Study guide
15.1 Classical Probability and Conditional Probability
Gaokao Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Sets, Logic, and Algebraic Foundations
1.1 Sets and Set Operations 1.2 Propositional Logic and Quantifiers 1.3 Inequalities and Absolute Value Equations
2 Chapter 2: Functions and Fundamental Properties
2.1 Concept, Domain, Range, and Mapping of Functions 2.2 Monotonicity, Parity, and Periodicity of Functions 2.3 Function Graphs, Transformations, and Zeros
3 Chapter 3: Exponential, Logarithmic, and Power Functions
3.1 Exponents and Exponential Functions 3.2 Logarithms and Logarithmic Functions 3.3 Power Functions and Comparative Growth Rates
4 Chapter 4: Complex Numbers and Quadratic Function Views
4.1 Algebraic and Geometric Representations of Complex Numbers 4.2 Complex Number Operations and Equations 4.3 Quadratic Equations and Inequalities from a Function Viewpoint
5 Chapter 5: Trigonometric Functions and Identities
5.1 Angles, Radians, and Unit Circle Definitions 5.2 Trigonometric Identities and Reduction Formulas 5.3 Addition, Subtraction, and Double-Angle Formulas 5.4 Graphs and Properties of Sine, Cosine, and Tangent Functions
6 Chapter 6: Triangles and Trigonometric Applications
6.1 Sine Theorem, Cosine Theorem, and Triangle Area Formulas 6.2 Solving Triangles and Comprehensive Geometric Applications 6.3 Practical Measurement, Optimization, and Trigonometric Modeling
7 Chapter 7: Sequences and Series
7.1 Arithmetic Sequences and Sums 7.2 Geometric Sequences and Sums 7.3 Recurrence Relations and General Term Determination 7.4 Advanced Summation Techniques and Sequence Applications
8 Chapter 8: Plane Vectors
8.1 Vector Concepts, Addition, Subtraction, and Scalar Multiplication 8.2 Coordinate Operations of Vectors 8.3 Dot Products, Angles, Vector Projections, and Geometric Applications
9 Chapter 9: Lines and Circles in Cartesian Coordinates
9.1 Equations of Straight Lines and Positional Relationships 9.2 Standard and General Equations of Circles 9.3 Positional Relationships Between Lines and Circles
10 Chapter 10: Conic Sections: Ellipses
10.1 Standard Equations and Definitions of Ellipses 10.2 Geometric Properties of Ellipses (Vertices, Foci, Eccentricity) 10.3 Intersection of Lines and Ellipses and Chord Problems
11 Chapter 11: Conic Sections: Hyperbolas and Parabolas
11.1 Hyperbola Definitions, Standard Equations, and Asymptotes 11.2 Parabola Definitions, Standard Equations, and Focal Properties 11.3 Unified Properties of Conic Sections and Trajectory Problems
12 Chapter 12: Solid Geometry: Three-Dimensional Figures
12.1 Prisms, Pyramids, Cylinders, Cones, and Spheres 12.2 Three-Dimensional Views and Cross-Sections 12.3 Surface Area and Volume Calculations
13 Chapter 13: Spatial Lines, Planes, and Spatial Vectors
13.1 Positional Relationships of Lines and Planes in Space 13.2 Parallelism and Perpendicularity Proofs in Solid Geometry 13.3 Spatial Coordinates and Spatial Vector Operations 13.4 Using Spatial Vectors to Compute Angles and Distances
14 Chapter 14: Permutations, Combinations, and Binomial Theorem
14.1 Fundamental Counting Principles (Addition and Multiplication Rules) 14.2 Permutations and Combinations 14.3 Binomial Theorem, Expansion Terms, and Coefficients
15 Chapter 15: Probability and Statistics
15.1 Classical Probability and Conditional Probability 15.2 Independent Events and Repeated Bernoulli Trials 15.3 Discrete Random Variables, Probability Distributions, Expectation, and Variance 15.4 Normal Distribution, Statistical Sampling, Correlation, and Regression
16 Chapter 16: Derivatives and Mathematical Modeling
16.1 Limit Concepts and Derivatives of Elementary Functions 16.2 Tangent Lines, Derivatives, Monotonicity, and Extremum Analysis 16.3 Optimization Problems and Curve Sketching with Derivatives 16.4 Real-World Mathematical Modeling and Problem Solving
15.1 Classical Probability and Conditional Probability
Key Takeaways Explain This Topic AI
Classical probability applies when sample space Ω is finite and all elementary outcomes are equally likely: P(A) = n(A) / n(Ω).
Conditional probability P(B|A) = P(AB) / P(A) (for P(A) > 0) evaluates probability under a reduced sample space A.
The Law of Total Probability decomposes event A across a complete partition {B_i}: P(A) = ∑ P(B_i)P(A|B_i).
Bayes' Theorem updates prior probabilities P(B_k) into posterior probabilities P(B_k|A) after observing evidence A: P(B_k|A) = [P(B_k)P(A|B_k)] / [∑ P(B_i)P(A|B_i)].
Last updated: July 2026
- 15.1 Classical Probability and Conditional Probability
- 1. Random Experiments, Sample Space, and Events
In probability theory, a random experiment is an action or process that results in one of several possible outcomes, where the exact outcome cannot be predicted with certainty beforehand, but all possible outcomes are known in advance.
1.1 Sample Space and Elementary Events
Sample Space ( Ω \Omega Ω ) : The set of all possible outcomes of a random experiment is called the sample space, denoted by Ω \Omega Ω .
Elementary Event ( ω \omega ω ) : An individual element ω ∈ Ω \omega \in \Omega ω ∈ Ω representing a single, indivisible outcome of the experiment.
Event ( A A A ) : Any subset A ⊆ Ω A \subseteq \Omega A ⊆ Ω of the sample space is called an event. We say event A A A occurs if the observed outcome ω \omega ω belongs to A A A .
1.2 Event Operations and Relationships
Inclusion ( A ⊆ B A \subseteq B A ⊆ B ) : If every outcome in A A A is also in B B B , occurrence of A A A implies occurrence of B B B .
Union ( A ∪ B A \cup B A ∪ B or A + B A + B A + B ) : The event containing all outcomes in A A A or B B B (or both). A ∪ B A \cup B A ∪ B occurs if at least one of A A A or B B B occurs.
Intersection ( A ∩ B A \cap B A ∩ B or A B AB A B ) : The event containing outcomes common to both A A A and B B B . A B AB A B occurs if both A A A and B B B occur simultaneously.
Mutually Exclusive (Incompatible) Events : Events A A A and B B B are mutually exclusive if A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ , meaning they cannot occur together.
Complementary Events ( A ‾ \overline{A} A ) : The event containing all outcomes in Ω \Omega Ω not in A A A . Satisfies A ∪ A ‾ = Ω A \cup \overline{A} = \Omega A ∪ A = Ω and A ∩ A ‾ = ∅ A \cap \overline{A} = \emptyset A ∩ A = ∅ .
2. Classical Probability Model
A probability model is called a Classical Probability Model (also known as a Laplace model) if it satisfies two essential conditions:
Finiteness : The sample space Ω \Omega Ω contains a finite number of elementary events, n ( Ω ) = N < ∞ n(\Omega) = N < \infty n ( Ω ) = N < ∞ .
Equal Likelihood : Each elementary event in Ω \Omega Ω has an equal probability of occurring.
2.1 Classical Probability Formula
For any event A ⊆ Ω A \subseteq \Omega A ⊆ Ω containing m m m elementary outcomes: P ( A ) = n ( A ) n ( Ω ) = m N = Number of outcomes favorable to A Total number of possible outcomes in Ω P(A) = \frac{n(A)}{n(\Omega)} = \frac{m}{N} = \frac{\text{Number of outcomes favorable to } A}{\text{Total number of possible outcomes in } \Omega} P ( A ) = n ( Ω ) n ( A ) = N m = Total number of possible outcomes in Ω Number of outcomes favorable to A
2.2 Core Axioms and Addition Rules
Axiom of Non-negativity : 0 ≤ P ( A ) ≤ 1 0 \le P(A) \le 1 0 ≤ P ( A ) ≤ 1 for any event A A A .
Axiom of Certainty : P ( Ω ) = 1 P(\Omega) = 1 P ( Ω ) = 1 , and for the impossible event ∅ \emptyset ∅ , P ( ∅ ) = 0 P(\emptyset) = 0 P ( ∅ ) = 0 .
Addition Rule for Mutually Exclusive Events : If A ∩ B = ∅ A \cap B = \emptyset A ∩ B = ∅ , then: P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B )
General Addition Rule : For any two events A A A and B B B : P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A B ) P(A \cup B) = P(A) + P(B) - P(AB) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A B )
3. Conditional Probability
Conditional probability measures the probability of an event B B B occurring given that another event A A A has already occurred.
3.1 Definition and Formula
Let A A A and B B B be two events associated with a sample space Ω \Omega Ω , with P ( A ) > 0 P(A) > 0 P ( A ) > 0 . The conditional probability of B B B given A A A , denoted by P ( B ∣ A ) P(B|A) P ( B ∣ A ) , is defined as: P ( B ∣ A ) = P ( A B ) P ( A ) P(B|A) = \frac{P(AB)}{P(A)} P ( B ∣ A ) = P ( A ) P ( A B )
In a classical probability model with finite sample space Ω \Omega Ω : P ( B ∣ A ) = n ( A B ) n ( A ) P(B|A) = \frac{n(AB)}{n(A)} P ( B ∣ A ) = n ( A ) n ( A B )
This effectively reduces the reference sample space from Ω \Omega Ω to the subset A A A .
3.2 Basic Properties of Conditional Probability
Range : 0 ≤ P ( B ∣ A ) ≤ 1 0 \le P(B|A) \le 1 0 ≤ P ( B ∣ A ) ≤ 1 .
Certain Event : P ( Ω ∣ A ) = 1 P(\Omega|A) = 1 P ( Ω∣ A ) = 1 , and P ( A ∣ A ) = 1 P(A|A) = 1 P ( A ∣ A ) = 1 .
Addition Rule for Mutually Exclusive Events : If B 1 ∩ B 2 = ∅ B_1 \cap B_2 = \emptyset B 1 ∩ B 2 = ∅ , then: P ( B 1 ∪ B 2 ∣ A ) = P ( B 1 ∣ A ) + P ( B 2 ∣ A ) P(B_1 \cup B_2 | A) = P(B_1|A) + P(B_2|A) P ( B 1 ∪ B 2 ∣ A ) = P ( B 1 ∣ A ) + P ( B 2 ∣ A )
Complement Rule : P ( B ‾ ∣ A ) = 1 − P ( B ∣ A ) P(\overline{B}|A) = 1 - P(B|A) P ( B ∣ A ) = 1 − P ( B ∣ A ) .
3.3 Multiplication Rule of Probability
Rearranging the conditional probability definition yields the multiplication rule : P ( A B ) = P ( A ) P ( B ∣ A ) = P ( B ) P ( A ∣ B ) ( provided P ( A ) > 0 , P ( B ) > 0 ) P(AB) = P(A) P(B|A) = P(B) P(A|B) \quad (\text{provided } P(A) > 0, P(B) > 0) P ( A B ) = P ( A ) P ( B ∣ A ) = P ( B ) P ( A ∣ B ) ( provided P ( A ) > 0 , P ( B ) > 0 )
For three events A , B , C A, B, C A , B , C : P ( A B C ) = P ( A ) P ( B ∣ A ) P ( C ∣ A B ) P(ABC) = P(A) P(B|A) P(C|AB) P ( A BC ) = P ( A ) P ( B ∣ A ) P ( C ∣ A B )
- 4. Law of Total Probability and Bayes' Theorem
- 4.1 Partition of Sample Space
A set of events B 1 , B 2 , … , B n B_1, B_2, \dots, B_n B 1 , B 2 , … , B n is said to form a partition of the sample space Ω \Omega Ω if:
B i ∩ B j = ∅ B_i \cap B_j = \emptyset B i ∩ B j = ∅ for all i ≠ j i \neq j i = j (pairwise mutually exclusive);
⋃ i = 1 n B i = Ω \bigcup_{i=1}^n B_i = \Omega ⋃ i = 1 n B i = Ω (collectively exhaustive);
P ( B i ) > 0 P(B_i) > 0 P ( B i ) > 0 for all i = 1 , 2 , … , n i = 1, 2, \dots, n i = 1 , 2 , … , n .
4.2 Law of Total Probability
If B 1 , B 2 , … , B n B_1, B_2, \dots, B_n B 1 , B 2 , … , B n form a partition of Ω \Omega Ω , then for any event A ⊆ Ω A \subseteq \Omega A ⊆ Ω : P ( A ) = ∑ i = 1 n P ( A B i ) = ∑ i = 1 n P ( B i ) P ( A ∣ B i ) P(A) = \sum_{i=1}^n P(AB_i) = \sum_{i=1}^n P(B_i) P(A|B_i) P ( A ) = i = 1 ∑ n P ( A B i ) = i = 1 ∑ n P ( B i ) P ( A ∣ B i )
Interpretation : The total probability of event A A A is the weighted sum of its conditional probabilities across all possible background scenarios B i B_i B i .
4.3 Bayes' Theorem (Inverse Probability)
If B 1 , B 2 , … , B n B_1, B_2, \dots, B_n B 1 , B 2 , … , B n form a partition of Ω \Omega Ω and P ( A ) > 0 P(A) > 0 P ( A ) > 0 , then for any k ∈ { 1 , 2 , … , n } k \in \{1, 2, \dots, n\} k ∈ { 1 , 2 , … , n } : P ( B k ∣ A ) = P ( B k A B k ) P ( A ) = P ( B k ) P ( A ∣ B k ) ∑ i = 1 n P ( B i ) P ( A ∣ B i ) P(B_k|A) = \frac{P(B_k AB_k)}{P(A)} = \frac{P(B_k) P(A|B_k)}{\sum_{i=1}^n P(B_i) P(A|B_i)} P ( B k ∣ A ) = P ( A ) P ( B k A B k ) = ∑ i = 1 n P ( B i ) P ( A ∣ B i ) P ( B k ) P ( A ∣ B k )
P ( B k ) P(B_k) P ( B k ) is called the prior probability of scenario B k B_k B k .
P ( A ∣ B k ) P(A|B_k) P ( A ∣ B k ) is the likelihood of observing A A A under scenario B k B_k B k .
P ( B k ∣ A ) P(B_k|A) P ( B k ∣ A ) is the posterior probability of scenario B k B_k B k after observing event A A A .
- 5. Worked Gaokao Exam Examples
- Example 1: Sampling Without Replacement (Urn Model)
Problem : An urn contains 5 5 5 balls of identical size: 3 3 3 white balls and 2 2 2 red balls. Two balls are drawn sequentially without replacement.
Find the probability that the second ball drawn is red given that the first ball drawn is white.
Find the probability that the second ball drawn is red.
Detailed Solution :
Let W 1 W_1 W 1 be the event "first ball is white", R 1 R_1 R 1 be "first ball is red", and R 2 R_2 R 2 be "second ball is red".
Conditional Probability P ( R 2 ∣ W 1 ) P(R_2|W_1) P ( R 2 ∣ W 1 ) :
After drawing 1 white ball, 4 balls remain in the urn ( 2 2 2 white, 2 2 2 red). P ( R 2 ∣ W 1 ) = 2 4 = 1 2 P(R_2|W_1) = \frac{2}{4} = \frac{1}{2} P ( R 2 ∣ W 1 ) = 4 2 = 2 1
Alternatively, using the formula: P ( W 1 ) = 3 5 P(W_1) = \frac{3}{5} P ( W 1 ) = 5 3 . The event W 1 R 2 W_1 R_2 W 1 R 2 corresponds to selecting 1 white first and 1 red second out of ordered pairs. P ( W 1 R 2 ) = 3 × 2 5 × 4 = 6 20 = 3 10 P(W_1 R_2) = \frac{3 \times 2}{5 \times 4} = \frac{6}{20} = \frac{3}{10} P ( W 1 R 2 ) = 5 × 4 3 × 2 = 20 6 = 10 3 . P ( R 2 ∣ W 1 ) = P ( W 1 R 2 ) P ( W 1 ) = 3 / 10 3 / 5 = 1 2 P(R_2|W_1) = \frac{P(W_1 R_2)}{P(W_1)} = \frac{3/10}{3/5} = \frac{1}{2} P ( R 2 ∣ W 1 ) = P ( W 1 ) P ( W 1 R 2 ) = 3/5 3/10 = 2 1
Unconditional Probability P ( R 2 ) P(R_2) P ( R 2 ) via Total Probability Law :
The events W 1 W_1 W 1 and R 1 R_1 R 1 partition the sample space for the first draw: P ( W 1 ) = 3 5 P(W_1) = \frac{3}{5} P ( W 1 ) = 5 3 , P ( R 1 ) = 2 5 P(R_1) = \frac{2}{5} P ( R 1 ) = 5 2 .
Conditional probabilities for the second draw: P ( R 2 ∣ W 1 ) = 2 4 = 1 2 P(R_2|W_1) = \frac{2}{4} = \frac{1}{2} P ( R 2 ∣ W 1 ) = 4 2 = 2 1 , and P ( R 2 ∣ R 1 ) = 1 4 P(R_2|R_1) = \frac{1}{4} P ( R 2 ∣ R 1 ) = 4 1 .
By the Law of Total Probability: P ( R 2 ) = P ( W 1 ) P ( R 2 ∣ W 1 ) + P ( R 1 ) P ( R 2 ∣ R 1 ) = 3 5 × 1 2 + 2 5 × 1 4 = 3 10 + 1 10 = 4 10 = 2 5 P(R_2) = P(W_1)P(R_2|W_1) + P(R_1)P(R_2|R_1) = \frac{3}{5} \times \frac{1}{2} + \frac{2}{5} \times \frac{1}{4} = \frac{3}{10} + \frac{1}{10} = \frac{4}{10} = \frac{2}{5} P ( R 2 ) = P ( W 1 ) P ( R 2 ∣ W 1 ) + P ( R 1 ) P ( R 2 ∣ R 1 ) = 5 3 × 2 1 + 5 2 × 4 1 = 10 3 + 10 1 = 10 4 = 5 2
Key Takeaway : In sequential sampling without replacement without knowing prior outcomes, the marginal probability of drawing a specific color on any draw equals the initial proportion of that color ( 2 5 \frac{2}{5} 5 2 ).
Example 2: Diagnostic Quality Control (Bayes' Rule)
Problem : Factory A produces 60 % 60\% 60% of a product, and Factory B produces 40 % 40\% 40% . The defect rate of Factory A is 2 % 2\% 2% , and the defect rate of Factory B is 5 % 5\% 5% . A product is randomly selected from the combined inventory and found to be defective.
What is the probability that the chosen product is defective?
What is the probability that this defective product was manufactured by Factory A?
Detailed Solution :
Let B 1 B_1 B 1 be the event "produced by Factory A", B 2 B_2 B 2 be "produced by Factory B", and D D D be "product is defective".
Given: P ( B 1 ) = 0.60 P(B_1) = 0.60 P ( B 1 ) = 0.60 , P ( B 2 ) = 0.40 P(B_2) = 0.40 P ( B 2 ) = 0.40 , P ( D ∣ B 1 ) = 0.02 P(D|B_1) = 0.02 P ( D ∣ B 1 ) = 0.02 , P ( D ∣ B 2 ) = 0.05 P(D|B_2) = 0.05 P ( D ∣ B 2 ) = 0.05 .
Total Probability P ( D ) P(D) P ( D ) : P ( D ) = P ( B 1 ) P ( D ∣ B 1 ) + P ( B 2 ) P ( D ∣ B 2 ) = ( 0.60 × 0.02 ) + ( 0.40 × 0.05 ) = 0.012 + 0.020 = 0.032 P(D) = P(B_1)P(D|B_1) + P(B_2)P(D|B_2) = (0.60 \times 0.02) + (0.40 \times 0.05) = 0.012 + 0.020 = 0.032 P ( D ) = P ( B 1 ) P ( D ∣ B 1 ) + P ( B 2 ) P ( D ∣ B 2 ) = ( 0.60 × 0.02 ) + ( 0.40 × 0.05 ) = 0.012 + 0.020 = 0.032
The overall defect rate in the warehouse is 3.2 % 3.2\% 3.2% .
Posterior Probability P ( B 1 ∣ D ) P(B_1|D) P ( B 1 ∣ D ) via Bayes' Theorem : P ( B 1 ∣ D ) = P ( B 1 ) P ( D ∣ B 1 ) P ( D ) = 0.012 0.032 = 12 32 = 3 8 = 0.375 P(B_1|D) = \frac{P(B_1)P(D|B_1)}{P(D)} = \frac{0.012}{0.032} = \frac{12}{32} = \frac{3}{8} = 0.375 P ( B 1 ∣ D ) = P ( D ) P ( B 1 ) P ( D ∣ B 1 ) = 0.032 0.012 = 32 12 = 8 3 = 0.375
Even though Factory A produces 60 % 60\% 60% of total goods, because its quality control is higher (lower defect rate), a defective item has only a 37.5 % 37.5\% 37.5% chance of having originated from Factory A.