Conditional Probability

Conditional probability measures the likelihood of an event given that another event is known to have occurred, written . Its defining formula is . It applies everywhere uncertainty is updated by new information — medical testing, spam filters, gambling, weather forecasts, and machine learning. Formalized by Thomas Bayes (1763) and Pierre-Simon Laplace (1812), it is the backbone of modern probabilistic reasoning.

Conditional probability is the probability of an event under the assumption that some other event has already happened, effectively shrinking the sample space to only the outcomes consistent with the given condition. It matters because almost all real-world reasoning involves updating beliefs as evidence arrives — raw, unconditional probabilities rarely capture what we actually know. The defining quantity is the proportion of the "world where is true" in which is also true. A surprising fact is that and can be wildly different — confusing the two (the "prosecutor's fallacy") has led to real miscarriages of justice. From this single definition flow the multiplication rule, Bayes' theorem, and the entire concept of statistical independence.

The Core Insight

When you learn that occurred, you discard every outcome where is false and renormalize what remains so the surviving probabilities again sum to 1. Conditional probability is nothing more than restricting attention to the sub-universe of outcomes consistent with your evidence, then asking how much of that sub-universe also satisfies . The division by is precisely this renormalization.

Formal Statement

Conditional Probability

Let and be events in a sample space with a probability measure , and suppose . The conditional probability of given is:

1
⟳Restrict the sample space to ; the favorable outcomes are those in both and , namely , and we divide by the "new total" .

Here:

  • = the sample space (set of all possible outcomes),
  • = events,
  • = the event that both and occur,
  • = the (unconditional) probability of , required to be strictly positive,
  • = probability of given that has occurred.

Rearranging equation [1] gives the multiplication rule, often more useful in practice:

2
⟳Multiply both sides of [1] by ; symmetry follows by swapping the roles of and .

Bayes' Theorem

For events and with and :

3
⟳Set the two expressions for in equation [2] equal and solve for .

When the denominator must be expanded over a partition of (the law of total probability):

4
⟳The events are disjoint and their union is ; apply the multiplication rule [2] to each term .

Independence

Events and are independent if and only if:

5
⟳Substitute into [1]; the cancels, leaving — knowing tells you nothing about .

Why It Holds / Derivation

Justifying the Definition via Renormalization

We show that equation [1] is the unique sensible definition for "probability of within the world where holds."

  1. Restrict the universe. Given that occurred, only outcomes inside remain possible. We seek a new probability measure defined on subsets of .
  1. Proportionality. Within , relative likelihoods should be preserved — if outcome was twice as likely as before, it still is. So for some constant , since only the part of inside matters.
  1. Normalization. A valid probability requires . Thus , giving .
  1. Conclude. Therefore , which is exactly in equation [1].

That Conditional Probability Is Itself a Valid Probability

Fix with . We verify satisfies the Kolmogorov axioms.

  1. Non-negativity: since both factors are non-negative.
  1. Total mass: .
  1. Countable additivity: For disjoint , the sets are also disjoint, so

Hence is a genuine probability measure.

Thomas Bayes | c. 1701–1761

An English Presbyterian minister and amateur mathematician, Bayes left an unpublished essay solving the "inverse probability" problem: given observed outcomes, how do we infer the probability of an underlying cause? His friend Richard Price edited and published it posthumously in 1763 as An Essay towards solving a Problem in the Doctrine of Chances. Bayes considered a thought experiment of balls rolled on a table — reasoning backward from where later balls land to where an unseen first ball lies. Though he never wrote the theorem in its modern form, the principle of reversing conditionals — turning into — bears his name and underlies an entire school of statistical inference.

Building Intuition

Picture the sample space as a rectangle of total area 1. Event is a region inside it; event is another region, possibly overlapping. The unconditional is the fraction of the whole rectangle covered by . But throws away everything outside and asks: of the area now remaining (just ), what fraction is also ? That fraction is the overlap divided by all of .

This is why conditioning can raise or lower a probability. If overlaps heavily, learning makes more likely. If they barely overlap, makes less likely. And if 's share of equals its share of the whole space, then is irrelevant — that is independence.

Conditional probability as renormalization: restricting the universe to B

Ω (total area = 1) A B A∩B P(A|B) = area(A∩B) / area(B) — only the gold region B is the "new universe"

Worked Examples

Two Dice — The Sum Given a Six

Given: Roll two fair six-sided dice. Let = "the sum is 8" and = "at least one die shows a 6." Find . Step 1 — Count . Outcomes with at least one 6: there are 11 (the six plus the six , minus the double-counted ). So . Step 2 — Count . Sum 8 and a six: only and . So . Step 3 — Apply equation [1].
Answer:

Note that unconditionally , so learning "at least one six" raised the probability of an 8.

