Search arXivSearch

arXiv · 2502.15492

Invariants for metrisable locally compact Boolean spaces

Abstract

Pierce identified 3 invariants of a compact metrisable Boolean space, derived from its Cantor-Bendixson sequence, that determine the space up to homeomorphism. For locally compact spaces we define an additional invariant, the compact rank, and show that these 4 invariants determine a locally compact metrisable Boolean space up to homeomorphism. We also identify which combinations of the 4 invariants can arise in practice. A Boolean ring and its associated Boolean space are primitive if the ring is disjointly generated by its pseudo-indecomposable (PI) elements. Spaces in this important sub-class of Boolean spaces can be well described (uniquely in the case of compact spaces) by an extended PO system (poset with a distinguished subset). We define the Cantor-Bendixson sequence and associated invariants for a PO system, and show that almost all of the invariant information for a primitive space can be recovered from that of an associated extended PO system. We also show how the primitivity of a Boolean space corresponds to a notion of primitivity of the additive measure associated with the rank function of a space, which in turn depends on the additive measure being sufficiently 'self-similar'. We use these ideas to develop a method for constructing non-primitive spaces.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrew B. Apps. 2025-02-21. Invariants for metrisable locally compact Boolean spaces. https://arxiv.org/abs/2502.15492

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

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO