Conditional Probability

SECTION 1

Historical Context & Motivation

Probability as a formal branch of mathematics has surprisingly recent roots. For centuries, games of chance drove people to wonder about likelihood, but it was not until the 1600s that mathematicians began writing down rigorous rules. The idea of conditional probability — the probability of an event given that another event has already happened — arose naturally from gambling problems and questions about uncertain evidence. Today, conditional probability underpins everything from medical testing to weather forecasting to spam filters in your email inbox.

1654

The Pascal–Fermat Correspondence

Blaise Pascal and Pierre de Fermat exchanged letters about the problem of points, laying the groundwork for modern probability theory by analyzing how to divide stakes in an interrupted game of chance.

1763

Bayes' Theorem Published

Thomas Bayes' essay, published posthumously, introduced a method for updating probabilities when new evidence is obtained — the first formal treatment of conditional probability as we know it today.

1812

Laplace's Théorie Analytique

Pierre-Simon Laplace systematized probability theory in his landmark book, refining conditional probability and applying it to astronomical observations and legal reasoning.

1933

Kolmogorov's Axioms

Andrey Kolmogorov published the axiomatic foundations of probability, formally defining conditional probability as P(A | B) = P(A ∩ B) / P(B), the formula students still use today.

The central question conditional probability answers is deceptively simple: if you already know something has happened, how does that change the chance of something else? For example, the probability that a randomly selected student plays basketball might be 15 %, but the probability changes if you already know that student is over 185 cm tall. This idea of updating probability with new information is what SL 4.4 is all about.

SECTION 2

Core Principles & Definitions

Before diving into calculations, it is essential to understand four foundational ideas that make conditional probability work. These concepts build on your existing knowledge of basic probability and set notation, so make sure you are comfortable with intersections (∩), unions (∪), and complementary events before proceeding.

The probability of event A occurring given that event B has already occurred. Written P(A | B), read as 'the probability of A given B.' The vertical bar '|' means 'given that.'

Sample Space Reduction

When you know B has happened, the original sample space shrinks to just the outcomes inside B. You are no longer looking at everything that could happen — only at what could happen within B.

Independent Events

Two events are independent if knowing one occurred does not change the probability of the other. Formally: P(A | B) = P(A), or equivalently P(A ∩ B) = P(A) × P(B).

Dependent Events

Two events are dependent if the occurrence of one changes the probability of the other. Drawing cards without replacement is a classic example: removing one card changes the deck for the next draw.

✦ KEY TAKEAWAY

Think of conditional probability like looking through a window. Normally, you can see the entire room (the full sample space). But when someone tells you event B has occurred, they put up a frame that blocks everything except the part of the room where B happens. Now you ask, 'Within this smaller view, how much of what I see is also A?' That fraction is P(A | B).

SECTION 3

Visual Explanation — Venn Diagrams & Sample Space

A Venn diagram is one of the clearest ways to see conditional probability in action. The diagram below shows two overlapping events A and B inside a universal sample space U. When we compute P(A | B), we effectively 'zoom in' on circle B and ask what fraction of B's area is shared with A.

When we condition on B, the entire circle B becomes our new sample space. The pink overlap region A ∩ B, divided by the total area of B, gives us P(A | B).

Notice what happens geometrically: the denominator P(B) rescales everything so that the probabilities inside B add up to 1. Everything outside circle B becomes irrelevant once we know B has occurred. This is the heart of sample space reduction. In numerical terms, if P(A ∩ B) = 0.12 and P(B) = 0.40, then P(A | B) = 0.12 / 0.40 = 0.30 — meaning 30 % of the time that B occurs, A also occurs.

SECTION 4

Mathematical Framework

The mathematics of conditional probability and independence rests on a small set of formulas. Each one connects to the Venn diagram picture you just studied. Master these equations and their rearrangements, and you will be well-equipped for any SL 4.4 exam question.

CONDITIONAL PROBABILITY FORMULA

P(A | B) = P(A ∩ B) / P(B), where P(B) > 0

P(A | B) = probability of A given B has occurred; P(A ∩ B) = probability that both A and B occur; P(B) = probability of event B.

MULTIPLICATION RULE (REARRANGEMENT)

P(A ∩ B) = P(A | B) × P(B)

This is the conditional probability formula rearranged. It says the probability of both events equals the probability of B times the probability of A given B. Useful when building tree diagrams.

TEST FOR INDEPENDENCE

A and B are independent ⟺ P(A ∩ B) = P(A) × P(B)

