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.
A Yang–Baxter operator gives braid-group representations
Statement
Let be a monoidal category, let , and let be a Yang–Baxter operator on . For every there is a unique group homomorphism
where is the braid group of The braid group by Artin presentation and are the local operators of Local Yang–Baxter operators on tensor powers. The family is compatible with the standard inclusions , , in the sense that
Facts & Assumptions
Given: a monoidal category , an object , a Yang–Baxter operator on , an integer , and the local operators on .
Each is an automorphism of , equal in a strict model to and in general to its bracket-corrected conjugate; the correction is independent of the chosen canonical isomorphisms by coherence (Local Yang–Baxter operators on tensor powers).
The local operators satisfy for and for , with the bracket-corrected readings in the non-strict model (Local Yang–Baxter operators satisfy the Artin relations).
For the braid group is presented by generators subject to the braid relations and the distant-commutativity relations for (The braid group by Artin presentation).
A map from the generators of a presented group to a group extends uniquely to a homomorphism if and only if the evaluation of every relator is the identity, and the extension is onto precisely when the images generate the target (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).
Proof
The assignment lands in the automorphism group. By [L1] each is an automorphism of , so the assignment is a map from the generating set of into the group .
The relators evaluate to the identity. By [L2] the values satisfy and for with the bracket-corrected readings in the non-strict model. Since identities of morphisms in a strict model are preserved by the bracket correction of [L1] (the correction is by a common canonical isomorphism for the fixed tensor power), both families of defining relators of evaluate to the identity in .
Extension and uniqueness. By [L4] applied to the presentation [L3] and the map of step 1.1, whose relators evaluate to the identity by step 1.2, there is a unique homomorphism with . Uniqueness is the uniqueness clause of [L4]: the generators generate , so a homomorphism is determined by its values on them.
Compatibility with the standard inclusions. Fix and consider the two maps given by and by . In the strict model the local operator at position for strands is , the local operator at position for strands tensored with ; in the non-strict model the same identity holds for the bracket-corrected operators by coherence, as in [L1]. Both displayed maps are homomorphisms and they agree on every generator by this identity, so by the uniqueness clause of [L4] applied to the presentation [L3] they agree on all of .
Conclusion. Steps 2.1 and 3.1 give, for every , the unique homomorphism with , compatible with the inclusions . The construction uses only the Yang–Baxter relations and von Dyck's theorem; no choice principle is used.
Depends on
Used by
- An object of a braided category carries canonical braid actions Corollary
- A diagonal Yang–Baxter operator on graded vector spaces Example
- A non-involutive one-dimensional Yang–Baxter operator Example
- The flip operator gives the permutation representation Example
- An involutive Yang–Baxter operator factors through the symmetric group Proposition
Dependency tree · two levels
17 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 (AMS Mathematical Surveys and Monographs 205), author's final version (standard reference, not scraped)
- V. G. Turaev, Quantum Invariants of Knots and 3-Manifolds (de Gruyter Studies in Mathematics 18, 1994) (standard reference, not scraped)