Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-26 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

The codensity monad of the small skeleton of finite sets is the ultrafilter monad

Statement

Let FinOrd be the full subcategory of Set on the standard finite ordinals [n]={0,,n1}, and let J:FinOrdSet be the inclusion functor.

Then the codensity monad of J exists and is naturally isomorphic to the ultrafilter monad β of The ultrafilter endofunctor with principal unit and flattening multiplication. Concretely, for a set X the codensity value consists of coherent finite-valued choice operators

αf[n](f:X[n])

satisfying αhf=h(αf) for every map h:[n][m], and these operators are in natural bijection with the ultrafilters on X.

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 J:FinOrdSet, with FinOrd the full subcategory on the standard finite ordinals.

[L1]

Because FinOrd is small and Set is locally small and has all small limits, the pointwise right Kan extension of J along itself exists; at a set X, the comma-category formula identifies its value with the limit of the diagram (XJ)FinOrdSet (Sets and functions form the large locally small category Set, 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).

[L2]

A proper filter is an ultrafilter if and only if for each AX exactly one of A and XA 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 U has a member in U).

[L3]

The codensity construction gives a monad (Codensity monad, The codensity construction satisfies the monad laws).

Proof

technique · direct
1.1

By [L1], an element of RanJJ(X) is exactly a cone over the diagram (XJ)FinOrdSet. Since an object of (XJ) is a map f:X[n], such a cone is exactly a family of chosen elements αf[n], one for each f:X[n], satisfying the compatibility condition αhf=h(αf) for every map h:[n][m].

L1
2.1

Given such a coherent family α, define Uα:={AX:αχA=1}, where χA:X[2] is the characteristic function of A. Let !:X[1] be the unique map, and let c0,c1:[1][2] be the constant maps with values 0 and 1. Since χ=c0! and χX=c1!, coherence gives αχ=0 and αχX=1, so Uα and XUα. If τ:[2][2] swaps 0 and 1, then χXA=τχA, so exactly one of A and XA lies in Uα for every AX. If A,BUα, define g:X[4] by g(x)=2χA(x)+χB(x), let p,q:[4][2] recover the first and second bits, and let m:[4][2] send only 3 to 1. Then pg=χA, qg=χB, and mg=χAB, so coherence gives p(αg)=q(αg)=1 and hence αχAB=m(αg)=1. Thus ABUα. Finally, if AUα, AB, and BUα, then XBUα, so A(XB)= lies in Uα, contradicting Uα. Therefore Uα is a filter deciding every subset, hence an ultrafilter by [L2].

L2step 1.1
2.2

Conversely, let U be an ultrafilter on X. For each map f:X[n], the fibres f1(i) form a finite partition of X, so [L2] gives a unique index αfU[n] with f1(αfU)U. If h:[n][m], then f1(αfU)(hf)1(h(αfU)), so upward closure of the ultrafilter puts (hf)1(h(αfU)) into U; uniqueness of the selected partition cell therefore gives αhfU=h(αfU). Thus αU is a coherent family of the kind described in step 1.1.

L2
3.1

The two constructions are inverse. Starting from α, let χi:[n][2] be the characteristic function of {i}. Then for any f:X[n] and any i[n], one has f1(i)Uα exactly when αχif=1, which by coherence is exactly when χi(αf)=1, that is, when i=αf; so the ultrafilter Uα selects precisely the fibre of αf, and step 2.2 recovers αf. Starting from an ultrafilter U, the definition of UαU says AUαU exactly when the fibre A is the cell selected by U in the partition {A,XA}, which is exactly the condition AU. Hence RanJJ(X)βX naturally in X.

step 2.1step 2.2
4.1

For xX, the family αfx:=f(x) is coherent, and the assignment xαx is natural in X. On a finite ordinal [n] and an element i[n], the counit of the right Kan extension evaluates αi at the identity map of [n], so it returns i; the defining equation 1J=ε(ηJ) in [L3] therefore forces the codensity unit to be xαx. Under step 3.1 this corresponds to the principal ultrafilter at x, since AUαx exactly when χA(x)=1.

L3step 3.1
5.1

Now let W be an ultrafilter on βX, and let Ω be its coherent family from step 2.2. For each f:X[n], define f^:βX[n] by sending U to the unique index i with f1(i)U; step 2.2 guarantees that this is well-defined. For the flattened ultrafilter of [L4], one has f1(i)μX(W) if and only if f^1(i)W, so the coherent family attached to μX(W) by step 2.2 takes the value Ωf^ at f. But Ωf^ is exactly the finite-set value produced by Tε in the defining equation ε(μJ)=ε(Tε) 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 J is the ultrafilter monad.

L3L4step 2.2step 3.1

Depends on

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