Higher limits of wider systems

Jeffrey Bergfalk; Matteo Casarosa

REVIEW 3 major objections 5 minor 1 cited by

Higher limits of wider systems

T0 review · 3 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Under the generalized continuum hypothesis and diamond principles, the higher derived limits of the inverse systems $A_\lambda$ are simultaneously nonzero exactly where Goblot's vanishing theorem permits.

desk verdict Theorem A is a clean new counterexample, but Theorem B rests on Lemma 4.8, whose key 'similar argument' is not just omitted but looks false for natural choices of the fixed specializing function and enumeration. read the letter →

arxiv 2507.05471 v1 pith:4SK7SUU4 submitted 2025-07-07 math.LO math.KT

Jeffrey Bergfalk , Matteo Casarosa This is my paper · ORCID

classification math.LOmath.KT MSC 03E3503E7518G10

keywords derivedlimitsinversesystemsadditivitynontrivialcoherenceconstructibleuniversediamondprinciplesAronszajntreestwistablesets

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper studies the inverse systems $A_\lambda$, the most basic nontrivial towers of abelian groups indexed by functions from a cardinal $\lambda$ to the natural numbers. It proves that, assuming the generalized continuum hypothesis and the diamond principles $\diamondsuit(S_{i+1}^i)$ for all positive $i$, the $(n+1)$-st derived limit of $A_\lambda$ vanishes precisely when $\lambda < \aleph_n$, for every $n$. Thus all higher derived limits are simultaneously nonzero in every instance not ruled out by Goblot's vanishing theorem, and this maximal nonvanishing is actual in the constructible universe $L$. This settles in the negative a long-standing question about whether the additivity of $\lim^1$ over sums of towers extends to higher degrees, and it matters because these derived limits control the additivity of strong homology and appear in condensed mathematics.

What carries the argument

The load-bearing device is a filtration of the poset $(\omega_n^\omega, \leq^*)$ into order-ideals $P_\alpha$, each equipped with a 'strong $n$-unbounded pair' $(P_\alpha,Q_\alpha)$ whose second component is drawn from the images of branches of a special $\omega_{n+1}$-Aronszajn tree (Lemma 4.8). Together with the notion of a $k$-twistable set---a subset of the grid $\omega_n \times \omega$ just large enough to support nontrivial $k$-coherence but small enough to be coded by diamond sequences---this gives the recursion that builds an $(n+1)$-coherent family that no globally defined trivialization can trivialize.

What would settle it

Examine the construction in Lemma 4.8 for a specific $n$, say $n=1$, under GCH: compute the sets $Q_\alpha = H[\{x \in T' : \mathrm{ht}_{T'}(x) \text{ is a limit and } x <_T y_\alpha\}]$ and check whether some function $g \in P_\alpha$ is $\leq^*$-above every member of $Q_\alpha$. If such a $g$ exists for any $\alpha \in S^2_1$, the lemma fails and the proof of Theorem B breaks. Alternatively, in a model of GCH plus $\diamondsuit(S_{i+1}^i)$, compute $\lim^{n+1} A_{\aleph_n}$ directly via the $n$-coherent family characterization of Proposition 2.6; if the quotient group vanishes for some $n$, Theorem B is false.

Watch

Extended reading notes

Core claim

The central discovery is that the 'wider systems' $A_\lambda$ can realize the maximal possible pattern of nonvanishing: for each degree $n>0$, $\lim^{n+1} A_\lambda = 0$ exactly when $\lambda < \aleph_n$, under GCH plus $\diamondsuit(S_{i+1}^i)$ for $i>0$. In the constructible universe these hypotheses hold, so there the derived limits of every $A_\lambda$ are nonzero except where Goblot's vanishing theorem forces them to vanish. The proof constructs nontrivial $(n+1)$-coherent families indexed by the function space $(\omega_n^\omega, \leq)$, using a filtration by ideals derived from branches of a special $\omega_{n+1}$-Aronszajn tree, and kills all putative trivializations by a diamond-guided recursion over 'twistable' sets.

