Technique Masterclasses

Statistics 1

Deep Dive: Conditional Probability Independence vs Mutually Exclusive

CODEX Deep-Dive — Conditional Probability, Independence, and Mutually Exclusive Events (WST01, spec 3.2/3.3)

Provenance (2026-09-29): Read/checked for this document — research/veridian/WST01-verified-facts.md in full, grepped specifically for "independen", "mutually exclusive" and "conditional" (§1 spec transcription, §5 Section-3 trap catalogue, §7 topic-richness ranking, §8/§9 coverage flags, and the two 2026-09-12 per-lesson audit entries for conditional-probability-independence-vs-mutually-exclusive.ts and elementary-probability-and-conditional-notation.ts); the live lesson file content/veridian/curriculum/wst01/conditional-probability-independence-vs-mutually-exclusive.ts in full; content/veridian/technique-hub/wst01/codex-formula-and-method-bank.md, forge-exam-technique-guide.md and signal-frequency-and-boundaries.md (grepped for this topic); content/veridian/question-bank/wst01.ts (grepped — no item on this specific topic exists there yet). No new PDF fetches were made for this document; every specific claim below traces to one of those sources, named inline. All arithmetic in the micro-examples was independently checked with exact-fraction arithmetic (Python's fractions.Fraction) before being written in.

Scope — what this adds, and what it deliberately does not repeat

The live lesson already derives the conditional probability formula from the multiplication law, proves that mutually exclusive events with positive probability can never be independent, and works two full tree-diagram chains plus a three-event Venn-diagram algebra chain. The formula bank (codex-formula-and-method-bank.md) already tabulates every relevant formula with its memorise/given status. The frequency doc (signal-frequency-and-boundaries.md) already gives this pairing's series-count ranking. None of that is reproduced here.

This document instead does three things the existing material doesn't: (1) states the underlying model formally and proves the piece the lesson asserts but doesn't derive — why the three independence forms are equivalent; (2) covers one real, distinct sub-case the lesson's own trap-taxonomy quotes but never actually computes — conditional probability compounded with a complement event — and, in doing so, reconstructs exactly what the lesson's most-quoted trap number (0.35/0.4) actually is, which neither existing file states explicitly; (3) assembles every real exam angle this specific pairing has been tested from into one place, organised by angle rather than by lesson stage, with the honest limits of that evidence stated plainly.

1. The formal model

Sample space and mutually exclusive events (spec 3.2). An event is a subset of the sample space Ω\Omega. AA and BB are mutually exclusive when A∩B=∅A \cap B = \varnothing, i.e. P(A∩B)=0P(A \cap B) = 0 — a statement about the sets themselves, fixed before any probabilities are attached.

Conditional probability (spec 3.2). From the multiplication law printed on the WST01 formula sheet, P(A∩B)=P(A)P(B∣A)=P(B)P(A∣B)P(A \cap B) = P(A)P(B\mid A) = P(B)P(A \mid B) (the two forms are equal because A∩B=B∩AA \cap B = B \cap A). Dividing the second equality by P(B)P(B), which must be strictly positive:

P(A∣B)=P(A∩B)P(B).P(A \mid B) = \frac{P(A \cap B)}{P(B)}.

Independence (spec 3.3) — why the three spec forms are one fact, not three. The spec's guidance box lists P(B∣A)=P(B)P(B\mid A)=P(B), P(A∣B)=P(A)P(A\mid B)=P(A) and P(A∩B)=P(A)P(B)P(A\cap B)=P(A)P(B) as three separate things to memorise. They are, in fact, algebraically forced to rise or fall together, and it's worth seeing why rather than trusting it: start from P(A∣B)=P(A)P(A\mid B)=P(A) and substitute the conditional-probability formula above, P(A∩B)P(B)=P(A)\frac{P(A\cap B)}{P(B)} = P(A), which rearranges to P(A∩B)=P(A)P(B)P(A \cap B) = P(A)P(B) — the third form. Running the same substitution the other way round, starting from P(B∣A)=P(A∩B)P(A)P(B \mid A) = \frac{P(A\cap B)}{P(A)}, reaches the identical product form. So any one of the three, once true, forces the other two — which is exactly why a real mark scheme only ever needs to see one of them tested, not all three (the marked-solution in the live lesson tests only the product form, P(M)×P(P)P(M)\times P(P) vs P(M∩P)P(M\cap P), and that alone is a complete, correctly-earning method).

The complete relationship map for two events with P(A)>0P(A)>0, P(B)>0P(B)>0. There are exactly three possibilities, not two: mutually exclusive (never independent — the lesson's mechanism block proves this: P(A∩B)=0P(A\cap B)=0 from one definition and P(A∩B)=P(A)P(B)>0P(A\cap B)=P(A)P(B)>0 from the other cannot both hold); independent (never mutually exclusive, by the same proof run the other way); or neither — genuinely overlapping, genuinely dependent, and only settled by running the product-rule calculation. Every one of the four mcq and three prequestion items in the live lesson is really an instance of a student being asked to place a given pair of events into one of these three regions correctly, rather than guessing by eye — which is precisely the chronic error the examiner reports name (§3 below).

2. Real, distinct sub-cases, each with a short micro-example

2.1 The independence test and the mutual-exclusivity test are different calculations, run on the same two numbers

A concrete pair from each of the three regions, using a single fair six-sided die (fresh numbers — the live lesson's own examples use two dice, and 5-red/3-blue and 6-red/4-blue counter bags, so none of these three collide with existing content):

2.2 Conditional probability compounded with a complement — and what the lesson's own most-quoted trap number actually is

Spec 3.2 lists P(A′)=1−P(A)P(A')=1-P(A) alongside conditional probability, but the live lesson never computes a conditional probability where the conditioning or intersected event is a complement — P(A∣B′)P(A\mid B') or P(A∩B′)P(A\cap B') — even though this is exactly the compound skill behind its own most-repeated trap-taxonomy quote. The sibling lesson elementary-probability-and-conditional-notation.ts was independently audited against the real anchor for that quote (Jan 2021 Q1, a three-event Venn diagram: AA-only=0.15=0.15, A∩B=0.20A\cap B=0.20, BB-only=0.17=0.17, B∩C=0.23B\cap C=0.23, CC-only=0.12=0.12, none=0.13=0.13) and found P(A∣B′)=P(A∩B′)/P(B′)=0.15/0.4=38P(A\mid B')=P(A\cap B')/P(B') = 0.15/0.4 = \frac38.

Reconstructing this fully (verified again here by exact arithmetic): P(A)=0.15+0.20=0.35P(A)=0.15+0.20=0.35 and P(B′)=0.15+0.12+0.13=0.4P(B')=0.15+0.12+0.13=0.4. The wrong answer the examiner report records is 0.35/0.4=780.35/0.4=\frac78 — which is exactly P(A)/P(B′)P(A)/P(B'): the correct compound numerator P(A∩B′)=0.15P(A\cap B')=0.15 was silently replaced by the plain marginal P(A)=0.35P(A)=0.35, while the denominator P(B′)=0.4P(B')=0.4 stayed correct. This matters for how the trap is usually described: "a raw ratio of two marginals with no intersection at all" is not quite the full picture for this specific anchor — the denominator here really is a legitimate conditional-probability denominator (P(B′)P(B'), a genuine complement probability), so the fast self-check "is there an intersection anywhere in this fraction" doesn't by itself catch this version of the error. The mark scheme also requires the fraction simplified: 0.15/0.40.15/0.4 left unreduced does not earn the accuracy mark, only 38\frac38 or 0.3750.375 does (verified via the sibling lesson's own audit of this anchor).

Fresh micro-example, same compound skill, different numbers. P(A)=0.6P(A)=0.6, P(B)=0.45P(B)=0.45, P(A∩B)=0.3P(A\cap B)=0.3. Find P(A∣B′)P(A\mid B'). Two routes, both exact: P(B′)=1−0.45=0.55P(B')=1-0.45=0.55; P(A∩B′)=P(A)−P(A∩B)=0.6−0.3=0.3P(A\cap B')=P(A)-P(A\cap B)=0.6-0.3=0.3 (splitting AA into its part inside BB and its part outside BB — the same identity the real anchor's own mark scheme credits as an alternative route). Then P(A∣B′)=0.30.55=611≈0.545P(A\mid B')=\frac{0.3}{0.55}=\frac{6}{11}\approx0.545.

2.3 Solving for an unknown from the independence product rule directly

The live lesson's own worked-chain solves a two-unknown system where the independence/conditional-probability condition puts the unknown on both sides (Oct 2021 Q1(c) territory) — a genuinely harder version of this skill, not reproduced here. The plain version, one unknown, one equation: P(A)=0.2P(A)=0.2, AA and BB independent, P(A∩B)=0.06P(A\cap B)=0.06. Since independent, P(A∩B)=P(A)×P(B)P(A\cap B)=P(A)\times P(B), so 0.06=0.2×P(B)0.06=0.2\times P(B), giving P(B)=0.3P(B)=0.3. This is the shape of the M1 in Oct 2021 Q1(c) with the unknown appearing only once rather than on both sides — the entry-level version of the same real skill.

2.4 Constructing an event to satisfy stated overlap/exclusivity conditions

Oct 2021 Q1(d) asks for an event DD drawn on a Venn diagram that is mutually exclusive with a named event AA but still overlaps a second named event BB — a constructive skill (given two events, build a third meeting stated relations to both) the live lesson covers once, via an MCQ built on its own two-dice scenario. A second, minimal illustration with fresh numbers: spinner with outcomes 11–88, A={1,2,3}A=\{1,2,3\}, B={3,4,5,6}B=\{3,4,5,6\}. Required: DD with D∩A=∅D\cap A=\varnothing and B∩D≠∅B\cap D\neq\varnothing. D={4,5}D=\{4,5\} satisfies both: it shares nothing with AA's set {1,2,3}\{1,2,3\}, and it shares {4,5}\{4,5\} with BB. The general recipe this exposes: choose DD entirely from outcomes outside AA, then require at least one of those outcomes to also sit inside BB — the same two-condition check the real anchor's B1 mark rewards.

2.5 Flagged extension, not confirmed tested: independence is preserved under taking a complement

This follows in one line from definitions already on the spec (3.2's P(A′)=1−P(A)P(A')=1-P(A), 3.3's product rule) but is not itself listed in the spec's guidance box, and no citation in the reviewed examiner-report archive was found testing it directly — flagged here rather than asserted as a confirmed exam angle. If AA and BB are independent, then AA and B′B' are independent too: P(A∩B′)=P(A)−P(A∩B)=P(A)−P(A)P(B)=P(A)(1−P(B))=P(A)P(B′)P(A\cap B')=P(A)-P(A\cap B)=P(A)-P(A)P(B)=P(A)\bigl(1-P(B)\bigr)=P(A)P(B') — exactly the product-rule condition, now for AA and B′B'. The identical argument applied to A′A' shows A′A' and BB, and A′A' and B′B', are independent too. Micro-example: P(A)=0.5P(A)=0.5, P(B)=0.4P(B)=0.4, independent, so P(A∩B)=0.2P(A\cap B)=0.2. Then P(B′)=0.6P(B')=0.6, and the theorem predicts P(A∩B′)=P(A)P(B′)=0.3P(A\cap B')=P(A)P(B')=0.3 — matching the direct check P(A)−P(A∩B)=0.5−0.2=0.3P(A)-P(A\cap B)=0.5-0.2=0.3 exactly. Worth knowing as a fallback if a multi-part question ever pairs independence with complement notation, but it should not be presented to a student as a confirmed exam pattern, because it isn't one in the material reviewed.

3. Synthesis — every real exam angle this pairing has actually been tested from

Confirmed in the archive, one row per distinct angle (not per mark), all traced to WST01-verified-facts.md:

Series & questionReal angle testedWhat the source says (paraphrased; short quote attributed)Where taught in this repo
Jan 2021 Q1(c)Conditional probability compounded with a complement, collapsed by candidates into a raw marginal ratioER: candidates occasionally wrote "0.35/0.40.35/0.4" in place of the compound intersection — reconstructed above as P(A)/P(B′)P(A)/P(B') standing in for P(A∩B′)/P(B′)P(A\cap B')/P(B')Live lesson trap-taxonomy (quote); sibling lesson's real worked example (the actual P(A∣B′)=3/8P(A\mid B')=3/8 computation)
Oct 2021 Q1(b)Independence vs mutual exclusivity judged by eye instead of by the product-rule calculationER names it "the usual confusion" and quotes a student line, "they are not independent as they overlap"Live lesson's trap-taxonomy and mechanism block
Oct 2021 Q1(c)Building an equation from an independence/conditional-probability condition with the unknown on both sides, then closing a two-unknown system with a second, unrelated relationshipMark scheme itself: "p / 0.5 = p + 0.06" is the M1 shape (quoted, VERIDIAN numbers substituted in the live lesson's own worked-chain)Live lesson's second worked-chain (VERIDIAN three-event Venn)
Oct 2021 Q1(d)Constructing a new event meeting stated mutual-exclusivity/overlap conditions relative to two given eventsB1 for a valid drawn regionLive lesson's fourth MCQ; §2.4 above (fresh spinner illustration)
Oct 2021 Q4(c)Multi-branch tree-diagram conditional probability, numerator built from the wrong count of branchesER: the common error used a product of two branches "rather than 3"Live lesson's first worked-chain and chain-drill (both explicitly built around this exact trap)
Jun 2022 Q4(b)Independence assumed on a Venn-diagram conditional-probability question, plus a subtract-before-divide order errorER: common errors "assume independence" or invert the order of subtraction and divisionLive lesson's trap-taxonomy
Jun 2022 (general)Paper-wide diagnosis: independence assumed where a genuine conditional probability was requiredPearson's own stated general weak point that seriesLive lesson's trap-taxonomy and mechanism block (opening line)
Jan 2023 Q2(d)An extra copy of an already-used probability folded into the numerator of a later conditional-probability calculationCorrected finding (2026-08-28 re-verification): the denominator carried over correctly; a spurious extra 61/23461/234 was added or multiplied into the numeratorPresent in the live lesson's trap-taxonomy (extra-probability-folded-into-the-numerator) as prose only — not yet built into a worked-chain, chain-drill or MCQ; see §4

Honest frequency statement, no invented likelihoods. This pairing (independence vs mutual exclusivity, tested by calculation rather than by eye) is directly quoted or evidenced in 4 of the 5 examiner-report series fully reviewed for this facts bank — Jan 2021, Oct 2021, Jun 2022, Jan 2023. The topic-richness ranking in the facts bank's §7 describes it as appearing in all 5, but the fifth series' own citations (Jun 2024) are for conditional probability applied to the Normal distribution — spec point 6.1, a different guidance box, taught in the sibling lesson normal-distribution-standardisation-and-conditional-probability.ts — not a fresh instance of the independence-vs-mutual-exclusivity confusion itself. Both statements can be true at once (conditional probability as a general skill is very widely tested; this exact confusion is confirmed in 4 series), and it's worth keeping them separate rather than rounding one into the other.

4. Open flags — where the real evidence currently runs out

Sources

research/veridian/WST01-verified-facts.md — §1 (spec text), §5 Section 3 (all examiner-report quotes cited above), §7 (topic-richness ranking), §8/§9 (coverage limits), and the two 2026-09-12 audit entries for conditional-probability-independence-vs-mutually-exclusive.ts and elementary-probability-and-conditional-notation.ts. content/veridian/curriculum/wst01/conditional-probability-independence-vs-mutually-exclusive.ts (live lesson, read in full). content/veridian/technique-hub/wst01/codex-formula-and-method-bank.md, forge-exam-technique-guide.md, signal-frequency-and-boundaries.md. content/veridian/question-bank/wst01.ts (checked, no overlapping item found).