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.
Braided and Symmetric Monoidal Categories
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Categories, Functors and Natural Transformations
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Finite Counting, Factorials and Binomial Coefficients
- Free Groups and Presentations
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Limits and Colimits
- Monoidal Categories and Monoidal Functors
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinals, Cardinals, and Transfinite Recursion
- Relations, Functions, and Quotients
- Strictification and Mac Lanes Coherence Theorem
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The ZFC Axioms and the Basic Set Constructions
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 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
Braiding
Definition
Let be a monoidal category (Monoidal category).
A braiding on is a natural isomorphism
natural in both variables (Natural isomorphism) such that, for all objects ,
and
These are the two hexagon identities. The invertibility of each is part of the data, not a consequence of the hexagons.
Braided monoidal category
Definition
A braided monoidal category is a monoidal category together with a chosen braiding in the sense of Braiding.
The inverse braiding is again a braiding
Statement
Let be a braiding on a monoidal category . Then the family
is again a braiding on .
Facts & Assumptions
Given: A braiding on a monoidal category .
A braiding is a natural isomorphism satisfying the two hexagon identities (Braiding).
Proof
Because [L1] says each is an isomorphism, the family is well defined. Inverting the naturality square for and swapping the variable names shows that is natural in both variables.
Substitute into the first hexagon for . After reversing the arrows, this equation is exactly the second hexagon for from [L1] with the object names permuted. Hence the first hexagon holds for .
The same calculation with the roles of the two hexagons reversed shows that the second hexagon for is the first hexagon for written backwards. Therefore satisfies both hexagon identities and is a braiding.
The braiding is compatible with the unit constraints
Statement
Let be a braiding on a monoidal category . Then for every object ,
and consequently
Facts & Assumptions
Given: A braided monoidal category with braiding .
In any braided monoidal category, Exercise 8.1.6 of EGNO derives the identities
A braiding is, in particular, a family of isomorphisms satisfying the hexagons (Braiding).
Proof
The present hypotheses are exactly those of [F1], so the two displayed unit-compatibility identities hold for every object .
By [L1], the morphisms and are isomorphisms. Step 1.1 therefore gives These two formulas are inverse to each other, so .
In a strict braided monoidal category the braiding satisfies the Yang-Baxter equation
Statement
Let be a strict braided monoidal category. Then for all objects ,
In particular, when , both sides are endomorphisms of , and the relation becomes
Facts & Assumptions
Given: A strict braided monoidal category.
A braided monoidal category carries a braiding satisfying the two hexagon identities (Braided monoidal category).
In a strict monoidal category, the associator and both unitors are identity morphisms (Strict monoidal category).
Proof
By [L2], both hexagon identities from [L1] lose all associators. They become and .
Naturality of with respect to the morphism gives
Expand the left-hand occurrence of in step 2.1 by the first formula of step 1.1, and expand by the same formula with and interchanged. This yields which is the stated Yang-Baxter relation. The special case is the displayed braid equation.
Symmetric monoidal category
Definition
A symmetric monoidal category is a braided monoidal category (Braided monoidal category) whose braiding satisfies
for all objects .
In the presence of symmetry, one hexagon implies the other
Statement
Let be a monoidal category equipped with a natural isomorphism that satisfies one of the two braiding hexagons. If moreover
for all , 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 satisfying the symmetry equation and one braiding hexagon.
In a symmetric monoidal category, the braiding satisfies (Symmetric monoidal category).
Proof
Assume first that the given hexagon is Inverting this equality gives
Replace in step 1.1 by . By [L1], the symmetry equation implies for all objects . After that substitution, step 1.1 becomes which is exactly the second braiding hexagon.
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.
Braided monoidal functor
Definition
Let and be braided monoidal categories (Braided monoidal category). A braided monoidal functor is a strong monoidal functor (Lax, strong, and strict monoidal functors) with structure isomorphisms
such that for all objects ,
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.
The cartesian swap braiding is a symmetry
Statement
Let be a category with finite products, regarded as a monoidal category under cartesian product. Then the swap maps
form a braiding, and this braiding is symmetric.
Facts & Assumptions
Given: A category with finite products.
A category with finite products is monoidal under cartesian product (A category with finite products is monoidal).
A symmetric monoidal category is a braided monoidal category whose braiding squares to the identity (Symmetric monoidal category).
A braiding is a natural isomorphism satisfying the two hexagons (Braiding).
Proof
For each pair , the two coordinate projections from define a unique morphism with first projection and second projection . The same universal property defines its inverse , so the family is a natural isomorphism.
To check the first hexagon, compare both composites from to after composing with the three product projections. Each route sends to , so the two maps are equal. The second hexagon is the same coordinate permutation written on and is checked in the same way.
Swapping twice returns every pair to itself, so . By [L2], the cartesian swap braiding is therefore a symmetry.
The double-braiding center is a symmetric monoidal subcategory
Statement
Let be a braided monoidal category. Let be the full subcategory on those objects such that
for every object of . Then is closed under tensor product and unit, and the inherited braiding makes into a symmetric monoidal category.
Facts & Assumptions
Given: A braided monoidal category .
A braided monoidal category is a monoidal category equipped with a braiding (Braided monoidal category).
By definition, a braided monoidal category is symmetric exactly when for all objects (Symmetric monoidal category).
The braiding is compatible with the unit constraints, so (The braiding is compatible with the unit constraints).
Canonical reassociations and unit insertions between fixed parenthesised tensor words are unique (Mac Lane coherence in canonical-map form).
Proof
The tensor unit belongs to : for every , [L3] gives , hence .
Suppose and lie in , and let 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
Transparency of gives . Substituting this into step 1.2 leaves which is the identity by transparency of . Hence lies in .
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 , their defining condition says . By the definition in [L2], the restricted braiding is therefore a symmetry. Thus is symmetric monoidal.
Every braided monoidal category is monoidally equivalent to a strict braided one
Statement
Let be a braided monoidal category. Then there exists a strict monoidal category , a braiding on , and a monoidal equivalence such that is a braided monoidal functor.
Facts & Assumptions
Given: A braided monoidal category .
Mac Lane strictification gives a monoidal equivalence from to a strict monoidal category (Mac Lane strictification).
A monoidal equivalence consists of a strong monoidal functor with strong monoidal quasi-inverse data (Monoidal equivalence and monoidal quasi-inverse data).
A braided monoidal functor is a strong monoidal functor whose tensor constraint intertwines the two braidings (Braided monoidal functor).
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
Apply [L1] and [L2] to obtain a monoidal equivalence with strict. By [F1], the braiding transports across the full strong monoidal equivalence to a braiding on .
The transported braiding is characterized by the compatibility square Thus [L3] makes braided monoidal, and is braided-monoidally equivalent to the strict braided monoidal category .
The braid group by Artin presentation
Definition
For , the braid group is the group with generators and relations
Equivalently,
interpreted in the sense of Group presentation by generators and relations and Relators and relations; finitely generated, finitely related, and finite presentations.
For and , there are no generators, and is the trivial group given by the empty presentation.
The two-strand braid group is infinite cyclic
Statement
The braid group is cyclic, generated by , and has infinite order. Hence is an infinite cyclic group.
Facts & Assumptions
Given: The Artin presentation of the braid groups.
The group is presented by one generator and no braid relations (The braid group by Artin presentation).
Free groups are torsion-free (Free groups are torsion-free).
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
By [L1], the presentation of has one generator and no defining relator, so every element of is a power of . Thus is cyclic.
With no relators present, the presented group is the free group on one generator. By [L2], that generator has infinite order, so for every nonzero integer .
Therefore the cyclic group is infinite, so it is infinite cyclic.
The symmetric group has the Coxeter presentation
Statement
For , the symmetric group has the presentation
where, after relabelling the underlying set as , corresponds to the adjacent transposition . For , the trivial group has the empty presentation.
Facts & Assumptions
Given: The symmetric group and the adjacent transpositions .
The group is defined on ; conjugating by the order-preserving bijection identifies it with the conventional symmetric group on and transports adjacent transpositions (The finite symmetric group , one-line notation, and cycle notation).
Muger states in Section 4 that the symmetric groups have the presentation
Proof
For , [F1] is exactly the displayed presentation on the conventional labels , and [L1] transports those generators to permutations of the library's underlying set .
For and , there are no adjacent transpositions and is the trivial group, so the empty presentation applies.
The braid group surjects onto the symmetric group
Statement
For every , the assignment extends to a surjective homomorphism
Facts & Assumptions
Given: The Artin presentation of and the adjacent transpositions in .
The braid group has generators with the Artin braid and distant-commutativity relations (The braid group by Artin presentation).
The adjacent transpositions generate (The adjacent transpositions generate ).
The symmetric group satisfies the Coxeter relations for adjacent transpositions (The symmetric group has the Coxeter presentation).
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
By [L3], the adjacent transpositions in satisfy the braid relations and the distant-commutativity relations from [L1]. Therefore [L4] extends the assignment to a homomorphism .
The image of contains every adjacent transposition, so [L2] makes surjective.
The braid category
Definition
The braid category is the category defined as follows.
- Its objects are the natural numbers .
- For , there are no morphisms .
- For each , the endomorphism group is the braid group from The braid group by Artin presentation.
Composition is the group multiplication in each . The tensor product on objects is addition. On morphisms, juxtaposition is the homomorphism sending the first block generators to and the second block generators to . The Artin relations show directly that this is well defined, strictly associative, and unital. Thus is a strict monoidal category (Strict monoidal category).
The standard block crossing moves the first strands over the last 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 .
Symmetric coherence
Statement
Let 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 and two parenthesised tensor words on the same finite list of letters.
A symmetric monoidal category is a braided monoidal category with involutive braiding (Symmetric monoidal category).
Under the symmetry axiom, one braiding hexagon implies the other (In the presence of symmetry, one hexagon implies the other).
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).
The symmetric group is generated by adjacent transpositions subject exactly to the Coxeter relations (The symmetric group has the Coxeter presentation).
A parenthesised tensor word records an ordering and a bracketing of finitely many tensor factors (Parenthesised tensor words and their evaluation functors).
In a strict symmetric monoidal category, the elementary adjacent swaps on tensor factors satisfy the Coxeter relations: by symmetry, distant swaps commute by naturality, and the braid relation is the Yang-Baxter identity specialized to an involutive braiding.
Proof
By [L1] and [L3], choose a braided monoidal equivalence from to a strict braided monoidal category . Because the braiding of is involutive, the transported braiding on is also involutive, so is strict symmetric.
In the strict symmetric category , 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.
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 depends only on the same permutation. Hence any two canonical symmetric composites with the same source, target, and underlying permutation are equal.
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 , 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.
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
Any two written forms of the same labelled tensor expression differ only by a choice of brackets and a permutation of the listed occurrences.
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.
Braided coherence fails in the symmetric form
Statement
There exists a braided monoidal category in which the canonical endomorphisms
of 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 .
In the braid category, the braiding on is the generator (The braid category).
The group is infinite cyclic, so its distinct powers of are distinct morphisms (The two-strand braid group is infinite cyclic).
Proof
Take in the braid category. By [L1], the canonical braiding on is , so its even powers are the endomorphisms of the object .
By [L2], the elements are pairwise distinct in . Therefore the canonical endomorphisms are pairwise distinct in this braided monoidal category.
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.
The braid category is the free strict braided monoidal category on one generator
Statement
Let be a strict braided monoidal category and let be an object of . Then there is a unique strict braided monoidal functor
from the braid category such that . Thus is the free strict braided monoidal category on one generator.
Facts & Assumptions
Given: A strict braided monoidal category and an object .
A braided monoidal functor is determined by its action on objects and by compatibility with the braidings and tensor products (Braided monoidal functor).
The braid category has objects the natural numbers and endomorphism groups , with tensor product given by addition and juxtaposition (The braid category).
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).
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
Define on objects, with . For each generator , define to be the morphism where the braiding acts only on the th and st tensor factors.
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 hold, and [L4] extends the assignment of step 1.1 uniquely to a homomorphism for every .
The family from step 2.1 defines a functor because morphisms exist only between equal objects in , and group multiplication in each is respected by the constructed homomorphism. By construction on objects, the tensor of braids is sent to juxtaposition of local braidings, and the standard braiding of is sent to the corresponding block braiding in . Hence is strict braided monoidal.
Any strict braided monoidal functor sending to must send to and each generator to the local braiding on the th and st factors. Since the generate every , such a functor must equal . Therefore is unique.
Braided coherence is controlled by underlying braids
Statement
Let be a braided monoidal category and let be an object of . Each formal canonical composite on built from associators, unitors, braidings, and their inverses has an underlying braid in . If two such formal composites have equal underlying braids, then their interpreted morphisms in are equal. Different formal braids may, of course, have the same interpretation in a particular braided category.
Facts & Assumptions
Given: A braided monoidal category , an object , and two canonical braided endomorphisms of .
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).
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).
A braided monoidal functor preserves canonical composites built from the braiding and tensor structure (Braided monoidal functor).
Proof
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.
In the strict model, every formal canonical endomorphism of is built only from the local braidings of adjacent copies of , together with identities, tensoring, and composition. Reading those local crossings before interpretation gives a braid word and hence an element of . 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 .
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].
Two canonical braided composites agree exactly when their underlying braids agree
Statement
For a fixed object and a fixed tensor power , two canonical braided endomorphisms of agree in every braided monoidal category if and only if their underlying braids are equal in .
Facts & Assumptions
Given: Two canonical braided endomorphisms of the same tensor power .
Canonical braided endomorphisms of a fixed tensor power with the same underlying braid are equal (Braided coherence is controlled by underlying braids).
The braid category realizes braid-group elements as actual canonical braided morphisms (The braid category).
Proof
If the two underlying braids are equal, then [L1] says the two canonical composites agree in every braided monoidal category.
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.
Therefore the two universal statements are equivalent.
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 . The braided analogue Braided coherence is controlled by underlying braids replaces those permutations by braids, hence by . The quotient map of The braid group surjects onto the symmetric group is exactly the formal operation of imposing , which is why the symmetric theorem is stronger: forgetting the pure-braid kernel is what turns many distinct braided composites into one permutation class.
Monoid objects in a braided monoidal category form a monoidal category
Statement
Let be a braided monoidal category. Then the category of monoid objects in is monoidal. For monoid objects and , the tensor product monoid has underlying object , unit , and multiplication
with brackets suppressed by coherence.
Facts & Assumptions
Given: A braided monoidal category and monoid objects in it.
A braided monoidal category is a monoidal category with a braiding (Braided monoidal category).
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).
After coherence, monoid-object axioms may be written without displaying associators or unitors (The monoid-object axioms may be written without associators).
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 monoidal.
Proof
Using [L3], define on the multiplication and unit displayed in the statement. The formula is typed because rewrites as , after which lands in .
The associativity and unit axioms for this multiplication are exactly the braided interchange identities proved in [F1]: one repeatedly moves the middle -tensorand past the middle -tensorand by the braiding, and the two possible threefold rearrangements agree because the hexagons express the Yang-Baxter compatibility needed for those moves. Hence is again a monoid object.
If and are monoid morphisms, then 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 are monoid morphisms by the same coherence computation recorded in [F1], so they supply the associator and unit data for . Therefore is monoidal.
Monoid objects in a symmetric monoidal category form a symmetric monoidal category
Statement
If is a symmetric monoidal category, then 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 .
A symmetric monoidal category is, in particular, braided (Symmetric monoidal category).
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
By [L1] and [L2], is already a monoidal category.
The ambient symmetry 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 . Therefore these maps provide a symmetric braiding on .
5 · Examples, counterexamples and false statements
The braid category is braided but not symmetric
Statement refuted
Every braided monoidal category is symmetric.
Facts & Assumptions
Given: The braid category .
The braid category is braided monoidal by construction (The braid category).
The group is infinite cyclic, generated by (The two-strand braid group is infinite cyclic).
Counterexample
By [L1], is a braided monoidal category. Its braiding on the generating object is the crossing braid .
By [L2], has infinite order, so in particular . Therefore the square of the braiding on is not the identity.
A symmetric braiding must square to the identity on every tensor product. Step 2.1 shows that this fails in , so is braided but not symmetric.
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.
There is a braided monoidal category with pairwise distinct canonical endomorphisms of one tensor square (Braided coherence fails in the symmetric form).
Refutation
If the displayed claim were true, then any two canonical endomorphisms of the same tensor word built from associators and braidings would agree.
The morphisms from [L1] are all such canonical endomorphisms of , yet [L1] says they are pairwise distinct in a specific braided monoidal category. This contradicts step 1.1.
Therefore the claim is false.
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.
The braid category is braided but not symmetric (The braid category is braided but not symmetric).
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
Apply the claim to the braid category from [L1]. Then there would exist a braided monoidal equivalence from to a strict braided category whose braiding is the identity.
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 symmetric as well.
Step 2.1 contradicts [L1], which says the braid category is not symmetric. Therefore the claim is false.
Sources
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definition 8.1.1
- Michael Muger, Tensor Categories: A Selective Guided Tour, Section 4
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Chapter 8.1
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Exercise 8.1.5
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Exercise 8.1.6
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Proposition 8.1.10
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definition 8.1.12
- Saunders Mac Lane, Natural Associativity and Commutativity, Section 4
- Saunders Mac Lane, Natural Associativity and Commutativity, the hexagon (4.5)
- Michael Muger, Tensor Categories: A Selective Guided Tour, Version I of the coherence theorem
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Definition 8.1.7
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Remark 8.1.8
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Example 8.2.1
- Michael Muger, Tensor Categories: A Selective Guided Tour, Section 2
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Example 8.2.4
- Saunders Mac Lane, Natural Associativity and Commutativity, Theorem 4.2
- Michael Muger, Tensor Categories: A Selective Guided Tour, Version II of the coherence theorem
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Remark 8.2.5
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Exercise 8.2.7
- Michael Muger, Tensor Categories: A Selective Guided Tour, Sections 2 and 4
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Exercise 8.8.2(iv)