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.
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 .
Depends on
Used by
- Two canonical braided composites agree exactly when their underlying braids agree Corollary
- The braid category is braided but not symmetric Counterexample
- The two-strand braiding in the braid category has infinite order Example
- Two canonical maps with different underlying braids do not agree Example
- Braided coherence fails in the symmetric form Theorem
- The braid category is the free strict braided monoidal category on one generator Theorem
Dependency tree · two levels
7 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
- P. Etingof, S. Gelaki, D. Nikshych, and V. Ostrik, Tensor Categories, Example 8.2.4 (standard reference, not scraped)
- Michael Muger, Tensor Categories: A Selective Guided Tour, Section 4 (standard reference, not scraped)