within $\px$ ]{When lattices meet topology: within $\px$.}
arXiv:1202.6180
Abstract
For a non-empty set , the collection of all topologies on sits inside the Boolean lattice $\PP(\PP(X))$ (when ordered by set-theoretic inclusion) which in turn can be naturally identified with the Stone space $\px$. Via this identification then, naturally inherits the subspace topology from $\px$ (see \cite{TopX1}). Extending ideas of Frink \cite{MR0006496}, we establish an equivalence between the topological closures of sublattices of $\px$ and their (completely distributive) completions. We exploit this equivalence when searching for countably infinite compact subsets within and in crystalizing the Borel complexity of . We exhibit infinite compact subsets of including, in particular, copies of the Stone-Čech and one-point compactifications of discrete spaces.
arXiv comment10 pages