Search arXiv⌕ Search

arXiv · 2609.39487

Hagendorf Orders

Abstract

Call a linear order type $φ$ Hagendorf if it shares two properties with additively indecomposable ordinal numbers without being one itself: $φ$ is strictly indecomposable to the right and whenever $ψ< φ$, then $ψ$ can be embedded into a proper initial segment of $φ$. In the 1970s, J. Hagendorf asked whether such types exist. F. Galvin observed that they must be uncountable, and soon thereafter, J. Larson proved that they cannot be scattered. We provide a simplification of her argument that might give additional insight into the $σ$-scattered case. We then show that consistently Hagendorf types exist and that this holds in many models of set theory, for instance under $\mathsf{BA}$ or $\mathsf{MA}_{\aleph_1}$. In fact, their non-existence has large cardinal strength. Furthermore, we construct real Hagendorf types from $\diamondsuit$ and from $\mathsf{PFA}$. This marks the first progress on this interesting problem since its description by Larson four dozen years ago.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonathan Schilhan, Thilo Weinert. 2026-09-30. Hagendorf Orders. https://arxiv.org/abs/2609.39487

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Formalization of Filter-Method Construction for Real Numbers in Coq

This paper presents a formalization for a theory of constructing real numbers using concepts related to filters. The formalization is implemented using the Coq proof assistant and is grounded in axiomatic set theory. The theory encompasses various notions such as filters, ultrafilters, principal ultrafilters, and arithmetical ultrafilters. A special filter, namely the non-principal arithmetical ultrafilter, whose existence requires the Continuum Hypothesis to be proven, is employed to establish several non-standard number sets: *N, *Z and *Q. The set of real numbers, R, is subsequently derived by equivalently classifying a specific subset of *Q. The entire theory is thoroughly formalized, with each detail verified to ensure rigor and precision. This work contributes a new selection of foundational materials for the formalization of mathematical theories.

math.LO↗