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 algebra on a finite discrete space
Example
Let be a finite set with the discrete topology. Every ultrafilter on is principal at a unique point, so the principal-unit map is a bijection. Its inverse is the ultrafilter algebra structure and the unique-limit map of the finite discrete space.
For , the only ultrafilters are and , and returns the corresponding point.
Facts & Assumptions
Given: A finite set with the discrete topology.
An ultrafilter contains exactly one of and for every (Characterisation of ultrafilters: every set or its complement).
The principal unit is (The ultrafilter endofunctor with principal unit and flattening multiplication).
The discrete topology is (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).
The ultrafilter endofunctor with principal unit and multiplication is a monad, so (The ultrafilter endofunctor with principal unit and flattening multiplication is a monad).
Verification
If an ultrafilter on a nonempty finite set contained no singleton, [L1] would put the complement of every singleton into it; their finite intersection is empty, impossible for a filter. Thus it contains some singleton and is principal.
It cannot contain two distinct singletons because their intersection is empty, so the principal point is unique.
By [L2], is therefore a bijection and . In the discrete topology [L3], an ultrafilter converges precisely to the point whose singleton it contains, so is the unique-limit map.
The equation is immediate. Since is bijective by step 3.1, is bijective with inverse . The monad unit law in [L4] says , so uniqueness of the inverse gives . Composing with yields , and is an algebra.
If , no ultrafilter exists, so and the unique empty map is an algebra. For , steps 1.1 and 2.1 give exactly and step 3.1 gives their displayed values.
Depends on
- The ultrafilter endofunctor with principal unit and flattening multiplication
- The ultrafilter endofunctor with principal unit and flattening multiplication is a monad
- Characterisation of ultrafilters: every set or its complement
- The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies
- Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right
- Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
28 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)