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 codensity monad of the small skeleton of finite sets is the ultrafilter monad
Statement
Let be the full subcategory of on the standard finite ordinals , and let be the inclusion functor.
Then the codensity monad of exists and is naturally isomorphic to the ultrafilter monad of The ultrafilter endofunctor with principal unit and flattening multiplication. Concretely, for a set the codensity value consists of coherent finite-valued choice operators
satisfying for every map , and these operators are in natural bijection with the ultrafilters on .
Under this bijection, the codensity unit and multiplication agree with the principal unit and flattening multiplication of the ultrafilter monad.
Facts & Assumptions
Given: The inclusion , with the full subcategory on the standard finite ordinals.
Because is small and is locally small and has all small limits, the pointwise right Kan extension of along itself exists; at a set , the comma-category formula identifies its value with the limit of the diagram (Sets and functions form the large locally small category , Pointwise Kan extensions exist under smallness and completeness hypotheses, Set has all small limits, realized as compatible tuples in a set-indexed product, Comma-category limit and colimit formulae compute Kan extensions).
A proper filter is an ultrafilter if and only if for each exactly one of and lies in it; moreover, if a finite union lies in an ultrafilter then one member of that union lies in the ultrafilter (Ultrafilter, Filter on a set, Characterisation of ultrafilters: every set or its complement, Ultrafilters are prime: a union in has a member in ).
The codensity construction gives a monad (Codensity monad, The codensity construction satisfies the monad laws).
The ultrafilter endofunctor with principal unit and flattening multiplication is a monad (The ultrafilter endofunctor with principal unit and flattening multiplication, The ultrafilter endofunctor with principal unit and flattening multiplication is a monad).
Proof
By [L1], an element of is exactly a cone over the diagram . Since an object of is a map , such a cone is exactly a family of chosen elements , one for each , satisfying the compatibility condition for every map .
Given such a coherent family , define , where is the characteristic function of . Let be the unique map, and let be the constant maps with values and . Since and , coherence gives and , so and . If swaps and , then , so exactly one of and lies in for every . If , define by , let recover the first and second bits, and let send only to . Then , , and , so coherence gives and hence . Thus . Finally, if , , and , then , so lies in , contradicting . Therefore is a filter deciding every subset, hence an ultrafilter by [L2].
Conversely, let be an ultrafilter on . For each map , the fibres form a finite partition of , so [L2] gives a unique index with . If , then , so upward closure of the ultrafilter puts into ; uniqueness of the selected partition cell therefore gives . Thus is a coherent family of the kind described in step 1.1.
The two constructions are inverse. Starting from , let be the characteristic function of . Then for any and any , one has exactly when , which by coherence is exactly when , that is, when ; so the ultrafilter selects precisely the fibre of , and step 2.2 recovers . Starting from an ultrafilter , the definition of says exactly when the fibre is the cell selected by in the partition , which is exactly the condition . Hence naturally in .
For , the family is coherent, and the assignment is natural in . On a finite ordinal and an element , the counit of the right Kan extension evaluates at the identity map of , so it returns ; the defining equation in [L3] therefore forces the codensity unit to be . Under step 3.1 this corresponds to the principal ultrafilter at , since exactly when .
Now let be an ultrafilter on , and let be its coherent family from step 2.2. For each , define by sending to the unique index with ; step 2.2 guarantees that this is well-defined. For the flattened ultrafilter of [L4], one has if and only if , so the coherent family attached to by step 2.2 takes the value at . But is exactly the finite-set value produced by in the defining equation of [L3]. Hence the codensity multiplication is identified with ultrafilter flattening. Therefore step 3.1 matches both the codensity unit and multiplication with the principal unit and flattening multiplication of [L4], so the codensity monad of is the ultrafilter monad.
Depends on
- Codensity monad
- The codensity construction satisfies the monad laws
- Comma-category limit and colimit formulae compute Kan extensions
- Pointwise Kan extensions exist under smallness and completeness hypotheses
- Set has all small limits, realized as compatible tuples in a set-indexed product
- Sets and functions form the large locally small category $\mathbf{Set}$
- Ultrafilter
- Filter on a set
- Ultrafilters are prime: a union in $\mathcal{U}$ has a member in $\mathcal{U}$
- Characterisation of ultrafilters: every set or its complement
- The ultrafilter endofunctor with principal unit and flattening multiplication
- The ultrafilter endofunctor with principal unit and flattening multiplication is a monad
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
37 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 6.5.14 (standard reference, not scraped)
- T. Leinster, Codensity and the ultrafilter monad, §§2-3 (standard reference, not scraped)