Load-bearing premise

The entire witness construction for Theorem B rests on Lemma 4.8, which asserts that under GCH the function space $(\omega_n^\omega, \leq^*)$ admits a filtration by ideals $P_\alpha$ with associated 'strong $n$-unbounded pairs' $(P_\alpha,Q_\alpha)$ coming from branches of a special $\omega_{n+1}$-Aronszajn tree; the proof's key claim that each $Q_\alpha$ is unbounded in $P_\alpha$ is only sketched as 'a similar argument', and if that unboundedness fails, the construction in Sections 5--7 collapses.

Editorial extensions

If this is right

If Theorem B is correct, the additivity implication '$\lim^1 A_{\aleph_0}=0 \Rightarrow \lim^1 A_\lambda=0$ for all $\lambda$' fails in every higher degree: for each $n>1$ there is a model with $\lim^{n+1} A_{\aleph_0}=0$ yet $\lim^{n+1} A_{\aleph_n} \neq 0$.
The functor $\lim^{n+1}: \mathrm{Pro}(\mathrm{Ab}) \to \mathrm{Ab}$ is not additive over arbitrary sums of towers in any degree $n \geq 1$, and the failure is simultaneous across all degrees in a single model ($L$).
Goblot's vanishing theorem is sharp for all $A_\lambda$ in $L$: every derived limit not forced to zero by cofinality and surjectivity is actually nonzero.
The results also answer the $\Omega_\lambda$-system variants recorded as [Ban23, Questions 7.4 and 7.5].
A positive solution to Question 8.1 (consistency of all $\lim^n A_\lambda = 0$) must avoid the tree-filtration structure presented here, which is a new constraint on any such model.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The tree-filtration machinery likely transfers to other index posets with similar Aronszajn-tree structure, so the maximal nonvanishing pattern may be a general phenomenon for wide towers rather than a peculiarity of $A_\lambda$.
The proof's reliance on full diamond can probably be weakened to weak diamond $w\diamondsuit$, as the paper notes for Theorem 7.1, which would spread the same nonvanishing pattern to models with weaker guessing principles.
Testable robustness check: force over a GCH model to kill the diamond principles (for instance, by adding Cohen reals) and compute $\lim^2 A_{\aleph_1}$; Theorem A suggests CH alone might keep the nonvanishing for degree 2, and the higher degrees may behave similarly.
Should Lemma 4.8's unboundedness claim be provable without diamond, the maximal nonvanishing would follow from GCH alone, sharpening the boundary between ZFC consequences and additional set-theoretic hypotheses.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

The paper answers real open questions, and the answer is likely of interest, but the main theorem's proof has a gap at Lemma 4.8 that I don't see how to close from the text.

What is genuinely new: Theorem A gives the first counterexample to the degree-1 additivity theorem in degree 2, under CH, by a relatively transparent forcing argument. That alone is a worthwhile result. Theorem B aims much higher: simultaneous nonvanishing in all degrees, with Goblot-optimal bounds, and a corollary in L. The twistable-sets machinery in Sections 5–6 is an interesting and genuinely novel device for handling the coding difficulties that arise in wide inverse systems. Conditional on Lemma 4.8, the induction in Sections 6–7 is structurally coherent and the dependence on diamond principles is stated precisely.

