- Atlas
- Mathematics
- Measure Theoretic Probability
Measure Theoretic Probability
Measure theoretic probability is the branch of mathematics that rebuilds chance on the foundation of measure and integration theory.
11 frameworks, from 1654 to today · Probability Theory · Mathematics
- Classical combinatorial probability 1654-1933
- Frequentist probability 1866-1960
- Measure and Integration Theory 1902-Present
- Bayesian probability 1926-Present
- Ergodic theory 1931-Present
- Probability axioms 1933-Present
- Conditional expectation and martingale theory 1935-Present
- Itô calculus 1944-Present
- General theory of stochastic processes 1960-Present
- Large deviation theory 1960-Present
- Algorithmic randomness 1966-Present
Overview
Measure theoretic probability is the branch of mathematics that rebuilds chance on the foundation of measure and integration theory1. Its central move is to treat a random experiment as a probability space: a set of outcomes, a collection of "events" that can be assigned a size, and a rule that gives each event a number between 0 and 11. Once probability is a kind of measure, the full machinery of analysis—limits, integrals, convergence theorems—becomes available, and questions about infinitely many random quantities can be posed and answered rigorously. What is at stake is not merely tidiness. Before this rebuilding, probability was a collection of powerful but partly informal techniques; afterwards it became a branch of mathematics with proofs as secure as those in geometry, capable of handling continuous time, infinite sequences, and the subtle limiting arguments on which modern statistics, physics, and finance depend.
From games of chance to a calculus of chances
Probability began as a practical craft. In the seventeenth century, correspondence between Blaise Pascal and Pierre de Fermat (1654) worked out how to divide stakes in an interrupted game, and Christiaan Huygens published the first printed treatise on the subject in 1657. The early theory was combinatorial: one counted equally likely outcomes—favorable cases over total cases—and computed with them1. Jacob Bernoulli's Ars Conjectandi (published posthumously, 1713) proved the first version of the law of large numbers, showing that in repeated independent trials with the same chance of success, the observed frequency tends to the true probability. Abraham de Moivre derived the normal approximation to the binomial distribution in the 1730s, and Laplace's Théorie analytique des probabilités (1812) systematized the field with generating functions and a classical definition of probability as a ratio of equally likely cases.
This tradition was enormously productive but rested on an awkward foundation. What does it mean to say two outcomes are "equally likely" without already assuming a probability? And how should one handle experiments with infinitely many possible outcomes, such as choosing a point at random on a line? The classical definition simply broke down there.
Frequencies, betting, and the search for foundations
Two rival interpretations grew up in the nineteenth and early twentieth centuries. The frequency view, associated with John Venn and later Richard von Mises, held that probability is the limiting relative frequency of an outcome in a long sequence of repetitions. Von Mises (1919 onward) tried to make this precise with the idea of a "collective"—a sequence in which frequencies stabilize and no gambling system can improve one's odds. The approach captured the empirical meaning of probability but struggled to define which sequences count as legitimate collectives without circularity.
The subjective or betting view, developed by Bruno de Finetti and Frank Ramsey, treated probability as a degree of belief constrained by consistency: your probabilities should be such that no combination of bets against you guarantees a loss. Both programs raised sharp foundational questions, and both eventually found a home inside the measure-theoretic framework rather than replacing it.
Measure and integration: the analytic toolkit
The decisive tools came from analysis, not from probability. Émile Borel, in the late 1890s, developed a theory of measure on the real line and proved early results on the strong law of large numbers for coin tossing. Henri Lebesgue's 1902 thesis introduced the integral that bears his name: instead of slicing the horizontal axis into small intervals, Lebesgue's integral slices the vertical axis, measuring the sets on which a function takes values in a given range. This made it possible to integrate a far wider class of functions and, crucially, to pass limits through integrals under clean conditions2.
The convergence theorems proved in this period—the monotone convergence theorem and the dominated convergence theorem, associated with the Italian school around Beppo Levi and later systematized—gave analysts exactly the interchange rules that probability needed. A probability is, after all, a measure with total mass one, and an expectation is an integral. The Russian school around Dmitri Egorov and Nikolai Luzin added deep results on convergence of measurable functions. By the 1920s the stage was set: probability could be recast as a special case of measure theory.
Kolmogorov's axioms and conditional expectation
Andrey Kolmogorov's Grundbegriffe der Wahrscheinlichkeitsrechnung (1933) is the founding document of the modern subject13. Kolmogorov defined a probability space as a triple: a set Ω of elementary outcomes, a σ-algebra of subsets called events (a collection closed under complement and countable union), and a countably additive measure P with P(Ω) = 11. A random variable became a measurable function on Ω, and its expectation the Lebesgue integral of that function4. Every classical result could now be proved from these axioms, and new questions could be posed without ambiguity.
Kolmogorov's framework also gave a rigorous meaning to conditional expectation5. The classical notion—the probability of A given B—only made sense when B had positive probability. Kolmogorov, building on earlier work by Joseph Doob and others, defined the conditional expectation of a random variable given a σ-algebra as a measurable function satisfying an integral identity. This abstraction, seemingly austere, turned out to be the key that unlocked martingale theory. A filtration—an increasing family of σ-algebras representing information available over time—made precise the idea of a process revealing itself gradually, and conditional expectation became the tool for updating in light of that information.
Martingales and the general theory of processes
A martingale is a process whose expected future value, given everything observed so far, equals its present value—the mathematical model of a fair game6. The idea had appeared in gambling contexts (the name refers to a betting strategy), but Paul Lévy and Joseph Doob turned it into a general theory in the 1930s and 1940s. Doob's 1953 book Stochastic Processes consolidated results such as the optional stopping theorem and martingale convergence theorems, which say that under suitable conditions a martingale settles down to a limit.
Martingales proved to be the right abstraction for a vast range of problems. The general theory of stochastic processes, developed especially by the French school around Paul-André Meyer from the 1960s onward, classified processes by their regularity (the "usual conditions" on filtrations), established decomposition theorems—notably the Doob–Meyer decomposition of a submartingale into a martingale plus an increasing process—and introduced the notion of semimartingale, the class of processes for which stochastic integration is possible. This body of work, sometimes called the "general theory of processes," gave probability a structural backbone comparable to that of algebra or topology.
Stochastic integration and Itô calculus
The most consequential application came from Kiyosi Itô78. In the 1940s Itô constructed an integral with respect to Brownian motion—the continuous random path first studied by Robert Brown and mathematically modeled by Norbert Wiener in the 1920s. Ordinary calculus fails here because Brownian paths, though continuous, are nowhere differentiable and have infinite variation9. Itô's insight was to define the integral as a limit of sums and to accept that a correction term appears: the resulting Itô formula is the chain rule of stochastic calculus, containing an extra term proportional to the quadratic variation of the integrator.
Itô's calculus made it possible to write and solve stochastic differential equations, modeling systems driven by noise8. It became the language of diffusion theory in physics, of option pricing in mathematical finance (the Black–Scholes formula of 1973 rests on it), and of filtering theory. The semimartingale framework of the general theory later placed Itô's construction in its natural generality.
Ergodic theory and the long run
A parallel strand concerns the behavior of systems over long times. Ergodic theory, founded by George Birkhoff and John von Neumann in the early 1930s, studies measure-preserving transformations and asks when time averages equal space averages. Birkhoff's ergodic theorem is a direct descendant of the strong law of large numbers and is proved with the same measure-theoretic tools. It supplied the rigorous basis for statistical mechanics, where one wants to replace an average over an enormous number of particles by an average over time, and it remains a lively field connecting probability, dynamical systems, and number theory.
Algorithmic randomness
A late and philosophically striking development asks what it means for an individual sequence to be random. Andrey Kolmogorov, Ray Solomonoff, and Gregory Chaitin, from the 1960s, and Per Martin-Löf, in 1966, approached this through algorithmic complexity: a finite string is random to the extent that no short program can reproduce it, and an infinite sequence is random if it passes every effective statistical test. Martin-Löf's definition of random sequences as those avoiding all "constructive" null sets tied the notion back to measure theory—random sequences form a set of measure one—while making precise the intuition behind von Mises's collectives10. The field, now called algorithmic randomness or algorithmic information theory, continues to connect computability, information, and probability.
The present
Measure theoretic probability is now the standard language of the field, and its descendants are everywhere: martingale methods in statistics and finance, semimartingale theory and stochastic analysis, ergodic theory, the theory of large deviations (concerned with the exponentially small probabilities of rare events), and the construction of ever more general stochastic processes. The foundational debates have not vanished—frequency and subjective interpretations remain active in statistics and philosophy, and algorithmic randomness keeps the question of what chance is alive—but they now take place within, rather than against, the measure-theoretic framework. Open questions cluster around the frontiers: stochastic partial differential equations driven by rough noise, the regularity theory of rough paths, the interface of probability with machine learning, and the precise limits of what can be said about random objects that are only partially observable. The subject that began with dividing stakes in an interrupted game now provides the grammar in which much of modern science states its uncertainties.
References
- Probability theory (introduction, History of probability, Measure-theoretic probability theory, Discrete probability distributions), Wikipedia
- Lebesgue integral, Wikipedia
- Probability axioms, Wikipedia
- Random variable, Wikipedia
- Conditional expectation (History), Wikipedia
- Martingale (probability theory), Wikipedia
- Stochastic calculus, Wikipedia
- Stochastic differential equation (Background, introduction), Wikipedia
- Itô calculus, Wikipedia
- Algorithmically random sequence, Wikipedia
The frameworks of Measure Theoretic Probability
Each framework is a way of working the field has used: when it held, and the question it answers.
- 1654-1933
Classical combinatorial probability
How do we count chances in games of chance?
- 1866-1960
- 1902-Present
Measure and Integration Theory
How do we measure and integrate sets and functions?
- 1926-Present
- 1931-Present
- 1933-Present
- 1935-Present
Conditional expectation and martingale theory
How do we update expectations given information?
- 1944-Present
- 1960-Present
General theory of stochastic processes
How do we classify random processes over time?
- 1960-Present
- 1966-Present
How the ideas connect
Each arrow runs from an earlier idea to the later one it shaped. The list below says what passed between them.
Probability axioms replaced Classical combinatorial probability
Kolmogorov's axioms replaced the classical definition of probability as a ratio of equally likely cases with a countably additive measure on a σ-algebra. The classical combinatorial results survive as special cases within the new framework.
Carried by Andrey Kolmogorov; Grundbegriffe der Wahrscheinlichkeitsrechnung (1933).
Probability axioms grew out of Measure and Integration Theory
Kolmogorov defined a probability space as a set with a σ-algebra and a countably additive measure of total mass one, directly importing Lebesgue's measure and integration theory. Expectation became the Lebesgue integral of a measurable function, and convergence theorems gave probability its analytic tools.
Carried by Andrey Kolmogorov; Henri Lebesgue; Grundbegriffe der Wahrscheinlichkeitsrechnung (1933).
Conditional expectation and martingale theory grew out of Probability axioms
Kolmogorov's axiomatic framework, with random variables as measurable functions and filtrations as increasing families of σ-algebras, provided the setting in which conditional expectation and martingales were rigorously defined. Martingale theory grew directly out of the Kolmogorov axioms.
Carried by Andrey Kolmogorov; Joseph Doob; Paul Lévy.
General theory of stochastic processes grew out of Conditional expectation and martingale theory
The general theory of stochastic processes, developed by the French school around Paul-André Meyer, grew out of martingale theory. It established decomposition theorems such as the Doob–Meyer decomposition and introduced semimartingales, generalizing the martingale framework.
Carried by Paul-André Meyer; Joseph Doob.
Frequentist probability reacted against Classical combinatorial probability
The frequency interpretation arose because the classical combinatorial definition of probability as a ratio of equally likely cases could not handle infinite or empirical sequences. John Venn and later Richard von Mises defined probability as a limiting relative frequency, rejecting the circular appeal to equally likely outcomes.
Carried by John Venn; Richard von Mises.
Measure and Integration Theory influenced by Classical combinatorial probability
Classical probability posed the problem of infinitely many outcomes, such as choosing a point at random on a line, which the combinatorial definition could not handle. Émile Borel's measure theory on the real line and his strong law for coin tossing were developed partly to give such problems a rigorous footing.
Carried by Émile Borel.
Probability axioms replaced Frequentist probability
Von Mises's frequency theory of collectives struggled to define legitimate sequences without circularity. Kolmogorov's measure-theoretic axioms supplied a rigorous foundation in which limiting frequencies could be proved as theorems, such as the strong law, rather than assumed as definitions.
Carried by Andrey Kolmogorov; Richard von Mises.
Algorithmic randomness influenced by Frequentist probability
Algorithmic randomness, developed by Kolmogorov, Solomonoff, and Martin-Löf, took up the frequency theorists' question of which infinite sequences count as random. Von Mises's collectives were given a rigorous definition in terms of computability, resolving the circularity that had plagued the frequency view.
Carried by Andrey Kolmogorov; Per Martin-Löf; Ray Solomonoff.
Conditional expectation and martingale theory influenced by Measure and Integration Theory
The abstract conditional expectation given a σ-algebra was defined as a measurable function satisfying an integral identity, a construction that only makes sense within Lebesgue integration theory. This measure-theoretic definition, building on earlier work by Doob, made martingale theory possible.
Carried by Andrey Kolmogorov; Joseph Doob.
Itô calculus influenced by Probability axioms
Itô constructed his stochastic integral with respect to Brownian motion using the measure-theoretic framework of measurable processes and filtrations. The Kolmogorov axioms supplied the probability space on which Brownian motion and the Itô integral are defined.
Carried by Kiyosi Itô; Norbert Wiener.
Algorithmic randomness influenced by Probability axioms
Martin-Löf's definition of random sequences was framed within the measure-theoretic setting of the Kolmogorov axioms, defining randomness as passing all measure-zero tests. Algorithmic randomness thus built on the axiomatic probability space.
Carried by Per Martin-Löf; Andrey Kolmogorov.
Itô calculus influenced by Conditional expectation and martingale theory
Itô's integral was defined as a limit of sums adapted to a filtration, and martingale ideas underlie the construction of the stochastic integral. The martingale property is central to the theory of stochastic integration.
Carried by Kiyosi Itô; Joseph Doob.
General theory of stochastic processes influenced by Itô calculus
The semimartingale framework of the general theory of processes placed Itô's stochastic integral in its natural generality, characterizing the class of integrators for which the integral can be defined. Itô calculus became a special case of the general theory.
Carried by Paul-André Meyer; Kiyosi Itô.
Beyond the field
Where Measure Theoretic Probability's ideas came from in other fields, and what they led to there: the strongest 12 of 82 links.
Classical combinatorial probability led to Probability and Stochastic Processes in Applied Mathematics
Classical combinatorial probability is the direct ancestor of the measure-theoretic and stochastic-process framework; Kolmogorov's 1933 axiomatisation generalised the classical equally-likely and frequency notions into measure theory. The later framework superseded the classical definition as the working foundation.
Carried by Andrey Kolmogorov.
Classical combinatorial probability replaced by Probability axioms in Probability Theory
Kolmogorov's axioms replaced classical combinatorial probability as the working foundation of the field, keeping finite equiprobable models as a special case. The older Laplace-style calculus of chances was subsumed rather than rejected.
Carried by Andrey Kolmogorov; Grundbegriffe der Wahrscheinlichkeitstheorie (1933).
Classical combinatorial probability replaced by Measure-Theoretic Probability in Stochastic Processes
Kolmogorov's 1933 axioms replaced classical combinatorial probability as the working foundation, keeping equally likely outcomes as a special case. The classical definition was superseded by the measure-theoretic one.
Carried by Andrey Kolmogorov; Grundbegriffe der Wahrscheinlichkeitsrechnung (1933).
Classical combinatorial probability replaced by Kolmogorov measure-theoretic probability in Measure Theory
Kolmogorov's 1933 axiomatisation replaced classical combinatorial probability as the working foundation, keeping the classical results as special cases of measure-theoretic probability.
Carried by Andrey Kolmogorov; Foundations of the Theory of Probability (1933).
Frequentist probability reacted against Classical definition of probability in Probability Theory
Frequentism defined itself against the classical equally-likely-cases definition, replacing the principle of insufficient reason with observed relative frequency.
Carried by John Venn; Richard von Mises.
Frequentist probability grew out of Actuarial and Frequency Tradition in Probability Theory
The actuarial and frequency tradition of tabulating repeated events and relative frequencies fed directly into the frequentist definition of probability as a limiting relative frequency.
Carried by John Venn.
Frequentist probability influenced Frequentist Inference in Probability Theory
The frequentist interpretation of probability as long-run relative frequency supplied the conceptual foundation on which Fisher, Neyman and Pearson built frequentist inference.
Carried by Ronald Fisher; Jerzy Neyman; Egon Pearson.
Frequentist probability influenced Frequentist Inference in Statistical Inference
Frequentist inference took its definition of probability from frequentist probability: Venn's and von Mises's limiting-frequency conception, later axiomatised in measure theory, is the foundation on which sampling-distribution inference is built.
Carried by John Venn; Richard von Mises.
Measure and Integration Theory replaced Riemann integration in Measure Theory
Lebesgue's integral generalized Riemann's, keeping Riemann-integrable functions as a special case while extending integration to a far wider class; measure theory replaced Riemann integration as the working foundation.
Carried by Henri Lebesgue.
Measure and Integration Theory influenced Martingale Theory in Probability Theory
Martingale theory was built on measure and integration theory, with Doob's 1953 Stochastic Processes formulating martingales as adapted integrable processes and proving convergence via measure-theoretic arguments. Conditional expectation as a Radon-Nikodym derivative is the technical core.
Carried by Joseph L. Doob; Stochastic Processes (1953).
Measure and Integration Theory influenced Probability axioms in Probability Theory
Kolmogorov's axiomatisation rests directly on the Lebesgue measure and integration theory developed by Borel and Lebesgue, defining probability as a normalised measure and expectation as an integral. Without that machinery the axioms could not be stated.
Carried by Andrey Kolmogorov; Henri Lebesgue; Émile Borel.
Measure and Integration Theory influenced Measure-Theoretic Probability in Stochastic Processes
Kolmogorov's 1933 Grundbegriffe built measure-theoretic probability directly on the Lebesgue measure and integration theory of Borel and Lebesgue. The measure and integration framework supplied the axioms and the tools.
Carried by Andrey Kolmogorov; Grundbegriffe der Wahrscheinlichkeitsrechnung (1933).

Measure Theoretic Probability is a planet in Nousfarer
Its city has a tower for each of these 11 frameworks. Land, walk in, and climb one concept at a time.
Land on Measure Theoretic ProbabilityRelated fields
Fields its ideas are linked to
- Probability Theory 27 links
- Measure Theory 10 links
- Stochastic Processes 10 links
- Statistical Inference 7 links
- Applied Mathematics 3 links
- Formal Epistemology 3 links
- Markov Processes 3 links
- Bayesian Statistics 3 links
- Operator Theory 2 links
- Enumerative Combinatorics 2 links
- Probabilistic Combinatorics 2 links
- Combinatorics 2 links
More in Probability Theory
See where Measure Theoretic Probability sits on the Map of Human Knowledge