Math 2.0

statement theorem

Law of total probability

Statement

Let (Ω,F,P)(\Omega, \mathcal{F}, P) be a probability space. Let B1,B2,…B_1, B_2, \dots be a finite or countable family of pairwise disjoint events with ⋃iBi=Ω\bigcup_i B_i = \Omega and P(Bi)>0P(B_i) > 0 for each ii. Then for each event AA, P(A)=∑iP(A∣Bi) P(Bi).P(A) = \sum_{i} P(A \mid B_i) \, P(B_i).

Remarks

The events BiB_i form a partition of Ω\Omega into events of positive probability. The proof uses A=⋃i(A∩Bi)A = \bigcup_i (A \cap B_i), countable additivity and the multiplication rule. The case of two events BB and BcB^c is the law of total probability for an event and its complement. Example: urn 11 has 22 red balls of 55 and urn 22 has 33 red balls of 44. Choose an urn with a fair coin and draw one ball. The ball is red with probability 12⋅25+12⋅34=2340\frac12 \cdot \frac25 + \frac12 \cdot \frac34 = \frac{23}{40}.

Explanations

L1 human

Split the world into cases that do not overlap. The chance of AA is the average of its chances in the cases, weighted by the chances of the cases.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

12 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Law_of_total_probability, Statement