pith. sign in

arxiv: 2512.16330 · v2 · submitted 2025-12-18 · 🧮 math.LO

Terminal Absoluteness of Collapse Forcings

Cesare Straffelini This is my paper

Pith reviewed 2026-05-16 21:32 UTC · model grok-4.3

classification 🧮 math.LO
keywords generic absolutenesscollapse forcingprojective setslarge cardinalsforcing extensionsset theoryabsolutenessZFC
0
0 comments X

The pith

Collapse forcings capture the full projective generic absoluteness equivalent to that of arbitrary forcings under large cardinal assumptions.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper investigates whether studying generic absoluteness for projective statements requires considering all possible forcing notions or if collapse forcings alone suffice. It establishes that, when suitable large cardinal hypotheses hold, the absoluteness properties obtained from collapse forcings match those from any forcing. At lower levels of the projective hierarchy, this equivalence already follows from ZFC without additional assumptions. This shows that collapse forcings are terminal in the sense that they encompass the complete robustness of the set-theoretic universe against forcing extensions. A sympathetic reader would care because it simplifies the study of forcing invariance by reducing it to a specific, well-understood class of posets.

Core claim

Under suitable large cardinal hypotheses, projective generic absoluteness for collapse forcings is equivalent to absoluteness for arbitrary forcings. At low projective levels the result holds already in ZFC. This reveals the terminality of collapse forcings since they capture the full robustness of the universe under forcing extensions.

What carries the argument

The equivalence between projective generic absoluteness for collapse forcings and for arbitrary forcings, which unifies the study of forcing invariance at the projective level.

If this is right

  • Projective truths stable under collapse extensions are stable under all forcing extensions, assuming the large cardinals.
  • Studying generic absoluteness can be restricted to collapse forcings without loss of generality.
  • The necessity of large cardinals is shown by counterexamples at higher levels if they fail.
  • Low-level projective absoluteness for collapses implies the general case in ZFC.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If collapse forcings suffice, then many consistency proofs involving projective absoluteness can be simplified by using only collapses.
  • This may extend to other classes of forcings that embed collapses or vice versa.
  • Testable by checking specific models with known large cardinals whether non-collapse forcings add new projective truths.

Load-bearing premise

The suitable large cardinal hypotheses are necessary for the equivalence to hold beyond the lowest projective levels.

What would settle it

A model of set theory with large cardinals where some projective statement is absolute for all collapse forcings but not for some non-collapse forcing would falsify the claim.

read the original abstract

Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably generated one, implying that any forcing extension can be realised inside one obtained via a collapse forcing. This observation raises a deeper question: are all forcing notions truly necessary when studying projective generic absoluteness, or does a particular class of forcing notions suffice to capture the same level of invariance? Here we show that, under suitable large cardinal hypotheses, projective generic absoluteness for collapse forcings is indeed equivalent to absoluteness for arbitrary forcings; and we discuss the necessity of these hypotheses, showing that at a low projective level the result holds in ZFC. Thus, we reveal the terminality of collapse forcings since they capture the full robustness of the universe under forcing extensions.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The manuscript claims that under suitable large cardinal hypotheses, projective generic absoluteness for collapse forcings is equivalent to projective generic absoluteness for arbitrary forcings; it further shows that the equivalence holds in ZFC alone at low projective levels, relying on Kripke's theorem that every complete Boolean algebra completely embeds into a countably generated one.

Significance. If the central equivalence holds, the result establishes collapse forcings as terminal for projective generic absoluteness, reducing the study of forcing invariance to a single class and clarifying the role of large cardinals in separating low-level ZFC cases from higher levels. The unconditional ZFC result at low projective levels is a clear strength, providing a parameter-free derivation in that regime.

major comments (2)
  1. [Main theorem statement (likely §3 or §4)] The precise large cardinal hypotheses (e.g., the exact strength such as a Woodin cardinal or measurable cardinal) invoked for the equivalence beyond low levels must be stated explicitly in the main theorem; without this, it is impossible to verify whether the proof strategy correctly reduces arbitrary forcings to collapses via Kripke embeddings.
  2. [ZFC case (likely §2)] For the ZFC result at low projective levels, the exact level (e.g., Σ¹₁-absoluteness or Π¹₂) and the precise reduction step from Kripke's embedding to absoluteness preservation need to be isolated; the current separation of ZFC from LC cases is promising but requires a self-contained derivation to confirm it does not tacitly rely on choice principles beyond ZFC.
minor comments (2)
  1. [Introduction] Define 'collapse forcings' and 'projective generic absoluteness' at first use with a brief reminder of the standard definitions to aid readers unfamiliar with the exact quantifier complexity.
  2. [References] Add an explicit citation to Kripke's embedding theorem in the references section and cross-reference it in the proof of the reduction.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the positive evaluation and the precise suggestions for improving clarity. We address each major comment below and will incorporate the requested changes in the revised manuscript.

read point-by-point responses

  1. Referee: [Main theorem statement (likely §3 or §4)] The precise large cardinal hypotheses (e.g., the exact strength such as a Woodin cardinal or measurable cardinal) invoked for the equivalence beyond low levels must be stated explicitly in the main theorem; without this, it is impossible to verify whether the proof strategy correctly reduces arbitrary forcings to collapses via Kripke embeddings.

    Authors: We agree that the large cardinal hypothesis must be stated explicitly. The proof relies on a Woodin cardinal to guarantee that projective truth is preserved when passing from an arbitrary forcing to its Kripke-embedded collapse forcing. In the revision we will restate the main theorem (currently Theorem 3.2) to read: 'Assuming a Woodin cardinal, projective generic absoluteness for collapse forcings is equivalent to projective generic absoluteness for arbitrary forcings.' This makes the reduction step via Kripke's theorem directly verifiable. revision: yes

  2. Referee: [ZFC case (likely §2)] For the ZFC result at low projective levels, the exact level (e.g., Σ¹₁-absoluteness or Π¹₂) and the precise reduction step from Kripke's embedding to absoluteness preservation need to be isolated; the current separation of ZFC from LC cases is promising but requires a self-contained derivation to confirm it does not tacitly rely on choice principles beyond ZFC.

    Authors: We accept the request for greater explicitness. The ZFC result establishes Σ¹₁-generic absoluteness and proceeds by applying Kripke's theorem to embed any complete Boolean algebra into a countably generated one; Σ¹₁ statements are then absolute because they are preserved under countable elementary embeddings that exist in ZFC. In the revision we will isolate this argument as a self-contained lemma (new Lemma 2.4) that cites only Kripke's theorem and the definition of Σ¹₁ formulas, with no appeal to choice principles beyond ZFC. The separation between the ZFC case and the Woodin-cardinal case will be retained. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper establishes an equivalence between projective generic absoluteness for collapse forcings and arbitrary forcings under large cardinal hypotheses, with a ZFC result at low projective levels. This rests on the classical Kripke embedding theorem (an external result reducing arbitrary forcings to collapse ones) and standard separation of cases by projective level. No self-definitional reductions, fitted inputs renamed as predictions, load-bearing self-citations, or smuggled ansatzes appear; the derivation is a direct proof from stated assumptions and is self-contained against external set-theoretic benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on large cardinal hypotheses for the main equivalence result; the low-level case requires only ZFC. No free parameters or new entities are introduced.

axioms (1)
  • domain assumption Suitable large cardinal hypotheses
    Invoked to obtain the equivalence at higher projective levels; necessity is discussed in the abstract.

pith-pipeline@v0.9.0 · 5439 in / 1153 out tokens · 34988 ms · 2026-05-16T21:32:17.489788+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages · 1 internal anchor

  1. [1]

    Bagaria and S

    J. Bagaria and S. D. Friedman, Generic absoluteness. Ann. Pure Appl. Logic 108, No. 1--3, 3--13 (2001)

    work page 2001

  2. [2]

    J. S. Bergfalk, Strong homology, derived limits, and set theory. Fundam. Math. 236, No. 1, 71--82 (2017)

    work page 2017

  3. [3]

    L. G. Brown, R. G. Douglas and P. A. Fillmore,

    work page

  4. [4]

    P. J. Cohen, The independence of the continuum hypothesis. I. Proc. Natl. Acad. Sci. USA 50, 1143--1148 (1963)

    work page 1963

  5. [5]

    P. J. Cohen, The independence of the continuum hypothesis. II. Proc. Natl. Acad. Sci. USA 51, 105--110 (1964)

    work page 1964

  6. [6]

    A. J. Dodd and R. B. Jensen, The core model. Ann. Math. Logic 20, 43--75 (1981)

    work page 1981

  7. [7]

    Farah, All automorphisms of the Calkin algebra are inner

    I. Farah, All automorphisms of the Calkin algebra are inner. Ann. Math. (2) 173, No. 2, 619--661 (2011)

    work page 2011

  8. [8]

    Q. Feng, M. Magidor and W. H. Woodin, Universally Baire sets of reals. Math. Sci. Res. Inst. Publ. 26, 203--242 (1992)

    work page 1992

  9. [9]

    Gale and F

    D. Gale and F. M. Stewart, Infinite games with perfect information. Contrib. Theory of Games, II, Ann. Math. Stud. No. 28, 245--266 (1953)

    work page 1953

  10. [10]

    L. A. Harrington, Analytic determinacy and 0^ . J. Symb. Log. 43, 685--693 (1978)

    work page 1978

  11. [11]

    Hauser, The consistency strength of projective absoluteness

    K. Hauser, The consistency strength of projective absoluteness. Ann. Pure Appl. Logic 74, No. 3, 245--295 (1995)

    work page 1995

  12. [12]

    Jech, Set theory

    T. Jech, Set theory. The third millennium edition, revised and expanded. Berlin: Springer (2003)

    work page 2003

  13. [13]

    Kanamori, The higher infinite

    A. Kanamori, The higher infinite. Large cardinals in set theory from their beginnings. 2nd ed. Berlin: Springer (2003)

    work page 2003

  14. [14]

    A. S. Kechris, Classical descriptive set theory Berlin: Springer-Verlag (1995)

    work page 1995

  15. [15]

    S. A. Kripke, An extension of a theorem of Gaifman-Hales-Solovay. Fundam. Math. 61, 29--32 (1967)

    work page 1967

  16. [16]

    R. B. Mansfield, A Souslin operation for ^1_2 . Isr. J. Math. 9, 367--379 (1971)

    work page 1971

  17. [17]

    D. A. Martin, Measurable cardinals and analytic games. Fundam. Math. 66, 287--291 (1970)

    work page 1970

  18. [18]

    D. A. Martin, Borel determinacy. Ann. Math. (2) 102, 363--371 (1975)

    work page 1975

  19. [19]

    D. A. Martin and J. R. Steel, A proof of projective determinacy. J. Am. Math. Soc. 2, No. 1, 71--125 (1989)

    work page 1989

  20. [20]

    D. A. Martin and J. R. Steel, Iteration trees. J. Am. Math. Soc. 7, No. 1, 1--73 (1994)

    work page 1994

  21. [21]

    Müller, R

    S. Müller, R. Schindler and W. H. Woodin, Mice with finitely many Woodin cardinals from optimal determinacy hypotheses. J. Math. Log. 20, Article ID 1950013, 118 p. (2020)

    work page 2020

  22. [22]

    Mycielski and H

    J. Mycielski and H. Steinhaus, A mathematical axiom contradicting the axiom of choice. Bull. Acad. Pol. Sci., Sér. Sci. Math. Astron. Phys. 10, 1--3 (1962)

    work page 1962

  23. [23]

    Neeman, Optimal proofs of determinacy

    I. Neeman, Optimal proofs of determinacy. II. J. Math. Log. 2, No. 2, 227--258 (2002)

    work page 2002

  24. [24]

    N. C. Phillips and N. Weaver,

    work page

  25. [25]

    Schimmerling, A Core Model Toolbox and Guide in: Handbook of set theory

    E. Schimmerling, A Core Model Toolbox and Guide in: Handbook of set theory. In 3 volumes. Dordrecht: Springer. 1685--1751 (2010)

    work page 2010

  26. [26]

    Shelah, Infinite Abelian groups, Whitehead problem and some constructions

    S. Shelah, Infinite Abelian groups, Whitehead problem and some constructions. Isr. J. Math. 18, 243--256 (1974)

    work page 1974

  27. [27]

    J. R. Shoenfield, The problem of predicativity. Essays Found. Math., dedicat. to A. A. Fraenkel on his 70th Anniv., 132--139 (1962)

    work page 1962

  28. [28]

    R. M. Solovay, A nonconstructible ^1_3 set of integers. Trans. Am. Math. Soc. 127, 50--75 (1967)

    work page 1967

  29. [29]

    T. M. Wilson, On forcing projective generic absoluteness from strong cardinals. preprint, https://arxiv.org/abs/1807.02206 (2018)

    work page internal anchor Pith review Pith/arXiv arXiv 2018