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.

Classical commutants bound the two generic tensor images

Statement

Let N≥2, n≥1, VF=Q(q)N, and MF=VF⊗n. Let AF and BF be respectively the images of the quantum algebra from The type-A quantum algebra and its tensor-action formulas and the normalized Hecke algebra action from The ordered-basis symmetry gives the normalized Hecke tensor action. Let A0 be the unital algebra generated by the classical operators ρn(a) of Classical tensor centralizer from polarization and Newton identities, and let B0 be the place-permutation image of Q[Sn]. The regular quantum and Hecke matrix families below specialize to generating families for these two rational algebras. Then dim⁡QA0≤dim⁡FAF,dim⁡QB0≤dim⁡FBF, dim⁡FEnd⁡BF(MF)≤dim⁡QA0,dim⁡FEnd⁡AF(MF)≤dim⁡QB0. These are separate image lower bounds and commutant upper bounds; the commuting inclusion needed to turn them into equalities is proved in The quantum and Hecke tensor actions commute.

Facts & Assumptions

Given: The quantum and Hecke actions above, their local relation-descent proofs, and the three local rank/centralizer suppliers below.

[F1]

The specialized classical quantum image satisfies A0=End⁡B0(M0) (Classical tensor centralizer from polarization and Newton identities).

[F2]

Over Q, the finite permutation image satisfies B0=End⁡A0(M0) (Finite semisimple matrix density and the double commutant over Q).

[F3]

A finite matrix over Q[q,q−1](q−1) has generic rank at least its rank at q=1; this gives both word-image lower bounds and commutant-kernel upper bounds (Finite matrix rank bounds under regular specialization).

Proof

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

1.1givenF1F2algebra

Put R=Q[q,q−1](q−1) and MR=(RN)⊗n, a finite free module with fraction-field fiber MF and residue-field fiber M0. All Hecke matrices and all iterated quantum matrices are regular over R by their explicit formulas. For the quantum family, also use Hj=(Lj−I)/(q−1). On a basis word with mj occurrences of j, Lj has eigenvalue qmj, so Hj is the diagonal matrix with entry 1+q+⋯+qmj−1 if mj>0 and 0 if mj=0. Thus Hj is regular and specializes to the classical diagonal count operator ρn(Ejj). The generators Ei,Fi,Hj specialize to the adjacent matrix Lie operators and all diagonal count operators, which generate A0 by the last conclusion of Classical tensor centralizer from polarization and Newton identities; Lj±1 specialize to the identity.

2.1givenF1F2F3step 1.1algebra

In a basis of MR, vectorize X∈End⁡(MR). The simultaneous commutator system for the finite family T1,…,Tn−1 is a finite matrix over R, and its kernel over F is End⁡BF(MF) while its kernel at q=1 is End⁡B0(M0). By [F3] its generic kernel dimension is at most the specialized one, which equals dim⁡QA0 by [F1]. The same construction for the finite family Ei,Fi,Lj±1,Hj has generic kernel End⁡AF(MF); at q=1 the family generates A0, so its specialized kernel is End⁡A0(M0), of dimension dim⁡QB0 by [F2]. This proves both commutant upper bounds independently.

3.1givenF1F2F3step 1.1algebra∎

The algebra A0 is finite-dimensional and generated by the specializations at q=1 of the regular quantum family in step 1.1. Words in that finite family span it, so select a finite word basis. The same words in the regular generic matrices have a vectorized-column matrix over R whose specialization has full column rank; [F3] gives their F-linear independence. Hence dim⁡FAF≥dim⁡QA0. Words in the finite family T1,…,Tn−1 similarly specialize to a spanning family of B0; selecting a basis and applying [F3] gives dim⁡FBF≥dim⁡QB0. Only these chosen regular words are specialized; no arbitrary rational denominator is evaluated at q=1.

Depends on

Used by

Dependency tree · two levels

21 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