SearcharxivSearch

arXiv · 2503.13728

The class of Aronszajn lines under epimorphisms

Abstract

A linear order $A$ is called strongly surjective if for every non empty suborder $B \preceq A$, there is an epimorphism from $A$ onto $B$ (denoted by $B \trianglelefteq A$). We show, answering some questions of D\'aniel T. Soukup, that under $\mathsf{MA}_{\aleph_{1}}$ there is a strongly surjective Countryman line. We also study the general structure of the class of Aronszajn lines under $\trianglelefteq$, and compare it with the well known embeddability relation $\preceq$. Under $\mathsf{PFA}$, the class of Aronszajn lines and the class of countable linear orders enjoy similar nice properties when viewed under the embeddability relation; both are well-quasi-ordered and have a finite basis. We show that this analogy does not extend perfectly to the $\trianglelefteq$ relation; while it is known that the countable linear orders are still well-quasi-ordered under $\trianglelefteq$, we show that already in $\mathsf{ZFC}$ the class of Aronszajn lines has an infinite antichain, and under $\mathsf{MA}_{\aleph_{1}}$ an infinite decreasing chain as well. We show that some of the analogy survives by proving that under $\mathsf{PFA}$, for some carefully constructed Countryman line $C$, $C$ and $C^{\star}$ form a $\trianglelefteq$-basis for the class of Aronszajn lines. Finally we show that this does not extend to all uncountable linear orders by proving that there is never a finite $\trianglelefteq$-basis for the uncountable real orders.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lucas Polymeris, Carlos Martinez-Ranero. 2025-03-17. The class of Aronszajn lines under epimorphisms. https://doi.org/10.1142/s0219061325500205

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

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO