pith. sign in

arxiv: 2606.28844 · v1 · pith:TLYHMBFOnew · submitted 2026-06-27 · 🧮 math.LO · math.CO

A solution to Ditor's problem

Lorenzo Notaro This is my paper

Pith reviewed 2026-06-30 08:41 UTC · model grok-4.3

classification 🧮 math.LO math.CO
keywords Ditor's problemn-ladderMahlo cardinalequiconsistencylatticeset theorycardinality boundindependence
5
0 comments X

The pith

The nonexistence of a 3-ladder of cardinality ℵ₂ is equiconsistent with a Mahlo cardinal.

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

Ditor defined an n-ladder as a lower finite lattice in which every element has at most n lower covers. He proved that any such lattice has size at most ℵ_{n-1} and showed the bound is sharp for n=1 and n=2. The paper resolves the open case for n=3 by proving that a 3-ladder of size ℵ₂ exists in some models of ZFC but fails to exist in others. The nonexistence statement is shown to be consistent if and only if a Mahlo cardinal is consistent. This establishes that Ditor's sharpness question for n=3 is independent of ZFC.

Core claim

We show that the nonexistence of a 3-ladder of cardinality ℵ₂ is equiconsistent with a Mahlo cardinal.

What carries the argument

An n-ladder, defined as a lower finite lattice whose elements have at most n lower covers; the equiconsistency argument relates the possible sizes of 3-ladders to the consistency strength of Mahlo cardinals.

If this is right

  • There exist models of ZFC containing no 3-ladder of cardinality ℵ₂.
  • There exist models of ZFC containing a 3-ladder of cardinality ℵ₂.
  • The upper bound of ℵ₂ for 3-ladders is not forced by ZFC.
  • The consistency strength of the nonexistence statement is exactly that of a Mahlo cardinal.

Where Pith is reading between the lines

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

  • Similar equiconsistency results may hold for n-ladders when n is larger than 3, with correspondingly stronger large cardinals.
  • The combinatorial properties of finite lattices with bounded lower covers are sensitive to the large cardinal hierarchy.
  • One could look for constructions that separate the existence of 4-ladders of size ℵ₃ from even stronger cardinals.

Load-bearing premise

The consistency of ZFC plus a Mahlo cardinal is required to establish the consistency of ZFC plus the nonexistence of a 3-ladder of size ℵ₂.

What would settle it

A proof from ZFC alone that every 3-ladder has size less than ℵ₂, or a model of ZFC with no 3-ladder of size ℵ₂ whose consistency does not require a Mahlo cardinal.

Figures

Figures reproduced from arXiv: 2606.28844 by Lorenzo Notaro.

Figure 1
Figure 1. Figure 1: Hasse diagram of M3 Question 3. Does the existence of a 3-ladder of cardinality ℵ2 follow from the existence of a lower finite lattice of breadth 3 and cardinality ℵ2? Note that a positive answer to Question 3 would imply that the theories (2) and (3) in the statement of Corollary B are equivalent, not just equiconsistent. Furthermore, it follows from Lemma 2.3 that every lower finite lattice of breadth 2 … view at source ↗
read the original abstract

We settle the long-standing open question whether there exists a $3$-ladder of cardinality $\aleph_2$. Given a positive integer $n$, an $n$-ladder is a lower finite lattice whose elements have at most $n$ lower covers. In 1984, Ditor proved that every $n$-ladder has cardinality at most $\aleph_{n-1}$, and that this cardinal bound is sharp for $n = 1,2$. He then raised the question of whether the bound is attained for $n\ge 3$ as well. An affirmative answer is known to be consistent with $\mathsf{ZFC}$. We prove, relative to the consistency of a Mahlo cardinal, that the question is independent of $\mathsf{ZFC}$. More precisely, we show that the nonexistence of a $3$-ladder of cardinality $\aleph_2$ is equiconsistent with a Mahlo cardinal.

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

0 major / 1 minor

Summary. The paper settles Ditor's 1984 question on the sharpness of the cardinal bound for n-ladders by proving that the nonexistence of a 3-ladder of cardinality ℵ₂ is equiconsistent with the existence of a Mahlo cardinal. This establishes the independence from ZFC of the existence of such a ladder (one direction from the consistency of a Mahlo cardinal, the other presumably via forcing or inner-model techniques).

