betaFeedback

WorksMathematics

Forcing global Πn2Π^2_n uniformization with or without projective determinacy

Abstract

We construct a set-forcing extension of LL which has the same reals as LL and satisfies the Πn2Π^2_n-uniformization property for every n≥1n\geq1. Assuming ωω Woodin cardinals and a measurable cardinal above them, we also obtain a forcing extension of L(R)MωL(\mathbb R)^{M_ω} which has the same reals and satisfies projective determinacy together with the Πn2Π^2_n-uniformization property for every n≥1n\geq1.

Introduction

A uniformization of a relation A⊆ωω×ωωA \subseteq\omega^\omega\times\omega^\omega is a function U⊆AU \subseteq A with dom⁡U=dom⁡A\operatorname{dom} U = \operatorname{dom} A. A pointclass has the uniformization property if each of its relations has a uniformization in the pointclass. We study the second-order pointclasses Σn2\Sigma^2_n and Πn2\Pi^2_n over the set HC of hereditarily countable sets: first-order quantifiers range over HC, and class quantifiers range over all subsets of HC. We write Σn2\Sigma^2_n-UP and Πn2\Pi^2_n-UP for the uniformization properties of these lightface pointclasses; the precise definitions are given in § 2.

For projective pointclasses, definable uniformizations come from two sources: scales, which projective determinacy propagates through the projective hierarchy [17], and good wellorders of the reals, as in LL. Both sources have second-order counterparts. Under AD+V=L(R)V = L(\mathbb{R}), the scale analysis of Steel [19] and Martin and Steel [15] gives the scale property, and hence uniformization, for Σ12\Sigma^2_1. Woodin extended this to ZF+AD++V=L(P(R))^+ +V = L(\mathcal{P}(\mathbb{R})); see Steel and Trang [24 Theorem 2]. Under the same hypothesis AD+V=L(R)\mathrm{AD}+\mathrm{V} = L(\mathbb{R}), an argument of Kechris and Solovay, similar to the classical argument of Lévy, gives a Π12\Pi^2_1 relation which has no uniformization in L(R)L(\mathbb{R}) [21 Theorem 3.11 and the following discussion].

In the presence of CH, a determinacy hypothesis for games of length ω1\omega_1 gives the uniformization property for Π12\Pi^2_1. Building on [22], Steel [23] showed that ω1\omega_1-open-projective determinacy gives the scale property for the open game quantifier on analytical trees: the games have length ω1\omega_1 and integer moves, and the trees of countable positions are definable over (HC,∈)(\mathrm{HC}, \in) from parameters. Under CH this pointclass is Π12\Pi^2_1, so the hypothesis yields Π12\Pi^2_1-UP [23 Corollary 0.6 and Theorem 2.1]. By Neeman’s work [18], in the form quoted by Steel [23 Theorem 0.1], the determinacy hypothesis holds if every real belongs to a countable, (ω1+1)(\omega_1+1)-iterable mouse satisfying ZFC−+“there is a measurable Woodin cardinal”\mathrm{ZFC}^{-}+\text{“there is a measurable Woodin cardinal”}. Steel notes that deriving this mouse-existence hypothesis from a large-cardinal assumption requires iterability results which are not yet known [23 footnote 1].

Good wellorders give the uniformization property for Σn2\Sigma^2_n at every level nn. In LL, the canonical wellorder of the subsets of ω1\omega_1 is Σ12\Sigma^2_1-good, and choosing least witnesses gives Σn2\Sigma^2_n-UP for every n≥1n \ge1 (Proposition 10.8). We show that a forcing over LL which adds no reals can produce the dual situation, Πn2\Pi^2_n-UP for every n≥1n \ge1. Such a forcing preserves HC and all projective statements, and it changes the second-order pointclasses only through the new subsets of HC which it adds. An earlier forcing of this kind is the construction of Abraham and Shelah [1]: without adding reals, they obtain a Δ22\Delta^2_2 wellorder of the reals and, by the same method, code prescribed relations on the reals.

Theorem 1.1. There is a cardinal-preserving set-forcing extension L[G]L[G] of LL which has the same reals as LL and satisfies Πn2\Pi^2_n-UP for every n≥1n \ge1.

The construction is compatible with projective determinacy.

Theorem 1.2. Assume there are ω\omega Woodin cardinals and a measurable cardinal above them, and put W=L(R)Mω\mathcal{W} = L(\mathbb{R})^{M_\omega}. There is a forcing P∈W\mathbb{P} \in\mathcal{W} which preserves all cardinals of W\mathcal{W}, adds no reals, and forces PD + CH and Πn2\Pi^2_n-UP for every finite n≥1n \ge1.

