Study guide
16.2 Addition Rule, Multiplication Rule, Independent Events & Conditional Probability
FTCE Mathematics 6-12 026
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Overview & Rational Number Systems
1.1 FTCE Mathematics 6-12 Overview, Interface & Test-Taking Strategies 1.2 Rational Numbers, Representations & Multi-Step Operations
2 Chapter 2: Real Number Approximations & Proportional Reasoning
2.1 Irrational Numbers, Radical Estimation & Scientific Notation 2.2 Ratios, Rates, Proportions & Dimensional Analysis 2.3 Percent Applications, Financial Models & Depreciation
3 Chapter 3: Algebraic Expressions & Polynomial Operations
3.1 Polynomial Arithmetic, Factoring Strategies & Special Products 3.2 Radical Operations, Rational Expressions & Equations 3.3 Field Properties, Exponent Laws & Literal Equations
4 Chapter 4: Linear Relationships, Systems & Inequalities
4.1 Linear Equations, Slope Concepts & Line Forms 4.2 Systems of Linear Equations & Real-World Applications 4.3 Single & Systems of Linear Inequalities on the Coordinate Plane 4.4 Absolute Value Equations & Inequalities in One and Two Variables
5 Chapter 5: Quadratic Equations, Functions & Complex Numbers
5.1 Quadratic Equations, Discriminant & Complex Number Arithmetic 5.2 Quadratic Functions: Vertex, Axis, Intercepts & Concavity 5.3 Quadratic Inequalities in One/Two Variables & Optimization
6 Chapter 6: Function Foundations, Transformations & Inverses
6.1 Function Definitions, Relations, Domain, Range & Notation 6.2 Function Families, Key Graphical Behaviors & Even/Odd Symmetry 6.3 Shifting, Scaling & Reflecting Functions Across Representations 6.4 Function Composition, Invertibility & Inverse Functions
7 Chapter 7: Geometric Foundations, Angles & Deductive Proofs
7.1 Angle Relationships, Parallel Lines & Transversals 7.2 Triangle Sum, Exterior Angles & Polygon Angle Formulas 7.3 Formal Proof Methods, CPCTC & Quadrilateral Properties
8 Chapter 8: Congruence, Similarity & Geometric Transformations
8.1 Triangle Congruence (SSS, SAS, ASA, AAS, HL) & Similarity (AA, SAS, SSS) 8.2 Rigid Motions: Translations, Reflections, Rotations & Symmetry 8.3 Dilations, Scale Factors & Proportional Reasoning in Geometry
9 Chapter 9: Coordinate Geometry & 3D Spatial Measurement
9.1 Distance, Midpoint, Slope Criteria & Coordinate Proofs 9.2 Perimeter, Area, Surface Area & Volume of 2D and 3D Figures 9.3 Cross Sections of 3D Figures & Solids of Revolution
10 Chapter 10: Circle Theorems & Geometric Constructions
10.1 Central, Inscribed, Tangent & Chord Angles and Arcs 10.2 Intersecting Chords, Secant/Tangent Lengths, Arc Length & Sector Area 10.3 Euclidean Constructions with Compass and Straightedge
11 Chapter 11: Conic Sections & Coordinate Modeling
11.1 Circles and Parabolas: Geometric Definitions, Equations & Modeling 11.2 Ellipses and Hyperbolas: Foci, Axes, Asymptotes & Real-World Applications
12 Chapter 12: Trigonometric Foundations & Oblique Triangles
12.1 Right-Triangle Trigonometry, Pythagorean Theorem & Special Triangles 12.2 The Unit Circle, Radian Measure & Exact Trigonometric Values 12.3 Law of Sines (Ambiguous Case), Law of Cosines & Oblique Triangle Area
13 Chapter 13: Trigonometric Functions, Polar & Parametric Systems
13.1 Graphs of the Six Trigonometric Functions & Periodic Modeling 13.2 Polar Coordinates, Polar-Rectangular Conversion & Polar Graphs 13.3 Parametric Equations, Elimination of Parameters & Projectile Motion
14 Chapter 14: Descriptive Statistics & Data Distributions
14.1 Measures of Central Tendency, Dispersion & Resistant Statistics 14.2 Univariate Displays (Histograms, Boxplots, Stemplots) & Distribution Shapes 14.3 Normal Distribution Properties, Empirical Rule & Standard Normal Z-Scores
15 Chapter 15: Statistical Studies, Bivariate Data & Linear Regression
15.1 Statistical Study Design, Random Sampling Techniques & Sources of Bias 15.2 Survey Sampling, Margin of Error & Population Estimation 15.3 Scatterplots, Correlation Coefficient r, Linear Regression & Residuals
16 Chapter 16: Probability Theory, Two-Way Tables & Expected Value
16.1 Fundamental Counting Principle, Permutations & Combinations 16.2 Addition Rule, Multiplication Rule, Independent Events & Conditional Probability 16.3 Two-Way Frequency Tables, Law of Large Numbers & Expected Value of Random Variables
17 Chapter 17: Precalculus: Polynomial, Rational & Transcendental Functions
17.1 Fundamental Theorem of Algebra, Remainder/Factor Theorems & Polynomial Roots 17.2 Rational Functions, Domain Restrictions, Holes & Asymptotes 17.3 Exponential & Logarithmic Functions, Base e & Logarithmic Properties
18 Chapter 18: Sequences, Series, Binomial Theorem & Vectors
18.1 Arithmetic & Geometric Sequences, Finite Sums & Infinite Series Convergence 18.2 Binomial Theorem, Pascal's Triangle & General Term Determination 18.3 Vector Representations, Operations, Magnitude, Direction & Dot Product
19 Chapter 19: Differential Calculus Foundations
19.1 Limits, One-Sided Limits, Indeterminate Forms & Continuity 19.2 Derivative Definition, Power, Product, Quotient & Transcendental Rules 19.3 Chain Rule, Tangent Line Equations & Rates of Change
20 Chapter 20: Applications of Derivatives & Integral Calculus
20.1 First & Second Derivative Tests, Extrema, Concavity & Optimization 20.2 Antiderivatives, Indefinite Integrals & Integration by U-Substitution 20.3 Fundamental Theorem of Calculus, Net Signed Area & Geometric Applications
21 Chapter 21: Mathematical Representations, Progressions & Tools
21.1 Concrete-Representational-Abstract (CPA) Progressions & Concept Continuity 21.2 The Rule of Four: Translating Among Representations to Support Fluency 21.3 Manipulatives, Dynamic Software & Technology in Secondary Mathematics
22 Chapter 22: Assessment, Error Analysis & Misconception Remediation
22.1 Student Misconceptions & Error Analysis Across Core Secondary Domains 22.2 Evaluating Validity of Student Mathematical Arguments & Reasonableness Checks 22.3 Formative Assessment Formats, Data-Driven Differentiation & Tiered Tasks
16.2 Addition Rule, Multiplication Rule, Independent Events & Conditional Probability
Key Takeaways Explain This Topic AI
Kolmogorov's probability axioms establish that event probabilities are real numbers bounded by 0 ≤ P ( A ) ≤ 1 0 \le P(A) \le 1 0 ≤ P ( A ) ≤ 1 summing to 1 over sample space S S S , directly yielding the complement rule P ( A ′ ) = 1 − P ( A ) P(A') = 1 - P(A) P ( A ′ ) = 1 − P ( A ) and the 'at least one' identity P ( ≥ 1 ) = 1 − P ( 0 ) P(\ge 1) = 1 - P(0) P ( ≥ 1 ) = 1 − P ( 0 ) .
The General Addition Rule P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) subtracts the joint intersection to eliminate double-counting; it simplifies to P ( A ) + P ( B ) P(A) + P(B) P ( A ) + P ( B ) if and only if events A A A and B B B are mutually exclusive (disjoint).
Conditional probability restricts the reference sample space to conditioning event B B B : P ( A ∣ B ) = P ( A ∩ B ) P ( B ) P(A|B) = \frac{P(A \cap B)}{P(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B ) , generating the General Multiplication Rule P ( A ∩ B ) = P ( B ) ⋅ P ( A ∣ B ) P(A \cap B) = P(B) \cdot P(A|B) P ( A ∩ B ) = P ( B ) ⋅ P ( A ∣ B ) .
Events A A A and B B B are statistically independent if and only if P ( A ∣ B ) = P ( A ) P(A|B) = P(A) P ( A ∣ B ) = P ( A ) (or P ( A ∩ B ) = P ( A ) ⋅ P ( B ) P(A \cap B) = P(A) \cdot P(B) P ( A ∩ B ) = P ( A ) ⋅ P ( B ) ); mutually exclusive events with positive probabilities can never be independent because the occurrence of one forces the probability of the other to zero.
Sequential multi-stage experiments are modeled with probability tree diagrams, where path probabilities are calculated by multiplying along branches and combined across disjoint paths using the Law of Total Probability and Bayes' Theorem.
Last updated: September 2026
- 16.2 Addition Rule, Multiplication Rule, Independent Events & Conditional Probability
- Axiomatic Foundations of Probability & The Complement Rule
Modern probability theory is formalized through the Kolmogorov Axioms . Given a sample space S S S representing the set of all possible mutually exclusive outcomes of a random phenomenon, a probability measure P P P assigns a real number to each event A ⊆ S A \subseteq S A ⊆ S satisfying three foundational axioms:
Axiom 1 (Non-Negativity): For any event A A A , P ( A ) ≥ 0 P(A) \ge 0 P ( A ) ≥ 0 .
Axiom 2 (Unitarity / Normalization): The probability of the entire sample space is unity: P ( S ) = 1 P(S) = 1 P ( S ) = 1 .
Axiom 3 (Countable Additivity): If A 1 , A 2 , A 3 , … A_1, A_2, A_3, \dots A 1 , A 2 , A 3 , … is a countable sequence of pairwise mutually exclusive (disjoint) events (where A i ∩ A j = ∅ A_i \cap A_j = \emptyset A i ∩ A j = ∅ for all i ≠ j i \ne j i = j ), then: P ( ⋃ i = 1 ∞ A i ) = ∑ i = 1 ∞ P ( A i ) P\left(\bigcup_{i=1}^\infty A_i\right) = \sum_{i=1}^\infty P(A_i) P ( i = 1 ⋃ ∞ A i ) = i = 1 ∑ ∞ P ( A i )
From these three axioms, all fundamental probability theorems emerge. Because the sample space can be partitioned into any event A A A and its complement A ′ A' A ′ (or A c A^c A c , representing all outcomes in S S S not in A A A ) such that A ∩ A ′ = ∅ A \cap A' = \emptyset A ∩ A ′ = ∅ and A ∪ A ′ = S A \cup A' = S A ∪ A ′ = S , applying Axioms 2 and 3 yields P ( A ∪ A ′ ) = P ( A ) + P ( A ′ ) = P ( S ) = 1 P(A \cup A') = P(A) + P(A') = P(S) = 1 P ( A ∪ A ′ ) = P ( A ) + P ( A ′ ) = P ( S ) = 1 . This establishes the Complement Rule : P ( A ′ ) = 1 − P ( A ) ⟺ P ( A ) = 1 − P ( A ′ ) P(A') = 1 - P(A) \iff P(A) = 1 - P(A') P ( A ′ ) = 1 − P ( A ) ⟺ P ( A ) = 1 − P ( A ′ )
A vital application on the FTCE Mathematics 6-12 examination is solving 'at least one' compound probability problems. When an experiment involves n n n independent trials, each with success probability p p p , finding the probability of obtaining at least one success directly requires summing multiple binomial terms. Applying the complement rule collapses the calculation to a single step: P ( at least 1 success ) = 1 − P ( zero successes ) = 1 − ( 1 − p ) n P(\text{at least 1 success}) = 1 - P(\text{zero successes}) = 1 - (1 - p)^n P ( at least 1 success ) = 1 − P ( zero successes ) = 1 − ( 1 − p ) n
The Addition Rule: Disjoint vs. Overlapping Events
The union of two events, denoted A ∪ B A \cup B A ∪ B (or ' A A A or B B B '), represents the event that event A A A occurs, event B B B occurs, or both occur.
Mutually Exclusive (Disjoint) Events
Two events A A A and B B B are mutually exclusive (or disjoint ) if they cannot occur simultaneously. Their intersection is the empty set: A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ , which implies P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 . By Axiom 3, the addition rule for mutually exclusive events is strictly additive: P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B )
Overlapping (Non-Mutually Exclusive) Events
When events A A A and B B B can occur concurrently ( A ∩ B ≠ ∅ A \cap B \ne \emptyset A ∩ B = ∅ ), adding P ( A ) P(A) P ( A ) and P ( B ) P(B) P ( B ) counts the outcomes in the intersection twice. To correct for this double-counting, we subtract the joint probability, yielding the General Addition Rule : P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B )
Geometrically visualized through a Venn diagram, this corresponds to the principle of inclusion-exclusion. For three overlapping events A , B A, B A , B , and C C C , the rule extends to: P ( A ∪ B ∪ C ) = P ( A ) + P ( B ) + P ( C ) − P ( A ∩ B ) − P ( A ∩ C ) − P ( B ∩ C ) + P ( A ∩ B ∩ C ) P(A \cup B \cup C) = P(A) + P(B) + P(C) - P(A \cap B) - P(A \cap C) - P(B \cap C) + P(A \cap B \cap C) P ( A ∪ B ∪ C ) = P ( A ) + P ( B ) + P ( C ) − P ( A ∩ B ) − P ( A ∩ C ) − P ( B ∩ C ) + P ( A ∩ B ∩ C )
Conditional Probability & The General Multiplication Rule
In many probabilistic systems, obtaining partial information alters the likelihood of an event. The conditional probability of an event A A A given that event B B B has occurred, denoted P ( A ∣ B ) P(A|B) P ( A ∣ B ) , is defined mathematically as: P ( A ∣ B ) = P ( A ∩ B ) P ( B ) , provided P ( B ) > 0 P(A|B) = \frac{P(A \cap B)}{P(B)}, \quad \text{provided } P(B) > 0 P ( A ∣ B ) = P ( B ) P ( A ∩ B ) , provided P ( B ) > 0
Conceptual Meaning of Conditioning
Conditioning on event B B B physically collapses the sample space: outcomes outside of B B B are discarded, making B B B the new, restricted sample space. Within this restricted universe, the only favorable outcomes for A A A are those residing in the intersection A ∩ B A \cap B A ∩ B . Dividing by P ( B ) P(B) P ( B ) rescales the remaining probabilities so that P ( B ∣ B ) = 1 P(B|B) = 1 P ( B ∣ B ) = 1 .
Rearranging the conditional probability definition yields the General Multiplication Rule , which calculates the joint probability of two events occurring together: P ( A ∩ B ) = P ( B ) × P ( A ∣ B ) = P ( A ) × P ( B ∣ A ) P(A \cap B) = P(B) \times P(A|B) = P(A) \times P(B|A) P ( A ∩ B ) = P ( B ) × P ( A ∣ B ) = P ( A ) × P ( B ∣ A )
For a sequential chain of k k k events, the rule generalizes via the chain rule of probability: P ( A 1 ∩ A 2 ∩ ⋯ ∩ A k ) = P ( A 1 ) × P ( A 2 ∣ A 1 ) × P ( A 3 ∣ A 1 ∩ A 2 ) × ⋯ × P ( A k ∣ A 1 ∩ ⋯ ∩ A k − 1 ) P(A_1 \cap A_2 \cap \dots \cap A_k) = P(A_1) \times P(A_2|A_1) \times P(A_3|A_1 \cap A_2) \times \dots \times P(A_k|A_1 \cap \dots \cap A_{k-1}) P ( A 1 ∩ A 2 ∩ ⋯ ∩ A k ) = P ( A 1 ) × P ( A 2 ∣ A 1 ) × P ( A 3 ∣ A 1 ∩ A 2 ) × ⋯ × P ( A k ∣ A 1 ∩ ⋯ ∩ A k − 1 )
Independent vs. Dependent Events and Sampling Paradigms
Two events A A A and B B B are statistically independent if the occurrence of one event provides zero information about the likelihood of the other event. Formally, A A A and B B B are independent if and only if: P ( A ∣ B ) = P ( A ) or P ( B ∣ A ) = P ( B ) P(A|B) = P(A) \quad \text{or} \quad P(B|A) = P(B) P ( A ∣ B ) = P ( A ) or P ( B ∣ A ) = P ( B )
Substituting this condition into the General Multiplication Rule produces the Multiplication Rule for Independent Events : P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B )
This product identity serves as the definitive mathematical test for independence on the examination: if P ( A ∩ B ) = P ( A ) ⋅ P ( B ) P(A \cap B) = P(A) \cdot P(B) P ( A ∩ B ) = P ( A ) ⋅ P ( B ) , the events are independent; if P ( A ∩ B ) ≠ P ( A ) ⋅ P ( B ) P(A \cap B) \ne P(A) \cdot P(B) P ( A ∩ B ) = P ( A ) ⋅ P ( B ) , the events are dependent .
Crucial Conceptual Distinction: Mutually Exclusive vs. Independent
A ubiquitous trap for mathematics educators is confusing mutually exclusive events with independent events:
Mutually exclusive means the events cannot happen together: P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 .
Independent means the occurrence of one does not affect the other: P ( A ∩ B ) = P ( A ) P ( B ) P(A \cap B) = P(A)P(B) P ( A ∩ B ) = P ( A ) P ( B ) .
If two events A A A and B B B have non-zero probabilities ( P ( A ) > 0 P(A) > 0 P ( A ) > 0 and P ( B ) > 0 P(B) > 0 P ( B ) > 0 ) and are mutually exclusive, can they ever be independent? No, never! P ( A ∩ B ) = 0 ≠ P ( A ) × P ( B ) P(A \cap B) = 0 \ne P(A) \times P(B) P ( A ∩ B ) = 0 = P ( A ) × P ( B )
Knowing that event B B B occurred completely guarantees that event A A A cannot occur ( P ( A ∣ B ) = 0 ≠ P ( A ) P(A|B) = 0 \ne P(A) P ( A ∣ B ) = 0 = P ( A ) ). Mutually exclusive events with positive probabilities are maximally dependent .
Sampling With Replacement vs. Without Replacement
Sampling with replacement: The sampled object is returned to the population before the next draw. Successive trials are independent , and probabilities remain constant across all stages.
Sampling without replacement: The sampled object is removed from the population. Successive trials are dependent , as the pool size and item counts decrease, altering conditional probabilities at each subsequent stage.
Probability Tree Diagrams, Law of Total Probability & Bayes' Theorem
A probability tree diagram models sequential multi-stage random experiments:
The root branches into primary events representing a partition of the sample space { B 1 , B 2 , … , B k } \{B_1, B_2, \dots, B_k\} { B 1 , B 2 , … , B k } with prior probabilities P ( B i ) P(B_i) P ( B i ) .
Secondary branches from each B i B_i B i represent conditional probabilities P ( A ∣ B i ) P(A|B_i) P ( A ∣ B i ) of an observed event A A A .
Multiplying probabilities along any path from root to leaf yields the joint probability of that specific path: P ( B i ∩ A ) = P ( B i ) × P ( A ∣ B i ) P(B_i \cap A) = P(B_i) \times P(A|B_i) P ( B i ∩ A ) = P ( B i ) × P ( A ∣ B i ) .
The Law of Total Probability
Because the branches { B 1 , B 2 , … , B k } \{B_1, B_2, \dots, B_k\} { B 1 , B 2 , … , B k } form a complete partition of the sample space ( B i ∩ B j = ∅ B_i \cap B_j = \emptyset B i ∩ B j = ∅ and ⋃ B i = S \bigcup B_i = S ⋃ B i = S ), the overall unconditional probability of event A A A is the sum of the disjoint path intersections: P ( A ) = ∑ i = 1 k P ( B i ∩ A ) = ∑ i = 1 k P ( B i ) × P ( A ∣ B i ) P(A) = \sum_{i=1}^k P(B_i \cap A) = \sum_{i=1}^k P(B_i) \times P(A|B_i) P ( A ) = i = 1 ∑ k P ( B i ∩ A ) = i = 1 ∑ k P ( B i ) × P ( A ∣ B i )
Bayes' Theorem: Inverting Conditional Probabilities
Bayes' Theorem calculates posterior probabilities—the probability that a specific underlying cause B j B_j B j occurred given that observed outcome A A A has taken place: P ( B j ∣ A ) = P ( B j ∩ A ) P ( A ) = P ( B j ) × P ( A ∣ B j ) ∑ i = 1 k P ( B i ) × P ( A ∣ B i ) P(B_j|A) = \frac{P(B_j \cap A)}{P(A)} = \frac{P(B_j) \times P(A|B_j)}{\sum_{i=1}^k P(B_i) \times P(A|B_i)} P ( B j ∣ A ) = P ( A ) P ( B j ∩ A ) = ∑ i = 1 k P ( B i ) × P ( A ∣ B i ) P ( B j ) × P ( A ∣ B j )
Probability Rules & Axiomatic Formulas Reference Matrix
Probability Theorem Algebraic Expression Governing Condition / Domain Key Exam Insight / Common Fallacy
Complement Rule P ( A ′ ) = 1 − P ( A ) P(A') = 1 - P(A) P ( A ′ ) = 1 − P ( A ) Universal for all events Essential for 'at least one' calculations: 1 − P ( 0 ) 1 - P(0) 1 − P ( 0 )
Addition Rule (Disjoint) P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B ) Mutually exclusive only ( A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ ) Do NOT use if events can occur simultaneously
General Addition Rule P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) Universal for all joint events Subtracts intersection to eliminate double-counting
Conditional Probability P ( A ∣ B ) = P ( A ∩ B ) P ( B ) P(A\vert B) = \frac{P(A \cap B)}{P(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B ) Requires P ( B ) > 0 P(B) > 0 P ( B ) > 0 P ( A ∣ B ) ≠ P ( B ∣ A ) P(A\vert B) \ne P(B\vert A) P ( A ∣ B ) = P ( B ∣ A ) (confusion is Prosecutor's Fallacy)
General Multiplication P ( A ∩ B ) = P ( B ) × P ( A ∣ B ) P(A \cap B) = P(B) \times P(A\vert B) P ( A ∩ B ) = P ( B ) × P ( A ∣ B ) Universal for all joint events Accounts for updated sample space in dependent trials
Multiplication (Independent) P ( A ∩ B ) = P ( A ) × P ( B ) P(A \cap B) = P(A) \times P(B) P ( A ∩ B ) = P ( A ) × P ( B ) Independent events only Definitive algebraic test for event independence
Law of Total Probability P ( A ) = ∑ P ( B i ) P ( A ∣ B i ) P(A) = \sum P(B_i)P(A\vert B_i) P ( A ) = ∑ P ( B i ) P ( A ∣ B i ) { B i } \{B_i\} { B i } partitions sample space S S S Sum of all path probabilities leading to outcome A A A
Bayes' Theorem P ( B j ∣ A ) = P ( B j ) P ( A ∣ B j ) ∑ P ( B i ) P ( A ∣ B i ) P(B_j\vert A) = \frac{P(B_j)P(A\vert B_j)}{\sum P(B_i)P(A\vert B_i)} P ( B j ∣ A ) = ∑ P ( B i ) P ( A ∣ B i ) P ( B j ) P ( A ∣ B j ) Inverts conditioning from cause to effect Resolves base rate neglect in medical/forensic screening
Worked Exemplar: Medical Diagnostic Screening & False Positive Analysis
Problem: A rare medical condition is present in 1 % 1\% 1% of a population ( P ( D ) = 0.01 P(D) = 0.01 P ( D ) = 0.01 ). A laboratory diagnostic screening test has a sensitivity of 98 % 98\% 98% ( P ( + ∣ D ) = 0.98 P(+|D) = 0.98 P ( + ∣ D ) = 0.98 , the true positive rate) and a false positive rate of 3 % 3\% 3% ( P ( + ∣ D c ) = 0.03 P(+|D^c) = 0.03 P ( + ∣ D c ) = 0.03 , meaning specificity is 97 % 97\% 97% ). A randomly selected individual tests positive. What is the probability that this person actually has the condition?
Analytical Solution via Tree Diagram and Bayes' Theorem
Define the Prior Probabilities:
Patient has the disease: P ( D ) = 0.01 P(D) = 0.01 P ( D ) = 0.01
Patient does not have the disease: P ( D c ) = 1 − 0.01 = 0.99 P(D^c) = 1 - 0.01 = 0.99 P ( D c ) = 1 − 0.01 = 0.99
Identify the Conditional Branch Probabilities:
- True Positive: P ( + ∣ D ) = 0.98 P(+|D) = 0.98 P ( + ∣ D ) = 0.98
- False Negative: P ( − ∣ D ) = 1 − 0.98 = 0.02 P(-|D) = 1 - 0.98 = 0.02 P ( − ∣ D ) = 1 − 0.98 = 0.02
- False Positive: P ( + ∣ D c ) = 0.03 P(+|D^c) = 0.03 P ( + ∣ D c ) = 0.03
- True Negative: P ( − ∣ D c ) = 1 − 0.03 = 0.97 P(-|D^c) = 1 - 0.03 = 0.97 P ( − ∣ D c ) = 1 − 0.03 = 0.97
Compute Joint Path Probabilities for a Positive Test Result:
Path 1 (Has disease and tests positive): P ( D ∩ + ) = P ( D ) × P ( + ∣ D ) = ( 0.01 ) ( 0.98 ) = 0.0098 P(D \cap +) = P(D) \times P(+|D) = (0.01)(0.98) = 0.0098 P ( D ∩ + ) = P ( D ) × P ( + ∣ D ) = ( 0.01 ) ( 0.98 ) = 0.0098
Path 2 (Healthy and tests positive - false positive): P ( D c ∩ + ) = P ( D c ) × P ( + ∣ D c ) = ( 0.99 ) ( 0.03 ) = 0.0297 P(D^c \cap +) = P(D^c) \times P(+|D^c) = (0.99)(0.03) = 0.0297 P ( D c ∩ + ) = P ( D c ) × P ( + ∣ D c ) = ( 0.99 ) ( 0.03 ) = 0.0297
Compute Total Probability of Testing Positive (Law of Total Probability): P ( + ) = P ( D ∩ + ) + P ( D c ∩ + ) = 0.0098 + 0.0297 = 0.0395 P(+) = P(D \cap +) + P(D^c \cap +) = 0.0098 + 0.0297 = 0.0395 P ( + ) = P ( D ∩ + ) + P ( D c ∩ + ) = 0.0098 + 0.0297 = 0.0395
Evaluate Posterior Probability via Bayes' Theorem: P ( D ∣ + ) = P ( D ∩ + ) P ( + ) = 0.0098 0.0395 = 98 395 ≈ 0.2481 ( 24.81 % ) P(D|+) = \frac{P(D \cap +)}{P(+)} = \frac{0.0098}{0.0395} = \frac{98}{395} \approx 0.2481 \quad (24.81\%) P ( D ∣ + ) = P ( + ) P ( D ∩ + ) = 0.0395 0.0098 = 395 98 ≈ 0.2481 ( 24.81% )
Pedagogical Insight: Resolving the False Positive Paradox
Even though the screening test boasts 98 % 98\% 98% sensitivity and 97 % 97\% 97% specificity, a person testing positive has only an approximately 24.8 % 24.8\% 24.8% probability of having the disease! This counter-intuitive result stems from base rate neglect : because the disease is rare ( 1 % 1\% 1% ), the large pool of healthy individuals ( 99 % 99\% 99% ) produces nearly three times as many false positives ( 0.0297 0.0297 0.0297 ) as the tiny pool of diseased individuals produces true positives ( 0.0098 0.0098 0.0098 ).