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 open-set family induced by an ultrafilter algebra is a topology
Statement
For every ultrafilter algebra , the family of induced-open subsets is a topology on .
Facts & Assumptions
Given: An ultrafilter algebra and its induced-open family .
A subset is induced-open when implies for every ultrafilter on (The open-set family induced by an ultrafilter algebra).
A topology contains the empty set and whole space, is closed under arbitrary unions, and is closed under finite intersections (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).
Proof
The empty set is induced-open because its antecedent never holds, and is induced-open because every ultrafilter contains .
Let be induced-open and suppose . Some contains , hence by [L1], and upward closure gives . Thus arbitrary unions are induced-open.
If and are induced-open and , then by [L1], so . This also covers the empty and singleton finite intersections using step 1.1.
Steps 1.1, 1.2, and 2.1 verify the axioms in [L2], so is a topology. No extension of a filter and no choice principle was used.
Depends on
Used by
- Under the ultrafilter lemma, closure in an ultrafilter-algebra topology is the image of ultrafilters containing the set Lemma
- Under the ultrafilter lemma, every ultrafilter algebra determines a compact Hausdorff topology Lemma
Cited to discharge well-definedness by The open-set family induced by an ultrafilter algebra.
Dependency tree · two levels
9 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)