\(\omega_1\) and \(-\omega_1\) may be the only minimal uncountable linear orders (Q2469315)

A minimal uncountable linear order is an uncountable linear order \(L\) so that if \(L'\) is an uncountable linear order and \(L'\) embeds in \(L\), then \(L\) embeds in \(L'\). This paper proves the consistency of only two uncountable linear orders, \(\omega_1\) and \(-\omega_1\). The main step is to use proper forcing to construct a model of CH in which a combinatorial statement (A) about ladder systems holds. The second main step is to show that if (A) holds and there is a minimal Aronszajn line, then \(2^{\omega_1} = 2^{\omega_2}\). Using well-known results about minimal linear orders, the theorem follows. The techniques extend to give results about sentences low in the hierarchy. For example, let \(\mathcal L\) be the language of set theory, and let \(\mathcal L^{C}\) add a predicate \(\overline{C}\); to the axioms of set theory add an axiom to say that \(\overline{C}= \{C_{\alpha}: \alpha < \omega_1\}\) where \(C_{\alpha}\) is a cofinal \(\omega\)-sequence in \(\alpha\) if \(\alpha\) is a limit; finite otherwise. Then \(\Pi_2\) sentences \(\varphi_1\) in \(\mathcal L\) and \(\varphi_2\) in \(\mathcal L^{C}\) can be found so the statements ``\(H(\omega_2)\) considered as a structure for \(\mathcal L\) models \(\text{CH}+ \varphi_1\)'' and ``\(H(\omega_2)\) considered as a structure for \(\mathcal L^{\overline C}\) models \(\text{CH}+ \varphi_2\)'' are \(\Omega\)-consistent, but \(\varphi_1 \wedge \varphi_2\) implies \(2^{\omega} = 2^{\omega_1}\), hence CH fails.