Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: 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.

The flip operator gives the permutation representation

Example

Take C=Vectk, X=kn for n≥0, with standard basis e1,…,en, and R(ei⊗ej)=ej⊗ei. Then R2=1 and R is a Yang–Baxter operator on X: both sides of the cubic relation act on ei⊗ej⊗el by the permutation of the three basis vectors reversing the order. By An involutive Yang–Baxter operator factors through the symmetric group the action ρm ⁣:Bm→Aut⁡(X⊗m) of A Yang–Baxter operator gives braid-group representations factors through Sm, and on the basis ei1⊗⋯⊗eim the generator σj acts by exchanging the entries in positions j and j+1. Thus ρm is the place-permutation representation of Bm through Sm: for m=2 and n≥2, R swaps e1⊗e2 with e2⊗e1 and fixes e1⊗e1 and e2⊗e2.

For m=0,1, use the trivial action on X⊗m, with X⊗0=k; it is also the place-permutation action of the trivial group Sm. If n=0 and m≥1, the tensor power is the zero space and its unique automorphism is its identity, so the same conclusion holds.

Facts & Assumptions

Given: the field k, the vector space X=kn with basis e1,…,en, and the linear flip R(ei⊗ej)=ej⊗ei on X⊗X.

[L1]

A Yang–Baxter operator on X is an invertible R ⁣:X⊗X→X⊗X satisfying the cubic equation (Yang–Baxter operators on an object), and it gives homomorphisms ρm ⁣:Bm→Aut⁡(X⊗m) with ρm(σj) the local operator at position j (A Yang–Baxter operator gives braid-group representations).

[L2]

If R2=1X⊗X, then for every m≥2 the homomorphism ρm factors through πm ⁣:Bm→Sm, and ψm(sj)=ρm(σj) (An involutive Yang–Baxter operator factors through the symmetric group).

Verification

1.1L1givenalgebra

The flip is an involutive Yang–Baxter operator. On the basis, R2(ei⊗ej)=R(ej⊗ei)=ei⊗ej, so R2=1X⊗X. For the cubic relation, the left-hand composite applied to ei⊗ej⊗el reverses the order of the three factors: R⊗1 exchanges the first two, then 1⊗R exchanges the last two, then R⊗1 the first two, giving el⊗ej⊗ei; the right-hand composite produces the same by the mirror computation. Since the pure tensors span X⊗3, the cubic equation holds and R is a Yang–Baxter operator on X.

2.1L1step 1.1

The action on pure tensors. For m≥2, by [L1] the local operator at position j is 1⊗(j−1)⊗R⊗1⊗(m−j−1), which on the basis vector ei1⊗⋯⊗eim exchanges the entries in positions j and j+1; thus each ρm(σj) is the corresponding place permutation.

3.1L2step 1.1step 2.1

Factorization and identification of the representation. By [L2] and R2=1 the action ρm factors as ψm∘πm with ψm(sj)=ρm(σj); by step 2.1 the value ψm(sj) is the place permutation exchanging positions j and j+1. Since the sj generate Sm, ψm is the place-permutation representation of Sm on X⊗m, and ρm is that representation composed with πm.

4.1step 1.1step 3.1given

The two-strand case. For m=2 and n≥2 the operator R swaps e1⊗e2 with e2⊗e1 and fixes ei⊗ei for i=1,2; this is the place-permutation representation of S2, in agreement with step 3.1.

5.1step 1.1step 3.1step 4.1∎

Conclusion and small strand counts. For m=0,1, the braid and symmetric groups are trivial and their actions send the sole element to the identity, the place permutation on X⊗m. If n=0 and m≥1, the tensor power is zero and its unique endomorphism is its identity. The flip operator is an involutive Yang–Baxter operator, and its braid actions are exactly the place-permutation representations of the symmetric groups, pulled back along the canonical surjections Bm→Sm. All computations are finite and linear and use no choice principle.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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