Significance. If the equiconsistency holds, the result resolves a long-standing open problem in set-theoretic combinatorics by pinning the exact consistency strength at a Mahlo cardinal, which aligns with the expected strength for statements at ℵ₂. The manuscript supplies both directions of the equiconsistency as asserted in the abstract.

minor comments (1)
  1. [Abstract] Abstract: the phrasing 'relative to the consistency of a Mahlo cardinal' could be expanded to explicitly name the two directions of the equiconsistency for immediate clarity.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending acceptance. The report accurately captures the main result establishing the equiconsistency of the nonexistence of a 3-ladder of size ℵ₂ with a Mahlo cardinal.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper proves an equiconsistency theorem: nonexistence of a 3-ladder of size ℵ₂ is equiconsistent with a Mahlo cardinal. One direction assumes Con(ZFC + Mahlo) to obtain Con(ZFC + no 3-ladder of ℵ₂); the reverse direction is standard. No equations, definitions, or predictions reduce to the paper's own inputs by construction. No self-citations are load-bearing, no ansatzes are smuggled, and no fitted parameters are relabeled as predictions. The result is self-contained against external set-theoretic benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim is an equiconsistency theorem resting on the standard axioms of ZFC together with the consistency assumption of a Mahlo cardinal for one direction.

axioms (2)
  • standard math ZFC
    Base theory in which both consistency statements are formulated.
  • domain assumption Consistency of ZFC + there exists a Mahlo cardinal
    Invoked to obtain consistency of ZFC + nonexistence of a 3-ladder of size ℵ₂.