The soft spot is exactly Lemma 4.8. Its item (3) claims the existence of strong n-unbounded pairs (P_α, Q_α), and the proof reaches this through a 'similar argument' that H[C] is ≤*-unbounded in P_α for a chain C of limit-of-limits ordertype. That argument is not supplied, and the stress-test objection lands. Since P_α is the ideal generated by H[T'↾α] together with e[α], and e is a bijection onto all of ω_n^ω, there is every opportunity for P_α to contain a function like the characteristic function of a block B_β that is never activated by F on the chain below y_α. For such β, every H(x) with x < y_α is identically zero on B_β, so no element of Q_α dominates that function. The proof does not force F to be surjective on chains; specializing functions can easily miss a block. So the unboundedness assertion is not just underproved; it appears false for some admissible choices of e and F. This is load-bearing: without (P_α, Q_α) being genuinely unbounded, the witness construction in Section 7 does not go through.

Smaller issues: Theorem A's proof leaves the verification that the constructed assignments 2-cohere to the reader, and Lemma 6.2 does the same. These are less serious, but they add up to a paper that is harder to certify than it should be.

The citation pattern looks appropriate; the paper engages thoroughly with the prior literature and the open questions are real. The authors are not overclaiming—the statements are precise and the auxiliary hypotheses are explicit.

This is a serious paper with a possibly repairable central construction. I would send it to a knowledgeable referee, with specific instructions to scrutinize Lemma 4.8. As it stands, the proof of Theorem B is incomplete and may be wrong.

Referee Report

3 major / 5 minor

Summary. The manuscript studies the inverse systems A_λ indexed by functions λ→ω and their higher derived limits lim^n A_λ. The main results are Theorem A, which under CH produces a forcing extension where lim^2 A_{ℵ_0}=0 and lim^2 A_{ℵ_1}≠0, and Theorem B, which under GCH plus diamond principles ♢(S_{i+1}^i) for positive i<ω asserts that lim^{n+1} A_λ=0 if and only if λ<ℵ_n for every n<ω and every cardinal λ. A corollary states that in Gödel's constructible universe these derived limits are nonvanishing in every instance not prohibited by Goblot's vanishing theorem. The proof of Theorem B proceeds through a tree-indexed filtration of (ω_n^ω,≤*) built from a special ω_{n+1}-Aronszajn tree, the notion of twistable sets, and a diamond-based induction that negates all putative trivializations.

Significance. If the proof is completed, Theorem B resolves open questions recorded in [Ber17] and [Ban23] and shows that, consistently, the groups lim^{n+1} A_λ are simultaneously nonvanishing wherever Goblot's theorem permits. The paper develops a genuinely nonlinear construction technique, using special Aronszajn trees rather than chains; Lemma 4.4 explains why linear spines cannot suffice under GCH. The statements are precise, the hypotheses are explicit, and the paper makes clear which auxiliary set-theoretic principles are used. The main concern is that a central structural lemma, Lemma 4.8, has a substantial gap in the proof of the unboundedness of the auxiliary sets Q_α, and the argument as written does not establish that claim.

major comments (3)

[§4, Lemma 4.8] The proof of item (3), that each (P_α,Q_α) is a strong n-unbounded pair, is incomplete. After verifying that H(x)∉P_α for limit-height x, the text says: 'a similar argument shows that if C⊆T′ is a chain of limit-of-limits ordertype then H[C] is ≤∗-unbounded in P_α.' The preceding argument does not show this: it only shows that each individual H(x) is outside the ideal P_α generated by earlier H-images and e[α]; it does not show that every p∈P_α is ≤∗ some H(x) with x∈C. In fact, because P_α is generated by e[α] and e is an arbitrary bijection ω_{n+1}→ω_n^ω, there can be blocks B_β that are not activated below y_α; for such β every q∈Q_α is identically zero on B_β, so q cannot ≤∗-dominate a generator e(γ) whose support is contained in B_β. The unboundedness claim therefore needs a proof that uses specific properties of the choice of e, of the branch below y_α, and of the functions G_ξ. This is load-bearing: Lemma 5.10 and the whole witness construction in Section 7 require Q_α to be ≤∗-unbounded in P_α.
[§3, proof of Theorem A] The construction of the condition r, after equations (1)–(3), ends with 'the verification that these assignments indeed 2-cohere, are left to the reader.' This is not a peripheral detail: r must be a condition in the poset P, and the contradiction argument in Claim 3.2 relies on r being a 2-coherent family indexed by the ∨-closure of E_q∪{g}. The coherence equations (1) and (3) are only a subset of the required cocycle conditions; the full verification for the remaining multi-indices should be supplied or reduced to a stated lemma.
[§7, Theorem B vs. Theorem 7.1] Theorem 7.1 proves lim^{n+1} A_{ℵ_n}≠0 under the stated hypotheses, but Theorem B asserts an equivalence for every cardinal λ. The text says only that Theorem 7.1 'implies Theorem B,' without giving the reduction for λ>ℵ_n. If the intended argument is that A_{ℵ_n} is a retract of A_λ via the order-preserving extension of functions by zero on λ\ℵ_n, that argument should be stated and checked; as written, the 'if and only if' for all cardinals λ is not established by the proof in Section 7.

minor comments (5)

[§6, Lemma 6.2] The proof of Lemma 6.2 is left to the reader, although the lemma is invoked in the nontriviality arguments of both Theorem 6.5 and Theorem 7.1. The verification is indeed routine, but it should be included for completeness.
[§5, Definition 5.2] The notation S(E↾α) in item (3) of Definition 5.2 is not defined. It appears to denote the union of the sets in the sequence E↾α; this should be stated explicitly.
[§7, Claim 7.2] In the sentence 'since Υ_0 and Υ_1 agree on Q(k)_α', the superscript should be n, not k; the two families are assumed to agree on Q(n)_α.
[§4, Lemma 4.8] The notation 'H[T′↾(Λ_n∩ω_n·α)]' is confusing because T′ is already a restriction of T to Λ_n; it would help to define T′↾α as the set of nodes of T′ of height below α.
[§7, Theorem 7.1] The hypotheses of Theorem 7.1 include ♢(S_{i+1}^i) for all i≤n, while Theorem B needs it only for positive i; the proof itself uses the diamond-free base case T(1). The authors note this in the text, but the formal statement could be aligned with the optimal hypothesis.

Circularity Check

0 steps flagged · score 2.0 of 10

No significant circularity: the nonvanishing constructions are derived from GCH, diamond, and standard tools; the only self-citation is a non-load-bearing aside.

full rationale

The central derivation is self-contained in the relevant sense. No parameter is fitted to a subset of data, and no target vanishing or nonvanishing statement is assumed among the hypotheses. Theorem B's vanishing direction is Goblot's vanishing theorem, an external standard result; the nonvanishing direction is the explicit construction of nontrivial n-coherent families in Theorems 6.5 and 7.1, built from GCH, diamond principles, Specker's special Aronszajn trees, and the coherence/cocycle translation of Proposition 2.6. The witnesses are produced by recursion on the tree and are made nontrivial by diamond-guessing against all coded trivializations; Claim 7.2 computes the algebraic contradiction explicitly, so the final nontriviality is not a restatement of any lemma's input. The only self-citation in the proof chain is the aside near the start of Section 7 that weak diamond principles suffice by running the argument of [Cas24, Claim 4.11]; since Theorem B and Theorem 7.1 assume ordinary diamond principles and the diagonalization is otherwise written out, this self-citation is not load-bearing. There is a genuine omitted proof in Lemma 4.8: the claim that H[C] is <=*-unbounded for a chain of limit-of-limits ordertype is dismissed with 'a similar argument shows', and a skeptical scenario involving blocks B_beta never activated below y_alpha would threaten that unboundedness. That is a correctness gap in a structural lemma, not circularity; Lemma 4.8's hypotheses do not contain the derived-limit conclusion, and no equation reduces the theorem to its own input. Score 2 reflects the minor non-load-bearing self-citation, not a circular derivation.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The central claims are consistency theorems built from standard set-theoretic hypotheses; no free parameters are fitted and no new mathematical entities beyond the constructed coherent families and tree filtrations are introduced.

assumptions (5)

standard math ZFC as the background set theory
All consistency and implication proofs are carried out in ZFC, with additional hypotheses stated explicitly.
domain assumption Continuum hypothesis (CH) in the ground model for Theorem A
Used in the proof of Theorem A to ensure lim^2 A_ℵ0 = 0 in the ground model and that the set B of bounded-support functions has size ℵ1.
domain assumption GCH and diamond principles ♢(S_{i+1}^i) for positive i<ω for Theorem B
These are the consistency hypotheses under which Theorem B and Corollary C are proved; the paper notes they hold in Gödel's constructible universe L.
standard math Goblot's vanishing theorem
Used throughout to obtain vanishing bounds and to trivialize coherent families at successor steps; cited from [Gob70] and [VV24].
standard math Specker's construction of special λ+-Aronszajn trees from GCH
Used in Lemma 4.8 to obtain the filtered tree structure underlying the proof of Theorem B; cited from [Spe49].

how reviews work

0 comments

Cite this review

Pith. "Pith review of Higher limits of wider systems." pith.science (2026). https://pith.science/paper/4SK7SUU4

@misc{pith2026250705471,
  author       = {Pith},
  title        = {Pith review of: Higher limits of wider systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4SK7SUU4}},
  note         = {Machine review of arXiv:2507.05471}
}

