| English | 释义 | 拼音 |
|---|---|---|
| intersection/ˌɪntəˈsekʃn/ | 交集 | jiāo jí |
| mutually exclusive/ˈmjuːtʃuːəli eksˈkluːsɪv/ | 互斥 | hù chì |
Boole's algebra of "and" and "or"
- In The Laws of Thought (1854), George Boole wrote rules for combining "and", "or" and "not". A century later engineers used his rules to design the logic gates inside every computer. The same rules work for sets and probability.
- Higher questions use set notation and the addition rule.
Set notation
- $A \cap B$: the intersection 交集. $A \cup B$: the union. $A'$: the complement. $\xi$: the universal set.
- Class of 30: 18 cycle (C), 12 swim (S), 7 both. $n(C \cap S) = 7$, $n(C \cup S) = 23$, $n((C \cup S)') = 7$.
The addition rule
- $P(A \cup B) = P(A) + P(B) - P(A \cap B)$: subtract the overlap because it was counted twice.
- $\dfrac{18}{30} + \dfrac{12}{30} - \dfrac{7}{30} = \dfrac{23}{30}$.
$P(A) = 0.5$, $P(B) = 0.4$, $P(A \cap B) = 0.15$. Find $P(A \cup B)$.
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
0.5 + 0.4 − 0.15.
Worked example: Venn with algebra
In a group of 50, $n(A) = 30$, $n(B) = 26$, and 4 are in neither. Find $n(A \cap B)$.
- In at least one: $50 - 4 = 46$.
- Addition rule: $46 = 30 + 26 - x$, so $x = 10$.
- Regions: A only 20, both 10, B only 16, neither 4: total 50 ✓.
Venn diagrams, unions and two-way counts
Place the overlap in a Venn diagram first, then fill the only-regions and neither-region
Classify the worked-case statements, then explain the units or invariant that justifies each decision.
In a group of 40, $n(A) = 22$, $n(B) = 18$ and 6 are in neither. Find $n(A \cap B)$.
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
34 = 40 − x.
Mutually exclusive events
- Events that cannot happen together have no overlap: $P(A \cap B) = 0$, so $P(A \cup B) = P(A) + P(B)$.
- Rolling a 2 and rolling a 5 on one dice are mutually exclusive.
Which pair of events is mutually exclusive for one roll of a dice?
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
3 is not even.
Shading regions
- $A \cap B'$: in A but not B (cycle only, 11). $A' \cap B'$: outside both (7).
- $(A \cap B)'$: everything except the overlap: $30 - 7 = 23$.
In the class of 30 (11 cycle only, 7 both, 5 swim only, 7 neither), find $n(C' \cap S)$.
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
Swim but not cycle.
In the class of 30, find $n((C \cap S)')$.
难度 2/5 · 今日首次完成可获 140 金币及少量额外奖励
30 − 7.
$P(A \cup B)$ is not $P(A) + P(B)$ unless there is no overlap. For the class, $\dfrac{18}{30} + \dfrac{12}{30} = 1$ would mean everyone does a sport, but 7 do neither. Subtract the intersection.
$P(A \cup B) = P(A) + P(B)$ for any two events.
难度 1/5 · 今日首次完成可获 100 金币及少量额外奖励
Only if they are mutually exclusive.
Use $\cap$, $\cup$ and $'$ to name regions. $P(A \cup B) = P(A) + P(B) - P(A \cap B)$, which becomes a simple sum for mutually exclusive events. Put an unknown $x$ in the overlap and solve from the total.
$P(A) = 0.6$, $P(B) = 0.5$ and $P(A \cup B) = 0.8$. Find $P(A \cap B)$ and $P(A \cap B')$. Are A and B independent?
Set probability.