Uncountable strongly surjective linear orders

From MaRDI portal



Abstract: A linear order L is strongly surjective if L can be mapped onto any of its suborders in an order preserving way. We prove various results on the existence and non-existence of uncountable strongly surjective linear orders answering questions of Camerlo, Carroy and Marcone. In particular, diamondsuit+ implies the existence of a lexicographically ordered Suslin-tree which is strongly surjective and minimal; every strongly surjective linear order must be an Aronszajn type under 2aleph0<2aleph1 or in the Cohen and other canonical models (where 2aleph0=2aleph1); finally, we prove that it is consistent with CH that there are no uncountable strongly surjective linear orders at all. We end the paper with a healthy list of open problems.


A linear order \(L\) is called \emph{strongly surjective} if whenever \(K\) is a suborder of \(L\), then there is a surjective order-preserving map \(f : L \rightarrow K\). In this paper, various results on the existence and non-existence of uncountable strongly surjective linear orders were obtained, answering questions of \textit{R. Camerlo} et al. [Order 32, No. 3, 387--400 (2015; Zbl 1327.06001)]. In particular, the author proved that the guessing principle \(\Diamond^{+}\) implies the existence of a lexicographically ordered Suslin tree which is strongly surjective and minimal, and every strongly surjective linear order must be an Aronszajn type under \(2^{\aleph_0} < 2^{\aleph_1}\) or in the Cohen and other canonical models (where \(2^{\aleph_0}=2^{\aleph_1}\)). The author also shows that it is consistent with \(\mathrm{CH}\) that there are no uncountable strongly surjective linear orders at all. A total number of 17 open problems were listed in the paper.











This page was built for publication: Uncountable strongly surjective linear orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1732801)