Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck pass
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 degenerate affine Hecke relations on two tensor factors

Example

Take g=gl2(C), the natural module V=C2 with basis v1,v2, the module M=V and d=2, so that the Arakawa-Suzuki construction acts on M⊗V⊗2=V⊗3. Write Pab for the operator that permutes the tensor factors in positions a,b∈{0,1,2} of V⊗3. Then x1=P01, s1=P12 and x2=P02+P12.

The example verifies on the eight-element tensor basis all relations of the degenerate affine Hecke presentation in this smallest nontrivial case: s12=1, [x1,x2]=0, s1x2−x1s1=1 and x2s1−s1x1=1. It also records two points that are easy to misread: on v1⊗v2⊗v1 the two sides of the cross relation differ by exactly the original vector, and the commutator [s1,x2] is not the identity, because the affine cross relation has x1, not x2, on its other side.

Facts & Assumptions

Given: The natural gl2-module V=C2 with basis v1,v2, the tensor space V⊗3 with its eight basis words, and the place permutations Pab.

[F1]

In the Arakawa-Suzuki construction with M=V and d=2 the operator Ω on two tensor slots is the flip, and xj=Ω0j+∑k<jPkj; hence x1=P01, s1=P12 and x2=P02+P12, and each Pab is an involution (Arakawa-Suzuki Casimir operators on tensor functors, The degenerate affine Hecke algebra).

[F2]

In general the Casimir and place permutation operators satisfy all Coxeter, commutation and affine cross relations, in particular si2=1, [xi,xj]=0, sixi+1−xisi=1 and xi+1si−sixi=1 (The Casimir and place-permutation operators satisfy the degenerate affine Hecke relations).

Proof

technique · direct

Given: The operators x1=P01, s1=P12 and x2=P02+P12 on V⊗3 acting on the eight basis words w0⊗w1⊗w2, wi∈{v1,v2}.

1.1F1algebra

The permutation identities. Since Pab exchanges two tensor positions it is an involution, Pab2=1; and evaluating on the eight words gives the two braid-type identities used below, P12P02=P01P12 and P02P12=P12P01, together with their transposes P01P02=P12P01 and P02P01=P01P12 (both sides of each identity send a word to the same word).

2.1F1step 1.1algebra

The four relations. First s12=P122=1. Next, [x1,x2]=P01P02−P02P01+P01P12−P12P01, and the identities P01P02=P12P01, P02P01=P01P12 of step 1.1 cancel the four 3-cycle terms pairwise. Finally s1x2−x1s1=P12P02+P122−P01P12=P01P12+1−P01P12=1 and, symmetrically, x2s1−s1x1=P02P12+P122−P12P01=P12P01+1−P12P01=1. Hence all degenerate affine Hecke relations of [F2] hold in this specialization.

3.1F1step 2.1algebra

The explicit vector. For v1⊗v2⊗v1: s1 sends it to v1⊗v1⊗v2, which x1=P01 fixes, so x1s1(v1⊗v2⊗v1)=v1⊗v1⊗v2; and x2=P02+P12 sends it to v1⊗v2⊗v1+v1⊗v1⊗v2, which s1 sends to v1⊗v1⊗v2+v1⊗v2⊗v1. Hence (s1x2−x1s1)(v1⊗v2⊗v1)=v1⊗v2⊗v1, the identity action on this vector.

4.1F1step 3.1algebra∎

The commutator caveat. On the same vector, x2s1(v1⊗v2⊗v1)=v2⊗v1⊗v1+v1⊗v2⊗v1 and s1x1(v1⊗v2⊗v1)=v2⊗v1⊗v1, so (x2s1−s1x1)(v1⊗v2⊗v1)=v1⊗v2⊗v1, while [s1,x2](v1⊗v2⊗v1)=v1⊗v1⊗v2−v2⊗v1⊗v1, which has no component along v1⊗v2⊗v1. So [s1,x2]≠1: the affine cross relation relates s1x2 to x1s1, not to x2s1.

Remarks

  • The braid-type identities are the only input: once they are checked on the eight words, the two nontrivial relations follow by cancellation of the 3-cycle terms, so the example is a finite verification of the normalization used by the Arakawa-Suzuki action.
  • The distinction recorded in step 4.1 is not a defect: [s1,x2]=−1 is false as well; the correct affine relations are s1x2−x1s1=1 and x2s1−s1x1=1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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