Alphabeta Math
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.

21 results · all verified · 13 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 8 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Braided and Symmetric Monoidal Categories

1 · Prerequisites

2 · Summary

This page adds the commutativity data that ordinary monoidal categories do not have. A braiding is not just a swap notation: it is a natural isomorphism with two hexagon axioms, and those axioms remain genuinely asymmetric until the symmetry relation cY,XcX,Y=1 is imposed.

The page then separates the two coherence theorems. In the symmetric case, canonical composites collapse to permutations and tensor words may be reordered freely. In the merely braided case, the surviving braid-group data is exactly what obstructs that stronger slogan, and it is also what makes the braid category the correct free object.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Braiding

Definition

Let (C,,1,α,λ,ρ) be a monoidal category (Monoidal category).

A braiding on C is a natural isomorphism

cX,Y:XYYX

natural in both variables (Natural isomorphism) such that, for all objects X,Y,Z,

αY,Z,XcX,YZαX,Y,Z=(1YcX,Z)αY,X,Z(cX,Y1Z),

and

αZ,X,Y1cXY,ZαX,Y,Z1=(cX,Z1Y)αX,Z,Y1(1XcY,Z).

These are the two hexagon identities. The invertibility of each cX,Y is part of the data, not a consequence of the hexagons.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Braided monoidal category

Definition

A braided monoidal category is a monoidal category together with a chosen braiding in the sense of Braiding.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The inverse braiding is again a braiding

Statement

Let c be a braiding on a monoidal category C. Then the family

cX,Y:=cY,X1:XYYX

is again a braiding on C.

Facts & Assumptions

Given: A braiding c on a monoidal category C.

[L1]

A braiding is a natural isomorphism cX,Y:XYYX satisfying the two hexagon identities (Braiding).

Proof

technique · direct
1.1

Because [L1] says each cX,Y is an isomorphism, the family cX,Y=cY,X1 is well defined. Inverting the naturality square for c and swapping the variable names shows that c is natural in both variables.

givenL1algebra
2.1

Substitute cX,Y=cY,X1 into the first hexagon for c. After reversing the arrows, this equation is exactly the second hexagon for c from [L1] with the object names permuted. Hence the first hexagon holds for c.

L1step 1.1algebra
3.1

The same calculation with the roles of the two hexagons reversed shows that the second hexagon for c is the first hexagon for c written backwards. Therefore c satisfies both hexagon identities and is a braiding.

L1step 2.1algebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The braiding is compatible with the unit constraints

Statement

Let c be a braiding on a monoidal category C. Then for every object X,

ρXc1,X=λX,λXcX,1=ρX,

and consequently

c1,X=cX,11.

Facts & Assumptions

Given: A braided monoidal category with braiding c.

[F1]

In any braided monoidal category, Exercise 8.1.6 of EGNO derives the identities ρXc1,X=λX,λXcX,1=ρX.

[L1]

A braiding is, in particular, a family of isomorphisms satisfying the hexagons (Braiding).

Proof

technique · direct
1.1

The present hypotheses are exactly those of [F1], so the two displayed unit-compatibility identities hold for every object X.

givenF1
2.1

By [L1], the morphisms c1,X and cX,1 are isomorphisms. Step 1.1 therefore gives c1,X=ρX1λX,cX,1=λX1ρX. These two formulas are inverse to each other, so c1,X=cX,11.

L1step 1.1algebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

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,Z1X)(1YcX,Z)(cX,Y1Z)=(1ZcX,Y)(cX,Z1Y)(1XcY,Z).

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

(c1)(1c)(c1)=(1c)(c1)(1c).

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.1

By [L2], both hexagon identities from [L1] lose all associators. They become cX,YZ=(1YcX,Z)(cX,Y1Z) and cXY,Z=(cX,Z1Y)(1XcY,Z).

givenL1L2algebra
2.1

Naturality of cX, with respect to the morphism cY,Z:YZZY gives (cY,Z1X)cX,YZ=cX,ZY(1XcY,Z).

L1step 1.1algebra
3.1

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

