The representability number of a chain
For each pair of linear orderings \((L, M)\), the representability number \(\text{repr}_M(L)\) of \(L\) in \(M\) is the least ordinal \(\alpha\) such that \(L\) can be order-embedded into the lexicographic power \(M^\alpha_{lex}\). The author proves: (i) If \(\kappa\) is a regular cardinal that is not order-embeddable in \(M\), then \(\text{repr}_M(\kappa)= \kappa\). (ii) If \(M\) is an uncountable linear ordering with the property that \(A\times_{lex} 2\) is not order-embeddable in \(M\) for each uncountable \(A\subseteq M\), then \(\text{repr}_M(M^\alpha_{lex})=\alpha\) for any ordinal \(\alpha\); in particular, \(\text{repr}_R(R^\alpha_{lex})= \alpha\). The author calls an uncountable chain \(L\) splittable if there exists an uncountable set \(A\subseteq L\) such that the chain \(A\times_{lex} 2\) embeds into \(L\). Several theorems on splittable respectively unsplittable chains and on Aronszajn respectively Suslin lines are established. Reviewer's remark: Theorem (i) is not new. See, e.g., \textit{F. Hausdorff}, ``Grundzüge einer Theorie der geordneten Mengen [Math. Ann. 65, 435--505 (1908; JFM 39.0099.01), Satz XIV], or the reviewer, ``Beiträge zur Theorie der Ordnungstypen, insbesondere der \(\eta_\alpha\)-Mengen [Math. Ann. 154, 116--134 (1964; Zbl 0192.04601), Hilfssatz 9].
- ℵ_0-categoricity of linear orderings
- A representation for topologically separable chains
- Embedding linearly ordered sets in real lexicographic products
- scientific article; zbMATH DE number 3888510 (Why is no real title available?)
- scientific article; zbMATH DE number 3092668 (Why is no real title available?)
- Isomorphisms of Lexicographic Powers of the Reals
- Lexicographic behaviour of chains
- Representable lexicographic products
- Representations of preference orderings
- Set theory. An introduction to independence proofs
- The non-existence of a utility function and the structure of non-representable preference relations
- Utility Theory
- Implementations of PACMAN
- Pointwise Debreu lexicographic powers
- A representation for topologically separable chains
- A lattice-theoretical characterization of the family of cut sets of interval-valued fuzzy sets
- Representable lexicographic products
- Characterizations of standard elements in posets
- On countably saturated linear orders and certain class of countably saturated graphs
- A hierarchy of chains embeddable into the lexicographic power \(({\mathbb{R}}^\omega,\prec_{\text{lex}})\)
- Lexicographic preferences representable by real-branching trees with countable height: a dichotomy result.
- A genesis of interval orders and semiorders: transitive NaP-preferences
- Universal semiorders
- Counting common representatives and symmetric chain decompositions
- The pseudo-transitivity of preference relations: strict and weak \((m,n)\)-Ferrers properties
- scientific article; zbMATH DE number 887775 (Why is no real title available?)
- The existence and the non-existence of utility functions in order-theoretic, algebraic and topological environments
- The interplay between intergenerational justice and mathematical utility theory
- Lexicographic preference representation: intrinsic length of linear orders on infinite sets
- Debreu-like properties of utility representations
This page was built for publication: The representability number of a chain
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779520)
