English

A note on Stone-\v{C}ech compactification in ZFA

Logic in Computer Science 2024-02-13 v3 Logic

Abstract

Working in Zermelo-Fraenkel Set Theory with Atoms over an ω\omega-categorical ω\omega-stable structure, we show how \emph{infinite} constructions over definable sets can be encoded as \emph{finite} constructions over the Stone-\v{C}ech compactification of the sets. In particular, we show that for a definable set XX with its Stone-\v{C}ech compactification X\overline{X} the following holds: a) the powerset P(X)\mathcal{P}(X) of XX is isomorphic to the finite-powerset Pfin(X)\mathcal{P}_{\textit{fin}}(\overline{X}) of X\overline{X}, b) the vector space KX\mathcal{K}^X over a field K\mathcal{K} is the free vector space FK(X)F_{\mathcal{K}}(\overline{X}) on X\overline{X} over K\mathcal{K}, c) every measure on XX is tantamount to a \emph{discrete} measure on X\overline{X}. Moreover, we prove that the Stone-\v{C}ech compactification of a definable set is still definable, which allows us to obtain some results about equivalence of certain formalizations of register machines.

Cite

@article{arxiv.2304.09986,
  title  = {A note on Stone-\v{C}ech compactification in ZFA},
  author = {Michał R. Przybyłek},
  journal= {arXiv preprint arXiv:2304.09986},
  year   = {2024}
}
R2 v1 2026-06-28T10:11:46.138Z