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 endofunctor with principal unit and flattening multiplication is a monad
Statement
The ultrafilter endofunctor together with the principal unit and flattening multiplication is a monad on .
Facts & Assumptions
Given: The functor and the natural transformations and from The ultrafilter endofunctor with principal unit and flattening multiplication.
For , write ; then exactly when (The ultrafilter endofunctor with principal unit and flattening multiplication).
The data in [L1] are already well-defined and natural (The ultrafilter endofunctor with principal unit and flattening multiplication).
Proof
For , one has iff iff iff . Thus .
Likewise iff . This inverse image is , so .
For , expanding membership in along either or gives the same condition . Hence multiplication is associative, and steps 1.1–1.2 give the unit laws.
Depends on
Used by
- The open-set family induced by an ultrafilter algebra Definition
- On finite sets the ultrafilter monad is naturally isomorphic to the identity; assuming the ultrafilter lemma, its unit is not invertible on the natural numbers Example
- The ultrafilter algebra on a finite discrete space Example
- βℕ as the free ultrafilter algebra Example
- The ultrafilter-limit map of a compact Hausdorff space is an algebra for the ultrafilter monad Lemma
- The codensity monad of the small skeleton of finite sets is the ultrafilter monad Theorem
- Under the ultrafilter lemma, compact Hausdorff spaces are monadic over sets Theorem
Dependency tree · two levels
8 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
- E. Riehl, Category Theory in Context, 2nd ed., Example 5.1.4(v) and Exercise 5.1.ii (standard reference, not scraped)