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.

A commutative monoid as a one-object strict monoidal category

Example

Let (M,,e) be a commutative monoid. Make a one-object category CM whose unique object is and whose endomorphisms are the elements of M, with composition given by . Define tensor on objects by = and on morphisms again by .

Facts & Assumptions

Given: A commutative monoid (M,,e).

[L1]

A monoid yields a one-object category whose endomorphism monoid is the original monoid (A monoid is a one-object category, and a group is a one-object category in which every morphism is invertible).

[L2]

In a strict one-object monoidal category, the endomorphism monoid is commutative (The endomorphisms of the tensor unit form a commutative monoid).

Verification

technique · direct
1.1

By [L1], CM is a category with identity e and composition given by .

L1
2.1

Because M is commutative, ((mn)(mn))=(mn)(mn)=(mm)(nn)=((mm)(nn)), so tensor is a bifunctor. Associativity and unit are literal equalities because there is only one object and the tensor on morphisms is exactly the monoid product.

step 1.1algebra
3.1

Thus CM is a one-object strict monoidal category. The theorem in [L2] explains why commutativity is the right hypothesis for this strict example.

step 2.1L2

Depends on

Used by

Nothing in the library uses this result yet.

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.