SearcharxivSearch

arXiv · 2510.14577

Linear orders on chainable continua

Abstract

We define and study certain linear orders on chainable continua. Those orders depend on a sequence of chains obtained from definition of chainability and on a fixed non-principal ultrafilter on the set of natural numbers. An alternative method of defining linear orders on a chainable continuum $X$ uses representation of $X$ as an inverse sequence of arcs and fixed non-principal ultrafilter on $\mathbb{N}$. We compare those two approaches. We prove that there exist exactly $2$ distinct ultrafilter orders on any arc, exactly $4$ distinct ultrafilter orders on the Warsaw sine curve, and exactly $2^{\mathfrak{c}}$ distinct ultrafilter orders on the Knaster continuum. We study the order type of various chainable continua equipped with an ultrafilter order and prove that a chainable continuum $X$ is Suslinean if and only if for every ultrafilter order $\leq_{\mathcal{U}}^{\mathcal{D}}$ on $X$, the space $(X, \leq_{\mathcal{U}}^{\mathcal{D}})$ is order isomorphic to $([0,1],\leq)$. We study also descriptive complexity of ultrafilter orders on chainable continua. We prove that the existence of closed ultrafilter order characterizes the arc and we show that for Suslinean chainable continua, any ultrafilter order is both of type $F_{\sigma}$ and $G_{\delta}$. On the other hand, we prove that there is no analytic and no co-analytic ultrafilter order on the Knaster continuum.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Witold Marciszewski, Julia Ścisłowska, Benjamin Vejnar. 2025-10-16. Linear orders on chainable continua. https://arxiv.org/abs/2510.14577

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN