REVIEW 2 major objections 6 minor 19 references
Generalisations of Stationarity, Closed and Unboundedness, and of Jensen's $\Box$
T0 review · 2 major / 6 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read This paper proves that in the constructible universe, a regular cardinal reflects γ-stationary sets exactly when it is Π^1_γ-indescribable, and constructs the square sequences that witness failure.
desk verdict A serious extension of Jensen's square-based characterization, but the central transfinite theorem rests on an equivalence in the game hierarchy that is asserted rather than proved. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The central objects are $\gamma$-club and $\gamma$-stationary sets, defined by simultaneous induction: a set is $\gamma$-stationary in $\kappa$ if it meets every $\eta$-club for $\eta<\gamma$ and $\kappa$ reflects $\eta$-stationary pairs; $\Pi^1_\gamma$-formulas are defined by who wins a finite game $G_\gamma(\kappa,\phi,A)$; and a $\Box^{<\gamma}$-sequence assigns to each $\alpha$ an $\eta_\alpha<\gamma$ and an $\eta_\alpha$-club $C_\alpha\subseteq\alpha$ with coherence on derivatives. The main tool is the $\Pi^1_\gamma$-trace of a level of $L$: the set of $\beta$ where the Skolem hull collapses to a model that is $\Pi^1_\gamma$-correct over $\beta$. At a $\Pi^1_\gamma$-indescribable cardinal these traces are $\gamma$-club, which supplies the $\Box^{<\gamma}$-sequence.
What would settle it
Take $\gamma=\omega$ and in $L$ look at a regular $\kappa$ that is $n$-reflecting for every $n<\omega$ but not $\omega$-reflecting. Compute the $\Pi^1_\omega$-trace $\int_{\Pi^1_\omega}(L_{\kappa^+},\emptyset,\kappa)$: if it is not $\omega$-club, Lemma 3.22 fails and the square-sequence construction does not survive limit levels. Alternatively, if such a $\kappa$ reflected $\omega$-stationary sets while failing $\Pi^1_\omega$-indescribability, Corollary 3.25 would be false.
Extended reading notes
Core claim
Assume $V=L$. For an ordinal $\gamma<\kappa$, if $\kappa$ is $\Sigma^1_\gamma$-indescribable but not $\Pi^1_\gamma$-indescribable, then for every $\gamma$-stationary $A\subseteq\kappa$ there is a $\gamma$-stationary $E_A\subseteq A$ and a $\Box^{<\gamma}$-sequence on $\kappa$ that avoids $E_A$; consequently $\kappa$ does not reflect $\gamma$-stationary sets. The authors conclude that a regular cardinal is $\Pi^1_\gamma$-indescribable iff it reflects $\gamma$-stationary sets, generalizing Jensen's theorem for $\gamma=1$. The proof constructs the square sequence from traces of Skolem hulls in levels of $L$, using a game-based hierarchy $\Pi^1_\gamma$ to handle limit ordinals.
Load-bearing premise
The load-bearing premise is the stated but unproved identification that $\Sigma^1_\gamma$-indescribability coincides with being $\Pi^1_\eta$-indescribable for every $\eta<\gamma$; Theorem 3.24 uses it to convert failure of $\Pi^1_\gamma$ plus lower-level reflection into its hypothesis.
Editorial extensions
If this is right
- In $L$, a regular cardinal fails to reflect $\gamma$-stationary sets exactly when a $\Box^{<\gamma}$-sequence can avoid a $\gamma$-stationary set (Corollary 3.25).
- The finite-level version recovers Jensen's square-based characterization of $\Pi^1_{n+1}$-indescribables (Theorem 3.2), and restricting a $\Box^{<\gamma+1}$-sequence to $d_\gamma(\kappa)$ yields a $\Box^\gamma$-sequence (Proposition 3.30).
- At a $\Pi^1_\gamma$-indescribable $\kappa$, the $\gamma$-club filter coincides with the $\Pi^1_\gamma$-indescribability filter (Corollary 3.36), so Fodor's lemma and Solovay-style splitting hold for $\gamma$-stationary sets.
- If the relevant $\gamma$-club filters are normal, $\gamma$-stationarity is downward absolute to $L$, so a $\gamma$-reflecting cardinal satisfying mild assumptions is at least $\Sigma^1_\gamma$-indescribable in $L$ (Theorem 4.5, Corollary 4.8).
- $\gamma$-ineffability is downward absolute to $L$ (Theorem 5.11), and in $L$ the generalized $\Diamond^*_\gamma$ holds exactly when $\kappa$ is $\gamma$-stationary and not $\gamma$-ineffable, for successor $\gamma$ (Corollary 5.23).
Reading between the lines
- If the identification of $\Sigma^1_\gamma$-indescribability with lower-level $\Pi^1_\eta$-indescribability is correct, the main theorem gives a complete analogue of Jensen's characterization; if not, it only covers cardinals that satisfy the stronger lower-level condition and fail $\Pi^1_\gamma$.
- The same trace-and-square machinery could be tried outside $L$: a forcing construction adding a $\Box^{<\gamma}$-sequence that avoids a $\gamma$-stationary set would show that failure of $\gamma$-reflection need not imply failure of $\Pi^1_\gamma$-indescribability.
- The limit-level behaviour of $\Diamond^*_\gamma$ suggests that $\omega$-ineffability is strictly weaker than $\Pi^1_\omega$-indescribability; one could test whether a model with an $\omega$-ineffable but not $\omega$-reflecting cardinal exists.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. This paper introduces transfinite hierarchies of γ-club and γ-stationary sets, defines Π^1_γ and Σ^1_γ indescribability via the Qγ games of Sharpe and Welch, and uses them to formulate square-like principles ✷γ and ✷<γ. The main theorem (Theorem 3.24) constructs, under V=L, a ✷<γ-sequence avoiding a γ-stationary set at a cardinal that is Σ^1_γ- but not Π^1_γ-indescribable; Corollary 3.25 then claims the L-characterization that a regular cardinal is Π^1_γ-indescribable iff it reflects γ-stationary sets. The paper also proves splitting theorems, downward absoluteness of γ-stationarity under appropriate filter-normality assumptions, and generalizations of ineffability and diamond principles, including characterizations in L.
Significance. If the main theorem is correct, it is a genuine transfinite extension of Jensen's square-based characterization of weak compactness, and the new ✷-sequences provide combinatorial witnesses for the failure of γ-reflection. The trace/filtration machinery is coherent and the proofs are detailed and largely self-contained. The paper also gives useful conditional results on downward absoluteness and on γ-ineffability, with explicit connections to Magidor's work. However, one load-bearing equivalence is asserted without proof, and until it is supplied the central characterization is not fully established.
major comments (2)
- [§3.4, Theorem 3.24] The parenthetical identification of "κ is Σ^1_γ-indescribable" with "κ is Π^1_η-indescribable for every η<γ" is asserted but not proved. Under Definitions 3.15–3.18 this is a substantive statement about the Qγ games, not the classical finite alternation equivalence, and no padding or unwinding argument is given. This identification is used essentially in the proof of Corollary 3.25, where γ-reflection (and hence η-reflection for every η<γ) is converted into the Σ^1_γ hypothesis of Theorem 3.24, and also inside the proof of Lemma 3.22 when the induction hypothesis is applied. A proof of both directions, or a citation to a definitionally matching result, is required; without it, Corollary 3.25 is established only for cardinals satisfying the stronger conjunct of Π^1_η-indescribability for every η<γ.
- [§3.3.1, Lemma 3.22] In the proof of Lemma 3.22, after showing that the collapsed level Lνβ reflects Π^1_γ statements, the text says "As for γ′<γ, Π^1_{γ′} sentences are also Π^1_γ, we have the other direction by induction." For the game-based hierarchy this is not automatic: the converse direction requires showing that if Lνβ satisfies the Π^1_η-winning condition of a lower-level game, then the real V also satisfies it, which is exactly the kind of transfinite induction that the unproved equivalence in Theorem 3.24 is meant to supply. This step is necessary for full Π^1_γ-correctness of the collapsed models and hence for the trace Lemma 3.29, so it cannot remain a one-line assertion.
minor comments (6)
- [§3.4, Corollary 3.25] The derivation of Corollary 3.25 from Theorem 3.24 is only announced with "and conclude"; please include the short explicit argument, since this is the central characterization of the paper.
- [§3.5.2, Corollary 3.39] Corollary 3.39 states that a γ+1-stationary set can be split into κ many disjoint γ-stationary sets, but the proof via Theorem 3.38 actually yields κ many disjoint γ+1-stationary sets; the statement should presumably say γ+1-stationary.
- [§5.2, Proposition 5.20] Proposition 5.20 is stated for ♦γ, but the proof and Corollary 5.21 concern ♦∗; the statement should be about ♦∗γ, otherwise the proof does not match the claim.
- [§5.2, Theorem 5.25] In the paragraph before Theorem 5.25, the text says "♦γ+1 κ implies ♦γ+1 κ"; this appears to be missing a star and should presumably read "♦∗γ+1 κ implies ♦γ+1 κ".
- [p. 3 and p. 20, footnotes] The claims that the game-based Π^1_γ notion should be equivalent to Bagaria's alternative definition, and that the proof of Theorem 3.24 would work with his definition, are unproved. Please either provide a precise equivalence proof or mark the comparison as conjectural.
- [Notation] There are a few minor typographical slips: in Lemma 3.10 the final expression "Lα" should presumably be "Lν", and Section 3.3.1 refers to "Definitions 3.15, 3.16 and 3.21" although Definition 3.21 is not present in the text.
Circularity Check
No circularity: the square-sequence construction is genuine; the unproved Σ^1_γ/Π^1_η identification is a correctness gap, not a circular step.
full rationale
The paper's derivation is self-contained in the sense relevant to circularity. Theorem 3.24 is proved by a genuine fine-structural construction: the □^{<γ}-sequence is built from traces ∫_{ηα}(L_{να},p_α,α), and the proof that E_A is γ-stationary (Lemma 3.28) is a separate argument using the H-witness set; neither the square sequence nor E_A is a restatement of the conclusion. The lower levels are used only as an induction hypothesis, not as the target result. The finite case (Theorem 3.2) is likewise a genuine construction. There are no fitted parameters and no data-dependent predictions. The one point that invites suspicion is the parenthetical in Theorem 3.24, 'Σ^1_γ-indescribable (i.e. Π^1_η-indescribable for every η<γ)', and the footnote that the authors' Π^1_γ 'should be equivalent' to Bagaria's notion. This identification is asserted, not proved, and it is used in Lemma 3.22 and in deriving Corollary 3.25. On inspection, however, this is an unproved equivalence between game-defined notions, not a definitional reduction: Definition 3.16 defines Σ^1_γ independently via the game G_γ, and the 'i.e.' is presented as a fact about that definition. If the equivalence fails, Corollary 3.25 is only conditional, but that is a correctness or missing-proof issue, not a circularity in the sense of the target result being assumed as an input.
Assumptions & free parameters
assumptions (5)
- standard math ZFC
- domain assumption V=L for the main constructibility theorems
- standard math Standard condensation and Skolem-hull facts for levels of L
- ad hoc to paper Sigma^1_gamma-indescribable is equivalent to Pi^1_eta-indescribable for every eta<gamma
- domain assumption Determinacy of the finite games G_gamma
invented entities (2)
-
γ-club and γ-stationary sets
-
Box^<gamma and Box^gamma square sequences
Cite this review
Pith. "Pith review of Generalisations of Stationarity, Closed and Unboundedness, and of Jensen's $\Box$." pith.science (2026). https://pith.science/paper/M7XRH4KA
@misc{pith2026190805920,
author = {Pith},
title = {Pith review of: Generalisations of Stationarity, Closed and Unboundedness, and of Jensen's $\Box$},
year = {2026},
howpublished = {\url{https://pith.science/paper/M7XRH4KA}},
note = {Machine review of arXiv:1908.05920}
}
abstract
The concepts of closed unbounded (club) and stationary sets are generalised to $\gamma$-club and $\gamma$-stationary sets, which are closely related to stationary reflection. We use these notions to define generalisations of Jensen's combinatorial principles {$\Box$} and $\diamondsuit$. We define $\Pi^1_\gamma$-indescribability and use the new $\Box^{\gamma}$-sequences to extend the result of Jensen that in the constructible universe a regular cardinal is stationary reflecting if and only if it is $\Pi^1_1$-indescribable: we show that in $L$ a cardinal is $\Pi^{1}_{\gamma} $-indescribable iff it reflects $\gamma$-stationary sets. More particularly (stating only the special case of $n$ finite): Theorem $(V=L)$ Let $n<\omega$ and $\kappa$ be $\Pi^{1}_{n}$-indescribable but not $\Pi^1_{n+1}$-indescribable, and let $A\subseteq\kappa$ be $n+1$-stationary. Then there are $E_{A}\subseteq A$ and a $\Box^{n}$-sequence $S$ on $\kappa$ such that $E_{A}$ is $n+1$-stationary in $\kappa$ and $S$ avoids $E_{A}$. Thus $\kappa$ is not $n+1$-reflecting. Certain assumptions on the $\gamma$-club filter allow us to prove that $\gamma$-stationarity is downwards absolute to $L$, and allows for splitting of $\gamma$-stationary sets. We define $\gamma$-ineffability, and look into the relation between $\gamma$-ineffability and various $\diamondsuit$ principles; we show that $\gamma$-ineffability is downward absolute to $L$.
Reference graph
Works this paper leans on
-
[1]
J. B AGARIA , M. M AGIDOR , and H. S AKAI , Reflection and Indescribability in the Constructible Universe, Israel Journal of Mathematics, vol. 208 (2015), no. 1, pp. 1–11
work page 2015
-
[2]
J OAN BAGARIA , Derived topologies on ordinals and stationary reflection , Transactions of the AMS , vol. 371 (2019), pp. 1981–2002
work page 2019
-
[3]
L EV BEKLEMISHEV and D AVID GABELAIA , Topological interpretations of provability logic , Leo esakia on duality in modal and intuitionistic logics , Springer, 2014, pp. 257–290. GENERALISA TIONS OF STA TIONARITY , CLOSED AND UNBOUNDEDNESS, AND OF JENSEN’S ✷ 49
work page 2014
-
[4]
A ARON BELLER and A MI LITMAN , A strengthening of Jensen’s ✷ principles, The Journal of Sym- bolic Logic, vol. 45 (1980), no. 02, pp. 251–264
work page 1980
-
[5]
O MER BEN -N ERIA , Diamonds, compactness, and measure sequences , Journal of Mathematical Logic, vol. 19 (2019), no. 1
work page 2019
-
[6]
B RENT CODY, Adding a non-reflecting weakly compact set , arXiv preprint arXiv:1701.04358 , (2017)
work page Pith review arXiv 2017
-
[7]
K. D EVLIN , Constructibility, Perspectives in Mathematical Logic, Springer V erlag, Ber lin, Heidel- berg, 1984
work page 1984
-
[8]
134, Suomalainen Tiedeakatemia, 2003
A LEX HELLSTEN , Diamonds on large cardinals , vol. 134, Suomalainen Tiedeakatemia, 2003
work page 2003
Show all 19 references
-
[9]
J ECH , Set theory, 3 ed., Springer Monographs in Mathematics, Springer, Berl in, New Y ork, 2003
T. J ECH , Set theory, 3 ed., Springer Monographs in Mathematics, Springer, Berl in, New Y ork, 2003
2003
-
[10]
R. B. J ENSEN , The fine structure of the constructible hierarchy , Annals of Mathematical Logic , vol. 4 (1972), pp. 229–308
1972
-
[11]
A KIHIRO KANAMORI , The higher infinite: large cardinals in set theory from their beginnings, Springer Science & Business Media, 2008
2008
-
[12]
43 (1978), no
K ENNETH KUNEN , Saturated ideals, The Journal of Symbolic Logic, vol. 43 (1978), no. 01, pp. 65– 76
1978
-
[13]
165 (2014), no
C HRIS LAMBIE -H ANSON , Squares and covering matrices, Annals of Pure and Applied Logic , vol. 165 (2014), no. 2, pp. 673–694
2014
-
[14]
47 (1982), no
M ENACHEM MAGIDOR , Reflecting stationary sets , The Journal of Symbolic Logic , vol. 47 (1982), no. 04, pp. 755–771
1982
-
[15]
every stationary set re- flects
A LAN H M EKLER and S AHARON SHELAH , The consistency strength of “every stationary set re- flects” , Israel Journal of Mathematics, vol. 67 (1989), no. 3, pp. 353–366
1989
-
[16]
R-D S CHINDLER , Set theory exploring independence and truth , Universitext, Springer-V erlag, 2014
2014
-
[17]
S HARPE and P.D
I. S HARPE and P.D. W ELCH , Greatly Erd˝ os cardinals and some generalizations to the Ch ang and Ramsey proerties, Annals of Pure and Applied Logic , vol. 162 (2011), pp. 863–902
2011
-
[18]
1, 1971, pp
R OBERT M S OLOVAY, Real-valued measurable cardinals , Axiomatic set theory , vol. 1, 1971, pp. 397–428
1971
-
[19]
32 (1993), no
W ENZHI SUN, Stationary cardinals, Archive for Mathematical Logic, vol. 32 (1993), no. 6, pp. 429– 442. E-mail: hazel.brickhill@bristol.ac.uk, p.welch@bristol.ac.u k SCHOOL OF MA THEMA TICS, UNIVERSITY OF BRISTOL, BRISTOL, BS8 1TW, ENGLAND
1993
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.