English

A solution to Ditor's problem

Logic 2026-06-27 v1 Combinatorics

Abstract

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

Cite

@article{arxiv.2606.28844,
  title  = {A solution to Ditor's problem},
  author = {Lorenzo Notaro},
  journal= {arXiv preprint arXiv:2606.28844},
  year   = {2026}
}

Comments

24 pages