From Probability to Statistics — 300 Years of Taming Chance
From Pascal and Fermat's 17th-century gambling letters, through Gauss's normal distribution, Kolmogorov's axioms, to 21st-century Bayesian machine learning — the journey of taming chance with mathematics.
Select a card to move the map to that location.
Jakob Bernoulli
The first-generation mathematician of the Bernoulli dynasty in Basel. His posthumous Ars Conjectandi (1713) proved the Law of Large Numbers — that observed frequencies converge to true probability with enough trials. A lifelong rival of his younger brother Johann.
Abraham de Moivre
A Huguenot mathematician who fled persecution in France and worked in London as a teacher and probability calculator. He developed de Moivre's formula, wrote The Doctrine of Chances, and in 1733 approximated a large binomial distribution by a bell-shaped curve. The story that he predicted his death by extrapolating his increasing sleep is famous but not secure contemporary evidence.
Henri Lebesgue
A mathematician who developed an integral that first measures sets of points sharing comparable function values. Building on earlier work including Borel’s measure of sets, Lebesgue systematized measure and integration in his 1902 thesis Integral, Length, Area. It is too crude to say that Riemann integration handles only nearly continuous functions: precisely, a bounded function on a closed interval is Riemann integrable exactly when its discontinuity set has measure zero. Lebesgue integration also supplies stronger theorems for exchanging limits and integrals. The function equal to 1 on rationals and 0 on irrationals is discontinuous everywhere and not Riemann integrable, yet its Lebesgue integral is 0. Calculating that contrast makes the power of measure in analysis and probability tangible.
Andrey Kolmogorov
A mathematician who clarified what can be proved from stated assumptions across probability, turbulence, mechanics, and information. At age 30, his 1933 Foundations of the Theory of Probability treated events as sets in a sample space and probability as a measure. It synthesized earlier work by Borel, Lebesgue, Fréchet, and others; the preceding two centuries of probability were not simply nonrigorous. His 1941 turbulence theory predicts spectral scaling under assumptions such as high Reynolds number and local homogeneity and isotropy. His 1954 idea that some invariant tori of a nearly integrable Hamiltonian system survive small perturbations became KAM theory through later work by Arnold and Moser. In the 1960s, independently alongside Solomonoff and Chaitin, he developed a way to measure an individual string’s complexity by the length of its shortest program. He also mentored students including Arnold and supported mathematical schooling, without one person constituting all of Soviet mathematics.
Statistics and Inference
The mathematics of reasoning from observed cases to a wider population, process, or effect. Its central task is not merely gathering more numbers but exposing who was counted, what was measured, and which comparisons and assumptions support a conclusion.
Intermediate → Advanced
Ready for advanced depth?
Unify similar-looking phenomena and examine why a claim fails when its hypotheses disappear.
Next takeaway · An explanation that includes its hypotheses
Open a advanced path