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 have finite products and let be an object of . With the cartesian monoidal structure from A category with finite products is monoidal, a monoid object structure on is exactly a multiplication morphism and a unit morphism satisfying the ordinary associativity and unit equations after the canonical product rebracketings are inserted. In particular, in these are exactly ordinary monoids in the sense of Semigroup and monoid.
Facts & Assumptions
Given: A category with finite products and an object .
The cartesian monoidal structure on uses product as tensor and a terminal object as unit (A category with finite products is monoidal).
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).
An ordinary monoid is a set with an associative unital binary operation (Semigroup and monoid).
Proof
By [L1], the tensor is and the unit is a terminal object . So [L2] says exactly that a monoid object on is data and satisfying the usual associative and left and right unit diagrams, with the only extra notation being the canonical rebracketing isomorphism .
In , a morphism is the choice of an element , and a morphism is a binary operation on the underlying set. The three diagrams from step 1.1 then say exactly and for all .
Therefore monoid objects in a cartesian monoidal category are associative unital multiplications internal to that cartesian structure, and in they are exactly ordinary monoids.
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
- S. Mac Lane, Categories for the Working Mathematician, Chapter VII.3 (standard reference, not scraped)
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Chapter 2.3 and 2.7 (standard reference, not scraped)