Determinacy (set theory)

Determinacy (set theory)
Name	Determinacy
Field	Set theory
Introduced	1950s
Notable results	Gale–Stewart theorem; Martin's theorem; Borel determinacy
Related concepts	Axiom of Determinacy; Axiom of Choice; Large cardinals

Determinacy (set theory)

Determinacy in set theory concerns winning strategies in infinite two-player games of perfect information and their structural consequences for sets of reals, ordinals, and definable hierarchies. Originating in work by Gale and Stewart, determinacy links analysis, descriptive set theory, and large cardinal hypotheses and has deep interactions with the Axiom of Choice, the work of Hugo Steinhaus, and developments by John von Neumann and Paul Erdős. Central results by Donald A. Martin, George W. Mycielski, and Yiannis N. Moschovakis connect determinacy principles to projective sets, measurable cardinals, and inner model theory.

Introduction

Determinacy formalizes when a player has a winning strategy in games whose plays produce sequences in spaces like the Baire space or Cantor space; key contributors include David Gale, Frank M. Stewart, Donald A. Martin, Alexander S. Kechris, and Yiannis N. Moschovakis. The framework studies games defined by payoff sets coming from the Borel hierarchy, projective hierarchy, or definability classes considered by Nikolai Luzin and André Weil, with implications for regularity properties studied by Wacław Sierpiński and Kazimierz Kuratowski. Determinacy axioms often contradict choices implicit in the Axiom of Choice explored by Ernst Zermelo and Abraham Fraenkel; the tension shaped investigations by Paul Cohen and Kurt Gödel.

Definitions and Basic Concepts

An infinite game G(A) between players I and II produces a sequence x in ω^ω; the payoff set A ⊆ ω^ω determines the winner. Fundamental definitions were formalized by David Gale and Frank M. Stewart and extended by Donald A. Martin and Alexander S. Kechris to classes like Borel and analytic sets studied earlier by Nikolai Luzin and Mikhail Suslin. A strategy for a player is a function from finite sequences to moves; a winning strategy ensures membership or nonmembership in A, with determinacy meaning one player has such a strategy. Related structures include the Borel hierarchy, projective hierarchy, Luzin separation results, and the Wadge hierarchy from work by William W. Wadge.

Determinacy Axioms and Variants

The primary axiom is the Axiom of Determinacy (AD) formulated as an alternative to the Axiom of Choice by researchers including J. Mycielski and H. Steinhaus. Variants include Borel Determinacy, proved by Donald A. Martin, Projective Determinacy (PD) advanced by W. Hugh Woodin and Donald A. Martin, and AD_R concerning games on the real numbers studied by John R. Steel and W. Hugh Woodin. Other forms involve Gale–Stewart determinacy for clopen sets, analytic determinacy linked to results of Martin and Steel, and uniformization principles considered by Moschovakis.

Consequences and Applications

Determinacy axioms yield regularity properties for definable sets such as Lebesgue measurability, the Baire property, and the perfect set property, results influenced by Émile Borel and Henri Lebesgue. Martin’s proof of Borel determinacy impacts descriptive set theory as treated by Kurt Gödel's constructible universe L and the study of scales by Donald A. Martin and John R. Steel. Consequences reach into inner model theory via core models developed by Ronald Jensen and applications in measure theory explored by Alfréd Rényi and Andrey Kolmogorov. Determinacy also informs combinatorial set theory results like partition properties investigated by Paul Erdős and structural results about pointclasses in the style of Yiannis N. Moschovakis.

Relationships with Choice and Large Cardinals

AD contradicts the full Axiom of Choice in ZF, a tension recognized by Ernst Zermelo and examined in independence proofs by Paul Cohen. Consistency of strong determinacy axioms often reduces to existence of large cardinals such as measurable cardinals, Woodin cardinals, supercompact cardinals, and strong cardinals studied by Kurt Gödel, Solomon Feferman, and W. Hugh Woodin. Projective Determinacy is equiconsistent with existence of sufficiently many Woodin cardinals combined with measurable cardinals, a theme developed by Donald A. Martin, John R. Steel, and Woodin. Interactions with inner models like L[μ] and the core model K were advanced by Ronald Jensen and Mitchell Steel.

Consistency and Independence Results

Key consistency results include Martin’s Borel determinacy proof within ZF and independence proofs of determinacy statements relative to large cardinals by Paul Cohen-style forcing and inner model constructions by Donald A. Martin and John R. Steel. Equiconsistency theorems relate PD to Woodin cardinals as shown by Martin and Steel; results by W. Hugh Woodin tie AD_R to strong large cardinal axioms. Independence from ZFC of many determinacy axioms mirrors seminal independence work by Paul Cohen on the Continuum Hypothesis and by Kurt Gödel on constructibility.

Historical Development and Key Results

The subject began with games on sequences studied by David Gale and Frank M. Stewart in the 1950s and grew through contributions by Donald A. Martin (Borel determinacy), Yiannis N. Moschovakis (descriptive set theoretic systems), W. Hugh Woodin (connections to large cardinals), and John R. Steel (inner model analysis). Landmark theorems include the Gale–Stewart theorem, Martin’s theorem on Borel determinacy, Moschovakis’ work on scales and pointclasses, and Martin–Steel results on projective determinacy. Ongoing research connects determinacy to modern developments in inner model theory by Stefano Sacerdote and William J. Mitchell, the study of AD+ by W. Hugh Woodin, and applications across descriptive set theory and mathematical logic as advanced at institutions such as Institute for Advanced Study and Princeton University.

Category:Set theory