step 1.1step 2.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Symmetric monoidal category

Definition

A symmetric monoidal category is a braided monoidal category (Braided monoidal category) whose braiding c satisfies

cY,XcX,Y=1XY

for all objects X,Y.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

In the presence of symmetry, one hexagon implies the other

Statement

Let C be a monoidal category equipped with a natural isomorphism cX,Y:XYYX that satisfies one of the two braiding hexagons. If moreover

cY,XcX,Y=1XY

for all X,Y, then the other hexagon also holds. In particular, in a symmetric monoidal category either hexagon may be taken as the coherence axiom.

Facts & Assumptions

Given: A natural family cX,Y satisfying the symmetry equation and one braiding hexagon.

[L1]

In a symmetric monoidal category, the braiding satisfies cY,XcX,Y=1XY (Symmetric monoidal category).

Proof

technique · direct
1.1

Assume first that the given hexagon is αY,Z,XcX,YZαX,Y,Z=(1YcX,Z)αY,X,Z(cX,Y1Z). Inverting this equality gives αX,Y,Z1cX,YZ1αY,Z,X1=(cX,Y11Z)αY,X,Z1(1YcX,Z1).

givenalgebra
2.1

Replace (X,Y,Z) in step 1.1 by (Z,X,Y). By [L1], the symmetry equation implies cU,V1=cV,U for all objects U,V. After that substitution, step 1.1 becomes αZ,X,Y1cXY,ZαX,Y,Z1=(cX,Z1Y)αX,Z,Y1(1XcY,Z), which is exactly the second braiding hexagon.

L1step 1.1algebra
3.1

If instead the second hexagon is given, the same argument with the roles of the two hexagons reversed proves the first. Hence under the symmetry axiom either hexagon implies the other.

step 2.1algebra
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Braided monoidal functor

Definition

Let (C,c) and (D,c) be braided monoidal categories (Braided monoidal category). A braided monoidal functor F:CD is a strong monoidal functor (Lax, strong, and strict monoidal functors) with structure isomorphisms

JX,Y:F(X)F(Y)F(XY),J0:1DF(1C),

such that for all objects X,Y,

JY,XcF(X),F(Y)=F(cX,Y)JX,Y.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Being braided is a property of a strong monoidal functor

Remark

For a fixed strong monoidal functor, no extra coherence map has to be chosen in order to make it braided: one merely checks whether the already chosen tensor constraint satisfies the compatibility equation from Braided monoidal functor. In that sense, braidedness is a property of a strong monoidal functor rather than a second layer of structure.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The cartesian swap braiding is a symmetry

Statement

Let C be a category with finite products, regarded as a monoidal category under cartesian product. Then the swap maps

τX,Y:X×YY×X,τX,Y(x,y)=(y,x),

form a braiding, and this braiding is symmetric.

Facts & Assumptions

Given: A category C with finite products.

[L1]

A category with finite products is monoidal under cartesian product (A category with finite products is monoidal).

[L2]

A symmetric monoidal category is a braided monoidal category whose braiding squares to the identity (Symmetric monoidal category).

[L3]

A braiding is a natural isomorphism satisfying the two hexagons (Braiding).

Proof

technique · direct
1.1

For each pair X,Y, the two coordinate projections from X×Y define a unique morphism τX,Y:X×YY×X with first projection π2 and second projection π1. The same universal property defines its inverse τY,X, so the family is a natural isomorphism.

givenL1L3construct
2.1

To check the first hexagon, compare both composites from X×(Y×Z) to (Y×Z)×X after composing with the three product projections. Each route sends (x,y,z) to (y,z,x), so the two maps are equal. The second hexagon is the same coordinate permutation written on ((X×Y)×Z) and is checked in the same way.

step 1.1L1L3algebra
3.1

Swapping twice returns every pair to itself, so τY,XτX,Y=1X×Y. By [L2], the cartesian swap braiding is therefore a symmetry.

L2step 1.1step 2.1algebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

The double-braiding center is a symmetric monoidal subcategory

Statement