abstract

Write $\mathbf{A}_\lambda$ for what might be described as the most elementary nontrivial inverse system of abelian groups indexed by the functions from the cardinal $\lambda$ to the set of natural numbers. The question of whether for any fixed $n$ the derived limit $\mathrm{lim}^n\,\mathbf{A}_\lambda$ may vanish for only a nonempty subset of the class of infinite cardinals $\lambda$ is recorded in both [Be17] and [Ban23], and bears closely on several related further ones. We answer this question in the affirmative; in fact, we show the maximal possibility, namely that this can simultaneously happen in every degree $n>1$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Infinitary combinatorics in condensed math and strong homology
math.AT 2024-12 conditional novelty 6.0 of 10

Higher derived limits of the systems A_kappa_lambda are shown to control non-fullness, non-additivity of strong homology, and non-compactness of products of compact projective condensed anima.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages · cited by 1 Pith paper

[1]

Nathaniel Bannister , Additivity of derived limits in the Cohen model , to appear in Israel J.\ of Math., 2023, preprint available at arXiv:2302.07222

work page Pith review arXiv 2023
[2]

, All you need is A_ , arXiv e-prints (2025), arXiv:2506.14185

work page arXiv 2025
[3]

, Nonvanishing Higher Derived Limits without w _ _1 , arXiv e-prints (2025), arXiv:2506.14183

