projective determinacy

projective determinacy
Name	Projective determinacy
Field	Set theory
Introduced	1970s
Notable results	Determinacy of projective sets, connections with large cardinals

projective determinacy is an axiom in set theory asserting that certain infinite two-player perfect-information games with payoff sets in the projective hierarchy are determined. It strengthens instances of Borel determinacy and is tightly connected to hypotheses about large cardinals such as Woodin cardinals and Measurable cardinals. The axiom has deep consequences for descriptive set theory, influencing regularity properties of sets of real numbers and definable hierarchies studied by researchers at institutions like University of California, Berkeley and Princeton University.

Definition and statement

Projective determinacy states that every two-player infinite game of length ω with play space ω and payoff set belonging to the projective hierarchy is determined. The games are of the form where players alternate natural numbers producing a real; the payoff set is a projective subset of Cantor space or Baire space arising from operations in the projective hierarchy such as projections and complements used in works by W. W. Tait and formalizations appearing in texts by Yiannis N. Moschovakis and Alexander S. Kechris. Determinacy means one of the players has a winning strategy, a notion formalized using strategies studied by John R. Steel and Martin Davis. The projective hierarchy itself refines earlier hierarchies developed by Emil Post and later systematized by Henri Lebesgue and Borel; modern accounts reference classifications related to Descriptive set theory courses at Massachusetts Institute of Technology.

Historical background and motivation

Interest in determinacy arose after paradoxes in classical real analysis and investigations by André Weil and Henri Lebesgue into measurability and regularity properties. Early determinacy results such as Borel determinacy were proved by Donald A. Martin and galvanized studies by researchers at University of California, Los Angeles and Harvard University. The projective case was motivated by counterexamples constructed by Felix Hausdorff and subsequent developments by D. A. Martin and John R. Steel, with major advances credited to collaborations involving W. Hugh Woodin and William J. Mitchell. Philosophical and foundational motivation drew attention from scholars connected to Institute for Advanced Study debates about axioms of infinity and was influenced by work on Continuum hypothesis implications considered at conferences attended by participants from University of Oxford and Cambridge University.

Consistency and large cardinals

Consistency proofs link projective determinacy with existence of strong large cardinals. Results by Donald A. Martin and John R. Steel showed that if there are sufficiently many Woodin cardinals and a measurable cardinal above them, then projective determinacy holds. The argument uses inner model techniques developed by Ronald Jensen and William Mitchell and iterability concepts refined by Mitchell-Steel core model researchers. Equiconsistency results relate projective determinacy to hypotheses involving sequences of Woodin cardinals and measurable cardinals studied at Rutgers University and University of California, Berkeley. Contrasting work by Solovay and Kunen framed limitations on proving determinacy from weaker axioms like those of Zermelo–Fraenkel set theory without large cardinal assumptions, a theme discussed in seminars at Princeton University.

Consequences in descriptive set theory

Under projective determinacy, every projective set of reals has regularity properties: Lebesgue measurability, the property of Baire, and the perfect set property, conclusions developed in papers by Yiannis N. Moschovakis and Donald A. Martin. Structural results include scale and uniformization theorems attributed to work from groups at University of California, Berkeley and University of Oxford, and canonical separation results explored by John R. Steel and W. Hugh Woodin. Determinacy gives precise determinacy-based analyses of definable pointclasses studied in graduate courses at Princeton University and in monographs by Alexander S. Kechris. Consequences extend to comparisons with large cardinal hierarchies appearing in lectures at Harvard University.

Proofs and techniques

Proofs of implications from large cardinals to projective determinacy employ inner model theory, iteration trees, and fine-structural analysis developed by Ronald Jensen, John R. Steel, and W. Hugh Woodin. Martin-Steel proofs use determinacy transfer arguments and scales, leveraging work on iterable mice and core models produced by research groups at University of California, Berkeley and Rutgers University. Techniques incorporate forcing absoluteness ideas originating with Paul Cohen and absoluteness methods refined by Thomas Jech and Akihiro Kanamori. The interplay between game-theoretic strategies and fine structure is central, with influential lectures given at Institute for Advanced Study and Mathematical Sciences Research Institute.

Related determinacy axioms and comparisons

Projective determinacy sits between Borel determinacy and full determinacy axioms like AD and AD+. Borel determinacy was settled by Donald A. Martin, while Axiom of Determinacy (AD) has consistency strengths explored by Kurt Gödel-inspired programs and modern researchers such as W. Hugh Woodin and John R. Steel. Comparisons involve determinate pointclasses including analytic and coanalytic sets originally studied by Émile Borel and later by Stefan Banach-era analysts; further distinctions reference consequences considered in workshops at Mathematical Association of America and conferences at European Set Theory Society. Relative consistency and incompatibility results with Axiom of Choice trace back to arguments by Solovay and discussions at Cleveland meetings.

Category:Set theory