Conditional Probability & Bayes
00 · Symbol Glossary
The probability of once you know occurred. Defined only when , by . Read the bar as "given", never as division.
Events that are pairwise disjoint and together cover : exactly one occurs. In finance the cells are usually scenarios or regimes (calm, normal, stress).
Probability of a hypothesis (a firm is fragile, the market is in stress) before looking at the evidence. In Bayes' theorem this is the base rate.
Probability of observing the data if the hypothesis is true. A test's hit rate and false-positive rate are both likelihoods.
Probability of the hypothesis after seeing the data. Bayes' theorem converts prior and likelihood into posterior. Confusing with is the most expensive error in this chapter.
. Each is a probability in a different conditional world. They are chained by the multiplication rule; they are not added.
For evidence and hypothesis , . Posterior odds equal prior odds times , so a second independent signal (Chapter 04) multiplies by a second ratio.
01 · Information Shrinks the Sample Space
Chapter 02 assigned every event a single number. In practice you rarely evaluate a probability in a vacuum: you already know something — yesterday's close, a rating action, the output of a risk model. Learning that an event occurred rules out every outcome outside . Probabilities of other events must be recomputed inside that smaller world.
On a finite space with the uniform measure the recomputation is just counting. Among the outcomes still possible (those in ), what fraction also lie in ?
Model three days of up/down moves as the equally likely strings in . Let be "day 1 is up", so .
Now you are told = "at least two of the three days were up". Then has outcomes, and has . Inside the reduced world,
The information "mostly up" is evidence about each individual day, even though the days were generated with no link between them. Conditioning is about what you know, not about what caused what.
02 · Definition
Counting only works for uniform measures. The general definition replaces counts with probabilities.
For events with ,
If , the expression is left undefined.
Plain language: take the probability mass sitting on , keep the part that also sits on , and rescale so that itself has total mass .
Fix with . The map satisfies every axiom of Chapter 02: it is non-negative, , and it is additive over disjoint events because splits into the disjoint pieces and . So every rule you already know still holds after conditioning — for example . The two numbers and live in different conditional worlds, so they do not add to . Section 04 combines them correctly, as a weighted average with weights and .
A historical-simulation VaR model is built from ten years of data in which a particular rate never went below zero. A risk manager asks for "the loss distribution given negative rates".
Why it breaks: under the empirical measure, the event = "rate below zero" has . The ratio is — not small, not large, undefined. No arithmetic on the existing model produces an answer.
Consequence: to condition on a scenario you must first build a model that gives it positive probability (a stressed scenario, an expanded sample, a parametric tail). A conditional number quoted for a zero-probability scenario was produced by something other than the model it claims to come from.
03 · The Multiplication Rule
Rearranging the definition gives the most-used identity in the chapter.
If ,
More generally, for events with , the chain rule is
The chain rule is how you compute the probability of a sequence of events: multiply the probability of the first step by the probability of each next step given everything before it.
A portfolio holds bonds, of which exactly will default this year. An auditor samples bonds at random without replacement. Let = "first sampled bond defaults", = "second sampled bond defaults". Then , and given only defaulters remain among bonds:
Multiplying instead would ignore that the first draw changed what is left in the pool.
04 · The Law of Total Probability
Often is hard to compute directly but easy to compute scenario by scenario. Split into scenarios, solve each one, and recombine.
If partition and for each , then for any event ,
Proof in one line: is the disjoint union of the pieces , so by additivity, and each piece equals by the multiplication rule. The unconditional probability is a weighted average of conditional probabilities, with the scenario probabilities as weights.
Each regime above could have perfectly well-behaved losses. Mixing them produces an unconditional loss frequency that no single regime exhibits, and the rare regime dominates the tail. This is one of the standard explanations for why return distributions look fatter-tailed than any one calm-period model suggests.
Draw the three-regime example as a tree: first branch on regime, then on versus . Label each edge with its conditional probability, multiply along each root-to-leaf path, and check that the six leaf probabilities sum to .
05 · Bayes' Theorem
The law of total probability goes forward: from scenario to outcome. Bayes' theorem goes backward: having seen the outcome, how likely is each scenario?
If and ,
If partition with each , expanding the denominator by total probability gives
In the language of the glossary: posterior likelihood prior, and the denominator just rescales so the posteriors over all hypotheses sum to . Applied to the three-regime example, seeing a large loss moves the probability of stress from a prior of to a posterior of .
The false positives win because they are drawn from a population times larger. When the base rate is small, even a modest false-positive rate swamps the true signal.
In the same arithmetic, is the probability of the path "fragile and flagged". A note then says a flagged bank has a chance of being fragile.
Why it breaks: is a joint probability. The posterior divides by the probability of the evidence, , and only then equals about . Stopping before that division leaves the answer in the original world, where flags are uncommon, instead of in the world where a flag was seen.
Consequence: the figure is small because the prior is small, which is the opposite of what the flag is trying to tell you. Joint, likelihood, and posterior are three different numbers; a risk limit or a supervisory action has to say which one it is using.
Dividing Bayes for by Bayes for cancels the denominator: posterior odds likelihood ratio prior odds. Here the likelihood ratio is and the prior odds are , so the posterior odds are — probability , as before. If a second, different test also flags the bank, and the two tests err independently given the bank's true state (an assumption Chapter 04 makes precise), multiply by the second likelihood ratio. With another ratio of the odds become , a posterior of about .
Surveillance software flags a trading pattern. Honest accounts produce the pattern with probability ; rogue accounts produce it almost surely. Someone argues: "the chance of this pattern from an honest trader is , so the trader is likely to be rogue."
Why it breaks: the argument reports and calls it . Bayes needs the base rate. If account in is rogue, then among accounts about rogue accounts are flagged and about honest accounts are flagged. So , and an honest trader is the likely explanation.
Consequence: the same swap appears whenever someone says a model "had only a chance of producing this backtest if it had no skill, so it has skill with probability". A small likelihood under one hypothesis is not a small posterior for that hypothesis; the answer depends on the prior and on how likely the evidence is under the alternatives. Chapter 14 returns to this distinction when a hypothesis test is read as a probability that the hypothesis is true.
06 · Conditional Survival Along a Credit Curve
A cumulative default probability answers "does the name default at some point before this date?" A trading desk usually inputs something narrower: the chance of defaulting this year if the name is still alive at the start of it. Those inputs sit in different conditional worlds. The chain rule is what stitches them into one probability on the original space.
Let be "alive at the start of year " and be "defaults during year ", with . When ,
The multiplication rule gives and .
Unrolling the product, survival through years and default during a specific year are
with the empty product (when ) equal to . The events are disjoint — a name defaults in at most one year — so the probability of default within years is the sum of those pieces, which is also .
An investment-grade name has , , .
Default during year 2, which requires surviving year 1, has probability . Default within three years has probability . The sum of the inputs, , is close and is still a different number: each was computed in a smaller world than the one before it.
A distressed name is assigned conditional default probabilities , , and for the next three years. A summary adds them and reports a chance of default within three years.
Why it breaks: is the probability of default in year 2 given survival through year 1, not the probability of that event in the original sample space. The three numbers are not the probabilities of three disjoint events, so the additivity axiom does not apply to them. The chain rule gives
Consequence: a sum above is easy to catch, and it is not the only failure. In the investment-grade example the sum sits quietly above the true cumulative and would pass a "does it exceed one?" check. Convert each conditional probability into an unconditional piece with the product of survivals, then add those pieces.
Pushing out, is the probability of surviving every year through , and increases to the probability of eventual default (Chapter 02's nested limit). Chapter 15 builds tail risk — value at risk and expected shortfall — by restricting attention to bad outcomes and rescaling. That is the same habit: recompute inside the event you conditioned on. A default curve is not itself one of those tail risk numbers.
07 · Exercises
Write two ways using the multiplication rule, then replace with its law-of-total-probability expansion.
By the multiplication rule, . Dividing by gives . Since the partition with positive probabilities, , which is the denominator of the partition form. Summing the result over gives , confirming that the posteriors form a probability over the hypotheses.
Derive the partition form of Bayes' theorem from the multiplication rule and the law of total probability, and check that the posteriors sum to .
Compute by total probability first. For the second part, condition on "no flag" and use .
, so . For unflagged borrowers, and , so . The flag raises default risk from to about and an absent flag lowers it to about : the model is useful for ranking, but declining every flagged applicant would turn away roughly seven good borrowers for every three defaulters.
Five percent of a lender's borrowers default within a year. A scoring model flags of eventual defaulters and of borrowers who do not default. Let be "borrower defaults". Find and , and interpret both numbers for a credit officer.
The hypotheses are the two regimes. Compute the likelihood of "two down days" in each regime, multiply by the prior, and normalize.
Likelihoods: and . Unnormalized posteriors: and , summing to . Hence , up from a prior of . Two down days are only mildly more likely under bear than bull (likelihood ratio ), so the update is real but modest; a single noisy observation rarely settles which regime you are in.
A market is in a bull regime with probability and a bear regime with probability . A down day has probability in the bull regime and in the bear regime, and within a regime the model treats the two days as unrelated, so the probability of two down days is the square of the one-day probability. After observing two consecutive down days, find the posterior probability of the bear regime. (Chapter 04 will name "unrelated" as independence; the product used here is part of the question's assumptions.)
Survival through year multiplies one more factor . Default during year 2 equals survival through year 1 times . The three conditional inputs are not the probabilities of disjoint events.
(a) . (b) Default during year 2 requires survival through year 1, so . (c) . As a check, the disjoint pieces are , , and , which sum to . (d) The sum adds probabilities from three different conditional worlds. It exceeds the cumulative default probability and is not itself the probability of any one event on the original space.
A name has conditional default probabilities , , , each given survival to the start of that year. (a) Find the probability of surviving all three years. (b) Find the probability of defaulting during year 2. (c) Find the probability of defaulting within three years. (d) Explain why is not the answer to (c).
08 · Chapter Summary
| Concept | Meaning |
|---|---|
| Conditional probability | , defined only for |
| Conditioning keeps the axioms | is itself a probability on |
| Multiplication / chain rule | probability of a sequence = product of step-by-step conditionals |
| Total probability | unconditional probability = scenario-weighted average of conditionals |
| Bayes' theorem | posterior likelihood prior |
| Base-rate effect | rare hypotheses stay unlikely after a positive signal unless the false-positive rate is tiny |
| Prosecutor's fallacy | is not |
| Joint versus posterior | likelihood times prior is ; divide by before calling it a conditional probability |
| Conditional hazard | default this year given survival so far; chain the survivals, then add the disjoint year-by-year pieces |
Next: Chapter 04 — Independence of Events, which studies the special case where conditioning on leaves the probability of unchanged, and shows why that assumption is so often wrong for defaults.