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

Generic quantum Schur–Weyl mutual centralizers over Q(q)

Statement

Let F=Q(q), N≥1, n≥0, M=(FN)⊗n, and let AF,BF⊆End⁡F(M) be the images of the quantum and normalized Hecke tensor actions defined above. Then AF=End⁡BF(M),BF=End⁡AF(M). These are equalities for the two matrix-algebra images. If N<n, no faithfulness of the abstract Hecke algebra is asserted. If N≥n, the abstract Hecke action is faithful. The theorem is only over the rational function field Q(q) and asserts no equality at a root of unity, at an arbitrary specialized parameter, or over a field of positive characteristic.

Facts & Assumptions

Given: F=Q(q), integers N≥1,n≥0, the local commuting inclusion, the rank bounds, and the abstract Hecke standard basis.

[F1]

The two images commute: BF⊆End⁡AF(M) and AF⊆End⁡BF(M) (The quantum and Hecke tensor actions commute).

[F2]

For N≥2,n≥1, the two generic image lower bounds and commutant upper bounds are those of Classical commutants bound the two generic tensor images.

[F3]

The abstract type-A Hecke algebra has basis {tw:w∈Sn} over F, obtained by base change from the universal standard-basis theorem (The standard basis of the generic Hecke algebra and base change, Universal parameters, the generic Coxeter Hecke algebra and generator conjugacy).

[F4]

A nonzero minor of a matrix with entries regular at q=1 remains nonzero over F=Q(q) (Finite matrix rank bounds under regular specialization).

Proof

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

1.1givenF1F2algebra

Suppose first N≥2 and n≥1. By [F2] and the commuting inclusions [F1], dim⁡QA0≤dim⁡FAF≤dim⁡FEnd⁡BF(M)≤dim⁡QA0, so every inequality is equality and AF=End⁡BF(M) because the included finite-dimensional subspaces have equal dimension. The other sandwich is dim⁡QB0≤dim⁡FBF≤dim⁡FEnd⁡AF(M)≤dim⁡QB0, which gives BF=End⁡AF(M) by the same inclusion-and-dimension argument. This establishes both mutual centralizer equalities without generic semisimplicity or a character formula.

1.2givenF3F4algebra

Assume N≥n≥1. On v=e1⊗⋯⊗en, the orbit vectors ρn(tw)v have entries regular at q=1; their specializations are the n! distinct tensors obtained by permuting the distinct basis labels. Their vectorized column matrix therefore has an n!×n! minor equal to 1 at q=1, which remains nonzero over F by [F4]. Thus the orbit vectors are linearly independent over F. If h=∑w∈Snawtw lies in the kernel, the standard basis [F3] gives this expansion and 0=ρn(h)v=∑wawρn(tw)v forces every aw=0. Hence the abstract action is faithful.

2.1givenF1algebra

If n=0, then M=F and both unital images and both commutants are F; the unique unital map from the abstract algebra H0=F is the identity, so this action is faithful. If N=1, M is one-dimensional; the quantum image contains the scalars and every Hecke generator acts by q, so both images and both commutants are again F. These direct cases cover the parameters excluded from step 1.1.

3.1step 2.1step 1.1F3algebra∎

In the range N<n the equalities in step 1.1 remain image equalities and do not identify BF with the abstract Hecke algebra. The distinction is real: for N=1,n=2, the abstract algebra has basis 1,t1 by [F3], while its one-dimensional tensor-space action sends t1 to q; the nonzero element t1−q is in the kernel. No claim of faithfulness in the full range N<n is used in either centralizer equality.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

27 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