work page Pith review arXiv 2025
[4]

Nathaniel Bannister, Jeffrey Bergfalk, and Justin Tatch Moore, On the additivity of strong homology for locally compact separable metric spaces, Israel J. Math. 255 (2023), no. 1, 349--381. 4619540

work page 2023
[5]

Nathaniel Bannister, Jeffrey Bergfalk, Justin Tatch Moore, and Stevo Todorcevic, A descriptive approach to higher derived limits, Journal of the E uropean M athematical S ociety (2024)

work page 2024
[6]

Jeffrey Bergfalk, Strong homology, derived limits, and set theory, Fund. Math. 236 (2017), no. 1, 71--82. 3577392

work page 2017
[7]

Jeffrey Bergfalk, Michael Hru s \' a k, and Chris Lambie-Hanson, Simultaneously vanishing higher derived limits without large cardinals, J. Math. Log. 23 (2023), no. 1, Paper No. 2250019, 40. 4568267

work page 2023
[8]

Jeffrey Bergfalk and Chris Lambie-Hanson , Infinitary combinatorics in condensed math and strong homology , arXiv e-prints (2024), arXiv:2412.19605

work page Pith review arXiv 2024

Show all 21 references

[9]

Pi 9 (2021), Paper No

Jeffrey Bergfalk and Chris Lambie-Hanson, Simultaneously vanishing higher derived limits, Forum Math. Pi 9 (2021), Paper No. e4, 31. 4275058

2021
[10]

Matteo Casarosa , Nonvanishing derived limits without scales , arXiv e-prints (2024), arXiv:2404.08983

2024 arXiv
[11]

