Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passaudited 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.

Monoid objects in a cartesian category are internal monoids; in Set they are ordinary monoids

Statement

Let C have finite products and let M be an object of C. With the cartesian monoidal structure from A category with finite products is monoidal, a monoid object structure on M is exactly a multiplication morphism μ:M×MM and a unit morphism e:1M satisfying the ordinary associativity and unit equations after the canonical product rebracketings are inserted. In particular, in Set these are exactly ordinary monoids in the sense of Semigroup and monoid.

Facts & Assumptions

Given: A category C with finite products and an object M.

[L1]

The cartesian monoidal structure on C uses product as tensor and a terminal object as unit (A category with finite products is monoidal).

[L2]

A monoid object is an object with multiplication and unit maps satisfying associativity and unit equations with the monoidal associator and unitors written explicitly (Monoid objects and comonoid objects in a monoidal category).

[L3]

An ordinary monoid is a set with an associative unital binary operation (Semigroup and monoid).

Proof

technique · direct
1.1

By [L1], the tensor is M×M and the unit is a terminal object 1. So [L2] says exactly that a monoid object on M is data μ:M×MM and e:1M satisfying the usual associative and left and right unit diagrams, with the only extra notation being the canonical rebracketing isomorphism ((M×M)×M)M×(M×M).

givenL1L2
2.1

In Set, a morphism 1M is the choice of an element eM, and a morphism M×MM is a binary operation on the underlying set. The three diagrams from step 1.1 then say exactly μ(μ(x,y),z)=μ(x,μ(y,z)) and μ(e,x)=x=μ(x,e) for all x,y,zM.

step 1.1L3algebra
3.1

Therefore monoid objects in a cartesian monoidal category are associative unital multiplications internal to that cartesian structure, and in Set they are exactly ordinary monoids.

step 1.1step 2.1L2L3

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

11 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