If this equation holds, knowing B gives no new information about A. Equivalently, P(A | B) = P(A) and P(B | A) = P(B).

⚠️ Common Mistake

Students often confuse mutually exclusive events (A ∩ B = ∅, so they cannot both happen) with independent events (knowing one tells you nothing about the other). In fact, if A and B are mutually exclusive and both have non-zero probability, they are never independent, because if B happened, you know for certain that A did not.

You can also express conditional probability symmetrically. Since P(A ∩ B) = P(B ∩ A), we can write P(B | A) = P(A ∩ B) / P(A). This symmetry is the foundation of Bayes' theorem, which you may meet at HL or in later studies. For SL 4.4 you mainly need the formulas above, along with the ability to set up and read tree diagrams and two-way tables.

SECTION 5

Tree Diagrams & Two-Way Tables

Two of the most powerful tools in SL 4.4 are tree diagrams and two-way tables. A tree diagram shows sequential events as branches, with conditional probabilities written along each branch. Multiplying along a path gives the joint probability of the outcomes on that path. A two-way table organizes data into rows and columns, making it straightforward to read off frequencies and compute conditional probabilities.

This tree diagram models drawing two marbles without replacement from a bag of 4 red and 6 blue. Notice that the second-draw probabilities change depending on the first draw — that is conditional probability at work. The branch probabilities in the second column are P(R₂ | R₁) = 3/9 and P(B₂ | R₁) = 6/9, for example.

Reading Conditional Probabilities from a Two-Way Table

A two-way table (also called a contingency table) displays counts or frequencies for two categorical variables. To find a conditional probability, restrict your attention to the row or column of the given event and divide the relevant cell by that row's or column's total. For example, in the table below, P(Sport | Female) is found by taking the number of females who play sport and dividing by the total number of females.

Sport participation by gender for 150 students

	Plays Sport	Does Not Play Sport	Total
Male	45	30	75
Female	35	40	75
Total	80	70	150

From this table: P(Sport | Female) = 35 / 75 ≈ 0.467. Meanwhile, P(Sport) = 80 / 150 ≈ 0.533. Because P(Sport | Female) ≠ P(Sport), we conclude that playing sport and being female are dependent events in this data set.

SECTION 6

Worked Example — Medical Test Accuracy

A common and powerful application of conditional probability is evaluating medical diagnostic tests. Consider the following scenario, which mirrors a classic IB exam-style question.

📋 Problem Statement

A disease affects 2 % of a population. A test for the disease has the following properties: if a person has the disease, the test is positive 95 % of the time (sensitivity). If a person does not have the disease, the test is positive 3 % of the time (false positive rate). A person is selected at random and tests positive. What is the probability that they actually have the disease?

Solution: Finding P(Disease | Positive Test)

Step 1 — Define Events and Given InformationLet D = person has the disease, and T⁺ = test is positive. We are given: P(D) = 0.02, so P(D') = 0.98. The sensitivity is P(T⁺ | D) = 0.95, and the false positive rate is P(T⁺ | D') = 0.03. We want P(D | T⁺).

Step 2 — Find P(T⁺) Using the Law of Total ProbabilityThe total probability of testing positive combines both paths in the tree diagram: P(T⁺) = P(T⁺ | D) × P(D) + P(T⁺ | D') × P(D'). Substituting: P(T⁺) = 0.95 × 0.02 + 0.03 × 0.98 = 0.019 + 0.0294 = 0.0484.

P(T⁺) = 0.0484

Step 3 — Apply the Conditional Probability FormulaP(D | T⁺) = P(D ∩ T⁺) / P(T⁺) = P(T⁺ | D) × P(D) / P(T⁺) = 0.019 / 0.0484.

P(D | T⁺) ≈ 0.3926

Step 4 — Interpret the ResultEven though the test seems very accurate (95 % sensitivity, only 3 % false positive), a person who tests positive has only about a 39 % chance of actually having the disease. This is because the disease is rare (only 2 % of the population), so the false positives from the healthy 98 % outnumber the true positives from the sick 2 %.

There is approximately a 39.3 % probability the person has the disease.

💡 WHY THIS MATTERS

This example illustrates the base rate fallacy — ignoring how common or rare a condition is when evaluating test results. A test can be excellent in terms of sensitivity and specificity and still produce many false alarms when the underlying condition is rare. This insight has real-world consequences in medicine, airport security screening, and even criminal justice.

SECTION 7

Comparing Dependent vs. Independent Situations

Understanding the difference between independent and dependent events is crucial for choosing the right formula and avoiding common exam errors. The table below summarizes the key distinctions you need to internalize for SL 4.4.

