How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Under the ultrafilter lemma, compact Hausdorff spaces and ultrafilter algebras are recovered by the two limit constructions
Statement
Assume UL/BPI. The following constructions are inverse on objects and morphisms:
- a compact Hausdorff space is sent to the ultrafilter algebra whose structure map takes each ultrafilter to its unique limit;
- an ultrafilter algebra is sent to its induced compact Hausdorff topology.
In particular, rebuilding the algebra recovers , rebuilding the topology recovers the original topology, continuous maps are algebra homomorphisms, and algebra homomorphisms are continuous. Thus the two concrete categories are isomorphic over .
Facts & Assumptions
Given: UL/BPI, the limit-algebra construction on compact Hausdorff spaces, and the induced-topology construction on ultrafilter algebras.
The ultrafilter-limit map of a compact Hausdorff space is an algebra for the ultrafilter monad (The ultrafilter-limit map of a compact Hausdorff space is an algebra for the ultrafilter monad).
Under UL/BPI, an ultrafilter algebra maps each ultrafilter to its unique limit in the induced topology (Under the ultrafilter lemma, an ultrafilter algebra maps each ultrafilter to its unique limit).
Every continuous map of compact Hausdorff spaces is an ultrafilter-algebra homomorphism (A continuous map of compact Hausdorff spaces is an ultrafilter-algebra homomorphism).
Under UL/BPI, the topology induced by an ultrafilter algebra is compact and Hausdorff (Under the ultrafilter lemma, every ultrafilter algebra determines a compact Hausdorff topology).
Proof
Starting with an algebra , [L4] makes its induced topology compact Hausdorff, so the limit construction of clause 1 applies to it, and [L2] says that the unique-limit map of that topology is exactly . Thus the algebra is recovered on the nose, including on an empty or singleton carrier.
Starting with a compact Hausdorff topology , every -open set is open for the limit algebra because a convergent ultrafilter contains each neighbourhood of its limit. Conversely, if is not a -neighbourhood of some , the neighbourhood filter at together with has the finite-intersection property; UL/BPI extends it to an ultrafilter converging to but not containing , contradicting induced openness. Hence the rebuilt topology is exactly .
The forward morphism direction is [L3]: every continuous map preserves unique ultrafilter limits and is an algebra homomorphism.
Conversely, let be an algebra homomorphism. If is induced-open in and , then , so and hence . Thus every preimage of an induced-open set is induced-open, and is continuous.
Steps 1.1 and 1.2 recover both object structures, while steps 1.3 and 1.4 identify both morphism classes. The assignments therefore define inverse functors over .
Depends on
- The ultrafilter-limit map of a compact Hausdorff space is an algebra for the ultrafilter monad
- A continuous map of compact Hausdorff spaces is an ultrafilter-algebra homomorphism
- Under the ultrafilter lemma, every ultrafilter algebra determines a compact Hausdorff topology
- Under the ultrafilter lemma, an ultrafilter algebra maps each ultrafilter to its unique limit
- The open-set family induced by an ultrafilter algebra
- Continuity of a map of topological spaces at a point and globally
- The ultrafilter extension principle (UL/BPI)
Used by
Dependency tree · two levels
22 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- J. Goubault-Larrecq, Algebras of filter-related monads: I. Ultrafilters and Manes' theorem (standard reference, not scraped)
- E. Riehl, Category Theory in Context, 2nd ed., Corollary 5.5.6 (standard reference, not scraped)