Let (C,c) be a braided monoidal category. Let Z2(C) be the full subcategory on those objects X such that

cY,XcX,Y=1XY

for every object Y of C. Then Z2(C) is closed under tensor product and unit, and the inherited braiding makes Z2(C) into a symmetric monoidal category.

Facts & Assumptions

Given: A braided monoidal category (C,c).

[L1]

A braided monoidal category is a monoidal category equipped with a braiding (Braided monoidal category).

[L2]

By definition, a braided monoidal category is symmetric exactly when cY,XcX,Y=1XY for all objects X,Y (Symmetric monoidal category).

[L3]

The braiding is compatible with the unit constraints, so c1,X=cX,11 (The braiding is compatible with the unit constraints).

[L4]

Canonical reassociations and unit insertions between fixed parenthesised tensor words are unique (Mac Lane coherence in canonical-map form).

Proof

technique · direct
1.1

The tensor unit belongs to Z2(C): for every Y, [L3] gives cY,11=c1,Y, hence cY,1c1,Y=11Y.

L3givenalgebra
1.2

Suppose X and Y lie in Z2(C), and let Z be arbitrary. By [L4], the canonical associators in the two hexagons may be suppressed after transporting both sides between the same parenthesised source and target. In that coherent notation, the hexagons give cZ,XYcXY,Z=(1XcZ,Y)(cZ,X1Y)(cX,Z1Y)(1XcY,Z).

L1L4givenalgebra
2.1

Transparency of X gives (cZ,X1Y)(cX,Z1Y)=1XZ1Y. Substituting this into step 1.2 leaves (1XcZ,Y)(1XcY,Z)=1X(cZ,YcY,Z), which is the identity by transparency of Y. Hence XY lies in Z2(C).

step 1.2givenalgebra
3.1

Because the subcategory is full and is closed under tensor product by step 2.1 and under the unit by step 1.1, tensor products of its morphisms and the ambient associator and unitors all remain in it. The ambient braiding also restricts to it. For central objects X,Y, their defining condition says cY,XcX,Y=1XY. By the definition in [L2], the restricted braiding is therefore a symmetry. Thus Z2(C) is symmetric monoidal.

L2step 1.1step 2.1algebra
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Every braided monoidal category is monoidally equivalent to a strict braided one

Statement

Let (C,c) be a braided monoidal category. Then there exists a strict monoidal category D, a braiding cstr on D, and a monoidal equivalence F:CD such that F is a braided monoidal functor.

Facts & Assumptions

Given: A braided monoidal category (C,c).

[L1]

Mac Lane strictification gives a monoidal equivalence from C to a strict monoidal category (Mac Lane strictification).

[L2]

A monoidal equivalence consists of a strong monoidal functor with strong monoidal quasi-inverse data (Monoidal equivalence and monoidal quasi-inverse data).

[L3]

A braided monoidal functor is a strong monoidal functor whose tensor constraint intertwines the two braidings (Braided monoidal functor).

[F1]

The braided strictification theorem in the cited monoidal-category source states that Mac Lane's strictification carries a unique transported braiding for which the strictification equivalence is braided monoidal.

Proof

technique · direct
1.1

Apply [L1] and [L2] to obtain a monoidal equivalence F:CD with D strict. By [F1], the braiding c transports across the full strong monoidal equivalence to a braiding cstr on D.

L1L2F1givenchoose
2.1

The transported braiding is characterized by the compatibility square JY,XcF(X),F(Y)str=F(cX,Y)JX,Y. Thus [L3] makes F braided monoidal, and C is braided-monoidally equivalent to the strict braided monoidal category (D,cstr).

L3F1step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The braid group by Artin presentation

Definition

For n2, the braid group Bn is the group with generators σ1,,σn1 and relations

σiσi+1σi=σi+1σiσi+1(1in2),

σiσj=σjσi(1i,jn1, ij>1).

Equivalently,

Bn=σ1,,σn1σiσi+1σi=σi+1σiσi+1 (1in2), σiσj=σjσi (1i,jn1, ij>1),

interpreted in the sense of Group presentation by generators and relations and Relators and relations; finitely generated, finitely related, and finite presentations.