Medical Test — Bayes in Action

Given: A disease affects 1% of a population: . A test has sensitivity and false-positive rate . A person tests positive. Find . Step 1 — Total probability of a positive (equation [4]).
Step 2 — Apply Bayes' theorem (equation [3]).
Answer:

Despite a 99% sensitive test, a positive result means only a ~17% chance of disease, because the disease is rare. This is the famous base-rate effect.

Common Misconceptions

Do Not Confuse $P(A \mid B)$ with $P(B \mid A)$

These are generally not equal. In the medical example, but . Swapping them is the prosecutor's fallacy: "the chance of this DNA match if innocent is 1 in a million, therefore the chance the defendant is innocent is 1 in a million" is invalid reasoning that ignores the base rate of innocent people. Equation [3] is precisely the correct way to convert one into the other.

Conditioning on a Zero-Probability Event

Equation [1] requires . If , the ratio is undefined and has no meaning from the elementary definition. Handling such cases (e.g., conditioning on a continuous variable taking an exact value) requires the more advanced machinery of conditional densities and measure theory.

Independence Is Not "Mutual Exclusivity"

A common error is thinking disjoint (mutually exclusive) events are independent. They are nearly the opposite. If and are disjoint with positive probabilities, then , so . Knowing occurred tells you cannot have — that is maximal dependence, not independence. For example, "rolling a 2" and "rolling a 5" on one die are mutually exclusive but strongly dependent.

Connections

Conditional probability is the hinge connecting many topics. It generalizes Joint Probability via the multiplication rule [2], and it specializes to ordinary probability when the condition is . It defines Statistical Independence (equation [5]) and powers Bayes' Theorem for inference. The Law of Total Probability (equation [4]) decomposes events over a partition, and conditional probability underlies Conditional Expectation, Markov Chains (where the future depends only on the present state), and Random Variables through conditional distributions. It is also the foundation of Decision Theory under uncertainty.

Real-World Applications

  1. Medical diagnosis (Bayesian screening): computing the true probability of disease given a positive test, correcting for base rates — as in the worked example above.
  2. Spam filtering (Naive Bayes classifiers): is computed from ; this powered early Gmail and SpamAssassin filters.
  3. Forensic science / DNA evidence: courts must convert match probabilities into guilt probabilities, where the prosecutor's fallacy is a documented danger (R v. Sally Clark, 1999).
  4. Weather forecasting: "70% chance of rain given current pressure and humidity" is an inherently conditional statement updated as data arrives.
  5. Insurance and actuarial pricing: premiums depend on .
  6. Machine learning: classifiers, hidden Markov models, and Bayesian networks all encode conditional dependencies; the entire field of probabilistic inference rests on it.
  7. Gambling and game theory: updating odds in poker or blackjack as cards are revealed is live conditional-probability calculation.

Historical Development

  • 1654 — Blaise Pascal and Pierre de Fermat correspond about the "problem of points," laying groundwork for probability and implicitly conditional reasoning.
  • 1713 — Jacob Bernoulli's Ars Conjectandi establishes the law of large numbers, framing probability as quantified uncertainty.
  • 1763 — Thomas Bayes' essay is published posthumously by Richard Price, introducing inverse probability.
  • 1774 & 1812 — Pierre-Simon Laplace independently develops and greatly extends Bayesian ideas in Théorie analytique des probabilités, giving the rule its general form.
  • 1837 — Siméon Poisson clarifies conditional reasoning in his work on judgments and probability.
  • 1933 — Andrey Kolmogorov's Grundbegriffe der Wahrscheinlichkeitsrechnung axiomatizes probability, defining conditional probability rigorously and extending it to general (measure-theoretic) conditioning.
  • 1950s — Conditional probability becomes central to information theory (Shannon) and statistical decision theory (Wald).
  • 1980s–1990s — Judea Pearl develops Bayesian networks, making conditional dependence a computational engine for AI.
  • 2000s–present — Bayesian methods dominate machine learning, genomics, and data science.

Subtleties & Limits

Conditioning on events of probability zero — for example, "given that a randomly chosen point lies exactly on a line" — cannot be handled by equation [1] and leads to the Borel–Kolmogorov paradox, where the answer depends on how one approaches the limiting condition. The measure-theoretic resolution defines conditional expectation as a Radon–Nikodym derivative, but it is only specified "almost everywhere," leaving genuine philosophical ambiguity about conditioning on individual zero-probability outcomes. Foundational debates between frequentist and Bayesian interpretations of what means — a long-run frequency versus a degree of belief — remain unresolved and actively shape statistical practice today.

See Also

Bayes' Theorem · Statistical Independence · Law of Total Probability · Joint Probability · Conditional Expectation · Markov Chains · Probability Axioms · Random Variables

Before this

Where this leads