Key differences between independent and dependent events

Feature	Independent Events	Dependent Events
Definition	P(A \| B) = P(A)	P(A \| B) ≠ P(A)
Multiplication rule	P(A ∩ B) = P(A) × P(B)	P(A ∩ B) = P(A \| B) × P(B)
Everyday example	Flipping a coin, then rolling a die	Drawing two cards without replacement
Tree diagram branches	Second-level branch probabilities stay the same regardless of the first branch	Second-level branch probabilities change depending on the first branch
How to verify	Check if P(A ∩ B) equals P(A) × P(B)	Check if P(A ∩ B) differs from P(A) × P(B)

🔍 INDEPENDENCE CHECK

Think of independence like this: imagine you are listening to music on shuffle. The song that plays first has no effect on which song plays next (assuming true random shuffle). These are independent events. But now imagine a playlist where the app avoids repeating the same genre twice in a row — knowing the first song was pop changes the probability that the next song is pop. Those are dependent events. On the IB exam, always check by computing P(A) × P(B) and comparing it to the given or computed P(A ∩ B).

SECTION 8

Connections to Advanced Probability

The conditional probability formula you have learned in SL 4.4 is actually the building block for several more advanced topics. The table below previews how this foundation extends in IB HL Mathematics and university-level statistics.

How SL 4.4 connects to higher-level topics

SL 4.4 Concept	Advanced Extension	Where You'll See It
P(A \| B) = P(A ∩ B) / P(B)	Bayes' Theorem: P(B \| A) = P(A \| B) × P(B) / P(A)	IB HL 4.12, university statistics, machine learning
Independence: P(A ∩ B) = P(A) × P(B)	Chi-squared test for independence: tests whether two variables are truly independent using observed vs. expected frequencies	IB SL/HL 4.11, AP Statistics
Tree diagrams with conditional branches	Markov Chains: systems where the next state depends only on the current state (conditional on the present)	University courses in stochastic processes, Google's PageRank algorithm
Law of Total Probability	Bayesian inference: continuously updating beliefs as new data arrives	Data science, epidemiology, spam filtering

The key insight to carry forward is that conditional probability is not just a formula — it is a way of thinking about information and uncertainty. Every time new evidence arrives, probabilities update. This Bayesian perspective has become one of the most important frameworks in modern science, artificial intelligence, and decision-making. Your SL 4.4 studies give you the first solid foothold on this powerful idea.

SECTION 9

Practice Problems

PROBLEM 1 — CONCEPTUAL

Events C and D are such that P(C) = 0.5, P(D) = 0.4, and P(C ∩ D) = 0.2. Are C and D independent? Explain your reasoning.

PROBLEM 2 — BASIC CALCULATION

A bag contains 5 green and 3 yellow balls. Two balls are drawn without replacement. Find the probability that the second ball is green given that the first ball was yellow.

PROBLEM 3 — INTERMEDIATE

In a school, 60 % of students study Spanish, 30 % study French, and 15 % study both. A student is chosen at random and is found to study Spanish. What is the probability that this student also studies French?

PROBLEM 4 — APPLIED

A factory has two machines, M₁ and M₂. Machine M₁ produces 60 % of items and has a 4 % defect rate. Machine M₂ produces 40 % of items and has a 6 % defect rate. An item is selected at random and found to be defective. What is the probability it was produced by M₁?

PROBLEM 5 — CRITICAL THINKING

Events A and B satisfy P(A) = 0.3 and P(B) = 0.5. (a) If A and B are independent, find P(A ∪ B). (b) If A and B are mutually exclusive, find P(A | B). (c) Explain why A and B cannot be both independent and mutually exclusive when both have non-zero probability.

SUMMARY

Lesson Summary

Conditional probability measures the likelihood of event A when event B is known to have occurred, calculated using the formula P(A | B) = P(A ∩ B) / P(B). This formula works by reducing the sample space to only those outcomes where B occurs. Two events are independent if and only if P(A ∩ B) = P(A) × P(B), meaning knowledge of one event does not affect the probability of the other. When events are dependent, the general multiplication rule P(A ∩ B) = P(A | B) × P(B) must be used instead of the simpler product.

Key tools for solving conditional probability problems include tree diagrams (which display sequential conditional branches) and two-way tables (which organize joint frequencies). Remember that mutually exclusive events are never independent (when both have non-zero probability), and always verify independence by checking the multiplication criterion rather than relying on intuition. These concepts extend naturally to Bayes' theorem and Bayesian inference at higher levels of study.