Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01
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.

In a strict braided monoidal category the braiding satisfies the Yang-Baxter equation

Statement

Let C be a strict braided monoidal category. Then for all objects X,Y,Z,

(cY,Z⊗1X)∘(1Y⊗cX,Z)∘(cX,Y⊗1Z)=(1Z⊗cX,Y)∘(cX,Z⊗1Y)∘(1X⊗cY,Z).

In particular, when X=Y=Z, both sides are endomorphisms of X⊗X⊗X, and the relation becomes

(c⊗1)(1⊗c)(c⊗1)=(1⊗c)(c⊗1)(1⊗c).

Facts & Assumptions

Given: A strict braided monoidal category.

[L1]

A braided monoidal category carries a braiding satisfying the two hexagon identities (Braided monoidal category).

[L2]

In a strict monoidal category, the associator and both unitors are identity morphisms (Strict monoidal category).

Proof

technique · direct
1.1givenL1L2algebra

By [L2], both hexagon identities from [L1] lose all associators. They become cX,Y⊗Z=(1Y⊗cX,Z)∘(cX,Y⊗1Z) and cX⊗Y,Z=(cX,Z⊗1Y)∘(1X⊗cY,Z).

2.1L1step 1.1algebra

Naturality of cX,− with respect to the morphism cY,Z:Y⊗Z→Z⊗Y gives (cY,Z⊗1X)∘cX,Y⊗Z=cX,Z⊗Y∘(1X⊗cY,Z).

3.1step 1.1step 2.1algebra∎

Expand the left-hand occurrence of cX,Y⊗Z in step 2.1 by the first formula of step 1.1, and expand cX,Z⊗Y by the same formula with Y and Z interchanged. This yields (cY,Z⊗1X)∘(1Y⊗cX,Z)∘(cX,Y⊗1Z)=(1Z⊗cX,Y)∘(cX,Z⊗1Y)∘(1X⊗cY,Z), which is the stated Yang-Baxter relation. The special case X=Y=Z is the displayed braid equation.

Depends on

Used by

Dependency tree · two levels

4 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