pith-pipeline@v0.9.1-grok · 5679 in / 1210 out tokens · 38180 ms · 2026-06-30T08:41:14.946374+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

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

  1. [1]

    Douglas Blue, Paul Larson, and Grigor Sargsyan.The failure of square at all uncountable cardinals is weaker than a Woodin limit of Woodin cardinals

  2. [2]

    Iterated forcing and elementary embeddings

    James Cummings. “Iterated forcing and elementary embeddings”. In:Hand- book of set theory. Vols. 1, 2, 3. Springer, Dordrecht, 2010, pp. 775–883.isbn: 978-1-4020-4843-2

    2010

  3. [3]

    Davey and Hilary A

    Brian A. Davey and Hilary A. Priestley.Introduction to lattices and order. Second. Cambridge University Press, New York, 2002.isbn: 0-521-78451-4

    2002

  4. [4]

    Devlin.Constructibility

    Keith J. Devlin.Constructibility. Perspectives in Mathematical Logic. Springer- Verlag, Berlin, 1984.isbn: 3-540-13258-9

    1984

  5. [5]

    Cardinality questions concerning semilattices of finite breadth

    Seymour Z. Ditor. “Cardinality questions concerning semilattices of finite breadth”. In:Discrete Math.48.1 (1984), pp. 47–59.issn: 0012-365X

    1984

  6. [6]

    Vaught measures and their applications in lattice theory

    Hans Dobbertin. “Vaught measures and their applications in lattice theory”. In:J. Pure Appl. Algebra43.1 (1986), pp. 27–51.issn: 0022-4049

    1986

  7. [7]

    Paul Erd˝ os, Andr´ as Hajnal, Attila M´ at´ e, and Richard Rado.Combinatorial set theory: partition relations for cardinals. Vol. 106. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, 1984, p. 347.isbn: 0-444-86157-2

    1984

  8. [8]

    Hofmann, Klaus Keimel, Jimmie D

    Gerhard Gierz, Karl H. Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael Mislove, and Dana S. Scott.Continuous lattices and domains. Vol. 93. Ency- clopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 2003.isbn: 0-521-80338-1. 3If, moreover,ℵ ω is a strong limit cardinal, then the failure of□ ℵω impliesAD L(R) [23], as well ...

    2003

  9. [9]

    Birkh¨ auser/Springer Basel AG, Basel, 2011.isbn: 978-3-0348-0017-4

    George Gr¨ atzer.Lattice theory: foundation. Birkh¨ auser/Springer Basel AG, Basel, 2011.isbn: 978-3-0348-0017-4

    2011

  10. [10]

    Congruence amal- gamation of lattices

    George Gr¨ atzer, Harry Lakser, and Friedrich Wehrung. “Congruence amal- gamation of lattices”. In:Acta Sci. Math. (Szeged)66.1-2 (2000), pp. 3–22. issn: 0001-6969

    2000

  11. [11]

    Springer Monographs in Mathematics

    Thomas Jech.Set theory. Springer Monographs in Mathematics. The third millennium edition, revised and expanded. Springer-Verlag, 2003.isbn: 3-540- 44085-2

    2003

  12. [12]

    Kenneth Kunen.Set theory. Vol. 102. Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, 1983.isbn: 0- 444-86839-9

    1983

  13. [13]

    Sur une caract´ erisation des alephs

    Casimir Kuratowski. “Sur une caract´ erisation des alephs”. In:Fund. Math. 38 (1951), pp. 14–17.issn: 0016-2736, 1730-6329

    1951

  14. [14]

    Filter games and combinatorial properties of strategies

    Claude Laflamme. “Filter games and combinatorial properties of strategies”. In:Set theory (Boise, ID, 1992–1994). Vol. 192. Contemp. Math. Amer. Math. Soc., Providence, RI, 1996, pp. 51–67.isbn: 0-8218-0306-9

    1992

  15. [15]

    The Rudin-Blass ordering of ultrafil- ters

    Claude Laflamme and Jian-Ping Zhu. “The Rudin-Blass ordering of ultrafil- ters”. In:J. Symbolic Logic63.2 (1998), pp. 584–592.issn: 0022-4812, 1943- 5886

    1998

  16. [16]

    On Milliken-Taylor ultrafilters

    Heike Mildenberger. “On Milliken-Taylor ultrafilters”. In:Notre Dame J. Form. Log.52.4 (2011), pp. 381–394.issn: 0029-4527, 1939-0726

    2011

  17. [17]

    Weak covering without count- able closure

    William J. Mitchell and Ernest Schimmerling. “Weak covering without count- able closure”. In:Math. Res. Lett.2.5 (1995), pp. 595–609.issn: 1073-2780

    1995

  18. [18]

    Ladders and squares

    Lorenzo Notaro. “Ladders and squares”. In:Adv. Math.485 (2026), Paper No. 110714, 36.issn: 0001-8708, 1090-2082

    2026

  19. [19]

    Lorenzo Notaro.On maximal ladders. 2026. arXiv:2604.06031

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  20. [20]

    Distributive congru- ence lattices of congruence-permutable algebras

    Pavel R˚ uˇ ziˇ cka, Jiˇ r´ ı T˚ uma, and Friedrich Wehrung. “Distributive congru- ence lattices of congruence-permutable algebras”. In:J. Algebra311.1 (2007), pp. 96–116.issn: 0021-8693

    2007

  21. [21]

    Nontame mouse from the failure of square at a singular strong limit cardinal

    Grigor Sargsyan. “Nontame mouse from the failure of square at a singular strong limit cardinal”. In:J. Math. Log.14.1 (2014), pp. 1450003, 47.issn: 0219-0613

    2014

  22. [22]

    Data types as lattices

    Dana Scott. “Data types as lattices”. In:SIAM J. Comput.5.3 (1976). Se- mantics and correctness of programs, pp. 522–587.issn: 0097-5397

    1976

  23. [23]

    PFA implies AD L(R)

    John R. Steel. “PFA implies AD L(R)”. In:J. Symbolic Logic70.4 (2005), pp. 1255–1296.issn: 0022-4812

    2005

  24. [24]

    Compacts de fonctions mesurables et filtres non mesu- rables

    Michel Talagrand. “Compacts de fonctions mesurables et filtres non mesu- rables”. In:Studia Math.67.1 (1980), pp. 13–43.issn: 0039-3223, 1730-6337

    1980

  25. [25]

    Representation of algebraic distributive lattices withℵ 1 compact elements as ideal lattices of regular rings

    Friedrich Wehrung. “Representation of algebraic distributive lattices withℵ 1 compact elements as ideal lattices of regular rings”. In:Publ. Mat.44.2 (2000), pp. 419–435.issn: 0214-1493

    2000

  26. [26]

    Large semilattices of breadth three

    Friedrich Wehrung. “Large semilattices of breadth three”. In:Fund. Math. 208.1 (2010), pp. 1–21.issn: 0016-2736

    2010

  27. [27]

    Infinite combinatorial issues raised by lifting problems in universal algebra

    Friedrich Wehrung. “Infinite combinatorial issues raised by lifting problems in universal algebra”. In:Order29.2 (2012), pp. 381–404.issn: 0167-8094. University of Vienna, Institute of Mathematics, Kurt G ¨odel research center, Kolin- gasse 14–16, 1090 Vienna, Austria Email address:lorenzo.notaro@univie.ac.at

    2012