The model W\mathcal{W} is its own L(R)L(\mathbb{R}) and satisfies ZFC+CH+PD\mathrm{ZFC}+\mathrm{CH}+\mathrm{PD} (Lemma 10.5). Since P\mathbb{P} adds no reals, it changes neither the projective sets nor the strategies for games on ω\omega, and hence preserves PD. Like LL, the model W\mathcal{W} satisfies Σn2\Sigma^2_n-UP for every n≥1n \ge1: it has the form L[A]L[A] for a set A⊆ω1A \subseteq\omega_1 whose membership and nonmembership relations have parameter-free Σ12\Sigma^2_1 definitions, and its canonical wellorder of the subsets of ω1\omega_1 is Σ12\Sigma^2_1-good relative to AA (Proposition 10.8). Since boldface Σn2\Sigma^2_n-uniformization and boldface Πn2\Pi^2_n-uniformization cannot hold at the same time (Lemma 10.9), we obtain the following.

Corollary 1.3. Under the hypothesis of Theorem 1.2, the models W⊆W[G]\mathcal{W} \subseteq\mathcal{W}[G] both satisfy ZFC + PD + CH, have the same HC, and satisfy, for every finite n≥1n \ge1,

W⊨Σn2-UP∧¬Πn2-UP,\mathcal{W} \models\Sigma^{2}_{n}\text{-UP} \mathbin{\wedge} \neg\Pi^{2}_{n}\text{-UP},
W[G]⊨Πn2-UP∧¬Σn2-UP.\mathcal{W}[G] \models\Pi^{2}_{n}\text{-UP} \mathbin{\wedge} \neg\Sigma^{2}_{n}\text{-UP}.

The analogous statement holds for LL and the extension L[G]L[G] of Theorem 1.1.

Thus, relative to the hypothesis of Theorem 1.2, each of the two combinations in Corollary 1.3 is consistent with PD + CH, and a forcing which changes neither the reals nor any projective statement turns the first into the second.

Large cardinals restrict the definable wellorders on which Σn2\Sigma^{2}_{n}-UP rests in our ground models. A theorem of Woodin rules out a Σ12\Sigma^{2}_{1} wellorder of the reals under CH and a measurable Woodin cardinal [1 p. 2]. Lücke, Schindler and Schlicht [14] obtain a good Σ1(ω1)\Sigma_{1}(\omega_{1})-definable wellorder of Hω2H_{\omega_{2}} in M1M_{1} [14 Theorem 5.2], and they show that infinitely many Woodin cardinals with a measurable cardinal above them preclude a Σ1(ω1)\Sigma_{1}(\omega_{1})-definable uniformization of the club filter on ω1\omega_{1} [14 Theorem 4.19]. Lücke and Müller [13 Theorem 1.6] show that the same hypothesis, or Woodin’s axiom (*), precludes a Σ1\Sigma_{1}-definable wellorder of any subset of P(ω1)\mathcal{P}(\omega_{1}) of size greater than ℵ1\aleph_{1}, with parameters in HC ∪{ω1}\cup\{\omega_{1}\}.

The models of Theorems 1.1 and 1.2 have no measurable Woodin cardinal. Indeed, both satisfy CH and have a Δ12\Delta^{2}_{1} wellorder of the reals: in L[G]L[G] the constructible wellorder of the reals, and in W[G]\mathcal{W}[G] the wellorder ≺\prec of § 10, which is Δ12\Delta^{2}_{1} there by Lemmas 10.5 and 10.6. Steel’s theorem, on the other hand, gives Π12\Pi^{2}_{1}-UP from CH and the mouse-existence hypothesis above. We therefore ask the following.

Question 1.4. Is Π12\Pi^{2}_{1}-UP consistent with CH and the existence of a measurable Woodin cardinal? More generally, is the conjunction of Πn2\Pi^{2}_{n}-UP for all n≥1n \ge1 consistent with these assumptions?

The method. Fix a recursive injection ℓ\ell which codes a triple (e,x,y)(e,x,y), consisting of a natural number and two reals, by a real ℓ(e,x,y)\ell(e,x,y). Let An,e(x,y)A_{n,e}(x,y) be the Πn2\Pi^{2}_{n} formula with Gödel number ee. In the final extension we define the uniformizing function by

