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.
An object of a braided category carries canonical braid actions
Statement
Let be a braided monoidal category with braiding and let . For every there is a canonical group homomorphism
characterized by the property that is the local braiding of the -th and -st tensor factors: in a strict model , while in general is transported by the associativity isomorphisms and the result is independent of those choices by braided coherence (Braided coherence is controlled by underlying braids). The actions are compatible with the standard inclusions for :
For , define to be the unique homomorphism from the trivial group to , with . There are no local generators in these cases. At , let be the left unitor. Compatibility means
For the preceding compatibility formula is literal because both sides are the identity of .
The statement holds for the braiding of Braided monoidal category with no choice principle.
Facts & Assumptions
Given: a braided monoidal category with braiding , an object , and an integer .
In a strict braided monoidal category the braiding gives a Yang–Baxter operator on : it is invertible and satisfies the cubic equation (Yang–Baxter operators on an object).
A Yang–Baxter operator on yields, for every , a unique homomorphism with the local operator of at position , and these are compatible with the inclusions (A Yang–Baxter operator gives braid-group representations).
Canonical composites built from associators, unitors, braidings and their inverses are determined by their underlying braid: if two such composites on have the same underlying element of , they are equal (Braided coherence is controlled by underlying braids).
The braid group is presented by the Artin generators and relations (The braid group by Artin presentation), and von Dyck's theorem extends a generator assignment that respects the relators, uniquely (Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group).
Proof
The strict case. For , assume first that is strict. By [L1], is a Yang–Baxter operator on , so [L2] produces the homomorphism with , and it is compatible with the inclusions. This gives the corollary in the strict case, together with the uniqueness of .
The general case. For in a general braided monoidal category, define on the fixed left-nested tensor power by conjugating the strict-model local braiding with the canonical associativity isomorphisms, as in [L3]. Each is a canonical composite built from associators, unitors and braidings, so [L3] shows that the composite does not depend on the chosen canonical isomorphisms and that the braid relations and the distant-commutativity relations between the hold, because the underlying braids of the two sides agree. The assignment therefore satisfies the Artin relators of [L4], and [L4] gives a unique homomorphism with these values; it is canonical because each is independent of the choices.
Zero and one strand. By [L4], and are trivial, so their unique group actions send to the identity. For both sides of the compatibility formula are . For , tensor functoriality gives ; conjugating by gives , the stated compatibility.
Compatibility with the inclusions. For , in the strict model the compatibility is step 1.1. In general, both and are canonical composite assignments on braid words with the same underlying braid in ; by [L3] they agree on every word, hence on every by [L4]. Thus .
Conclusion. Steps 1.1--1.2 construct the canonical homomorphisms in the strict and general case, and steps 1.3 and 2.1 give the compatibility with the standard inclusions. The construction uses only the braiding, its coherence and von Dyck's theorem; no choice principle is used, since all composites are finite and the canonical isomorphisms are explicitly determined.
Depends on
- A Yang–Baxter operator gives braid-group representations
- Yang–Baxter operators on an object
- Braided monoidal category
- Braided coherence is controlled by underlying braids
- The braid group by Artin presentation
- Von Dyck's theorem: maps of generators that satisfy the relators extend uniquely from a presented group
Used by
Dependency tree · two levels
24 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.