Andrey Kolmogorov: The Man Who Gave Probability Its Rules

Photo: lil artsy / Pexels
Andrey Nikolaevich Kolmogorov (1903–1987) was a Soviet mathematician who placed probability theory on a rigorous axiomatic footing, derived the statistical laws that govern turbulent fluid flow, and helped found the field now called algorithmic complexity theory. Working across more than half a century at Moscow State University, he reshaped at least six distinct areas of mathematics — a breadth matched by almost no one in the 20th century.
A Childhood Without Parents, a Mind That Made Its Own Rules
Kolmogorov was born on April 25, 1903, in Tambov, Russia, under circumstances that would define the shape of his inner life. His mother, Maria Yakovlevna Kolmogorova, died in childbirth. His father, a provincial agronomist, played no role in raising him. The infant was taken in by his maternal aunt, Vera Yakovlevna, who brought him to the family estate at Tunoshna, a village near Yaroslavl.
Vera Yakovlevna — the aunt who raised Kolmogorov and ran an informal home school for neighborhood children, where the young Andrey first encountered mathematical puzzles as a game rather than a curriculum.
The estate household maintained a handwritten journal in which the children published their discoveries. Kolmogorov contributed a puzzle at age five: he noticed that the sum 1 + 3 + 5 + … + (2n − 1) equals n². He had not been taught this; he had observed it in dot-patterns drawn on paper. The episode is worth noting not because it marks a prodigy (most mathematically gifted children find the same pattern) but because it reveals his characteristic working method: start from observation, find the underlying structure, then ask whether the structure can be proved necessary.
He reached Moscow State University in 1920, initially uncertain about his field. He enrolled in metallurgy, then Russian history, before settling on mathematics. That indecision was not aimlessness; it reflected a genuine breadth of interest he never abandoned. At university he studied under Nikolai Luzin, the dominant figure of Moscow mathematics, whose seminar "Luzitania" trained an entire generation of Soviet mathematicians.
Source: MacTutor History of Mathematics, University of St Andrews — Kolmogorov biography, accessed May 2026.
In 1925, aged 22, Kolmogorov graduated and immediately published five papers. One of them contained what is now called the three-series theorem — a criterion for deciding when an infinite series of random variables converges with probability one. It was a result that more senior mathematicians had been circling for years. Kolmogorov published it as a student.
The Axioms That Settled a Century of Confusion
Before 1933, probability was a practical tool with shaky philosophical foundations. Mathematicians and philosophers argued about what "probability" actually meant. Was it a frequency, an intuition, a degree of belief? Different definitions produced different answers to the same problem, and no one agreed on the rules.
Kolmogorov ended the argument. In 1933 he published Grundbegriffe der Wahrscheinlichkeitsrechnung (Foundations of the Theory of Probability), a 62-page monograph that treated probability the way Euclid treated geometry: start from a small set of axioms and derive everything else.
Probability space — a mathematical structure consisting of a sample space (the set of all possible outcomes), a collection of events (subsets of that space called a sigma-algebra), and a probability measure (a function assigning a number between 0 and 1 to each event, with the total measure equaling exactly 1).
The three core axioms Kolmogorov proposed are these:
| Axiom | Statement |
|---|---|
| Non-negativity | The probability of any event is greater than or equal to 0. |
| Normalization | The probability of the entire sample space is exactly 1. |
| Countable additivity | The probability of a union of mutually exclusive events equals the sum of their individual probabilities. |
That is the whole foundation. From these three statements — which can be written on a Post-it note — you can derive the law of large numbers, the central limit theorem, conditional probability, Bayes' theorem, and every other result in classical and modern probability theory. The monograph was translated from German into English in 1950 and remains in print today.
The achievement is analogous to what Euclid did for geometry: not discovering new territory, but proving that the territory already explored rests on solid, explicitly stated ground. Before Kolmogorov's axioms, a probabilist could always be asked "but what do you mean by probability?" and have no agreed-upon answer. After 1933, the answer was: the axioms are what we mean.
Source: Kolmogorov, A.N. (1933). Grundbegriffe der Wahrscheinlichkeitsrechnung. Springer. English translation (1950), Chelsea Publishing.
How He Described Chaos in Pipes and Clouds
In the late 1930s Kolmogorov turned his attention to turbulence — the chaotic, swirling motion of fluids at high velocity. A river rushing over rocks, the wake behind a jet engine, the convection currents inside a star: these are all turbulent flows, and predicting their behavior exactly is, even today, beyond reach. The problem is one of the seven Millennium Prize Problems in mathematics, worth $1 million unsolved.
Kolmogorov's approach was characteristically statistical. He did not try to track every eddy. Instead he asked: what can be said about the statistical properties of the energy in turbulent flow, when averaged over many observations?
Turbulence cascade — the process by which large eddies in a fluid break down into progressively smaller ones, transferring kinetic energy from large scales to small scales, until the smallest eddies dissipate energy as heat through viscosity.
In two papers published in 1941 (now referred to as K41), Kolmogorov showed that in the "inertial subrange" — the middle portion of the cascade, where eddies are neither the largest nor the smallest — the energy spectrum follows a power law: energy is proportional to the wavenumber raised to the power of −5/3. This is now called the Kolmogorov −5/3 law, and it describes turbulent flows from laboratory wind tunnels to atmospheric boundary layers to interstellar gas clouds with remarkable accuracy.
Think of it this way: if you stir a pot of soup and then watch the swirling patterns, you see large swirls breaking into medium swirls breaking into small swirls. Kolmogorov showed that the mathematical relationship between the size of those swirls and the energy they carry is not random — it follows a precise, universal scaling law, regardless of what is in the pot or how it was stirred.
Source: Kolmogorov, A.N. (1941). "The local structure of turbulence in incompressible viscous fluid for very large Reynolds numbers." Doklady Akademii Nauk SSSR, 30(4), 299–303.
The 1941 papers have been cited thousands of times and remain the starting point for virtually every serious treatment of turbulence. Kolmogorov himself revised the theory in 1962 (K62) to account for intermittency — the observation that energy dissipation in real turbulence is not uniformly distributed across space — but K41 is the foundation.
The Friendship That Shaped His Life
In the summer of 1929, Kolmogorov and Pavel Sergeevich Alexandrov — a topologist who had been his fellow student under Luzin — traveled together for three weeks down the Volga River and across the Caucasus to Lake Sevan. The trip was partly a working vacation: Kolmogorov used the time to develop his ideas on Markov processes. But it was also the beginning of what would become one of the most significant personal relationships in his life.
Pavel Alexandrov — Soviet mathematician (1896–1982), a founder of modern topology who made fundamental contributions to the theory of topological spaces. He and Kolmogorov were close companions for more than five decades.
The two men traveled again in 1931, visiting Berlin, Göttingen, Munich, and Paris — the mathematical capitals of Europe. In 1935, they purchased a dacha (country house) together in Komarovka, a village outside Moscow, which became a gathering place for students and visiting mathematicians from around the world. They lived and worked together at that house for the rest of their lives.
Several historians of mathematics have concluded that the relationship was romantic, though neither Kolmogorov nor Alexandrov acknowledged this publicly. Open acknowledgment was not a realistic option in Stalin's Soviet Union: homosexuality had been recriminalized in 1933 and carried a sentence of up to five years in labor camp. What is documented is that the two men were inseparable companions for more than 50 years, collaborated scientifically, shared a home, and by all accounts shaped each other's mathematical vision profoundly.
Source: Graham, L. & Kantor, J.-M. (2009). Naming Infinity: A True Story of Religious Mysticism and Mathematical Creativity. Harvard University Press.
The Komarovka house had a specific weekly ritual that Kolmogorov's students remembered for the rest of their lives. Each Sunday, Kolmogorov would lead a long walk in the forests around the dacha. The walks were not purely recreational: students were expected to discuss mathematics, music, architecture, and literature as they moved through the trees. Kolmogorov believed that mathematical insight emerged from a cultivated, broadly educated mind, not from isolation in front of equations. He organized ski excursions in winter for the same reason.
His student Boris Gnedenko recalled that "the time of their graduate studies remains for all of Kolmogorov's students an unforgettable period in their lives." Kolmogorov set reading lists that ranged from Pushkin's verse forms to the structure of Bach's fugues. He believed the patterns underlying great poetry and great music were not unrelated to the patterns of mathematics.
Working Under Stalin: Danger and Navigation
Kolmogorov's career unfolded entirely inside the Soviet system, and understanding what that meant is necessary for understanding how he worked. The purges of the 1930s killed several of his mathematical colleagues and destroyed the careers of others. His own teacher, Luzin, was subjected to a vicious public denunciation in 1936 on charges that included publishing his best work in foreign journals — a "betrayal" of Soviet science. Kolmogorov testified at the proceedings. His testimony was measured; he praised Luzin's scientific contributions while conceding the political accusations. It was the kind of careful navigation that kept a Soviet intellectual alive.
Kolmogorov was a member of the Communist Party, held the Stalin Prize (1941), and received the Lenin Prize (1965). He accumulated these honors not through ideological fervor but through the mathematical productivity that made him indispensable. The Soviet state valued mathematicians who produced results, and Kolmogorov produced them in volume across every decade of his working life.
He was also, in the 1950s and 1960s, deeply involved in Soviet mathematics education reform. He rewrote secondary school mathematics curricula and helped establish the Kolmogorov Boarding School (now School 18) in Moscow, which offered intensive mathematics education to gifted students from across the USSR regardless of their family background or geographic origin. He taught at the school himself, into his seventies.
Source: Tikhomirov, V.M. (2003). "Andrei Nikolaevich Kolmogorov." Russian Mathematical Surveys, 58(5), 805–808.
Lesser-Known Work: Complexity, Topology, and Poetry
The public story of Kolmogorov centers on probability and turbulence, but he made equally fundamental contributions in areas that receive less general attention.
In topology, he independently introduced cohomology groups in 1935 — simultaneously with J.W. Alexander in the United States and with no communication between them. This is the kind of multiple independent discovery that signals a mathematical idea whose time has come.
In dynamical systems, his work in the early 1950s launched what became KAM theory (Kolmogorov-Arnold-Moser), which describes the stability of orbits in Hamiltonian systems — essentially, the conditions under which a planetary orbit will remain stable over astronomical timescales rather than drifting into chaos. This work influenced both celestial mechanics and the mathematical understanding of chaos.
In 1957 he solved Hilbert's 13th problem — a question David Hilbert had posed in 1900 about whether certain functions of multiple variables could be expressed as compositions of functions of fewer variables. Kolmogorov proved that Hilbert's conjecture was wrong: every continuous function of multiple variables can be represented as a composition of functions of just one variable.
Then, in 1965, he introduced what is now called Kolmogorov complexity: the idea that the complexity of a string of data can be measured by the length of the shortest computer program that produces it. A string of a million identical digits has low Kolmogorov complexity because a short program ("print 1, one million times") generates it. A truly random string has high complexity because no program shorter than the string itself can reproduce it. This concept became foundational to algorithmic information theory, theoretical computer science, and machine learning.
Kolmogorov complexity — a measure of the computational resources needed to specify an object, defined as the length of the shortest program in a fixed programming language that outputs that object and then halts.
Kolmogorov himself noted that Ray Solomonoff had developed similar ideas independently before him, and he publicly acknowledged Solomonoff's priority — a gesture of intellectual honesty that was not universal among mathematicians of his generation.
He also spent years analyzing the statistical structure of Pushkin's verse — not as a literary hobby but as a rigorous application of information theory to natural language. He published papers on the entropy of Russian prose and the metrical structure of Eugene Onegin.
Source: Kolmogorov, A.N. (1965). "Three approaches to the quantitative definition of information." Problems of Information Transmission, 1(1), 1–7.
Personal Life: The Dacha, the Skis, and the Decline
Kolmogorov's personal life was, outside the relationship with Alexandrov, notably austere. He did not accumulate possessions, did not pursue status goods, and was consistently described by students and colleagues as both demanding and generous — demanding in his expectation that they engage seriously with ideas, generous in his time and attention when they did.
He married Anna Dmitrievna Egorova in 1942, a childhood friend. The marriage was quiet; Egorova was not a mathematician and took little public role in Kolmogorov's professional life. Alexandrov and Kolmogorov continued to share the Komarovka dacha.
Kolmogorov was a serious long-distance skier and swimmer into old age. He skied with students in the winters around Komarovka and swam in the Volga and in local reservoirs. He considered physical activity directly connected to intellectual clarity — not as metaphor but as a conviction he acted on daily.
In the early 1970s he began showing symptoms of what was eventually diagnosed as Parkinson's disease. He continued working through the decade, but his handwriting and his ability to present mathematics deteriorated visibly. He died on October 20, 1987, in Moscow, at age 84. Alexandrov had died five years earlier, in 1982.
The Generation He Trained
Kolmogorov's influence on Soviet and global mathematics extended far beyond his own publications, because he was, by any measure, one of the great mathematical teachers of the 20th century. His doctoral students included Israel Gelfand, Anatoly Malcev, Boris Gnedenko, Vladimir Arnold, and Yakov Sinai — names that appear across modern mathematics, from representation theory to ergodic theory to mathematical physics.
Arnold, who developed Arnold diffusion and was a central figure in dynamical systems theory, credited Kolmogorov's seminars as the formative experience of his mathematical life. Sinai, who won the Abel Prize in 2014 for his work in dynamical systems and probability, was a direct intellectual descendant.
This pedagogical influence is genuinely part of Kolmogorov's scientific legacy. A mathematician's work lives in theorems and papers; it also lives in the students who carry a way of thinking forward. By that measure, Kolmogorov's influence on 20th-century mathematics is larger than any citation count can capture.
Source: Arnold, V.I. (1997). "On A.N. Kolmogorov." In Golden Years of Moscow Mathematics, History of Mathematics vol. 6. American Mathematical Society.
Legacy: What Kolmogorov Made Possible
Probability theory, as Kolmogorov axiomatized it, is the mathematical language of uncertainty — which means it is the foundation of statistics, machine learning, quantum mechanics (where probability amplitudes are the fundamental object), financial mathematics, epidemiology, and information theory. Every time a machine learning model produces a confidence score, every time a weather forecast gives a percentage chance of rain, every time a physicist calculates the probability of a particle interaction, they are working inside the framework Kolmogorov built in 1933.
His work on turbulence remains the starting point for fluid mechanics and is applied in aerospace engineering, climate modeling, oceanography, and astrophysics. The −5/3 power law has been measured in laboratory experiments, atmospheric data, and astronomical observations, always within the range Kolmogorov predicted.
Kolmogorov complexity is now a standard concept in theoretical computer science and underpins parts of machine learning theory, including the formal description of what it means for a model to generalize rather than merely memorize.
And the generation of mathematicians he trained — directly through supervision, and indirectly through his reformed school curriculum — reshaped Soviet and eventually global mathematics across the second half of the 20th century.
He was elected to the USSR Academy of Sciences in 1939, received the Lenin Prize in 1965, the Wolf Prize in Mathematics in 1980, and was elected a foreign member of the Royal Society, the National Academy of Sciences, the French Academy of Sciences, and numerous other bodies. The Abel Prize — the most prestigious award in mathematics, established in 2003 — was named, with deliberate irony, for a mathematician who died at 26 in poverty. Kolmogorov's corresponding prize is the Fields Medal, which cannot be awarded posthumously and which, in the custom of the time, was not awarded to him during his working life. The oversight, if it is one, does not diminish the work.
Source: Tikhomirov, V.M. & Uspenskii, V.A. (1988). "Andrei Nikolaevich Kolmogorov: October 25, 1903 — October 20, 1987." Russian Mathematical Surveys, 43(3), 1–9.
What This Means
Kolmogorov's career demonstrates what it looks like when a single mind applies rigorous structural thinking to wildly different problems and keeps finding that the same deep ideas — measure, entropy, complexity, scaling — recur in each one. He did not simply solve problems; he built frameworks that made entire classes of problems solvable. Probability theory, turbulence theory, algorithmic complexity: in each case, the world was using the concept loosely before Kolmogorov, and precisely afterward. That is not a common achievement. It happened three times.
FAQs
Q: What are the Kolmogorov axioms of probability?
A: The three axioms state that probabilities are non-negative, that the probability of the entire sample space is 1, and that the probability of a union of mutually exclusive events is the sum of their individual probabilities. All of modern probability theory derives from these three statements, first published in Kolmogorov's 1933 monograph.
Q: What is the Kolmogorov −5/3 law in turbulence?
A: In the inertial subrange of a turbulent flow, the energy spectrum scales as the wavenumber to the power of −5/3. Derived in Kolmogorov's 1941 papers (K41), this law predicts how kinetic energy is distributed across eddy sizes and has been confirmed in measurements ranging from wind tunnels to atmospheric data.
Q: What is Kolmogorov complexity?
A: Kolmogorov complexity measures how compressible a piece of data is by defining its complexity as the length of the shortest computer program that produces it. A repetitive string has low complexity; a truly random string cannot be compressed and has high complexity. The concept underpins algorithmic information theory and parts of machine learning theory.
Q: Did Kolmogorov work on areas outside mathematics?
A: Yes. He analyzed the statistical structure of Russian poetry (particularly Pushkin's verse), reformed Soviet secondary school mathematics curricula, and applied information-theoretic methods to linguistics and music theory. He believed broadly educated mathematicians produced better mathematics.
Q: What was Kolmogorov's relationship with Pavel Alexandrov?
A: Alexandrov and Kolmogorov were lifelong companions who shared a house outside Moscow for more than 50 years, traveled together extensively, and collaborated mathematically. Several historians have concluded the relationship was romantic, though public acknowledgment was impossible under Soviet law, which criminalized homosexuality from 1933 onward.
Q: Who were Kolmogorov's most important students?
A: His doctoral students included Israel Gelfand, Anatoly Malcev, Boris Gnedenko, Vladimir Arnold, and Yakov Sinai — each of whom made major independent contributions to mathematics. Arnold (dynamical systems) and Sinai (ergodic theory, Abel Prize 2014) are particularly prominent.
Read next:
Follow new articles
Add SciHub101 to your feed reader to see new science and technology stories.
About the Author
SciHub101 is an independent science and technology publication founded and edited by Buğra Sözeri, a software engineer and app developer based in Türkiye. AI tools assist with drafting and research. Source documentation in the existing archive is uneven, and articles are being reviewed and corrected. The Editorial Team byline identifies editorial responsibility; it does not certify specialist or independent human review. Where we compare products, anything built by our own team is labelled as such — see the editorial guidelines and About page for how corrections and disclosures work.
Related Articles

Carl Friedrich Gauss: The Prince of Mathematicians
Carl Friedrich Gauss proved the 17-gon constructible at 19 and published Disquisitiones Arithmeticae at 24. Explore the life of history's greatest mathematician.

Andrei Sakharov: From Soviet H-Bomb Architect to Nobel Peace Prize Dissident
Andrei Sakharov designed the Soviet hydrogen bomb in 1953, then spent three decades fighting for human rights — enduring exile, hunger strikes, and KGB surveillance.

Konstantin Tsiolkovsky: The Deaf Schoolteacher Who Invented Space Travel
Konstantin Tsiolkovsky derived the rocket equation in 1903, proposed liquid propellants and multi-stage rockets, and laid the theoretical foundation for all human spaceflight. He was nearly deaf.

Joseph-Louis Lagrange: The Mathematician Who Rewrote Mechanics
Lagrange's 1788 Mécanique analytique reformulated Newton using pure algebra. He discovered Lagrange points, invented calculus of variations, and survived the Revolution that killed Lavoisier.

Kurt Gödel: The Logician Who Proved Mathematics Has Limits
Kurt Gödel's incompleteness theorems (1931) shattered the dream of a complete mathematics. His Princeton friendship with Einstein and tragic death reveal a singular mind.

Pierre-Simon Laplace: The Mathematician Who Mapped the Solar System
Laplace's celestial mechanics proved the solar system stable, his demon defined determinism, and his probability theory is still used today. He served Napoleon and the Bourbons with equal facility.