Alphabeta Math
TheoremStatement: 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.

A Yang–Baxter operator gives braid-group representations

Statement

Let C be a monoidal category, let X∈C, and let R be a Yang–Baxter operator on X. For every n≥2 there is a unique group homomorphism

ρn ⁣:Bn⟶Aut⁡C(X⊗n),ρn(σi)=Ri,

where Bn is the braid group of The braid group by Artin presentation and R1,…,Rn−1 are the local operators of Local Yang–Baxter operators on tensor powers. The family (ρn)n≥2 is compatible with the standard inclusions ιn ⁣:Bn→Bn+1, ιn(σi)=σi, in the sense that

ρn+1(ιn(β))=ρn(β)⊗1Xfor all β∈Bn.

Facts & Assumptions

Given: a monoidal category C, an object X, a Yang–Baxter operator R on X, an integer n≥2, and the local operators R1,…,Rn−1 on X⊗n.

[L1]

Each Ri is an automorphism of X⊗n, equal in a strict model to 1X⊗(i−1)⊗R⊗1X⊗(n−i−1) 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).

[L2]

The local operators satisfy RiRj=RjRi for ∣i−j∣>1 and RiRi+1Ri=Ri+1RiRi+1 for 1≤i≤n−2, with the bracket-corrected readings in the non-strict model (Local Yang–Baxter operators satisfy the Artin relations).

[L3]

For n≥2 the braid group Bn is presented by generators σ1,…,σn−1 subject to the braid relations σiσi+1σi=σi+1σiσi+1 and the distant-commutativity relations σiσj=σjσi for ∣i−j∣>1 (The braid group by Artin presentation).

[L4]

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

technique · direct
1.1L1given

The assignment lands in the automorphism group. By [L1] each Ri is an automorphism of X⊗n, so the assignment σi↦Ri is a map from the generating set {σ1,…,σn−1} of Bn into the group Aut⁡C(X⊗n).

1.2L1L2L3algebra

The relators evaluate to the identity. By [L2] the values Ri satisfy σiσi+1σi=σi+1σiσi+1 and σiσj=σjσi for ∣i−j∣>1 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 Bn evaluate to the identity in Aut⁡C(X⊗n).

2.1L3L4step 1.1step 1.2construct

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 ρn ⁣:Bn→Aut⁡C(X⊗n) with ρn(σi)=Ri. Uniqueness is the uniqueness clause of [L4]: the generators generate Bn, so a homomorphism is determined by its values on them.

3.1L1L3L4step 2.1algebra

Compatibility with the standard inclusions. Fix n≥2 and consider the two maps Bn→Aut⁡C(X⊗n+1) given by β↦ρn+1(ιn(β)) and by β↦ρn(β)⊗1X. In the strict model the local operator at position i for n+1 strands is 1X⊗(i−1)⊗R⊗1X⊗(n−i)=(1X⊗(i−1)⊗R⊗1X⊗(n−i−1))⊗1X, the local operator at position i for n strands tensored with 1X; 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 σi by this identity, so by the uniqueness clause of [L4] applied to the presentation [L3] they agree on all of Bn.

4.1step 2.1step 3.1∎

Conclusion. Steps 2.1 and 3.1 give, for every n≥2, the unique homomorphism ρn with ρn(σi)=Ri, compatible with the inclusions ιn. The construction uses only the Yang–Baxter relations and von Dyck's theorem; no choice principle is used.

Depends on

Used by

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