Probability, trees and conditional reasoning
Introduced| English | Meaning |
|---|---|
| conditional probability/kənˈdɪʃənl ˌprɒbəˈbɪlɪti/ | The probability of an event given that another event has occurred. |
| tree diagram/triː ˈdaɪəɡræm/ | A branching diagram showing possible stages, outcomes or classifications and their relationships. |
| independent events/ˌɪndɪˈpendənt ɪˈvents/ | Events for which the occurrence of one does not change the probability of the other. |
Three doors and a column, 1990
- In September 1990 Marilyn vos Savant answered a reader's puzzle in Parade magazine. A prize is behind one of three doors. You pick one; the host, who knows where the prize is, opens another door to show a goat, and offers you the chance to switch. She said switching wins with probability $\tfrac23$. Thousands of readers, including mathematicians, wrote to say she was wrong. She was right.
- The host's choice is information. Conditional probability 条件概率 updates probabilities when information arrives; tree diagrams 树状图 keep track of it.
In the Monty Hall problem, what is the probability of winning by switching?
Difficulty 1/5 · 100 coins + a small bonus on first completion today
The host's choice is information.
Basic rules
- $P(A') = 1 - P(A)$. $P(A \cup B) = P(A) + P(B) - P(A \cap B)$.
- Independent events 独立事件: $P(A \cap B) = P(A)P(B)$. Mutually exclusive: $P(A \cap B) = 0$.
P(A) = 0.5, P(B) = 0.4, P(A ∩ B) = 0.2. Find P(A ∪ B).
Difficulty 2/5 · 140 coins + a small bonus on first completion today
0.5 + 0.4 − 0.2.
If P(A) = 0.5, P(B) = 0.4 and P(A ∩ B) = 0.2, A and B are independent.
Difficulty 1/5 · 100 coins + a small bonus on first completion today
0.5 × 0.4 = 0.2.
Tree diagrams
- Multiply along branches; add the end results that make up the event. Without replacement, the second-stage probabilities change.
Probability, trees and conditional reasoning
Multiply along a tree branch and add disjoint branches
Compare the model with the worked case and explain one change.
From 3 red and 2 blue, two are drawn without replacement. Find P(both blue).
Difficulty 2/5 · 140 coins + a small bonus on first completion today
2/5 × 1/4.
Conditional probability
- $P(A \mid B) = \dfrac{P(A \cap B)}{P(B)}$ — restrict attention to outcomes where $B$ happened.
- Bayes' theorem (HL): $P(B \mid A) = \dfrac{P(A \mid B)P(B)}{P(A)}$ reverses the condition.
P(A ∩ B) = 0.12 and P(B) = 0.4. Find P(A | B).
Difficulty 2/5 · 140 coins + a small bonus on first completion today
0.12 ÷ 0.4.
Worked example: two draws
A bag holds 3 red and 2 blue counters; two are drawn without replacement.
- Branches: $P(RR) = \tfrac35 \times \tfrac24 = 0.3$, $P(RB) = \tfrac35 \times \tfrac24 = 0.3$, $P(BR) = \tfrac25 \times \tfrac34 = 0.3$, $P(BB) = \tfrac25 \times \tfrac14 = 0.1$. Total $1$. ✓
- At least one blue: $1 - P(RR) = 0.7$.
- Conditional: $P(\text{first red} \mid \text{one of each}) = \dfrac{P(RB)}{P(RB) + P(BR)} = \dfrac{0.3}{0.6} = \tfrac12$.
In the worked example, find P(at least one blue).
Difficulty 2/5 · 140 coins + a small bonus on first completion today
1 − 0.3.
Monty Hall explained
- Your first pick is right with probability $\tfrac13$. The host never reveals the prize, so when you are wrong ($\tfrac23$) the remaining closed door must hold it. Switching wins $\tfrac23$ of the time.
$P(A \mid B) \ne P(B \mid A)$. The probability that a positive test means disease is not the probability that disease gives a positive test. Use Bayes' theorem to reverse a condition.
P(A | B) always equals P(B | A).
Difficulty 1/5 · 100 coins + a small bonus on first completion today
Use Bayes' theorem.
Use complements and the addition rule; multiply for independent events. Draw trees, multiplying along branches and adjusting for no replacement. $P(A \mid B) = \tfrac{P(A \cap B)}{P(B)}$, and Bayes' theorem reverses the condition.
1% of people have a condition. A test detects it 95% of the time and gives a false positive 5% of the time. Find P(condition | positive).
Branches, total, divide.