Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedverified 2026-09-26 (gpt-6-sol)
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.

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

On the full subcategory of finite sets, the principal-unit map ηX:X→βX is a natural isomorphism, so the ultrafilter monad restricts to the identity monad up to natural isomorphism. Assuming the ultrafilter lemma, this fails on N.

Facts & Assumptions

Given: The ultrafilter monad (β,η,μ) of The ultrafilter endofunctor with principal unit and flattening multiplication and, for the infinite comparison only, the ultrafilter lemma.

[L1]

An ultrafilter containing a finite union contains one of its members (Ultrafilters are prime: a union in U has a member in U).

[L2]
[L3]

Assuming the ultrafilter lemma, every filter on a set is contained in an ultrafilter on that set; this library proves the lemma from the Axiom of Choice (The ultrafilter lemma, from the Axiom of Choice: every filter extends to an ultrafilter). Applying it to the tail filter gives a nonprincipal ultrafilter on N by the explicit refutation in FALSE, once the ultrafilter lemma is available: every ultrafilter is principal.

[L4]

A filter contains the whole carrier, excludes the empty set, is upward closed, and is closed under finite intersections (Filter on a set).

[L5]

A finite set is equinumerous with a natural number (The cardinality ∣A∣ of a finite set), and an ultrafilter is in particular a proper filter (Ultrafilter).

Verification

technique · direct
1.1L1L4L5

If X is nonempty and finite, [L5] makes its singleton partition finite, and its union X belongs to every ultrafilter. Repeated use of [L1] selects a singleton {x}, and no distinct singleton can also belong because their intersection is empty.

2.1L2L4step 1.1

Upward closure now shows that the ultrafilter consists exactly of the subsets containing x, namely ηX(x). Thus ηX is bijective for nonempty finite X. If X=∅, no proper filter exists because the whole carrier is also empty, so βX=∅ and ηX is again bijective.

3.1L2step 2.1

Naturality in [L2] makes these bijections a natural isomorphism on finite sets. Under the identification, ηX is the identity and μX sends the principal ultrafilter at ηX(x) to ηX(x), so the restricted monad is naturally isomorphic to the identity monad.

4.1L2L3step 3.1∎

Assuming [L3], let U be the nonprincipal ultrafilter on N supplied there. Every value of ηN is principal, so U is outside its image and that unit component is not invertible.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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.