- Atlas
- Mathematics
- Descriptive Set Theory
Descriptive Set Theory
Descriptive set theory is the study of definable sets of real numbers—sets that can be described by a formula, a construction, or a rule, rather than picked out arbitrarily.
11 frameworks, from 1917 to today · Mathematical Logic · Mathematics
- Classical descriptive set theory 1917-1940
- Constructible universe 1938-1975
- Determinacy 1953-Present
- Effective descriptive set theory 1955-Present
- Forcing 1963-Present
- Projective determinacy 1965-Present
- Large cardinals and inner model theory 1968-Present
- Wadge hierarchy 1970-Present
- Reverse mathematics 1975-Present
- HOD analysis and the HOD conjecture 1985-Present
- Borel equivalence relation 1990-Present
Overview
Descriptive set theory is the study of definable sets of real numbers—sets that can be described by a formula, a construction, or a rule, rather than picked out arbitrarily. Its central objects are the Borel sets, built from open intervals by countable unions, intersections, and complements, and the projective sets, obtained from Borel sets by projecting them (taking images under continuous maps) and complementing, repeatedly12. The field asks: how complicated must a definition be? What structural properties—size, regularity, the existence of a "nice" member—do definable sets necessarily have? And which of these properties can be proved in ordinary mathematics, and which require stronger axioms?
The stakes are foundational. A set of reals can be so wild that it has no reasonable notion of length (non-measurable), or contains no perfect subset, or admits no way of choosing one representative from each of its classes. Descriptive set theory measures exactly how far one can go before such pathologies appear, and it has repeatedly shown that the boundary is not a matter of taste but of axioms.
Beginnings: Borel, Baire, and Lebesgue
Émile Borel introduced the sets now bearing his name around 1898, in work on measure theory: starting from intervals, closing under countable unions and intersections. René Baire and Henri Lebesgue developed the surrounding theory of functions and measurability in the same years. The early discoveries were regularity theorems. Every Borel set is measurable, and every uncountable Borel set contains a perfect subset—a copy of the Cantor set—so Borel sets obey a clean dichotomy: countable or of the cardinality of the continuum.
The decisive early result was the Suslin theorem (1917). Mikhail Suslin, a student of Nikolai Luzin, found an error in Lebesgue's claim that the projection of a Borel set is Borel. Suslin showed that projections of Borel sets—the analytic (or Σ¹₁) sets—form a strictly larger class, and he characterized the Borel sets as exactly those sets that are both analytic and co-analytic. This launched the Luzin–Suslin school in Moscow and, with Wacław Sierpiński and Kazimierz Kuratowski in Warsaw, the Polish school that dominated the field between the wars.
The classical period: hierarchies and regularity
The classical theory, largely complete by the 1930s, organized definable sets into hierarchies. The projective hierarchy Σ¹₁, Π¹₁, Σ¹₂, … alternates projections and complements; the Borel hierarchy does the same with countable operations13. Luzin and Sierpiński established the basic structural facts: analytic sets are measurable and have the perfect set property, and every Σ¹₁ set is either countable or contains a perfect subset.
Two results from this era set the agenda for everything after. First, Luzin and Sierpiński (1917) showed that a Σ¹₂ set can be constructed whose existence depends on a well-ordering of the reals, and such sets can fail regularity. Second, in 1925 Luzin and Sierpiński proved that every Σ¹₂ set is measurable, and in 1930 Luzin proved every Σ¹₂ set has the perfect set property. The pattern was tantalizing: the first level beyond the Borel sets behaves well, but the proofs used the axiom of choice in ways that suggested the next level might not.
The classical school also developed the tree representation: closed sets correspond to trees of finite sequences, and analytic sets are projections of closed sets. This combinatorial machinery—trees, well-founded relations, ranks—became the field's working language.
Gödel, constructibility, and the limits of provability
Kurt Gödel's 1938 construction of the constructible universe L transformed the subject4. L is a minimal inner model of set theory, built by transfinite recursion, in which the axiom of choice and the generalized continuum hypothesis hold. Crucially, L contains a definable well-ordering of the reals. In L, one can explicitly construct a Σ¹₂ set that is not measurable and has no perfect subset. So the regularity theorems of Luzin and Sierpiński could not be pushed to Σ¹₂ in ZFC alone: the pathologies were consistent.
This created the field's characteristic tension. The classical results were theorems of ZFC about low levels; the question of what happens at higher levels became a question about which axioms one adopts. The answer came from an unexpected direction.
Determinacy: games and the regularity of projective sets
In the 1950s and 1960s, the theory of infinite games entered set theory. In a game of perfect information of length ω, two players alternately choose natural numbers; a determinacy hypothesis says that for a given class of payoff sets, every such game is determined—one player has a winning strategy. Open determinacy is provable in ZFC (a Gale–Stewart result of 1953). Borel determinacy was proved by Donald Martin in 1975, a landmark requiring substantial set-theoretic machinery5.
The connection to descriptive set theory is that determinacy for a class of sets implies regularity for that class. Martin showed in 1970 that analytic determinacy implies all Σ¹₂ sets are measurable and have the perfect set property, and more generally that determinacy at one level yields regularity at the next. The axiom of determinacy (AD), asserting that all games on integers are determined, is inconsistent with the axiom of choice but consistent with the dependent choice fragment; under AD, every set of reals is regular, and the projective hierarchy collapses in a structured way.
The determinacy program thus offered a coherent picture: adopt determinacy axioms and the pathologies vanish. The question became whether determinacy itself could be justified from accepted axioms.
Large cardinals and the proof of projective determinacy
The answer came through large cardinal axioms—statements asserting the existence of very large infinite sets, such as measurable cardinals. In the 1960s, work by Dana Scott, H. Jerome Keisler, and others connected measurability to elementary embeddings of the universe. In the 1970s and 1980s, Martin, John Steel, and others developed the inner model theory of large cardinals, constructing canonical minimal models containing them.
The crowning result: projective determinacy is equivalent to the existence of infinitely many Woodin cardinals (Martin–Steel, building on work of Woodin, around 1985). This gave a precise calibration: the regularity of projective sets is not an arbitrary choice but follows from a natural hierarchy of strong axioms. The Wadge hierarchy and Wadge reducibility—a notion of one set being continuously reducible to another—gave the determinacy world its own fine structure, with the Wadge degrees forming a well-founded hierarchy under AD16.
Forcing, independence, and the modern landscape
Paul Cohen's invention of forcing (1963) gave set theorists a method for building models of ZFC with prescribed properties7. For descriptive set theory, forcing became both a tool and a source of independence results. Robert Solovay's 1970 model, in which all sets of reals are Lebesgue measurable (assuming an inaccessible cardinal), showed that regularity can hold universally in a model of ZFC plus a large cardinal. Conversely, forcing can produce models with pathological definable sets.
The modern field is organized around several interacting programs. Effective descriptive set theory, developed by Kleene, Addison, and others from the 1950s onward, replaces arbitrary definability with computability-theoretic definability: a set is lightface Σ¹₁ if it is the projection of a computable relation, and the hyperarithmetic hierarchy mirrors the Borel hierarchy at the effective level. This connects descriptive set theory to recursion theory and yields precise theorems about which classical results are effective.
Borel equivalence relation theory, developed from the 1990s by Kechris, Louveau, and others, classifies definable equivalence relations by Borel reducibility: one relation reduces to another if there is a Borel function mapping classes to classes. This gives a hierarchy of classification problems—countable versus uncountable, smooth versus non-smooth—with applications to classification in algebra and dynamics.
Reverse mathematics, a program initiated by Harvey Friedman and developed by Stephen Simpson, asks which set-existence axioms are needed to prove classical theorems8. Descriptive set theory supplies many of its benchmark results: the perfect set theorem, the Suslin theorem, and determinacy fragments have been calibrated against subsystems of second-order arithmetic.
HOD—the universe of hereditarily ordinal-definable sets—has returned to prominence through Woodin's work on the HOD conjecture, which proposes that under large cardinals, HOD is a canonical inner model. This connects the fine structure of definable sets to the deepest questions about the set-theoretic universe.
The present
Descriptive set theory today is a mature field with several active fronts. The inner model theory program continues to build canonical models for stronger large cardinals, with the ultimate goal of a model containing a supercompact cardinal; this is among the hardest open problems in set theory. Determinacy and its consequences remain central, with the Wadge hierarchy and Borel reducibility providing the structural backbone. Effective methods connect the field to computability, while forcing and large cardinal techniques supply independence and consistency results. The HOD conjecture and the search for a canonical inner model of the universe tie descriptive set theory to the largest questions in the foundations of mathematics. What began as a study of Borel's measurable sets has become a laboratory for testing which axioms mathematics can and should adopt.
References
- Descriptive set theory (Borel sets, Analytic and coanalytic sets, Borel hierarchy, Projective sets and Wadge degrees), Wikipedia
- Projective hierarchy, Wikipedia
- Borel hierarchy, Wikipedia
- Constructible universe, Wikipedia
- Borel determinacy theorem, Wikipedia
- Wadge hierarchy, Wikipedia
- Forcing (mathematics), Wikipedia
- Reverse mathematics, Wikipedia
The frameworks of Descriptive Set Theory
Each framework is a way of working the field has used: when it held, and the question it answers.
- 1917-1940
Classical descriptive set theory
How complex must a definable set of reals be?
- 1938-1975
- 1953-Present
- 1955-Present
- 1963-Present
Forcing
How can we build models of set theory with prescribed properties?
- 1965-Present
- 1968-Present
Large cardinals and inner model theory
What large cardinals exist and what do they imply?
- 1970-Present
Wadge hierarchy
How do sets of reals compare under continuous reducibility?
- 1975-Present
Reverse mathematics
Which axioms are needed to prove classical theorems?
- 1985-Present
HOD analysis and the HOD conjecture
What is the structure of hereditarily ordinal-definable sets?
- 1990-Present
Borel equivalence relation
When can two classification problems be compared?
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.
Constructible universe influenced by Classical descriptive set theory
Gödel's construction of L was motivated by the classical descriptive set theory of Luzin and Sierpiński; L provided a model where a Σ¹₂ set can be explicitly constructed that is not measurable, settling a question left open by the classical school.
Carried by Kurt Gödel.
Effective descriptive set theory grew out of Classical descriptive set theory
Effective descriptive set theory grew directly out of the classical theory by replacing arbitrary definability with computability-theoretic definability, yielding lightface analogues of the Borel and projective hierarchies.
Carried by Stephen Cole Kleene; John W. Addison.
Projective determinacy grew out of Determinacy
Projective determinacy is the restriction of the determinacy program to projective sets, and it was pursued as a way to obtain regularity for the projective hierarchy without the full axiom of determinacy.
Carried by Donald A. Martin; John Steel.
Large cardinals and inner model theory influenced by Projective determinacy
The proof of projective determinacy from large cardinals (Martin–Steel) was a crowning achievement of inner model theory, showing that projective determinacy is equivalent to the existence of infinitely many Woodin cardinals.
Carried by Donald A. Martin; John Steel; W. Hugh Woodin.
Determinacy influenced by Classical descriptive set theory
The classical regularity theorems for analytic and co-analytic sets posed the question of whether such regularity extends to higher projective levels; determinacy was introduced as a hypothesis that would imply such regularity.
Forcing influenced by Constructible universe
Cohen's forcing was developed partly to construct models of set theory with different properties of definable sets of reals, building on and reacting to Gödel's constructible universe as the first inner model.
Carried by Paul Cohen.
Wadge hierarchy influenced by Determinacy
The Wadge hierarchy was developed to provide a fine structure for sets of reals under continuous reducibility, and its properties were analyzed under determinacy assumptions.
Carried by William W. Wadge.
Reverse mathematics influenced by Effective descriptive set theory
Reverse mathematics uses effective descriptive set theory and recursion-theoretic hierarchies as benchmarks, asking which set-existence axioms are needed to prove classical theorems about definable sets.
Carried by Harvey Friedman; Stephen G. Simpson.
Large cardinals and inner model theory influenced by Forcing
Forcing became a central tool in the development of inner model theory, used to establish independence and consistency results about large cardinals and their associated models.
Carried by Robert M. Solovay.
HOD analysis and the HOD conjecture influenced by Forcing
Woodin's HOD analysis and the HOD conjecture rely on forcing techniques to study the structure of HOD under large cardinals.
Carried by W. Hugh Woodin.
HOD analysis and the HOD conjecture influenced by Large cardinals and inner model theory
The HOD conjecture emerged from inner model theory and large cardinal analysis, proposing that under large cardinals HOD is a canonical inner model.
Carried by W. Hugh Woodin.
Borel equivalence relation influenced by Wadge hierarchy
The Wadge hierarchy and its reducibility notions provided a model for the later development of Borel equivalence relation theory, which classifies definable equivalence relations by Borel reducibility.
Carried by Alexander S. Kechris.
Beyond the field
Where Descriptive Set Theory's ideas came from in other fields, and what they led to there: the strongest 12 of 43 links.
Classical descriptive set theory grew out of Cantorian transfinite set theory in Set Theory
Classical descriptive set theory is a branch of Cantorian transfinite set theory, applying its notions of cardinality, well-order, and transfinite induction to definable sets of reals. It arose as a refinement of Cantor's program, especially through the work of Borel, Lebesgue, and Suslin.
Carried by Georg Cantor; Émile Borel; Mikhail Suslin.
Constructible universe grew out of Cantorian transfinite set theory in Set Theory
The constructible universe was defined by Gödel within Cantorian transfinite set theory, using the cumulative hierarchy and transfinite recursion over ordinals. It is a direct outgrowth of Cantor's theory of ordinals and cardinals.
Carried by Kurt Gödel; Georg Cantor.
Determinacy influenced by Descriptive set theory in Set Theory
The axiom of determinacy was introduced by Mycielski and Steinhaus (1962) precisely to settle open questions of classical descriptive set theory, such as the regularity properties of projective sets. Determinacy implies that all projective sets are Lebesgue measurable and have the perfect set property, directly addressing descriptive set theory's central problems.
Carried by Jan Mycielski; Hugo Steinhaus.
Effective descriptive set theory influenced by Computably Enumerable Sets and Reducibilities in Recursion Theory
The theory of computably enumerable sets and reducibilities supplied the basic notions (recursive, r.e., many-one and Turing reducibility) that effective descriptive set theory transferred from natural numbers to reals. Kleene's and Post's work on c.e. sets underlies the effective hierarchies.
Carried by Stephen Cole Kleene; Emil Post.
Effective descriptive set theory grew out of Descriptive set theory in Set Theory
Effective descriptive set theory is the branch of descriptive set theory that restricts attention to definable (recursive, arithmetical, hyperarithmetical) sets of reals. It grew directly out of classical descriptive set theory by replacing arbitrary sets with effectively definable ones, starting with Kleene's work in the 1950s.
Carried by Stephen Cole Kleene.
Effective descriptive set theory influenced by Recursively enumerable set theory in Computability
Effective descriptive set theory was built by applying the theory of recursively enumerable sets and relative computability to sets of reals, leading to the arithmetical and hyperarithmetical hierarchies. Kleene's recursion-theoretic work in the 1950s provided the core methods.
Carried by Stephen Cole Kleene.
Forcing influenced by Zermelo–Fraenkel set theory in Mathematical Logic
Forcing was developed as a technique in mathematical logic for proving independence results relative to ZF, using the metamathematics of models and consistency. It is a logical method built on the syntax and semantics of ZF.
Carried by Paul Cohen.
Forcing influenced by Zermelo–Fraenkel set theory in Set Theory
Forcing is a method for constructing models of Zermelo–Fraenkel set theory, starting from a ground model and adjoining a generic set. It presupposes and operates within the ZF axioms.
Carried by Paul Cohen.
Forcing led to Forcing axioms in Set Theory
Forcing axioms such as Martin's Axiom were formulated directly out of Cohen's forcing method, generalising properties of generic extensions into axioms.
Carried by Donald A. Martin; Robert M. Solovay.
Projective determinacy grew out of Determinacy in Set Theory
Projective determinacy is a restricted form of the axiom of determinacy, asserting determinacy only for projective sets. It was isolated as a hypothesis in the 1960s from the broader determinacy program, following Mycielski and Steinhaus.
Carried by Jan Mycielski; Yiannis Moschovakis.
Projective determinacy influenced by Descriptive set theory in Set Theory
Projective determinacy was formulated to resolve central problems of descriptive set theory, namely the regularity properties of projective sets. The hypothesis implies that all projective sets are Lebesgue measurable and have the perfect set property, answering questions left open by classical descriptive set theory.
Carried by Yiannis Moschovakis; Donald A. Martin.
Projective determinacy grew out of Large cardinal in Set Theory
Projective determinacy was shown to follow from large cardinal axioms, notably measurable and stronger cardinals, through the work of Martin, Solovay, and others in the 1960s and 1970s. Large cardinals thus provide a foundation for projective determinacy.
Carried by Donald A. Martin; Robert M. Solovay.

Descriptive Set Theory 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 Descriptive Set TheoryRelated fields
Fields its ideas are linked to
- Set Theory 25 links
- Measure Theory 4 links
- Real Analysis 3 links
- Recursion Theory 3 links
- Computability 3 links
- Complexity Theory 2 links
- Model Theory 1 link
- Mathematical Logic 1 link
- Theory Of Computation 1 link
More in Mathematical Logic
- Constructive Mathematics
- Mathematical Logic
- Model Theory
- Proof Theory
- Recursion Theory
- Set Theory
- Type Theory
See where Descriptive Set Theory sits on the Map of Human Knowledge