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.
The ultrafilter-limit map of a compact Hausdorff space is an algebra for the ultrafilter monad
Statement
Let be compact Hausdorff, and define by sending each ultrafilter to its unique limit. Then is an algebra for the ultrafilter monad:
Facts & Assumptions
Given: A compact Hausdorff space and its ultrafilter-limit map .
Every ultrafilter on a compact Hausdorff space has exactly one limit (A given ultrafilter on a compact Hausdorff space has a unique limit).
The ultrafilter monad has principal unit and flattening multiplication , where (The ultrafilter endofunctor with principal unit and flattening multiplication).
A -algebra structure satisfies and (Algebra and algebra homomorphism for a monad).
Proof
By [L1], is defined on every ultrafilter. When , both and are empty and the unique empty map satisfies the equations below.
The principal ultrafilter contains every neighbourhood of , so it converges to . Uniqueness in [L1] gives for every .
Let be an ultrafilter on . If an open neighbourhood of a point belongs to the pushforward , then . Every ultrafilter whose limit lies in contains , so ; upward closure gives , hence by [L2]. Thus every limit of the pushforward is a limit of the flattening.
Both ultrafilters in step 2.2 have unique limits by [L1], so their limits coincide: .
Steps 2.1 and 3.1 are exactly the unit and multiplication equations in [L3], so is an ultrafilter algebra.
Depends on
Used by
Dependency tree · two levels
14 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)