Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Mac Lane strictification

Statement

Let C be a monoidal category. Then the assignment L(X)=(X,αX,,) defines a strong monoidal functor L:CC from C to the strict monoidal category C of The category of right-module endofunctors, and L is a monoidal equivalence. Consequently every monoidal category is monoidally equivalent to a strict monoidal category.

Facts & Assumptions

Given: A monoidal category C and its right-module endofunctor category C.

[L1]

An object of C is a functor F together with coherent isomorphisms cX,Y:F(X)YF(XY), and a morphism in C is a natural transformation compatible with those structure maps (The category of right-module endofunctors).

[L2]

The category C is strict monoidal under composition (The right-module endofunctor category is strict monoidal).

[L3]

A monoidal equivalence is a strong monoidal functor whose underlying functor is an equivalence of categories with monoidal quasi-inverse data (Monoidal equivalence and monoidal quasi-inverse data).

[L4]

A functor is an equivalence exactly when it is fully faithful and split essentially surjective (A functor is an equivalence exactly when it is fully faithful and split essentially surjective, without Choice).

[L5]

Every equivalence can be equipped with adjoint-equivalence data (Every equivalence of categories can be equipped as an adjoint equivalence).

[L6]

A fully faithful functor reflects isomorphisms (Every fully faithful functor reflects isomorphisms).

Proof

technique · direct
1.1

For each object X of C, put L(X)=(X,αX,,). The pentagon and triangle axioms of C are exactly the coherence and unit equations required in [L1], so L(X) is an object of C. For a morphism f:XY, define L(f)Z=f1Z. Naturality of the associator shows that L(f) is a morphism in C.

givenL1construct
1.2

The functor L is split essentially surjective. For an object (F,c) of C, let X:=F(1) and define ϕY:=F(λY)c1,Y:XYF(Y). Each ϕY is an isomorphism because both factors are, and naturality of c together with its coherence equations makes ϕ:L(X)(F,c) a morphism in C.

L1chooseconstruct
2.1

The unit comparison for L is the natural isomorphism (L0)Z=λZ1:Z1Z, and the binary comparison L2(X,Y):L(X)L(Y)L(XY) has component αX,Y,Z1:X(YZ)(XY)Z. The same pentagon and triangle identities show these are morphisms in C, so L is strong monoidal into the strict monoidal target of [L2].

step 1.1L2construct
2.2

The functor L is faithful. If L(f)=L(g), then their components at the unit object agree, and composing with the right unitors gives f=ρYL(f)1ρX1=ρYL(g)1ρX1=g.

step 1.1algebra
3.1

The functor L is full. Given a morphism θ:L(X)L(Y) in C, define f=ρYθ1ρX1:XY. The compatibility equation from [L1], evaluated at (1,Z), identifies θZ with f1Z after the unitors are inserted, so θ=L(f).

L1step 2.2construct
4.1

By steps 2.2-3.1 and [L4], the underlying functor of L is an equivalence of categories. By [L5], choose an adjoint-equivalence quasi-inverse G:CC with natural isomorphisms η:1CGL and ε:LG1C.

L4L5step 1.2step 2.2step 3.1choose
5.1

Use full faithfulness of L to define the binary comparison G2(A,B):G(A)G(B)G(AB) as the unique morphism whose image under L is εAB1(εAεB)L2(GA,GB)1. Define G0:1CG(1C) uniquely by L(G0)=ε1C1L01. Naturality of ε and L2 makes the displayed images natural in A,B, so faithfulness of L makes G2 natural. Both comparisons are isomorphisms by [L6].

L2L4L6step 2.1step 4.1construct
6.1

Apply the faithful functor L to the associativity and unit diagrams for G2,G0. By their defining formulas, the images reduce to the coherence diagrams for the strong monoidal functor L together with naturality of ε, so they commute. Thus G is strong monoidal, and the defining equations in step 5.1 say exactly that ε is monoidal. The triangle identity εLLη=1L gives Lη=(εL)1; since the inverse of a monoidal natural isomorphism is monoidal, faithfulness of L then verifies the binary and unit equations for η. Hence η is monoidal. The data (L,G,η,ε) therefore satisfy [L3], so L is a monoidal equivalence to the strict monoidal category C.

L3step 2.1step 4.1step 5.1algebra

Depends on

Used by

Dependency tree · two levels

18 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