English

The countable condensation on linear orders

Logic 2025-09-19 v1

Abstract

The countable condensation on a linear order LL is the equivalence relation ω\sim_\omega defined by declaring xωyx \sim_\omega y when the set of points between xx and yy is countable. We characterize the linear orders LL that condense to 11 under the countable condensation by constructing a linear order UU that is universal for the order types LL such that L/ ⁣ ⁣ω1L/\!\!\sim_\omega\, \cong 1. We define a multiplication operation ω\cdot_\omega on the class of linear orders by setting MωLM \cdot_\omega L to be the order type of (ML)/ ⁣ ⁣ω(ML)/\!\!\sim_\omega (where MLML denotes the lexicographic product), and show that the right identities for ω\cdot_\omega are exactly the uncountable suborders of UU. The order types of these uncountable suborders of UU form a left regular band under ω\cdot_\omega, and the order types of all suborders of UU form a semigroup.

Keywords

Cite

@article{arxiv.2509.14614,
  title  = {The countable condensation on linear orders},
  author = {Jennifer Brown and Ricardo Suárez},
  journal= {arXiv preprint arXiv:2509.14614},
  year   = {2025}
}
R2 v1 2026-07-01T05:43:08.911Z