Reversible Disjoint Unions of Well Orders and Their Inverses

Abstract

A poset P is called reversible iff every bijective homomorphism f:P → P is an automorphism. Let W and W * denote the classes of well orders and their inverses respectively. We characterize reversibility in the class of posets of the form P = i∈ IL i, where L i, i∈ I, are pairwise disjoint linear orders from W W *. First, if L i ∈ W, for all i∈ I, and L i α i =γi+ni∈ Ord, where γi∈ Lim \0\ and ni∈ω, defining Iα := \ i∈ I : αi = α \, for α ∈ Ord, and Jγ := \ j∈ I : γj = γ \, for γ∈ Lim 0, we prove that i∈ I L i is a reversible poset iff α i :i∈ I is a finite-to-one sequence, or there is γ = \ γ i : i∈ I\, for α ≤ γ we have |Iα |<ω , and ni : i∈ Jγ Iγ is a reversible sequence of natural numbers. The same holds when L i ∈ W *, for all i∈ I. In the general case, the reversibility of the whole union is equivalent to the reversibility of the union of components from W and the union of components from W *.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…