Pentagon identity for a monoidal category 2026-10-14
For an associator in a monoidal category, the two paths from to agree:This five-vertex diagram is the basic compatibility for reassociating four tensor factors. The monoidal coherence theorem extends it to arbitrary finite tensor expressions.
Snake identity Created 2026-10-06 Updated 2026-10-14
The two triangular identities and , with canonical associators and unitors inserted, for a dual pair in a monoidal category.
Strict monoidal category 2026-10-06
A monoidal category whose associators and unitors are identities; the tensor and unit laws are then equalities of objects and morphisms.
Triangle identity for a monoidal category 2026-10-14
The associator and unitors of a monoidal category satisfyThus the two ways to remove a unit between two tensor factors agree. Together with the pentagon identity for a monoidal category this implies all unit identities derived from the monoidal pentagon and triangle and the monoidal coherence theorem.
The associator and unitors of a monoidal category satisfyFor the first identity, postcompose the pentagon on by , then use the triangle twice and cancel . This gives the first equality after tensoring with ; set and cancel using the natural invertible right unitor. Reversing tensor order proves the second identity. Naturality of the left unitor at gives ; comparing the second identity with the triangle on gives and hence the last identity. These are consequences of the axioms, not extra axioms imported from the monoidal coherence theorem.
Unitor 2026-10-06
The natural isomorphisms and in a monoidal category. Together with the associator they satisfy the triangle axiom.
Associate to a finite ordered word the right-associated tensor , retaining a terminal unit: and . Define concatenation maps recursively byThe unit identities derived from the monoidal pentagon and triangle give . Induction on , using the pentagon in the induction step and left-unitor compatibility in the base case, givesNormalize a letter by , a formal unit by , and a tensor expression recursively using . The displayed identities show that normalization commutes with each generating associator or unitor, and therefore also with inverses, tensor products and composites of them. Every structural arrow from expression to expression is consequently , proving monoidal coherence without presupposing it.