Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 quantum and Hecke tensor actions commute

Statement

For every N≥1 and n≥2, each adjacent Hecke operator Ta on VN⊗n commutes with the iterated-coproduct action of every Lj±1,Ei,Fi from The type-A quantum algebra and its tensor-action formulas. Thus the image BF of the normalized Hecke algebra is contained in the commutant of the quantum image AF.

Facts & Assumptions

Given: F=Q(q), the ordered-basis operator T, the quantum generator matrices, and the coproduct of The type-A quantum algebra and its tensor-action formulas.

[F1]

On a pair of labels, T fixes a repeated label with coefficient q, flips an increasing pair, and sends a decreasing pair (a,b) to (b,a)+c(a,b), where c=q−q−1 (The ordered-basis Hecke operator and its normalization).

[F2]

Put κ(a)=δi,a−δi+1,a. On two tensor positions the coproduct operators are Ei=Ei⊗Ki+1⊗Ei and Fi=Fi⊗1+Ki−1⊗Fi; their actions are Ei(a,b)=δa,i+1qκ(b)(i,b)+δb,i+1(a,i) and Fi(a,b)=δa,i(i+1,b)+q−κ(a)δb,i(a,i+1) (The type-A quantum algebra and its tensor-action formulas, The type-A quantum presentation descends to its coproduct tensor action).

[F3]

The pair operator preserves the multiset of labels, and Ki is the diagonal combination LiLi+1−1 (The ordered-basis Hecke operator and its normalization, The type-A quantum algebra and its tensor-action formulas).

Proof

Given: The data in [F1]–[F3].

1.1givenF1F3algebra

For each j, Lj⊗Lj acts on (a,b) by the scalar qδj,a+δj,b. Every term in T(a,b) has the same multiset of labels as (a,b), so it has the same scalar. Hence T(Lj⊗Lj)=(Lj⊗Lj)T; the inverse Lj−1⊗Lj−1 commutes as well.

1.2givenF1F2algebra

Fix i and write (a,b) for ea⊗eb. If the pair contains no i+1, both TEi and EiT vanish by [F2]–[F3]. For the remaining labels, the complete cases are: on (i+1,i+1) both composites give (i,i+1)+q(i+1,i); on (i+1,i) both give q2(i,i); on (i,i+1) both give q(i,i); for r<i, the inputs (i+1,r) and (r,i+1) give respectively (r,i)+c(i,r) and (i,r) under either composite; for r>i+1, those same two orientations give respectively (r,i) and (i,r)+c(r,i). These cases exhaust every pair containing i+1, including both orientations of each outside label, so TEi=EiT. The only coefficient simplification used in the repeated-label case is q−1+c=q.

1.3givenF1F2algebra

If a pair contains no i, both composites with Fi vanish. The remaining complete cases are: on (i,i) both give (i,i+1)+q(i+1,i); on (i,i+1) both give q(i+1,i+1); on (i+1,i) both give q2(i+1,i+1); for r<i, the inputs (i,r) and (r,i) give respectively (r,i+1)+c(i+1,r) and (i+1,r) under either composite; for r>i+1, they give respectively (r,i+1) and (i+1,r)+c(r,i+1). Thus every pair containing i is covered and TFi=FiT. The repeated-label coefficients use q−1+c=q and 1+cq=q2.

2.1step 1.1step 1.2step 1.3F2F3algebra∎

Coassociativity and the coproduct formulas in [F2] give on n positions Δn(Ei)=∑r=1n1⊗(r−1)⊗Ei⊗Ki⊗(n−r), Δn(Fi)=∑r=1n(Ki−1)⊗(r−1)⊗Fi⊗1⊗(n−r), and Δn(Lj)=Lj⊗n. For positions a,a+1, the two Ei summands at those positions restrict there to Ei⊗Ki+1⊗Ei, and the two Fi summands restrict to Fi⊗1+Ki−1⊗Fi; every earlier summand restricts to Ki⊗Ki or Ki−1⊗Ki−1, and every later summand to the identity. Step 1.1 handles these Cartan factors and steps 1.2–1.3 handle the two-site sums; therefore Ta commutes with each iterated quantum generator. Commuting with the generators implies commuting with their products and linear combinations, which proves BF⊆End⁡AF(VN⊗n).

Depends on

Used by

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