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 - Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Braided and Symmetric Monoidal Categories
- 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
These examples keep the two coherence regimes concrete. Cartesian products and supervector spaces show what a symmetry looks like in practice, while the braid category shows why braided coherence is weaker and why different underlying braids can survive as genuinely different canonical maps.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The swap map on sets is the cartesian braiding
Example
In with cartesian product, the braiding on is the swap map
Facts & Assumptions
Given: The category of sets with cartesian product.
The cartesian swap braiding is a symmetry in every category with finite products (The cartesian swap braiding is a symmetry).
Verification
The category has finite products, namely cartesian products of sets.
Therefore [L1] applies with , and the resulting braiding is exactly the swap map .
The braid group on three strands and its quotient to S_3
Example
The three-strand braid group has presentation
and the quotient map to sends to and to .
Facts & Assumptions
Given: The Artin presentation of braid groups and the standard quotient to the symmetric group.
The Artin presentation defines (The braid group by Artin presentation).
The map extends to a surjection (The braid group surjects onto the symmetric group).
Verification
Specializing [L1] to leaves two generators and only one braid relation, because there is no pair with among . This gives the displayed presentation of .
Specializing [L2] to gives the quotient map with and .
The hexagon checked for cartesian products
Example
For cartesian products, both routes around the first braiding hexagon send to .
Facts & Assumptions
Given: A category with finite products and its cartesian swap braiding.
The cartesian swap maps form a braiding (The cartesian swap braiding is a symmetry).
Verification
Write the source of the first hexagon as and evaluate the left-hand route on . The inner swap sends to after the evident rebracketing.
Evaluate the right-hand route: first swap past , then swap past . The result is again after the same rebracketing identifications.
Since the two routes agree on every triple , the first hexagon commutes in this cartesian case. The second hexagon is checked by the same coordinate calculation with the factors regrouped as .
Supervector spaces with the sign braiding
Example
Let be the category of -graded vector spaces. For homogeneous vectors , define
This is a symmetric braiding.
Facts & Assumptions
Given: -graded vector spaces and homogeneous vectors of degrees .
A symmetric monoidal category is a braided monoidal category with involutive braiding (Symmetric monoidal category).
Verification
The displayed map is natural and invertible: applying it twice multiplies a pure tensor by , so .
On a triple tensor , each route around a braiding hexagon contributes the sign , because moving past is the same as moving it past and then past . Thus both hexagons commute.
By [L1], these two checks show that carries a symmetric braiding, namely the sign braiding.
The two-strand braiding in the braid category has infinite order
Example
In the braid category, the braiding on the object has infinite order.
Facts & Assumptions
Given: The braid category and the computation of .
In the braid category, the braiding on is the generator (The braid category).
The group is infinite cyclic, generated by (The two-strand braid group is infinite cyclic).
Verification
By [L1], the braiding on is the element .
By [L2], all nonzero powers of are distinct from the identity. Hence the braiding on has infinite order.
Two canonical maps with different underlying braids do not agree
Example
In the braid category, the two canonical endomorphisms of represented by and are different.
Facts & Assumptions
Given: Braided coherence and the braid category.
Two canonical braided composites agree in every braided monoidal category exactly when their underlying braids agree (Two canonical braided composites agree exactly when their underlying braids agree).
The braid category realizes the braid group on three strands as the endomorphisms of the object (The braid category).
Verification
The two displayed composites have underlying braids and in .
These braids are not equal: their images in are and , which are distinct permutations.
Therefore [L1] implies that the two canonical composites do not agree. In particular, they are distinct endomorphisms of the object in the braid category from [L2].
Commutative monoid objects in sets are ordinary commutative monoids
Example
A commutative monoid object in is exactly an ordinary commutative monoid.
Facts & Assumptions
Given: Sets with cartesian product.
Monoid objects in a cartesian monoidal category are ordinary monoids on the underlying sets (Monoid objects in a cartesian category are internal monoids; in Set they are ordinary monoids).
In a symmetric monoidal category, monoid objects inherit a symmetric tensor product, so commutativity is expressed by invariance under the symmetry (Monoid objects in a symmetric monoidal category form a symmetric monoidal category).
Verification
By [L1], a monoid object in is a set with a multiplication map and a unit element satisfying the usual associative and unital equations.
The symmetry on is the swap map , so the categorical commutativity condition says for all . By [L2], that is exactly the ordinary commutativity law.
Sources
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Example 8.2.1
- Michael Muger, Tensor Categories: A Selective Guided Tour, Section 4
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Example 8.2.2
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Exercise 8.2.7