Un,e(x,y)⟺An,e(x,y)∧¬Code⁡n(ℓ(e,x,y)).U_{n,e}(x,y) \Longleftrightarrow A_{n,e}(x,y) \mathbin{\wedge} \neg\operatorname{Code}_{n}(\ell(e,x,y)).

Each real tt in the range of ℓ\ell indexes a member StnS^{n}_{t} of a canonical family of stationary subsets of ωn\omega_{n} in LL. Given a sequence T⃗=(Tn)n≥1\vec{T}=(T_{n})_{n\ge1} of sets of such reals, we construct a forcing FT⃗\mathbb{F}_{\vec{T}} in whose extension

Code⁡n(t)⟺Stn is nonstationary in ωn⟺t∈Tn.\operatorname{Code}_{n}(t) \Longleftrightarrow S^{n}_{t}\text{ is nonstationary in }\omega_{n} \Longleftrightarrow t \in T_{n}.

For n=1n=1, Code⁡1(t)\operatorname{Code}_1(t) asserts that there is a club in ω1\omega_1 disjoint from St1S_t^1.2 For n≥2n\ge2, a club in ωn\omega_n is too large to be a class over HC. Here Code⁡n(t)\operatorname{Code}_n(t) asserts that there is a set X⊆ω1X\subseteq\omega_1 from which iterated almost disjoint decoding produces a set CX⊆ω1nC_X\subseteq\omega_1^n with the following property: every suitable model NN which is likewise coded by a subset of ω1\omega_1, and which contains the corresponding set decoded from XX, satisfies that CX∩ωnNC_X\cap\omega_n^N is a club in ωnN\omega_n^N disjoint from Stn∩ωnNS_t^n\cap\omega_n^N. The ordinals ωnN\omega_n^N are cofinal in ωn\omega_n, and all these models compute initial segments of the same set CXC_X; hence such a set XX yields a club in ωn\omega_n disjoint from StnS_t^n in the final model. Section 7 expresses this property by a parameter-free Σn2\Sigma^2_n formula. Thus Un,eU_{n,e} is Πn2\Pi^2_n, and it uniformizes An,eA_{n,e} provided that every nonempty section {y:An,e(x,y)}\{y:A_{n,e}(x,y)\} contains exactly one yy with ℓ(e,x,y)∉Tn\ell(e,x,y)\notin T_n.

The difficulty is that the sections themselves depend on T⃗\vec{T}. The forcing adds no reals, so every candidate yy is already in LL, but new subsets of HC can change the truth value of An,e(x,y)A_{n,e}(x,y). To determine in LL which statements An,e(x,y)A_{n,e}(x,y) a given forcing FT⃗F_{\vec{T}} forces, we reduce Πn2\Pi^2_n truth in the full extension to Π12(Hωn)\Pi^2_1(H_{\omega_n}) truth in the intermediate extension by the club shooting forcing. Cone homogeneity of the club shooting forcing then shows that each such statement with real parameters from the ground model is decided by the trivial condition.

