Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-31
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 free-monoid monad as a monoid object in the endofunctor category

Example

Let S be the full subcategory of Set on the three sets , 1={}, and N. This category is small. The usual free-monoid construction sends

{ε}1,11N,NNN,

where the first bijection sends the empty word to , the second sends a word on one letter to its length, and the third is any fixed bijection. Denote these chosen bijections by bX:XT(X) for XS. Define T(f):=bYfbX1:T(X)T(Y) for f:XY. This makes T:SS an endofunctor. Its transported unit has component ηX=bXηX:XT(X), and its transported multiplication has component μX=bXμX(bX1)bT(X)1:T2(X)T(X). Thus these maps correspond to one-letter insertion and word concatenation under the chosen codings; they are not literally those word maps on the representative set N.

Facts & Assumptions

Given: The transported free-monoid endofunctor on the small category S.

[L1]

The free-monoid construction on Set is a genuine monad (The free-monoid monad has monoids as its Eilenberg–Moore algebras).

[L2]

For a small category, monads are exactly monoid objects in the endofunctor category (A monoid object in a small endofunctor category is exactly a monad).

Verification

technique · direct
1.1

By [L1], the free-monoid construction on Set comes with unit η and multiplication μ satisfying the monad equations. The formulas in the Example conjugate the functor action and structure maps by the bijections bX, so functoriality, naturality, and the monad equations are preserved. Hence (T,η,μ) is a monad on S.

L1algebra
2.1

Because S has only three objects, it is small, so [L2] applies to the monad from step 1.1. Therefore the data (T,η,μ) are exactly the structure maps of a monoid object in the endofunctor category [S,S].

step 1.1L2
3.1

Therefore this transported free-monoid monad is a concrete example of a monoid object in a small endofunctor category.

step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

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