Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 C be a braided monoidal category with braiding c and let X∈C. For every n≥2 there is a canonical group homomorphism

ρn ⁣:Bn⟶Aut⁡C(X⊗n)

characterized by the property that ρn(σi) is the local braiding of the i-th and (i+1)-st tensor factors: in a strict model ρn(σi)=1X⊗(i−1)⊗cX,X⊗1X⊗(n−i−1), while in general cX,X 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 ιn ⁣:Bn→Bn+1 for n≥1:

ρn+1(ιn(β))=ρn(β)⊗1X.

For n=0,1, define ρn to be the unique homomorphism from the trivial group Bn to Aut⁡(X⊗n), with X⊗0=1. There are no local generators in these cases. At n=0, let λX:1⊗X→X be the left unitor. Compatibility means

ρ1(ι0(e))=λX(ρ0(e)⊗1X)λX−1=1X.

For n=1 the preceding compatibility formula is literal because both sides are the identity of X⊗X.

The statement holds for the braiding of Braided monoidal category with no choice principle.

Facts & Assumptions

Given: a braided monoidal category C with braiding c, an object X, and an integer n≥0.

[L1]

In a strict braided monoidal category the braiding gives a Yang–Baxter operator R=cX,X on X: it is invertible and satisfies the cubic equation (Yang–Baxter operators on an object).

[L2]

A Yang–Baxter operator R on X yields, for every n≥2, a unique homomorphism ρn ⁣:Bn→Aut⁡(X⊗n) with ρn(σi) the local operator of R at position i, and these are compatible with the inclusions ιn (A Yang–Baxter operator gives braid-group representations).

[L3]

Canonical composites built from associators, unitors, braidings and their inverses are determined by their underlying braid: if two such composites on X⊗n have the same underlying element of Bn, they are equal (Braided coherence is controlled by underlying braids).

[L4]

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

technique · direct
1.1L1L2givenconstruct

The strict case. For n≥2, assume first that C is strict. By [L1], R:=cX,X is a Yang–Baxter operator on X, so [L2] produces the homomorphism ρn ⁣:Bn→Aut⁡(X⊗n) with ρn(σi)=1X⊗(i−1)⊗R⊗1X⊗(n−i−1)=1X⊗(i−1)⊗cX,X⊗1X⊗(n−i−1), and it is compatible with the inclusions. This gives the corollary in the strict case, together with the uniqueness of ρn.

1.2L3L4givenconstruct

The general case. For n≥2 in a general braided monoidal category, define cˇi on the fixed left-nested tensor power X⊗n by conjugating the strict-model local braiding with the canonical associativity isomorphisms, as in [L3]. Each cˇi±1 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 cˇi hold, because the underlying braids of the two sides agree. The assignment σi↦cˇi therefore satisfies the Artin relators of Bn [L4], and [L4] gives a unique homomorphism ρn ⁣:Bn→Aut⁡(X⊗n) with these values; it is canonical because each cˇi is independent of the choices.

1.3L4givenalgebra

Zero and one strand. By [L4], B0 and B1 are trivial, so their unique group actions send e to the identity. For n=1 both sides of the compatibility formula are 1X⊗X. For n=0, tensor functoriality gives ρ0(e)⊗1X=11⊗X; conjugating by λX gives 1X=ρ1(ι0(e)), the stated compatibility.

2.1L3L4step 1.2algebra

Compatibility with the inclusions. For n≥2, in the strict model the compatibility is step 1.1. In general, both β↦ρn+1(ιn(β)) and β↦ρn(β)⊗1X are canonical composite assignments on braid words with the same underlying braid ιn(β) in Bn+1; by [L3] they agree on every word, hence on every β by [L4]. Thus ρn+1(ιn(β))=ρn(β)⊗1X.

3.1step 1.1step 1.2step 2.1step 1.3∎

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

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.

Sources