References

  1. [1]U. Abraham and S. Shelah, A Δ₂² well-order of the reals and incompleteness of L(𝒬ᴹᴹ), Ann. Pure Appl. Logic 59 (1993), no. 1, 1–32. DOI: 10.1016/0168-0072(93)90228-6.DOI
  2. [2]J. Cummings, M. Džamonja, M. Magidor, C. Morgan and S. Shelah, A framework for forcing constructions at successors of singular cardinals, Trans. Amer. Math. Soc. 369 (2017), no. 10, 7405–7441. DOI: 10.1090/tran/6974.DOI
  3. [3]V. Fischer and S. D. Friedman, Cardinal characteristics and projective wellorders, Ann. Pure Appl. Logic 161 (2010), no. 7, 916–922. DOI: 10.1016/j.apal.2009.11.003.DOI
  4. [4]V. Fischer, S. D. Friedman and L. Zdomsky, Projective wellorders and mad families with large continuum, Ann. Pure Appl. Logic 162 (2011), 853–862. DOI: 10.1016/j.apal.2011.04.001.DOI
  5. [5]S. D. Friedman and M. Magidor, The number of normal measures, J. Symbolic Logic 74 (2009), no. 3, 1069–1080. DOI: 10.2178/jsl/1245158100.
  6. [6]G. Fuchs, Closed maximality principles: implications, separations and combinations, J. Symbolic Logic 73 (2008), no. 1, 276–308. DOI: 10.2178/jsl/1208358754.DOI
  7. [7]S. Hoffelner, Forcing the Π₁¹-Uniformization Property, preprint, 2021, revised 2026. arXiv:2103.11748v5.
  8. [8]S. Hoffelner, Forcing the Π₁³-reduction property and a failure of Π₁³-uniformization, Ann. Pure Appl. Logic 174 (2023), no. 8, 103292. DOI: 10.1016/j.apal.2023.103292.
  9. [9]S. Hoffelner, Forcing Σ₁¹-Separation on ω₁^ω₁, preprint, 2026. arXiv:2605.21175.
  10. [10]T. Jech, Set Theory, The Third Millennium Edition, Springer Monographs in Mathematics, Springer, 2003.
  11. [11]R. B. Jensen, The fine structure of the constructible hierarchy, Ann. Math. Logic 4 (1972), 229–308. DOI: 10.1016/0003-4843(72)90001-0.DOI
  12. [12]K. Kunen, Set Theory: An Introduction to Independence Proofs, North-Holland, 1980.
  13. [13]P. Lücke and S. Müller, Σ₁-definability at higher cardinals: Thin sets, almost disjoint families and long well-orders, Forum Math. Sigma 11 (2023), e103, 1–36. DOI: 10.1017/fms.2023.102.
  14. [14]P. Lücke, R. Schindler and P. Schlicht, Σ₁(κ)-definable subsets of H(κ⁺), J. Symbolic Logic 82 (2017), no. 3, 1106–1131. DOI: 10.1017/jsl.2017.36.DOI
  15. [15]D. A. Martin and J. R. Steel, The extent of scales in L(ℝ), in Cabal Seminar 79–81 (A. S. Kechris, D. A. Martin and Y. N. Moschovakis, eds.), Lecture Notes in Mathematics 1019, Springer, 1983, 86–96. DOI: 10.1007/BFb0071697.
  16. [16]D. A. Martin and J. R. Steel, A proof of projective determinacy, J. Amer. Math. Soc. 2 (1989), no. 1, 71–125.DOI
  17. [17]Y. N. Moschovakis, Uniformization in a playful universe, Bull. Amer. Math. Soc. 77 (1971), no. 5, 731–736. DOI: 10.1090/S0002-9904-1971-12789-1.DOI
  18. [18]I. Neeman, Games of length ω₁, J. Math. Logic 7 (2007), no. 1, 83–124. DOI: 10.1142/S0219061307000627.DOI
  19. [19]J. R. Steel, Scales in L(ℝ), in Cabal Seminar 79–81 (A. S. Kechris, D. A. Martin and Y. N. Moschovakis, eds.), Lecture Notes in Mathematics 1019, Springer, 1983, 107–156. DOI: 10.1007/BFb0071699.
  20. [20]J. R. Steel, An Outline of Inner Model Theory, in Handbook of Set Theory (M. Foreman and A. Kanamori, eds.), Springer, 2010, 1595–1684. The numbering and printed pages cited refer to the author’s version, https://math.berkeley.edu/~steel/papers/steel1.pdf.DOI
  21. [21]J. R. Steel, Games and scales. Introduction to Part I, in Games, Scales and Suslin Cardinals: The Cabal Seminar, Volume I (A. S. Kechris, B. Löwe and J. R. Steel, eds.), Lecture Notes in Logic 31, Cambridge University Press, 2008, 3–27. DOI: 10.1017/CBO9780511546488.002.DOI
  22. [22]J. R. Steel, Long games, in Cabal Seminar 81–85 (A. S. Kechris, D. A. Martin and J. R. Steel, eds.), Lecture Notes in Mathematics 1333, Springer, 1988, 56–97. DOI: 10.1007/BFb0084970.
  23. [23]J. R. Steel, The length-ω₁ open game quantifier propagates scales, in Games, Scales and Suslin Cardinals: The Cabal Seminar, Volume I (A. S. Kechris, B. Löwe and J. R. Steel, eds.), Lecture Notes in Logic 31, Cambridge University Press, 2008, 260–270. DOI: 10.1017/CBO9780511546488.014.DOI
  24. [24]J. R. Steel and N. Trang, AD†, derived models, and Σ₁-reflection, unpublished notes, 2010. https://math.berkeley.edu/~steel/papers/AD+reflection.pdf.
  25. [25]Š. Stejskalová, Some notes on embeddings, projections, and Easton’s lemma, Acta Univ. Carolin. Philos. Hist. 2022 (2025), no. 1, 57–75. DOI: 10.14712/24647055.2025.4.DOI

Paper details

vlnc:W_w7su6tg4
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 9

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents