Study guide
14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem
GRE Subject Test: Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Single-Variable Differential Calculus
1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves
2 Chapter 2: Single-Variable Integral Calculus
2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria
3 Chapter 3: Sequences, Infinite Series & Power Series
3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds
4 Chapter 4: Multivariable Differential Calculus
4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers
5 Chapter 5: Multivariable Integration & Vector Calculus
5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem
6 Chapter 6: Ordinary Differential Equations
6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters
7 Chapter 7: Elementary Algebra & Number Theory
7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient
8 Chapter 8: Linear Algebra: Vector Spaces & Transformations
8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis
9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
10 Chapter 10: Abstract Algebra: Groups, Rings & Fields
10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
11 Chapter 11: Introductory Real Analysis
11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence
12 Chapter 12: Complex Analysis
12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem
13 Chapter 13: Topology, Geometry & Numerical Analysis
13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature
14 Chapter 14: Probability, Statistics & Discrete Mathematics
14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions
14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem
Key Takeaways Explain This Topic AI
Probability spaces (Omega, F, P) satisfy Kolmogorov's axioms, guaranteeing countable additivity for disjoint events, monotonicity P(A) <= P(B) whenever A subseteq B, and Boole's union bound P(union A_i) <= sum P(A_i).
Two events A and B with non-zero probabilities are mutually exclusive if A cap B = emptyset, which fundamentally precludes them from being independent because P(A cap B) = 0 != P(A)P(B).
Pairwise independence among three or more events does not imply mutual (joint) independence; verifying full independence requires testing all subset intersections.
The Law of Total Probability partitions a sample space into disjoint events B_i to express P(A) = sum_{i=1}^n P(A | B_i)P(B_i), forming the denominator of Bayes' Theorem.
Bayes' Theorem updates prior probabilities with experimental evidence via P(B_k | A) = [P(A | B_k) P(B_k)] / sum P(A | B_i) P(B_i); when the prior is rare, high sensitivity and specificity can still produce a low posterior positive predictive value.
Last updated: September 2026
14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem
Probability on the GRE Mathematics Subject Test evaluates Kolmogorov's axiomatic framework, conditional probability, algebraic independence, the Law of Total Probability, and Bayesian inference. Precise handling of conditional spaces, event partitions, and prior-to-posterior probability updates is essential for success.
Axiomatic Probability Spaces
A formal probability model is a triple ( Ω , F , P ) (\Omega, \mathcal{F}, P) ( Ω , F , P ) :
Sample Space Ω \Omega Ω : The set of all possible outcomes.
σ \sigma σ -Algebra F \mathcal{F} F : A collection of events containing Ω \Omega Ω , closed under complementation ( A ∈ F ⟹ A c ∈ F A \in \mathcal{F} \implies A^c \in \mathcal{F} A ∈ F ⟹ A c ∈ F ) and countable unions ( ⋃ i = 1 ∞ A i ∈ F \bigcup_{i=1}^\infty A_i \in \mathcal{F} ⋃ i = 1 ∞ A i ∈ F ).
Probability Measure P P P : A function P : F → [ 0 , 1 ] P: \mathcal{F} \to [0, 1] P : F → [ 0 , 1 ] satisfying Kolmogorov's Axioms:
Non-negativity: P ( A ) ≥ 0 P(A) \ge 0 P ( A ) ≥ 0 for all A ∈ F A \in \mathcal{F} A ∈ F .
Normalization: P ( Ω ) = 1 P(\Omega) = 1 P ( Ω ) = 1 .
Countable Additivity: For pairwise disjoint events { A i } i = 1 ∞ \{A_i\}_{i=1}^\infty { A i } i = 1 ∞ , 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 ) .
- Derived Properties
- P ( ∅ ) = 0 P(\emptyset) = 0 P ( ∅ ) = 0 and P ( A c ) = 1 − P ( A ) P(A^c) = 1 - P(A) P ( A c ) = 1 − P ( A )
Monotonicity: A ⊆ B ⟹ P ( A ) ≤ P ( B ) A \subseteq B \implies P(A) \le P(B) A ⊆ B ⟹ P ( A ) ≤ P ( B ) and P ( B ∖ A ) = P ( B ) − P ( A ) P(B \setminus A) = P(B) - P(A) P ( B ∖ A ) = P ( B ) − P ( A )
Inclusion-Exclusion: 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 )
Boole's Inequality (Union Bound): P ( ⋃ i = 1 n A i ) ≤ ∑ i = 1 n P ( A i ) P\left(\bigcup_{i=1}^n A_i\right) \le \sum_{i=1}^n P(A_i) P ( ⋃ i = 1 n A i ) ≤ ∑ i = 1 n P ( A i )
Continuity of Measure: If A n ↑ A A_n \uparrow A A n ↑ A , then lim P ( A n ) = P ( A ) \lim P(A_n) = P(A) lim P ( A n ) = P ( A ) ; if A n ↓ A A_n \downarrow A A n ↓ A , then lim P ( A n ) = P ( A ) \lim P(A_n) = P(A) lim P ( A n ) = P ( A ) .
Conditional Probability and the Chain Rule
For events A , B A, B A , B with P ( B ) > 0 P(B) > 0 P ( B ) > 0 , the conditional probability of A A A given B B B is: P ( A ∣ B ) = P ( A ∩ B ) P ( B ) P(A \mid B) = \frac{P(A \cap B)}{P(B)} P ( A ∣ B ) = P ( B ) P ( A ∩ B )
The conditional measure P ( ⋅ ∣ B ) P(\cdot \mid B) P ( ⋅ ∣ B ) is a valid probability measure satisfying all Kolmogorov axioms.
Multiplication (Chain) Rule P ( A ∩ B ) = P ( A ∣ B ) P ( B ) P(A \cap B) = P(A \mid B) P(B) P ( A ∩ B ) = P ( A ∣ B ) P ( B )
For n n n events with P ( A 1 ∩ ⋯ ∩ A n − 1 ) > 0 P(A_1 \cap \dots \cap A_{n-1}) > 0 P ( A 1 ∩ ⋯ ∩ A n − 1 ) > 0 : P ( A 1 ∩ ⋯ ∩ A n ) = P ( A 1 ) P ( A 2 ∣ A 1 ) P ( A 3 ∣ A 1 ∩ A 2 ) ⋯ P ( A n ∣ A 1 ∩ ⋯ ∩ A n − 1 ) P(A_1 \cap \dots \cap A_n) = P(A_1) P(A_2 \mid A_1) P(A_3 \mid A_1 \cap A_2) \cdots P(A_n \mid A_1 \cap \dots \cap A_{n-1}) P ( A 1 ∩ ⋯ ∩ A n ) = P ( A 1 ) P ( A 2 ∣ A 1 ) P ( A 3 ∣ A 1 ∩ A 2 ) ⋯ P ( A n ∣ A 1 ∩ ⋯ ∩ A n − 1 )
Independent Events vs. Mutually Exclusive Events
Feature Independent Events Mutually Exclusive (Disjoint) Events
Definition P ( A ∩ B ) = P ( A ) P ( B ) P(A \cap B) = P(A) P(B) P ( A ∩ B ) = P ( A ) P ( B ) A ∩ B = ∅ ⟹ P ( A ∩ B ) = 0 A \cap B = \emptyset \implies P(A \cap B) = 0 A ∩ B = ∅ ⟹ P ( A ∩ B ) = 0
Conditioning P ( A ∣ B ) = P ( A ) P(A \mid B) = P(A) P ( A ∣ B ) = P ( A ) P ( A ∣ B ) = 0 P(A \mid B) = 0 P ( A ∣ B ) = 0
Simultaneity Can occur simultaneously Cannot occur simultaneously
Compatibility If P ( A ) > 0 , P ( B ) > 0 P(A) > 0, P(B) > 0 P ( A ) > 0 , P ( B ) > 0 , disjoint events are never independent ( 0 ≠ P ( A ) P ( B ) 0 \neq P(A)P(B) 0 = P ( A ) P ( B ) ). Direct contradiction with independence
Pairwise vs. Mutual Independence
Events { A 1 , … , A n } \{A_1, \dots, A_n\} { A 1 , … , A n } are mutually independent if for every non-empty sub-index set J ⊆ { 1 , … , n } J \subseteq \{1, \dots, n\} J ⊆ { 1 , … , n } : P ( ⋂ j ∈ J A j ) = ∏ j ∈ J P ( A j ) P\left(\bigcap_{j \in J} A_j\right) = \prod_{j \in J} P(A_j) P j ∈ J ⋂ A j = j ∈ J ∏ P ( A j )
Pairwise independence ( P ( A i ∩ A j ) = P ( A i ) P ( A j ) P(A_i \cap A_j) = P(A_i)P(A_j) P ( A i ∩ A j ) = P ( A i ) P ( A j ) for all i ≠ j i \neq j i = j ) does not imply mutual independence. A classic counterexample is two fair coin tosses where A A A is heads on toss 1, B B B is heads on toss 2, and C C C is both tosses match.
Law of Total Probability
If events { B 1 , … , B n } \{B_1, \dots, B_n\} { B 1 , … , B n } form a partition of Ω \Omega Ω (disjoint with ⋃ B i = Ω \bigcup B_i = \Omega ⋃ B i = Ω and P ( B i ) > 0 P(B_i) > 0 P ( B i ) > 0 ), then for any event A A A : P ( A ) = ∑ i = 1 n P ( A ∩ B i ) = ∑ i = 1 n P ( A ∣ B i ) P ( B i ) P(A) = \sum_{i=1}^n P(A \cap B_i) = \sum_{i=1}^n P(A \mid B_i) P(B_i) P ( A ) = i = 1 ∑ n P ( A ∩ B i ) = i = 1 ∑ n P ( A ∣ B i ) P ( B i )
Bayes' Theorem and Posterior Calculations
Bayes' Theorem updates prior probabilities P ( B k ) P(B_k) P ( B k ) to posterior probabilities P ( B k ∣ A ) P(B_k \mid A) P ( B k ∣ A ) upon observing evidence A A A : P ( B k ∣ A ) = P ( A ∣ B k ) P ( B k ) P ( A ) = P ( A ∣ B k ) P ( B k ) ∑ i = 1 n P ( A ∣ B i ) P ( B i ) P(B_k \mid A) = \frac{P(A \mid B_k) P(B_k)}{P(A)} = \frac{P(A \mid B_k) P(B_k)}{\sum_{i=1}^n P(A \mid B_i) P(B_i)} P ( B k ∣ A ) = P ( A ) P ( A ∣ B k ) P ( B k ) = ∑ i = 1 n P ( A ∣ B i ) P ( B i ) P ( A ∣ B k ) P ( B k )
Prior P ( B k ) P(B_k) P ( B k ) : Baseline probability before evidence A A A .
Likelihood P ( A ∣ B k ) P(A \mid B_k) P ( A ∣ B k ) : Probability of evidence given state B k B_k B k .
Posterior P ( B k ∣ A ) P(B_k \mid A) P ( B k ∣ A ) : Updated belief given evidence A A A .
Diagnostic Testing and the Base Rate Fallacy
Sensitivity: P ( + ∣ Disease ) = 1 − False Negative Rate P(+ \mid \text{Disease}) = 1 - \text{False Negative Rate} P ( + ∣ Disease ) = 1 − False Negative Rate
Specificity: P ( − ∣ Healthy ) = 1 − False Positive Rate P(- \mid \text{Healthy}) = 1 - \text{False Positive Rate} P ( − ∣ Healthy ) = 1 − False Positive Rate
Positive Predictive Value (PPV): P ( Disease ∣ + ) = P ( + ∣ Disease ) P ( Disease ) P ( + ∣ Disease ) P ( Disease ) + P ( + ∣ Healthy ) P ( Healthy ) P(\text{Disease} \mid +) = \frac{P(+ \mid \text{Disease}) P(\text{Disease})}{P(+ \mid \text{Disease}) P(\text{Disease}) + P(+ \mid \text{Healthy}) P(\text{Healthy})} P ( Disease ∣ + ) = P ( + ∣ Disease ) P ( Disease ) + P ( + ∣ Healthy ) P ( Healthy ) P ( + ∣ Disease ) P ( Disease )
When prevalence P ( Disease ) P(\text{Disease}) P ( Disease ) is rare, false positives from the large healthy subpopulation can swamp true positives, resulting in a low PPV despite high test accuracy.
Step-by-Step Worked Problem
Problem: Box 1 has 4 green and 2 yellow balls. Box 2 has 3 green and 5 yellow balls. A die is rolled: if 1 or 2 appears, Box 1 is chosen; otherwise, Box 2 is chosen. Two balls are drawn without replacement, and both are green ( G G GG GG ). Find P ( B 1 ∣ G G ) P(B_1 \mid GG) P ( B 1 ∣ GG ) .
Solution:
Priors: P ( B 1 ) = 2 / 6 = 1 / 3 P(B_1) = 2/6 = 1/3 P ( B 1 ) = 2/6 = 1/3 and P ( B 2 ) = 4 / 6 = 2 / 3 P(B_2) = 4/6 = 2/3 P ( B 2 ) = 4/6 = 2/3 .
Likelihoods:
Box 1 (total 6): P ( G G ∣ B 1 ) = ( 4 2 ) / ( 6 2 ) = 6 / 15 = 2 / 5 P(GG \mid B_1) = \binom{4}{2} / \binom{6}{2} = 6/15 = 2/5 P ( GG ∣ B 1 ) = ( 2 4 ) / ( 2 6 ) = 6/15 = 2/5 .
Box 2 (total 8): P ( G G ∣ B 2 ) = ( 3 2 ) / ( 8 2 ) = 3 / 28 P(GG \mid B_2) = \binom{3}{2} / \binom{8}{2} = 3/28 P ( GG ∣ B 2 ) = ( 2 3 ) / ( 2 8 ) = 3/28 .
Law of Total Probability: P ( G G ) = ( 2 5 ) ( 1 3 ) + ( 3 28 ) ( 2 3 ) = 2 15 + 1 14 = 43 210 P(GG) = \left(\frac{2}{5}\right)\left(\frac{1}{3}\right) + \left(\frac{3}{28}\right)\left(\frac{2}{3}\right) = \frac{2}{15} + \frac{1}{14} = \frac{43}{210} P ( GG ) = ( 5 2 ) ( 3 1 ) + ( 28 3 ) ( 3 2 ) = 15 2 + 14 1 = 210 43
Bayes' Theorem: P ( B 1 ∣ G G ) = P ( G G ∣ B 1 ) P ( B 1 ) P ( G G ) = 2 / 15 43 / 210 = 2 15 × 210 43 = 28 43 P(B_1 \mid GG) = \frac{P(GG \mid B_1) P(B_1)}{P(GG)} = \frac{2/15}{43/210} = \frac{2}{15} \times \frac{210}{43} = \frac{28}{43} P ( B 1 ∣ GG ) = P ( GG ) P ( GG ∣ B 1 ) P ( B 1 ) = 43/210 2/15 = 15 2 × 43 210 = 43 28
GRE Exam Traps & Pitfalls
Trap 1: Confusing Independence with Disjointness Disjoint events satisfy P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 . For events with positive probability, P ( A ) P ( B ) > 0 ≠ 0 P(A)P(B) > 0 \neq 0 P ( A ) P ( B ) > 0 = 0 , making disjoint events strictly dependent.
Trap 2: Transposing Conditionals (Prosecutor's Fallacy) Never equate P ( A ∣ B ) P(A \mid B) P ( A ∣ B ) with P ( B ∣ A ) P(B \mid A) P ( B ∣ A ) . Conflating sensitivity P ( + ∣ Disease ) P(+ \mid \text{Disease}) P ( + ∣ Disease ) with posterior P ( Disease ∣ + ) P(\text{Disease} \mid +) P ( Disease ∣ + ) ignores the prior base rate.
Trap 3: Pairwise vs. Mutual Independence Checking that all pairs satisfy P ( A i ∩ A j ) = P ( A i ) P ( A j ) P(A_i \cap A_j) = P(A_i)P(A_j) P ( A i ∩ A j ) = P ( A i ) P ( A j ) does not verify full independence. Complete independence requires all higher-order subset products to hold.
Trap 4: Omitting Shift in Without-Replacement Likelihoods When sampling without replacement, conditional probabilities shift after each draw ( 4 / 6 × 3 / 5 4/6 \times 3/5 4/6 × 3/5 ). Applying independent product probabilities produces wrong likelihoods.