Measure theory for probability
12 levels · 16 core library pages · Learn at your own pace
Assumed Prerequisites
These sample courses assume the background shown in the example. Use the linked pages to check your foundations. Abstract algebra is not required for either path.
Suggested Curriculum
Build the language that turns length, area and probability into one theory. Starting from your single-variable analysis, you will move through measurable sets and functions, construct Lebesgue measure, and learn why integration behaves well under carefully controlled limits. Each level connects the definitions to the theorems that use them and to worked examples in the library.
Then translate this machinery into probability: random variables become measurable functions, expectation becomes an integral, and conditional expectation becomes a precise way to retain information. The final level brings together convergence, independence and conditioning. The emphasis is on explaining hypotheses and choosing the right theorem, with a checkpoint before moving on.
Sigma-algebras & Borel sets
Specify which sets can be measured.
A sigma-algebra is closed under complements and countable unions. Generated sigma-algebras make this structure from a smaller family of sets; Borel sets arise from open sets. The pi-lambda theorem is a practical way to extend identities from generators to a whole sigma-algebra. Use the examples to compare finite partitions with the Borel structure on the real line.
Library pages & worked examples 1 core page
Measure Theory Math library
Logical flowchart 8 landmarks · 7 connections
Browse chart landmarks as a list
- Math · DefinitionSigma-algebras ↗
- Math · DefinitionMeasurable spaces and measurable sets ↗
- Math · DefinitionThe sigma-algebra generated by a family of sets ↗
- Math · DefinitionThe Borel sigma-algebra of a topological space ↗
- Math · DefinitionPi-systems ↗
- Math · DefinitionLambda-systems, or Dynkin systems ↗
- Math · TheoremNonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal ↗
- Math · TheoremDynkin's pi-lambda theorem ↗
Construct the sigma-algebra generated by a finite partition, then explain what generates the Borel sets.
Measures & null sets
Assign size using countable additivity.
A measure assigns nonnegative size with countable additivity. Distinguish finite and sigma-finite spaces, and interpret almost-everywhere statements through null sets. Continuity from below follows by decomposing an increasing union into disjoint increments; continuity from above requires a finite starting measure. Compare counting measure and point masses in the examples.
Library pages & worked examples 1 core page
Measure Theory Math library
Logical flowchart 8 landmarks · 7 connections
Browse chart landmarks as a list
- Math · DefinitionMeasures on sigma-algebras ↗
- Math · DefinitionMeasure spaces ↗
- Math · DefinitionFinite, sigma-finite, and semifinite measures ↗
- Math · DefinitionMeasure-null sets and almost-everywhere statements relative to a measure ↗
- Math · DefinitionComplete measure spaces ↗
- Math · TheoremFinite and countable subadditivity of measures ↗
- Math · TheoremContinuity from below for measures ↗
- Math · TheoremContinuity from above when one set has finite measure ↗
Prove continuity from below and explain why continuity from above needs a finiteness assumption.
Outer measure & extension
Construct a measure from simpler data.
An outer measure assigns size to arbitrary subsets through countable covers. Carathéodory measurability singles out sets that split every other set additively. The extension theorem turns a premeasure on an algebra into a measure; its uniqueness conclusion needs the stated hypotheses. The examples connect the abstract construction to interval covers.
Library pages & worked examples 1 core page
Measure Theory Math library
Logical flowchart 7 landmarks · 7 connections
Browse chart landmarks as a list
- Math · DefinitionOuter measures ↗
- Math · TheoremCarathéodory's theorem: measurable sets form a sigma-algebra carrying a complete measure ↗
- Math · DefinitionPremeasures on algebras of sets ↗
- Math · TheoremAssuming countable choice, a premeasure extends through its induced outer measure ↗
- Math · TheoremA sigma-finite premeasure has at most one extension to its generated sigma-algebra ↗
- Math · DefinitionMetric outer measures ↗
- Math · TheoremEvery Borel set is Carathéodory measurable for a metric outer measure ↗
State the extension theorem and separate its existence assumptions from its uniqueness assumptions.
Lebesgue measure
Extend interval length to measurable sets.
Lebesgue measure is constructed from elementary volumes and an outer measure. Borel sets are measurable, and completing the measure includes every subset of a null set. Regularity lets measurable sets be approximated by open and compact sets under the appropriate hypotheses. The examples show how null sets and ordinary volume fit this construction.
Library pages & worked examples 1 core page
Measure Theory Math library
Logical flowchart 8 landmarks · 7 connections
Browse chart landmarks as a list
- Math · DefinitionHalf-open boxes in ℝⁿ and their volume ↗
- Math · DefinitionLebesgue outer measure on ℝⁿ ↗
- Math · DefinitionLebesgue measurable sets, the family L(ℝⁿ), and the restricted set function λₙ ↗
- Math · TheoremElementary volume is a sigma-finite premeasure on the algebra of elementary sets ↗
- Math · TheoremAssuming countable choice, L(ℝⁿ) is a sigma-algebra containing every elementary set and λₙ is a complete measure extending elementary volume ↗
- Math · TheoremAssuming countable choice, every Borel subset of ℝⁿ is Lebesgue measurable ↗
- Math · TheoremAssuming countable choice, the Lebesgue outer measure of an arbitrary subset of ℝⁿ is the infimum of the measures of the open sets containing it ↗
- Math · TheoremAssuming countable choice, the Lebesgue measure of a measurable set is the supremum of the measures of its compact subsets ↗
Explain why a subset of a Lebesgue-null set is measurable.
Measurable functions
Approximate measurable functions by simple ones.
A measurable function pulls measurable sets back to measurable sets. Testing a generating family often suffices, and suitable pointwise limits preserve measurability. Increasing simple approximations to a nonnegative measurable function prepare the definition of integration. Work through a concrete approximation in the examples.
Library pages & worked examples 1 core page
Measure Theory Math library
Logical flowchart 4 landmarks · 3 connections
Browse chart landmarks as a list
- Math · TheoremA generating family on the codomain suffices to test measurability ↗
- Math · TheoremSequential suprema, infima, limsup, liminf, and pointwise limits of measurable functions are measurable ↗
- Math · TheoremEvery nonnegative measurable function admits an explicit increasing sequence of simple approximations ↗
- Math · TheoremDoob-Dynkin factorization through the sigma-algebra generated by a function ↗
Construct an increasing sequence of simple functions converging to a nonnegative measurable function.
The integral & convergence theorems
Choose the right theorem for a limit of integrals.
The Lebesgue integral begins with simple functions and extends by monotone approximation. Monotone convergence handles increasing nonnegative sequences; Fatou gives an inequality, while dominated convergence gives equality under an integrable bound. The examples show why pointwise convergence alone is insufficient.
Library pages & worked examples 1 core page
Measure Theory Math library
Logical flowchart 6 landmarks · 5 connections
Browse chart landmarks as a list
- Math · TheoremMonotone convergence for the integral ↗
- Math · TheoremFatou's lemma ↗
- Math · TheoremA nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere ↗
- Math · TheoremDominated convergence ↗
- Math · TheoremAbsolute continuity of the integral ↗
- Math · TheoremJensen's integral inequality for a probability measure ↗
Give a pointwise-convergent sequence for which the integrals do not converge to the integral of the limit.
Product measures & iterated integration
Check when iterated integrals agree.
Product measures extend rectangular size to a product sigma-algebra. Tonelli applies to nonnegative functions, while Fubini applies under integrability assumptions. Their distinction matters when signs or infinite values occur. Use the examples to check hypotheses before interchanging the order of integration.
Library pages & worked examples 1 core page
Measure Theory Math library
Logical flowchart 7 landmarks · 5 connections
Browse chart landmarks as a list
- Math · TheoremFor sigma-finite measures, the two section-measure integrals of a measurable set agree ↗
- Math · TheoremFor sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique ↗
- Math · TheoremTonelli's theorem for nonnegative measurable functions on a sigma-finite product ↗
- Math · TheoremFubini's theorem for L¹ functions on a sigma-finite product ↗
- Math · TheoremThe Euclidean Lebesgue measure is the completion of the product of the factor Lebesgue measures ↗
- Math · TheoremFor 0 < p < ∞, the layer-cake formula computes the integral of |f|ᵖ from the distribution function ↗
- Math · TheoremPolar coordinates decompose Lebesgue measure into rⁿ⁻¹ dr dσ ↗
Explain the difference between the hypotheses of Tonelli and Fubini.
Modes of convergence
Distinguish almost-everywhere and in-measure convergence.
Convergence in measure controls the size of exceptional sets, whereas almost-everywhere convergence describes individual points outside a null set. Egorov and Lusin link measurable behaviour to uniform or continuous behaviour under their stated hypotheses. The examples help identify which implications fail without extra conditions.
Library pages & worked examples 1 core page
Measure Theory Math library
Logical flowchart 4 landmarks · 2 connections
Browse chart landmarks as a list
- Math · TheoremRiesz's subsequence theorem for convergence in measure ↗
- Math · TheoremEgorov's theorem ↗
- Math · TheoremAssuming countable choice, Lusin's theorem on finite-measure subsets of ℝⁿ ↗
- Math · TheoremVitali convergence theorem on finite and sigma-finite measure spaces ↗
State Egorov’s theorem and explain why its finite-measure hypothesis matters.
Probability spaces & expectation
Translate measure theory into the language of probability.
A probability space has total measure one. Random variables are measurable functions, their laws are pushforward measures, and expectation is integration. Change of variables lets an expectation be computed using a law instead of the original sample space. Check this translation in the examples.
Library pages & worked examples 1 core page
Probability Math library
Logical flowchart 4 landmarks · 0 connections
Browse chart landmarks as a list
- Math · TheoremProbability laws correspond to distribution functions ↗
- Math · TheoremChange of variables for expectation ↗
- Math · TheoremJensen's inequality for expectation ↗
- Math · TheoremNormal equations for best affine L² prediction ↗
Express the expectation of a function of a random variable as an integral against its law.
Independence & long-run events
Separate independence assumptions from probability bounds.
Independence factors joint event probabilities. Borel–Cantelli connects sums of event probabilities with infinitely many occurrences; its two directions require different assumptions. Zero-one laws describe events whose probabilities must be extremal under specified independence structures. Use the examples to test precisely where independence enters.
Library pages & worked examples 1 core page
Probability Math library
Logical flowchart 7 landmarks · 6 connections
Browse chart landmarks as a list
- Math · DefinitionIndependent sigma-algebras and independent events ↗
- Math · DefinitionIndependent random elements ↗
- Math · TheoremExpectation factors over a finite product of mutually independent random variables ↗
- Math · DefinitionLimsup and the infinitely often event ↗
- Math · TheoremPairwise-independent Borel-Cantelli frequency law ↗
- Math · DefinitionTail sigma-algebra of a sequence ↗
- Math · TheoremKolmogorov zero-one law ↗
Compare the assumptions of the two Borel–Cantelli conclusions.
Radon–Nikodym densities
Represent an absolutely continuous measure by a density.
The Radon–Nikodym theorem expresses an absolutely continuous measure as integration against a density, with uniqueness up to almost-everywhere equality. Lebesgue decomposition separates absolutely continuous and singular parts. The examples prepare the density construction used in conditional expectation.
Library pages & worked examples 1 core page
Measure Theory Math library
Logical flowchart 4 landmarks · 3 connections
Browse chart landmarks as a list
- Math · TheoremEvery sigma-finite signed measure admits a Lebesgue decomposition relative to a sigma-finite positive measure ↗
- Math · TheoremA sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density ↗
- Math · TheoremRadon-Nikodym derivatives satisfy the chain rule along nu << mu << lambda ↗
- Math · TheoremEvery finite signed or complex measure has a polar decomposition against its total variation ↗
Explain what almost-everywhere uniqueness of a Radon–Nikodym density means.
Conditional expectation
Condition on information using an integral identity.
Conditional expectation is measurable with respect to the retained sigma-algebra and agrees with the original variable’s integrals on its events. Radon–Nikodym gives existence, and the tower property describes successive conditioning. Work through conditioning on a finite partition in the examples.
Library pages & worked examples 1 core page
Probability Math library
Logical flowchart 5 landmarks · 4 connections
Browse chart landmarks as a list
- Math · DefinitionConditional expectation given a sigma algebra ↗
- Math · TheoremConditional expectation exists by radon nikodym ↗
- Math · TheoremTaking out what is known ↗
- Math · TheoremTower property of conditional expectation ↗
- Math · TheoremConditional jensen inequality ↗
Define conditional expectation by its integral identity, then calculate it for a finite partition.