For n=0 and n=1, there are no generators, and Bn is the trivial group given by the empty presentation.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The two-strand braid group is infinite cyclic

Statement

The braid group B2 is cyclic, generated by σ1, and σ1 has infinite order. Hence B2 is an infinite cyclic group.

Facts & Assumptions

Given: The Artin presentation of the braid groups.

[L1]

The group B2 is presented by one generator σ1 and no braid relations (The braid group by Artin presentation).

[L2]

Free groups are torsion-free (Free groups are torsion-free).

[L3]

A map of generators satisfying the relators extends uniquely from a presented group (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

Proof

technique · direct
1.1

By [L1], the presentation of B2 has one generator and no defining relator, so every element of B2 is a power of σ1. Thus B2 is cyclic.

givenL1algebra
2.1

With no relators present, the presented group is the free group on one generator. By [L2], that generator has infinite order, so σ1m1 for every nonzero integer m.

L1L2L3step 1.1algebra
3.1

Therefore the cyclic group B2=σ1 is infinite, so it is infinite cyclic.

step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The symmetric group has the Coxeter presentation

Statement

For n2, the symmetric group Sn has the presentation

Sn=s1,,sn1si2=1, sisi+1si=si+1sisi+1, sisj=sjsi (ij>1),

where, after relabelling the underlying set n={0,,n1} as {1,,n}, si corresponds to the adjacent transposition (i i+1). For n=0,1, the trivial group has the empty presentation.

Facts & Assumptions

Given: The symmetric group Sn and the adjacent transpositions τi=(i i+1).

[L1]

The group Sn is defined on n={0,,n1}; conjugating by the order-preserving bijection kk+1 identifies it with the conventional symmetric group on {1,,n} and transports adjacent transpositions (The finite symmetric group Sn, one-line notation, and cycle notation).

[F1]

Muger states in Section 4 that the symmetric groups have the presentation Sn=σ1,,σn1σi2=1, σiσi+1σi=σi+1σiσi+1, σiσj=σjσi (ij>1).

Proof

technique · direct
1.1

For n2, [F1] is exactly the displayed presentation on the conventional labels 1,,n, and [L1] transports those generators to permutations of the library's underlying set n.

F1L1
2.1

For n=0 and n=1, there are no adjacent transpositions and Sn is the trivial group, so the empty presentation applies.

L1algebra
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The braid group surjects onto the symmetric group

Statement

For every n2, the assignment σi(i i+1) extends to a surjective homomorphism

πn:BnSn.

Facts & Assumptions

Given: The Artin presentation of Bn and the adjacent transpositions in Sn.

[L1]

The braid group Bn has generators σ1,,σn1 with the Artin braid and distant-commutativity relations (The braid group by Artin presentation).

[L3]

The symmetric group satisfies the Coxeter relations for adjacent transpositions (The symmetric group has the Coxeter presentation).

[L4]

A map of generators satisfying the relators extends uniquely from a presented group (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

Proof

technique · direct
1.1

By [L3], the adjacent transpositions in Sn satisfy the braid relations and the distant-commutativity relations from [L1]. Therefore [L4] extends the assignment σi(i i+1) to a homomorphism πn:BnSn.

L1L3L4givenconstruct
2.1

The image of πn contains every adjacent transposition, so [L2] makes πn surjective.

L2step 1.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

The braid category

Definition

The braid category B is the category defined as follows.

  • Its objects are the natural numbers 0,1,2,.
  • For mn, there are no morphisms mn.
  • For each n, the endomorphism group EndB(n) is the braid group Bn from The braid group by Artin presentation.

Composition is the group multiplication in each Bn. The tensor product on objects is addition. On morphisms, juxtaposition is the homomorphism Bm×BnBm+n sending the first block generators σi to σi and the second block generators σj to σm+j. The Artin relations show directly that this is well defined, strictly associative, and unital. Thus B is a strict monoidal category (Strict monoidal category).

The standard block crossing βm,n moves the first m strands over the last n strands. Isotopy of braid diagrams, equivalently the Artin braid relations, gives naturality and the two block hexagons, so these crossings form a braiding (Braided monoidal category). Under this convention β1,1=σ1B2.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

Symmetric coherence

Statement

Let C be a symmetric monoidal category. For any two parenthesised tensor words built from the same finite list of objects, possibly in different orders, there is a unique canonical natural isomorphism between them determined only by the induced permutation of the letters. Canonical symmetric composites therefore depend only on the underlying permutation.

Facts & Assumptions

Given: A symmetric monoidal category C and two parenthesised tensor words on the same finite list of letters.

[L1]

A symmetric monoidal category is a braided monoidal category with involutive braiding (Symmetric monoidal category).

[L2]

Under the symmetry axiom, one braiding hexagon implies the other (In the presence of symmetry, one hexagon implies the other).

[L3]

Every braided monoidal category is braided-monoidally equivalent to a strict braided one (Every braided monoidal category is monoidally equivalent to a strict braided one).

[L4]

The symmetric group is generated by adjacent transpositions subject exactly to the Coxeter relations (The symmetric group has the Coxeter presentation).

[L5]

A parenthesised tensor word records an ordering and a bracketing of finitely many tensor factors (Parenthesised tensor words and their evaluation functors).

[F1]

In a strict symmetric monoidal category, the elementary adjacent swaps on tensor factors satisfy the Coxeter relations: si2=1 by symmetry, distant swaps commute by naturality, and the braid relation is the Yang-Baxter identity specialized to an involutive braiding.

Proof

technique · direct
1.1

By [L1] and [L3], choose a braided monoidal equivalence from C to a strict braided monoidal category D. Because the braiding of C is involutive, the transported braiding on D is also involutive, so D is strict symmetric.

L1L3givenchoose
2.1

In the strict symmetric category D, every canonical map between two tensor words with the same ordered letters is built from adjacent swaps of neighboring factors. By [F1] and [L4], the resulting composite depends only on the permutation carrying the source word to the target word, not on the chosen decomposition of that permutation into adjacent transpositions.

L4L5F1step 1.1algebra
3.1

Transport this canonical map back across the equivalence chosen in step 1.1. Faithfulness of an equivalence preserves uniqueness, so the resulting canonical map in C depends only on the same permutation. Hence any two canonical symmetric composites with the same source, target, and underlying permutation are equal.

L2L3step 1.1step 2.1algebra
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Labelled unbracketed and unordered tensor strings are well defined in a symmetric monoidal category

Statement

In a symmetric monoidal category, once a finite tensor product is regarded as a labelled list of occurrences X1,,Xn, it may be written without specifying either a bracketing or an order: any two parenthesised reorderings of that same labelled list are canonically and uniquely identified.

Facts & Assumptions

Given: A symmetric monoidal category and a labelled finite list of tensor factor occurrences.

[L1]

Symmetric coherence supplies a unique canonical natural isomorphism between any two parenthesised reorderings of the same finite list of labelled factor occurrences (Symmetric coherence).

Proof

technique · direct
1.1

Any two written forms of the same labelled tensor expression differ only by a choice of brackets and a permutation of the listed occurrences.

givenalgebra
2.1

By [L1], those two parenthesised reorderings are canonically and uniquely isomorphic. Therefore suppressing both the brackets and the order does not change the resulting labelled tensor expression except by that unique canonical identification.

L1step 1.1
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

Braided coherence fails in the symmetric form

Statement

There exists a braided monoidal category in which the canonical endomorphisms

1, cX,X2, cX,X4,

of XX are pairwise distinct. Consequently the symmetric slogan "every diagram built from associators and braidings commutes" is false for braided monoidal categories.

Facts & Assumptions

Given: The braid category B.

[L1]

In the braid category, the braiding on 11=2 is the generator σ1B2 (The braid category).

[L2]

The group B2 is infinite cyclic, so its distinct powers of σ1 are distinct morphisms (The two-strand braid group is infinite cyclic).

Proof

technique · direct
1.1

Take X:=1 in the braid category. By [L1], the canonical braiding on XX is σ1, so its even powers are the endomorphisms σ12m of the object 2.

givenL1algebra
2.1

By [L2], the elements 1,σ12,σ14, are pairwise distinct in B2. Therefore the canonical endomorphisms 1,cX,X2,cX,X4, are pairwise distinct in this braided monoidal category.

L2step 1.1algebra
3.1

If every formal diagram built from associators and braidings commuted in every braided monoidal category, then the morphisms in step 2.1 would all agree. They do not, so the symmetric-form coherence slogan fails in the braided setting.

step 2.1contradiction
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

The braid category is the free strict braided monoidal category on one generator

Statement

Let C be a strict braided monoidal category and let X be an object of C. Then there is a unique strict braided monoidal functor

FX:BC

from the braid category B such that FX(1)=X. Thus B is the free strict braided monoidal category on one generator.

Facts & Assumptions

Given: A strict braided monoidal category C and an object XC.

[L1]

A braided monoidal functor is determined by its action on objects and by compatibility with the braidings and tensor products (Braided monoidal functor).

[L2]

The braid category has objects the natural numbers and endomorphism groups Bn, with tensor product given by addition and juxtaposition (The braid category).

[L3]

In a strict braided monoidal category, the local braidings satisfy the Yang-Baxter equation (In a strict braided monoidal category the braiding satisfies the Yang-Baxter equation).

[L4]

A map of generators satisfying the relators extends uniquely from a presented group (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).

Proof

technique · direct
1.1

Define FX(n):=Xn on objects, with FX(0):=1. For each generator σiBn, define FX(σi) to be the morphism 1X(i1)cX,X1X(ni1):XnXn, where the braiding acts only on the ith and (i+1)st tensor factors.

givenL2construct
2.1

By [L3], the neighboring generators from step 1.1 satisfy the braid relation. Local braidings on disjoint tensor factors commute because in a strict monoidal category they act on separate coordinates. Therefore the Artin relations of Bn hold, and [L4] extends the assignment of step 1.1 uniquely to a homomorphism BnAut(Xn) for every n.

L3L4step 1.1algebra
3.1

The family from step 2.1 defines a functor BC because morphisms exist only between equal objects in B, and group multiplication in each Bn is respected by the constructed homomorphism. By construction FX(m+n)=FX(m)FX(n) on objects, the tensor of braids is sent to juxtaposition of local braidings, and the standard braiding βm,n of B is sent to the corresponding block braiding in C. Hence FX is strict braided monoidal.

L1L2step 1.1step 2.1algebra
4.1

Any strict braided monoidal functor BC sending 1 to X must send n=1n to Xn and each generator σi to the local braiding on the ith and (i+1)st factors. Since the σi generate every Bn, such a functor must equal FX. Therefore FX is unique.

L1L2step 3.1algebra
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Braided coherence is controlled by underlying braids

Statement

Let C be a braided monoidal category and let X be an object of C. Each formal canonical composite on Xn built from associators, unitors, braidings, and their inverses has an underlying braid in Bn. If two such formal composites have equal underlying braids, then their interpreted morphisms in C are equal. Different formal braids may, of course, have the same interpretation in a particular braided category.

Facts & Assumptions

Given: A braided monoidal category C, an object XC, and two canonical braided endomorphisms of Xn.

[L1]

Every braided monoidal category is braided-monoidally equivalent to a strict braided one (Every braided monoidal category is monoidally equivalent to a strict braided one).

[L2]

The braid category is the free strict braided monoidal category on one generator (The braid category is the free strict braided monoidal category on one generator).

[L3]

A braided monoidal functor preserves canonical composites built from the braiding and tensor structure (Braided monoidal functor).

Proof

technique · direct
1.1

By [L1], replace the given braided monoidal category by a braided-monoidally equivalent strict one. Equality may be checked there because an equivalence is faithful on morphisms.

L1givenchoose
2.1

In the strict model, every formal canonical endomorphism of Xn is built only from the local braidings of adjacent copies of X, together with identities, tensoring, and composition. Reading those local crossings before interpretation gives a braid word and hence an element of Bn. By [L2], interpreting the formal composite is exactly applying the unique strict braided monoidal functor from the braid category that sends the generating object to X.

L2step 1.1construct
3.1

If the two formal canonical composites have the same underlying braid, then step 2.1 identifies their interpretations as the images of the same morphism in the free braid category under the same braided functor. Hence they are equal in the strict model, and therefore equal in the original braided category by step 1.1 and [L3].

L3step 1.1step 2.1algebra
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Two canonical braided composites agree exactly when their underlying braids agree

Statement

For a fixed object X and a fixed tensor power Xn, two canonical braided endomorphisms of Xn agree in every braided monoidal category if and only if their underlying braids are equal in Bn.

Facts & Assumptions

Given: Two canonical braided endomorphisms of the same tensor power Xn.

[L1]

Canonical braided endomorphisms of a fixed tensor power with the same underlying braid are equal (Braided coherence is controlled by underlying braids).

[L2]

The braid category realizes braid-group elements as actual canonical braided morphisms (The braid category).

Proof

technique · direct
1.1

If the two underlying braids are equal, then [L1] says the two canonical composites agree in every braided monoidal category.

L1given
2.1

Conversely, suppose the two canonical composites agree in every braided monoidal category. Apply this to the braid category from [L2]. There the canonical composites are literally the corresponding braids, so equality of the composites forces equality of the underlying braids.

L2step 1.1algebra
3.1

Therefore the two universal statements are equivalent.

step 1.1step 2.1
RemarkRemark: AI-adaptedProof: Not applicableaudited 2026-09-01Open item page →

The symmetric and braided coherence theorems compare S_n with B_n

Remark

Symmetric coherence says that canonical symmetric composites are governed by permutations, hence by Sn. The braided analogue Braided coherence is controlled by underlying braids replaces those permutations by braids, hence by Bn. The quotient map of The braid group surjects onto the symmetric group is exactly the formal operation of imposing σi2=1, which is why the symmetric theorem is stronger: forgetting the pure-braid kernel is what turns many distinct braided composites into one permutation class.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

Monoid objects in a braided monoidal category form a monoidal category

Statement

Let (C,,1,c) be a braided monoidal category. Then the category Mon(C) of monoid objects in C is monoidal. For monoid objects (A,μA,ηA) and (B,μB,ηB), the tensor product monoid has underlying object AB, unit ηAηB, and multiplication

μAB=(μAμB)(1AcB,A1B),

with brackets suppressed by coherence.

Facts & Assumptions

Given: A braided monoidal category C and monoid objects A,B in it.

[L1]

A braided monoidal category is a monoidal category with a braiding c (Braided monoidal category).

[L2]

A monoid object is an object equipped with multiplication and unit maps satisfying associativity and unit diagrams (Monoid objects and comonoid objects in a monoidal category).

[L3]

After coherence, monoid-object axioms may be written without displaying associators or unitors (The monoid-object axioms may be written without associators).

[F1]

EGNO Exercise 8.8.2(iv) checks that the braided interchange formula above defines the tensor product of monoid objects and that the ambient associator and unit object make Mon(C) monoidal.

Proof

technique · direct
1.1

Using [L3], define on AB the multiplication and unit displayed in the statement. The formula is typed because 1AcB,A1B rewrites ABAB as AABB, after which μAμB lands in AB.

L1L2L3givenconstruct
2.1

The associativity and unit axioms for this multiplication are exactly the braided interchange identities proved in [F1]: one repeatedly moves the middle B-tensorand past the middle A-tensorand by the braiding, and the two possible threefold rearrangements agree because the hexagons express the Yang-Baxter compatibility needed for those moves. Hence AB is again a monoid object.

F1step 1.1algebra
3.1

If f:AA and g:BB are monoid morphisms, then fg preserves the units and multiplications because tensoring respects composition and the braiding is natural. Thus tensoring extends to morphisms. The ambient associator and unit object of C are monoid morphisms by the same coherence computation recorded in [F1], so they supply the associator and unit data for Mon(C). Therefore Mon(C) is monoidal.

L1L2F1step 2.1algebra
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-09-01Open item page →

Monoid objects in a symmetric monoidal category form a symmetric monoidal category

Statement

If C is a symmetric monoidal category, then Mon(C) is symmetric monoidal under the tensor product of Monoid objects in a braided monoidal category form a monoidal category.

Facts & Assumptions

Given: A symmetric monoidal category C.

[L1]

A symmetric monoidal category is, in particular, braided (Symmetric monoidal category).

[L2]

In a braided monoidal category, monoid objects form a monoidal category under the braided tensor product (Monoid objects in a braided monoidal category form a monoidal category).

Proof

technique · direct
1.1

By [L1] and [L2], Mon(C) is already a monoidal category.

L1L2given
2.1

The ambient symmetry cA,B:ABBA is a monoid morphism between the tensor-product monoids because the symmetry is involutive and natural, so it commutes with the braided interchange formula defining multiplication. Its square is the identity because it already is in C. Therefore these maps provide a symmetric braiding on Mon(C).

L1L2step 1.1algebra

5 · Examples, counterexamples and false statements

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-01Open item page →

The braid category is braided but not symmetric

Statement refuted

Every braided monoidal category is symmetric.

Facts & Assumptions

Given: The braid category B.

[L1]

The braid category is braided monoidal by construction (The braid category).

[L2]

The group B2 is infinite cyclic, generated by σ1 (The two-strand braid group is infinite cyclic).

Counterexample

technique · direct
1.1

By [L1], B is a braided monoidal category. Its braiding on the generating object 11=2 is the crossing braid σ1B2.

givenL1algebra
2.1

By [L2], σ1 has infinite order, so in particular σ1212. Therefore the square of the braiding on 11 is not the identity.

L2step 1.1algebra
3.1

A symmetric braiding must square to the identity on every tensor product. Step 2.1 shows that this fails in B, so B is braided but not symmetric.

step 2.1algebra
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

FALSE: every diagram built from the associator and the braiding commutes

Statement

False claim: in every braided monoidal category, every diagram whose edges are built only from associators, unitors, braidings, and their inverses commutes.

Facts & Assumptions

Given: The failure theorem for braided coherence in the symmetric form.

[L1]

There is a braided monoidal category with pairwise distinct canonical endomorphisms 1,cX,X2,cX,X4, of one tensor square (Braided coherence fails in the symmetric form).

Refutation

technique · direct
1.1

If the displayed claim were true, then any two canonical endomorphisms of the same tensor word built from associators and braidings would agree.

givenassume-contra
2.1

The morphisms 1,cX,X2,cX,X4, from [L1] are all such canonical endomorphisms of XX, yet [L1] says they are pairwise distinct in a specific braided monoidal category. This contradicts step 1.1.

L1step 1.1contradiction
3.1

Therefore the claim is false.

step 2.1discharge-contradiction
False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passaudited 2026-09-01Open item page →

FALSE: every braided monoidal category is equivalent to a strict commutative one

Statement

False claim: every braided monoidal category is braided-monoidally equivalent to a strict braided monoidal category whose braiding is the identity on every tensor product.

Facts & Assumptions

Given: The braid category and strict braided strictification.

[L1]

The braid category is braided but not symmetric (The braid category is braided but not symmetric).

[L2]

Every braided monoidal category is braided-monoidally equivalent to some strict braided monoidal category (Every braided monoidal category is monoidally equivalent to a strict braided one).

Refutation

technique · direct
1.1

Apply the claim to the braid category from [L1]. Then there would exist a braided monoidal equivalence from B to a strict braided category D whose braiding is the identity.

L1givenassume-contra
2.1

A strict braided category with identity braiding is symmetric, because its braiding certainly squares to the identity. Transporting that symmetric structure back across the supposed braided equivalence would make B symmetric as well.

L2step 1.1algebra
3.1

Step 2.1 contradicts [L1], which says the braid category is not symmetric. Therefore the claim is false.

L1step 2.1discharge-contradiction

Sources