Study guide
5.1 Fundamentals of Probability
FRM Part I Financial Risk Manager Study Guide Exam
Track your progress as you read
Finished sections get a check mark.
1 Introduction & Exam Overview
1.1 Current Exam Facts 1.2 Study Strategy & Domain Weights
2 Foundations: Risk Building Blocks & Governance
2.1 Building Blocks of Risk Management 2.2 How Firms Manage Financial Risk 2.3 Governance of Risk Management 2.4 Credit Risk Transfer Mechanisms
3 Foundations: Portfolio Models, Data & ERM
3.1 MPT and the CAPM 3.2 APT and Multifactor Models 3.3 Risk Data Aggregation & Reporting 3.4 Enterprise Risk Management
4 Foundations: Disasters, Crisis & Ethics
4.1 Learning from Financial Disasters 4.2 Anatomy of the Great Financial Crisis 4.3 GARP Code of Conduct
5 Quantitative Analysis: Probability Foundations
5.1 Fundamentals of Probability 5.2 Random Variables 5.3 Common Univariate Distributions 5.4 Multivariate Random Variables
6 Quantitative Analysis: Inference & Regression
6.1 Sample Moments 6.2 Hypothesis Testing 6.3 Linear Regression 6.4 Multiple Regression
7 Quantitative Analysis: Diagnostics & Time Series
7.1 Regression Diagnostics 7.2 Stationary Time Series 7.3 Non-Stationary Time Series 7.4 Returns, Volatility & Correlation
8 Quantitative Analysis: Simulation & Machine Learning
8.1 Simulation and Bootstrapping 8.2 Machine-Learning Methods 8.3 Machine Learning and Prediction
9 Financial Markets: Institutions & Derivatives Intro
9.1 Banks 9.2 Insurance Companies and Pension Plans 9.3 Fund Management 9.4 Introduction to Derivatives
10 Financial Markets: Clearing, Futures & Hedging
10.1 Exchanges and OTC Markets 10.2 Central Clearing 10.3 Futures Markets 10.4 Using Futures for Hedging
11 Financial Markets: FX, Forwards, Commodities & Options
11.1 Foreign Exchange Markets 11.2 Pricing Financial Forwards and Futures 11.3 Commodity Forwards and Futures 11.4 Options Markets
12 Financial Markets: Option Properties, Strategies & Rates
12.1 Properties of Options 12.2 Trading Strategies 12.3 Exotic Options 12.4 Properties of Interest Rates
13 Financial Markets: Bonds, MBS, Rate Futures & Swaps
13.1 Corporate Bonds 13.2 Mortgages and Mortgage-Backed Securities 13.3 Interest Rate Futures 13.4 Swaps
14 Valuation & Risk Models: VaR, Volatility & Ratings
14.1 Measures of Financial Risk 14.2 Calculating and Applying VaR 14.3 Measuring and Monitoring Volatility 14.4 External and Internal Credit Ratings
15 Valuation & Risk Models: Credit, OpRisk & Stress
15.1 Country Risk 15.2 Measuring Credit Risk 15.3 Operational Risk 15.4 Stress Testing
16 Valuation & Risk Models: Fixed-Income Valuation
16.1 Pricing, Discounting & Arbitrage 16.2 Interest Rates 16.3 Bond Yields and Return Calculations 16.4 Duration, Convexity & DV01
17 Valuation & Risk Models: Term Structure, Options & Greeks
17.1 Non-Parallel Term Structure Shifts 17.2 Binomial Trees 17.3 The Black-Scholes-Merton Model 17.4 Option Sensitivity Measures: The Greeks
5.1 Fundamentals of Probability
Key Takeaways Explain This Topic AI
An event is a subset of the sample space Ω; probability assigns numbers in [0, 1] that satisfy non-negativity, normalization, and countable additivity for disjoint events
Independent events satisfy P(A ∩ B) = P(A)P(B); mutually exclusive events satisfy A ∩ B = ∅ and cannot both occur—do not confuse the two
Conditional independence means P(A ∩ B | C) = P(A|C)P(B|C); it is weaker than unconditional independence and is common in risk-factor models
Conditional probability P(A|B) = P(A ∩ B) / P(B) updates beliefs given information; Bayes’ rule reverses conditioning using priors and likelihoods
Unconditional probabilities average over all scenarios; risk managers often need conditional probabilities given market regimes, ratings, or stress states
Last updated: August 2026
Fundamentals of Probability
Quantitative Analysis opens with probability because every risk measure—VaR, expected shortfall, default likelihood, option pricing—is a statement about uncertain outcomes. GARP’s QA–1 reading expects fluency with events, conditioning, independence concepts, and Bayes’ rule before distribution catalogs begin.
Sample Space, Events, and Event Space
The sample space Ω is the set of all mutually exclusive, exhaustive outcomes of an experiment. Tossing a fair six-sided die once gives Ω = {1, 2, 3, 4, 5, 6}. For tomorrow’s equity return, Ω might be the continuum of real numbers (or a discretized grid in a model).
An event is any subset of Ω that we care about measuring. Examples: A = {even faces} = {2, 4, 6}; B = {loss greater than 2%}; C = {counterparty defaults within one year}. The collection of events we assign probabilities to is the event space (formally a σ-algebra). For FRM purposes, treat it as “the family of events the model recognizes,” closed under complement and countable unions so that “not A,” “A or B,” and “A and B” are always valid events when A and B are.
A probability measure P maps events to numbers in [0, 1] with three core properties:
Non-negativity: P(E) ≥ 0 for every event E.
Normalization: P(Ω) = 1.
Additivity for disjoint events: if A ∩ B = ∅, then P(A ∪ B) = P(A) + P(B). For countably many pairwise-disjoint events, the same rule extends to infinite sums.
Immediate corollaries: P(∅) = 0; P(Aᶜ) = 1 − P(A); and for any A, B, the inclusion-exclusion identity P(A ∪ B) = P(A) + P(B) − P(A ∩ B).
- Object Meaning Exam cue
- Ω Sample space of outcomes “All possible results”
- Event A ⊆ Ω Subset we assign probability “Default,” “rally,” “breach”
- P(A) Probability of A Number in [0, 1]
- A ∩ B Both occur Joint event
- A ∪ B At least one occurs Union
- Aᶜ A does not occur Complement
- Independent Versus Mutually Exclusive
Two events are mutually exclusive (disjoint) if they cannot happen together: A ∩ B = ∅, so P(A ∩ B) = 0. “Downgrade to CCC” and “upgrade to AA” in the same one-period rating migration for one issuer are mutually exclusive in a standard matrix.
Two events are independent if knowledge of one does not change the probability of the other: P(A ∩ B) = P(A)P(B), equivalently P(A|B) = P(A) when P(B) > 0. Independence is about information , not about impossibility of joint occurrence.
Critical trap: mutually exclusive events with positive individual probabilities are dependent , not independent. If P(A) > 0 and P(B) > 0 and A ∩ B = ∅, then P(A ∩ B) = 0 ≠ P(A)P(B). Exam writers love this confusion.
Independence extends to collections: A, B, C are mutually independent if every subset factors—P(A ∩ B) = P(A)P(B), P(A ∩ C) = P(A)P(C), P(B ∩ C) = P(B)P(C), and P(A ∩ B ∩ C) = P(A)P(B)P(C). Pairwise independence alone is not enough for the triple product.
Conditional Independence
Events A and B are conditionally independent given C if P(A ∩ B | C) = P(A|C)P(B|C). Unconditionally they may still be dependent because C induces correlation.
Risk example: two corporate bonds may look correlated because both load on the same credit cycle. Conditional on a latent factor F (economy state), default indicators D₁ and D₂ might be modeled as independent. That is the logic behind many one-factor credit-portfolio models: conditional independence given the systematic factor, unconditional dependence through the factor. FRM candidates should state which conditioning set is assumed whenever they claim “independent defaults.”
Discrete Probabilities and Elementary Calculations
When Ω is finite and outcomes are equally likely, P(A) = |A| / |Ω|. More generally, assign probabilities pᵢ to atoms ωᵢ with Σ pᵢ = 1, then P(A) = Σ_{ωᵢ ∈ A} pᵢ.
Worked discrete example
A trading desk faces three scenarios for next quarter with probabilities 0.50 (base), 0.30 (mild stress), and 0.20 (severe stress). Event L = “liquidity buffer breached” occurs in mild stress with probability 0.40 conditional on that scenario and in severe stress with probability 0.75; it never occurs in the base case. Then:
P(L) = 0.50·0 + 0.30·0.40 + 0.20·0.75 = 0 + 0.12 + 0.15 = 0.27.
This is the law of total probability : partition Ω into scenarios Sⱼ and write P(L) = Σ P(L|Sⱼ)P(Sⱼ).
Conditional Versus Unconditional Probability
Unconditional (marginal) probability P(A) is the probability before using a specific piece of information. Conditional probability updates given that B occurred:
P(A|B) = P(A ∩ B) / P(B), provided P(B) > 0.
Rearrangement: P(A ∩ B) = P(A|B)P(B) = P(B|A)P(A).
Risk managers live in conditional space: P(default | downgrade), P(loss > x | VIX spike), P(breach | model break). Reporting only unconditional averages can hide that a book is safe in calm markets and fragile in stress.
From the liquidity example, P(severe | L) is not 0.20. Using Bayes below, most breaches come from severe and mild stress in proportion to their joint mass.
Bayes’ Rule
Bayes’ rule reverses conditioning:
P(Sⱼ|L) = P(L|Sⱼ)P(Sⱼ) / P(L).
Priors P(Sⱼ) combine with likelihoods P(L|Sⱼ) to produce posteriors P(Sⱼ|L).
Worked Bayes example (full numbers)
Using the same scenarios and P(L) = 0.27:
- P(base | L) = (0 · 0.50) / 0.27 = 0
- P(mild | L) = (0.40 · 0.30) / 0.27 = 0.12 / 0.27 ≈ 0.444
- P(severe | L) = (0.75 · 0.20) / 0.27 = 0.15 / 0.27 ≈ 0.556
Given a buffer breach, there is about a 55.6% chance the world is in severe stress and 44.4% it is mild stress—even though the unconditional prior on severe stress was only 20%. That is the exam point: data updates priors ; rare scenarios with high likelihoods can dominate the posterior.
Credit-risk analogue: a sparse default sample still updates PD beliefs when combined with a prior from the rating system. Fraud detection, model validation “false positive” problems, and regime inference all use the same structure.
Putting the Rules to Work
When a FRM stem mentions two risks, ask: Are they exclusive, independent, or neither? When information arrives, switch from P(A) to P(A|B). When the question gives P(data|hypothesis) but asks for P(hypothesis|data), apply Bayes with a carefully computed denominator via the law of total probability. Master these mechanics and later chapters on distributions and multivariate dependence become applications rather than new languages.