A solution to Ditor's problem

Abstract

We settle the long-standing open question whether there exists a 3-ladder of cardinality 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 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 3 as well. An affirmative answer is known to be consistent with ZFC. We prove, relative to the consistency of a Mahlo cardinal, that the question is independent of ZFC. More precisely, we show that the nonexistence of a 3-ladder of cardinality 2 is equiconsistent with a Mahlo cardinal.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…