Matteo Casarosa and Chris Lambie-Hanson , Simultaneously nonvanishing higher derived limits , arXiv e-prints (2024), arXiv:2411.15856

2024 arXiv
[12]

Vaughan, Strong homology and the proper forcing axiom, Proc

Alan Dow, Petr Simon, and Jerry E. Vaughan, Strong homology and the proper forcing axiom, Proc. Amer. Math. Soc. 106 (1989), no. 3, 821--828. 961403

1989
[13]

A pplications aux modules , Bull

R\' e mi Goblot, Sur les d\' e riv\' e s de certaines limites projectives. A pplications aux modules , Bull. Sci. Math. (2) 94 (1970), 251--255. 274557

1970
[14]

Shizuo Kamo, Almost coinciding families and gaps in P( ) , J. Math. Soc. Japan 45 (1993), no. 2, 357--368. 1206659

1993
[15]

3, 129--146

J Donald Monk, On general boundedness and dominating cardinals, Notre Dame Journal of Formal Logic 45 (2004), no. 3, 129--146

2004
[16]

Marde s i\' c and A

S. Marde s i\' c and A. V. Prasolov, Strong homology is not additive, Trans. Amer. Math. Soc. 307 (1988), no. 2, 725--744. 940224

1988
[17]

Specker, Sur un probl\`eme de S ikorski , Colloq

E. Specker, Sur un probl\`eme de S ikorski , Colloq. Math. 2 (1949), 9--12. 39779

1949
[18]

84, American Mathematical Society, Providence, RI, 1989

Stevo Todorcevic, Partition problems in topology, Contemporary Mathematics, vol. 84, American Mathematical Society, Providence, RI, 1989. 980949

1989
[19]

, The first derived limit and compactly F_ sets , J. Math. Soc. Japan 50 (1998), no. 4, 831--836. 1643351

1998
[20]

263, Birkh\"auser Verlag, Basel, 2007

, Walks on ordinals and their characteristics, Progress in Mathematics, vol. 263, Birkh\"auser Verlag, Basel, 2007. 2355670

2007
[21]

Boban Veli c kovi\' c and Alessandro Vignati, Non-vanishing higher derived limits, Commun. Contemp. Math. 26 (2024), no. 7, Paper No. 2350031, 22. 4760549

2024

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.

[1] [1]

Nathaniel Bannister , Additivity of derived limits in the Cohen model , to appear in Israel J.\ of Math., 2023, preprint available at arXiv:2302.07222

work page Pith review arXiv 2023

[2] [2]

, All you need is A_ , arXiv e-prints (2025), arXiv:2506.14185

work page arXiv 2025

[3] [3]

, Nonvanishing Higher Derived Limits without w _ _1 , arXiv e-prints (2025), arXiv:2506.14183

work page Pith review arXiv 2025

[4] [4]

Nathaniel Bannister, Jeffrey Bergfalk, and Justin Tatch Moore, On the additivity of strong homology for locally compact separable metric spaces, Israel J. Math. 255 (2023), no. 1, 349--381. 4619540

work page 2023

[5] [5]

Nathaniel Bannister, Jeffrey Bergfalk, Justin Tatch Moore, and Stevo Todorcevic, A descriptive approach to higher derived limits, Journal of the E uropean M athematical S ociety (2024)

work page 2024

[6] [6]

Jeffrey Bergfalk, Strong homology, derived limits, and set theory, Fund. Math. 236 (2017), no. 1, 71--82. 3577392

work page 2017

[7] [7]

Jeffrey Bergfalk, Michael Hru s \' a k, and Chris Lambie-Hanson, Simultaneously vanishing higher derived limits without large cardinals, J. Math. Log. 23 (2023), no. 1, Paper No. 2250019, 40. 4568267

work page 2023

[8] [8]

Jeffrey Bergfalk and Chris Lambie-Hanson , Infinitary combinatorics in condensed math and strong homology , arXiv e-prints (2024), arXiv:2412.19605

work page Pith review arXiv 2024