Alphabeta Math
Pipeline-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.

✓ 23 results · all verified · 6 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 17 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Type-A Hecke Specht Modules and Cellular Bases

1 · Prerequisites

2 · Summary

This page develops the cellular-algebra foundations of the modular representation theory of the type-A Hecke algebra and its q-Schur algebra. It begins with the Graham-Lehrer cellular calculus, the cell form and its radical, and the classification of the simple modules by the nonzero cell heads Dλ=Cλ/rad Cλ, with the dominance-unitriangular decomposition matrix as its first consequence.

The second half specialises to HF,q(Sn): the Murphy cellular basis and the identification of the Hecke Specht modules through the Dipper-James signed-cell dictionary, the triangular action of the Jucys-Murphy elements and the resulting seminormal bases in the separated range, the classification of the simple modules by the e-regular partitions, and the Schur functor connecting Weyl modules and their Jantzen filtrations to Specht modules. The q-Schaper virtual radical-layer formula and its hook-product Gram determinants are recorded in the form needed by the block and decomposition-number items of later pages, together with an explicit remark on the limits of what cellularity and the sum formula determine.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Cellular bases and cell modules

Definition

Let R be a commutative ring with 1 and A a unital R-algebra (Algebras over a commutative ring, central structure maps, and algebra homomorphisms) that is free as an R-module on a finite set C={cstλ:λ∈Λ, s,t∈T(λ)}, where (Λ,⊵) is a finite poset (Partial order and partially ordered set; its strict order is written ⊳) and each T(λ) is a finite set. For λ∈Λ let A⊳λ be the R-submodule of A spanned by all cuvμ with μ⊳λ.

Then (C,Λ) is a cellular basis of A, and A is a cellular algebra, if:

(i) the R-linear map i:A→A with i(cstλ)=ctsλ for all λ,s,t is an algebra anti-automorphism of A, i.e. i(ab)=i(b)i(a) and i(1)=1 (equivalently i is an isomorphism of A with the opposite algebra; the displayed formula forces i2=id); and

(ii) for every λ∈Λ, every t∈T(λ) and every a∈A there exist coefficients rv∈R (v∈T(λ)), independent of s, such that for every s∈T(λ) cstλ a≡∑v∈T(λ)rv csvλ(modA⊳λ).

Cell modules. For λ∈Λ let Cλ be the free R-module with basis {ctλ:=cttλ:t∈T(λ)}; condition (ii) makes Cλ a right A-module by ctλa:=∑vrvcvλ when cttλa≡∑vrvctvλ(modA⊳λ), and it makes Cλ a left A-module via i, the left action being a⋅ctλ:=ctλ i(a). Both actions are well defined on the freely spanning basis elements by (ii): the coefficients rv are unique because C is an R-basis of A and the quotient by A⊳λ kills exactly the basis elements indexed by strictly larger labels, while applying the anti-automorphism (i) to (ii) gives the same triangularity for left multiplication. The module Cλ is the (right) cell module of λ, and A⊵λ/A⊳λ≅Cλ⊗RCλ via cstλ+A⊳λ↦csλ⊗ctλ, where A⊵λ is spanned by all cuvμ with μ⊵λ. A cellular algebra may have several cellular bases.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

e-regular and e-restricted partitions

Definition

Let e∈{2,3,4,… }∪{∞} and let λ⊢n be a partition with parts λ1≥λ2≥⋯ and conjugate λ′ (Partitions, English diagrams, and conjugation). Then λ is e-regular when every positive integer occurs as a part of λ fewer than e times, i.e. zj(λ)<e for every j≥1, and e-restricted when λi−λi+1<e for every i≥1 (with λi:=0 for i>ℓ(λ)).

For prime e=p these are exactly the p-regular and p-restricted notions of p-regular and p-restricted partitions; the same inequalities define the extension to composite finite e. For e=∞ both conditions are vacuous, so every partition is both e-regular and e-restricted: the inequalities zj(λ)<∞ and λi−λi+1<∞ hold because partitions have finitely many nonzero parts and each difference is a nonnegative integer. Moreover λ is e-restricted if and only if its conjugate λ′ is e-regular: the multiplicity of the part i in λ′ is the number of columns of [λ] of height exactly i, namely λi−λi+1, so the two conditions zi(λ′)=λi−λi+1<e are the same family of inequalities, and for e=∞ both sides hold. In particular ∅ is simultaneously e-regular and e-restricted for every e (p-regular and p-restricted partitions).

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

The quantum characteristic of an invertible Hecke parameter

Definition

Let F be a field and q∈F× an invertible element. The quantum characteristic e=e(F,q) is the least integer e≥2 such that 1+q+⋯+qe−1=0 in F, and e:=∞ when no such integer exists (The q-integer, q-factorial and q-multinomial coefficients, The generic type-A Hecke algebra). Since [1]q=1≠0, the least positive integer e with [e]q=0, when it exists, automatically satisfies e≥2, so the two formulations coincide.

Concretely: (i) if q≠1 then [m]q=(qm−1)/(q−1) for all m≥0 — indeed (q−1)(1+q+⋯+qm−1)=qm−1 and q−1≠0 — so [e]q=0 is equivalent to qe=1, and a finite e exists exactly when q is a root of unity and then e is the multiplicative order of q in F× (which is ≥2 because q≠1); (ii) if q=1 then [m]1=m, so e=char⁡(F) when char⁡(F)>0 (the characteristic is a prime, hence at least 2, and m⋅1F≠0 for 1≤m<p) and e=∞ when char⁡(F)=0 (Group algebra and finite-field specializations of the generic Hecke algebra).

If e<∞ then q≠1 implies qe=1, and hence [m+e]q=[m]q for every integer m: for m≥0 the sum splits as [m+e]q=[m]q+qm[e]q, so [m+e]q=[m]q whenever [e]q=0; for the remaining m<0 one extends the closed formula by [m]q:=(qm−1)/(q−1) when q≠1 and reads [m]1:=m∈F for the canonical image of the integer m when q=1, in which case e=char⁡(F) and [m+e]1=m+e=m in F. In particular the quantum characteristic, not merely the multiplicative order, is the parameter governing the modular representation theory of the Hecke algebra. No choice principle is used.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Decompositions of the identity into primitive central idempotents are unique

Statement

Let A be a unital ring (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides), with centre Z(A):={z∈A:za=az for all a∈A}. Suppose that 1=e1+⋯+ek=f1+⋯+fℓ where {e1,…,ek} and {f1,…,fℓ} are finite families of pairwise orthogonal central idempotents of A that are primitive among central idempotents: each is nonzero and admits no decomposition as a sum of two nonzero orthogonal central idempotents (zero parts are omitted). Then k=ℓ and there is a bijection σ of the index sets with ei=fσ(i) for all i; in particular the decomposition of 1 into primitive central idempotents is unique up to order. No choice principle is used, the families being finite.

Facts & Assumptions

Given: A unital ring A with centre Z(A)={z∈A:za=az for all a∈A}; finite families e1,…,ek and f1,…,fℓ of pairwise orthogonal nonzero central idempotents of A that are primitive among central idempotents, with 1=e1+⋯+ek=f1+⋯+fℓ.

[F1]

Ring axioms and the zero ring: (A,+,0) is an abelian group, multiplication is associative with two-sided identity 1 and distributes over addition on both sides, and a ring in which 1=0 has exactly one element (Ring: an abelian group under addition and a monoid under multiplication, with multiplication distributing over addition on both sides).

Proof

technique · direct
1.1givenF1

If k=0 or ℓ=0 then 1=0 in A, so A has exactly one element by [F1], namely 0; then no nonzero idempotent exists and the two families are empty, k=ℓ=0, and the empty map is the required bijection. Assume henceforth that k,ℓ≥1.

1.2F1givenalgebra

For central idempotents e,f∈A the products ef and e(1−f) are central idempotents with ef+e(1−f)=e and ef⋅e(1−f)=0: centrality gives (ef)a=e(fa)=e(af)=(ea)f=(ae)f=a(ef) and (1−f)a=a−af=a−fa=a(1−f) for all a∈A; idempotence gives (ef)2=efef=e2f2=ef and (1−f)2=1−2f+f2=1−f, hence e(1−f)e(1−f)=e2(1−f)2=e(1−f); distributivity gives ef+e(1−f)=e(f+1−f)=e and ef⋅e(1−f)=e2f(1−f)=0.

2.1step 1.2given

If e is primitive and f is a central idempotent, then ef∈{0,e}: by step 1.2, e=ef+e(1−f) exhibits e as a sum of the two orthogonal central idempotents ef and e(1−f), so primitivity forces ef=0 or e(1−f)=0; in the second case step 1.2 gives ef=ef+0=ef+e(1−f)=e.

3.1givenstep 2.1F1algebra

Fix j∈{1,…,ℓ}. Since 1=e1+⋯+ek, distributivity and centrality give fj=fj⋅1=∑ifjei=∑ieifj, and step 2.1 gives eifj∈{0,ei} for every i; since fj≠0, the set Sj:={i:eifj=ei} is nonempty and fj=∑i∈Sjei.

4.1step 3.1givenalgebra

For every j the set Sj is a singleton: its elements ei are pairwise orthogonal nonzero central idempotents summing to fj by step 3.1, so if Sj contained distinct i≠i′ then fj=ei+∑i′′∈Sj, i′′≠iei′′ would exhibit fj as a sum of the two orthogonal central idempotents ei and fj−ei, both nonzero since multiplying the second sum by the nonzero idempotent ei′ retrieves ei′, contradicting primitivity of fj; hence Sj={i(j)} and fj=ei(j).

5.1step 4.1givenalgebra

The map j↦i(j) is injective: if i(j)=i(j′)=i with j≠j′, then ei=ei2=fjfj′=0 by idempotence, centrality and pairwise orthogonality of the f's, contradicting ei≠0.

5.2step 4.1givenF1algebra

The map j↦i(j) is surjective: from fj=ei(j) for all j and both decompositions, ∑jei(j)=1=∑iei; multiplying this equality by the central idempotent ei and using pairwise orthogonality of the e's gives ei on the left when i lies in the image of j↦i(j) and 0 otherwise, while the right side is ei≠0; hence every i lies in the image.

6.1step 4.1step 5.1step 5.2∎

Steps 5.1 and 5.2 make j↦i(j) a bijection {1,…,ℓ}→{1,…,k} with fj=ei(j) for all j by step 4.1; its inverse σ satisfies ei=fσ(i) for all i, and k=ℓ. Since the families were arbitrary, the decomposition of 1 into primitive central idempotents is unique up to order, as claimed.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The identity of a finite-dimensional algebra decomposes into primitive central idempotents

Statement

Let F be a field and A a finite-dimensional unital F-algebra with centre Z(A):={z∈A:za=az for all a∈A} (Algebras over a commutative ring, central structure maps, and algebra homomorphisms). Then Z(A) is a finite-dimensional commutative F-algebra, and the identity 1∈Z(A) admits a decomposition 1=e1+⋯+ek into pairwise orthogonal primitive central idempotents of A: each ei is a nonzero idempotent of Z(A) that is not the sum of two nonzero orthogonal idempotents of Z(A). No semisimplicity of A is assumed and no choice principle is used.

Facts & Assumptions

Given: A field F, a finite-dimensional unital F-algebra A, and the centre C:=Z(A)={z∈A:za=az for all a∈A}.

[F1]

F-algebra conventions: a unital F-algebra A is a unital ring together with a unital ring homomorphism η:F→A whose image is central, and the induced scalar action ra:=η(r)a makes A an F-module with multiplication A×A→A bilinear (Algebras over a commutative ring, central structure maps, and algebra homomorphisms).

[F2]

Subspace dimension: if V is a finite-dimensional vector space over F with dim⁡FV=n and U a linear subspace of V, then U is finite-dimensional with dim⁡FU≤n, and dim⁡FU=n if and only if U=V (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V).

[F3]

Well-ordering principle: every nonempty subset of N has a least element (The well-ordering principle).

Proof

technique · direct
1.1givenF1

If A=0, then C=Z(A)={0} and the empty family (k=0) satisfies 1=e1+⋯+ek with the stated conditions vacuously, so assume A≠0; then in A one has 1≠0 and hence 1≠0 in C.

1.2givenF1algebra

The centre C is a commutative unital F-subalgebra of A and, in particular, a linear subspace of the F-vector space A: 1∈C; if x,y∈C, α∈F and a∈A, then (x+y)a=xa+ya=ax+ay=a(x+y), (αx)a=α(xa)=α(ax)=a(αx) and (xy)a=x(ya)=x(ay)=(xa)y=(ax)y=a(xy), while 0∈C; and distinct elements of C commute with each other because each commutes with all of A.

1.3givenF3

Suppose, for contradiction, that the following general claim fails: every finite-dimensional commutative unital F-algebra D with 1D≠0 and dim⁡FD≥1 admits a decomposition of 1D into pairwise orthogonal idempotents of D that are primitive in D. Let S⊆N be the nonempty set of F-dimensions of such counterexamples; by [F3] let d∈S be least and fix a counterexample D with dim⁡FD=d.

2.1step 1.2F2

The centre C is finite-dimensional over F with dim⁡FC≤dim⁡FA, by [F2] applied to the linear subspace C of the finite-dimensional space A.

2.2step 1.3given

Since D is a counterexample, 1D is not primitive in D: otherwise k=1, e1=1D would be the required decomposition. Hence there are nonzero orthogonal idempotents u,v∈D with 1D=u+v.

3.1step 2.2F1algebra

The set Du:=uD={ux:x∈D} is a linear subspace of D and, with the inherited operations, a commutative unital F-algebra with identity u: it is closed since ux+uy=u(x+y), α(ux)=u(αx) and (ux)(uy)=u2xy=u(xy) for x,y∈D, α∈F, while u⋅ux=ux; and u≠0. The same holds for Dv:=vD with identity v.

4.1step 3.1step 1.3F2algebra

One has Du≠D because v∉Du: if v=ux then 0=uv=u2x=ux=v≠0, a contradiction using uv=0 and u2=u. Hence by [F2], applied to the subspace Du of D with dim⁡FD=d, one has dim⁡FDu<d; the same argument gives dim⁡FDv<d.

5.1step 4.1step 1.3given

By the minimality of d in S, no counterexample has dimension <d, and since dim⁡FDu<d and dim⁡FDv<d with 1Du=u≠0, 1Dv=v≠0, the general claim holds for Du and for Dv: there are pairwise orthogonal idempotents f1,…,fa of Du primitive in Du with u=f1+⋯+fa, and pairwise orthogonal idempotents g1,…,gb of Dv primitive in Dv with v=g1+⋯+gb.

6.1step 5.1step 3.1algebra

The combined family f1,…,fa,g1,…,gb is a decomposition of 1D into pairwise orthogonal idempotents of D that are primitive in D: the elements lie in Du∪Dv⊆D; distinct f's are orthogonal and distinct g's are orthogonal by step 5.1; figj=(ufi)(vgj)=uvfigj=0; and if fi=p+q with p,q nonzero orthogonal idempotents of D, then p=fip=ufip=up∈Du and likewise q=uq∈Du, contradicting primitivity of fi in Du (and symmetrically for gj in Dv).

7.1step 6.1step 1.3

Step 6.1 contradicts the choice of D as a counterexample, so no counterexample exists and the general claim of step 1.3 holds: every finite-dimensional commutative unital F-algebra D with 1D≠0 and dim⁡FD≥1 decomposes its identity into pairwise orthogonal primitive idempotents.

8.1step 7.1step 2.1step 1.1∎

Apply step 7.1 to D=C=Z(A): by steps 1.1 and 1.2, C is a commutative unital F-algebra with 1≠0 and dim⁡FC≥1; by step 2.1 it is finite-dimensional. This produces 1=e1+⋯+ek with the ei pairwise orthogonal idempotents of C=Z(A) primitive in C; idempotents of Z(A) are exactly the central idempotents of A, and primitive in C says precisely that ei is not the sum of two nonzero orthogonal idempotents of Z(A). Since no semisimplicity was used and the only invoked principles are the choice-free subspace theorem [F2], the choice-free well-ordering principle [F3] and finite selections, the proof is complete.

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (gpt-6.1-sol)Open item page →

The star anti-automorphism of the type-A Hecke algebra

Statement

Let R be a commutative ring, q∈R×, and let H=HR,q(Sn) be the specialized type-A Hecke algebra with generators T1,…,Tn−1 and relations Ti2=(q−1)Ti+q, the braid relations and the distant commutations (The generic type-A Hecke algebra, The standard basis of the generic type-A Hecke algebra). Then the assignment Ti↦Ti (1≤i<n) extends uniquely to an R-algebra anti-automorphism ∗:H→H, i.e. an R-linear map with (ab)∗=b∗a∗ and 1∗=1; it is an involution, ∗∗=idH, and on the standard basis Tw∗=Tw−1(w∈Sn). In particular (TwTw−1)∗=TwTw−1 and, for the symmetrizers mλ=∑w∈SλTw, one has mλ∗=mλ.

Facts & Assumptions

Given: A commutative ring R, a unit q∈R×, and the specialized type-A Hecke algebra H=HR,q(Sn), presented over R by generators T1,…,Tn−1 with the relations Ti2=(q−1)Ti+q, TiTi+1Ti=Ti+1TiTi+1 (1≤i≤n−2) and TiTj=TjTi (∣i−j∣>1).

[F1]

The generic algebra and its specialization: Hv(n) is the quotient of the free unital associative A-algebra, A=Z[v±1], on the Ti by the two-sided ideal generated by the quadratic and braid relators; a reduced expression of w∈Sn is a word w=si1⋯siℓ of minimal length ℓ(w) representing w, and Tw:=Ti1⋯Tiℓ, the empty product for w=1; the specialization at v0 is the R-algebra R⊗AHv(n), and for v0=q it is H, presented over R by the images of the Ti subject to the relations above (The generic type-A Hecke algebra).

[F2]

Standard basis of the generic algebra: {Tw:w∈Sn} is an A-basis of Hv(n), so Tw is independent of the reduced expression chosen for w (The standard basis of the generic type-A Hecke algebra).

[F3]

Length is inversion invariant: ℓ(w−1)=ℓ(w) for every w∈Sn (Permutation Weyl group and inversion length).

[F4]

For a set X, the finite words X∗ form a monoid under concatenation with the empty word as identity (Finite words satisfy the free-monoid universal property).

[F5]

The free R-module R(X∗) on the set X∗ has the words as an R-basis: every element is a unique finite R-linear combination ∑waww (The free module on a set and its standard basis).

[F6]

Two-sided ideals are additive subgroups closed under multiplication on both sides; for S⊆F the ideal (S) is the intersection of all two-sided ideals containing S, so any two-sided ideal containing S contains (S) (Left, right and two-sided ideals, The ideal generated by a subset and principal ideals).

[F7]

The quotient ring F/I has additive cosets with (x+I)(y+I)=xy+I and R-scalar action inherited from F (The quotient ring R/I with (r+I)(s+I)=rs+I).

Proof

technique · direct
1.1givenF1F4F5F7

Put X:={1,…,n−1} and F:=R(X∗), the free R-module with the finite words in X as basis [F5]; write the basis word corresponding to i1,…,ik as Ti1⋯Tik and the empty word as 1. Extending concatenation of words R-bilinearly makes F a unital associative R-algebra: concatenation is associative with two-sided identity the empty word by [F4], and distributivity holds by the bilinear extension. Let I⊆F be the two-sided ideal generated by the relators ri:=Ti2−(q−1)Ti−q⋅1, bi:=TiTi+1Ti−Ti+1TiTi+1 and dij:=TiTj−TjTi, and put H:=F/I, which by [F1] is the presented algebra HR,q(Sn), the image of Ti being again written Ti; every element of H is the image of an R-linear combination of words in the Ti, so H is generated as an R-algebra by T1,…,Tn−1.

1.2F4F5algebra

Define ρ:F→F on the word basis by ρ(Ti1⋯Tik):=Tik⋯Ti1 and ρ(1):=1, extended R-linearly. Then ρ is an R-linear involution and reverses products, ρ(xy)=ρ(y)ρ(x), because reversal of a concatenation is the concatenation of the reversals in the opposite order and both sides are R-bilinear; in particular ρ2=idF and ρ(Ti)=Ti for each generator.

2.1step 1.2F6algebra

ρ preserves I, i.e. ρ(I)⊆I: the relators are fixed up to sign, ρ(ri)=ri, ρ(bi)=bi and ρ(dij)=−dij by step 1.2, so each lies in I; the set J:={x∈F:ρ(x)∈I} contains 0, is closed under addition and additive inverses because ρ is R-linear and I is an additive subgroup, and for x∈J and a∈F one has ρ(ax)=ρ(x)ρ(a)∈I and ρ(xa)=ρ(a)ρ(x)∈I because I is a two-sided ideal [F6]; hence J is a two-sided ideal containing all relators, so (S)⊆J and I=(S)⊆J, that is, ρ(I)⊆I.

3.1step 1.1step 1.2step 2.1F7algebra

Consequently ρˉ:H→H, ρˉ(x+I):=ρ(x)+I, is well defined: if x−y∈I then ρ(x)−ρ(y)=ρ(x−y)∈I by step 2.1. It is an R-linear anti-automorphism of H with ρˉ2=id and ρˉ(Ti)=Ti: the quotient operations of [F7] and step 1.2 give ρˉ((x+I)(y+I))=ρ(xy)+I=ρ(y)ρ(x)+I=ρˉ(y+I)ρˉ(x+I), and similarly for addition, scalars and the unit.

4.1step 1.1step 3.1algebra

ρˉ is the unique R-algebra anti-automorphism of H with ρˉ(Ti)=Ti for all i: if α is any such anti-automorphism, then α and ρˉ agree on 1, and for a word Ti1⋯Tik one has α(Ti1⋯Tik)=α(Tik)⋯α(Ti1)=Tik⋯Ti1=ρˉ(Ti1⋯Tik); the words span H by step 1.1, so α=ρˉ by R-linearity.

4.2givenF1F2F3step 3.1algebra

For w∈Sn and a reduced expression w=si1⋯siℓ one has Tw=Ti1⋯Tiℓ in the generic algebra and hence Tw=Ti1⋯Tiℓ∈H; thus Tw∗=ρˉ(Ti1⋯Tiℓ)=Tiℓ⋯Ti1 by step 3.1. The reversed word siℓ⋯si1 represents w−1 and has ℓ letters, and ℓ=ℓ(w)=ℓ(w−1) by [F3], so it is a reduced expression of w−1 and therefore Tw−1=Tiℓ⋯Ti1∈H; hence Tw∗=Tw−1 for every w, and Tw is well defined in H independently of the chosen reduced expression by [F1] and [F2].

5.1step 3.1step 4.1step 4.2algebra∎

The assertions of the statement follow: ∗:=ρˉ is the unique extension of the assignment Ti↦Ti, an involution by step 3.1; Tw∗=Tw−1 is step 4.2; therefore (TwTw−1)∗=Tw−1∗Tw∗=T(w−1)−1Tw−1=TwTw−1; and for the parabolic subgroup Sλ the map w↦w−1 is a bijection of Sλ, so mλ∗=∑w∈SλTw−1=∑v∈SλTv=mλ. No choice principle is used: the constructions are explicit on the word basis.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Blocks of a finite-dimensional algebra via primitive central idempotents

Definition

Let F be a field and A a finite-dimensional unital F-algebra with centre Z(A):={z∈A:za=az for all a∈A} (Algebras over a commutative ring, central structure maps, and algebra homomorphisms). A central idempotent of A is an idempotent e∈Z(A); it is primitive when e≠0 and e is not the sum of two nonzero orthogonal central idempotents.

Then Z(A) is a finite-dimensional commutative F-algebra, so the identity 1∈Z(A) admits a decomposition 1=e1+⋯+ek into pairwise orthogonal primitive central idempotents (The identity of a finite-dimensional algebra decomposes into primitive central idempotents), and this decomposition is unique up to order (Decompositions of the identity into primitive central idempotents are unique). A block of A is the two-sided ideal B=eA=Ae cut out by a primitive central idempotent e (the two descriptions agree because e is central).

The blocks are pairwise orthogonal two-sided ideals: BiBj⊆eiAejA=eiejA=0 for i≠j, and ei∈Bi is the identity of Bi since ei(eia)=eia and (aei)ei=aei. Moreover A=B1⊕⋯⊕Bk as F-algebras with units ei: every a∈A is a=(∑iei)a=∑ieia with eia∈Bi, and if ∑ibi=0 with bi∈Bi then multiplying by ej gives bj=ejbj=∑iejbi=0, so the sum is direct. Each Bi is an indecomposable two-sided ideal: if Bi=J⊕J′ were a direct sum of nonzero two-sided ideals, the projections of ei onto J and J′ would be nonzero orthogonal central idempotents of A summing to ei, as is seen by applying to ei the A-bimodule projections Bi→J and Bi→J′, which satisfy π(ax)=aπ(x) and π(xa)=π(x)a; this contradicts primitivity of ei.

For every (not necessarily finite-dimensional) A-module M one has M=⨁i=1keiM as A-modules: ∑iei=1 acts as the identity on M, so M=∑ieiM, and if ∑imi=0 with mi=eimi then applying ej gives mj=0; each eiM is A-stable because ei is central. A simple A-module S satisfies eiS≠0 for exactly one i, and then S=eiS lies in the corresponding block: S=(∑iei)S=∑ieiS forces some eiS≠0, and if eiS≠0≠ejS with i≠j then simplicity gives eiS=S=ejS, whence S=eiS=ei(ejS)=(eiej)S=0, a contradiction. Nothing here asserts that a block is semisimple or simple, and the construction is choice-free.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Hecke Jucys-Murphy elements and q-contents

Definition

Let R be a commutative ring, q∈R×, and H=HR,q(Sn) (The generic type-A Hecke algebra). For 1≤k≤n define L1:=0,Lk:=q−1T(k−1,k)+q−2T(k−2,k)+⋯+q1−kT(1,k)∈H(k≥2), where T(i,k) is the standard basis element indexed by the transposition (i k) (The standard basis of the generic type-A Hecke algebra). The Lk are the Hecke Jucys-Murphy elements. They are fixed by the star anti-automorphism Tw∗=Tw−1 (The star anti-automorphism of the type-A Hecke algebra): each transposition (i k) is its own inverse, so T(i,k)∗=T(i,k), and the coefficients qi−k are central, whence Lk∗=∑i<kqi−kT(i,k)=Lk. They commute pairwise and every symmetric polynomial in L1,…,Ln with coefficients in R is central in H (The Hecke Jucys-Murphy action is dominance triangular).

q-contents. The quantum integers [m]q for m≥0 are those of The q-integer, q-factorial and q-multinomial coefficients; extend the definition to negative indices by [−m]q:=−q−m[m]q for m>0, so that (q−1)[m]q=qm−1 for all m∈Z. When q−1 is a unit this may be written [m]q=(qm−1)/(q−1); the polynomial definition requires no such division. Also [m]1=m for all m∈Z, since [−r]1=−[r]1=−r. For a standard λ-tableau t and 1≤k≤n let content⁡t(k)=c−r be the content of the node carrying k (The content of a node and the content vector of a standard tableau) and define the q-content value [content⁡t(k)]q. If e=e(F,q)<∞ for a field F then [m+e]q=[m]q for every m∈Z (The quantum characteristic of an invertible Hecke parameter), so the q-content value depends only on the residue of the content modulo e. At q=1 the identification HR,1(Sn)≅R[Sn] with Tw↦w — the isomorphism given by the Coxeter presentation and the standard bases (The symmetric group has the Coxeter presentation, The standard basis of the generic type-A Hecke algebra) — sends Lk to the ordinary Jucys-Murphy element Xk=∑j<k(j k) (The Jucys-Murphy elements of the symmetric group algebra), because each coefficient qj−k specializes to 1, and [content⁡t(k)]1=content⁡t(k).

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Murphy elements and Murphy tableau elements

Definition

Let R be a commutative ring, q∈R×, and H=HR,q(Sn) with standard basis {Tw} and star anti-automorphism ∗ (The generic type-A Hecke algebra, The standard basis of the generic type-A Hecke algebra, The star anti-automorphism of the type-A Hecke algebra). For a composition (in particular a partition) μ of n put mμ:=∑w∈SμTw∈H, the row symmetrizer of the standard Young subgroup Sμ (Young subgroups, tabloids, and permutation modules); the sum has ∣Sμ∣=∏iμi! terms.

A tableau is row standard when its entries increase along each row. Use the right tableau action t⋅w:=w−1⋅t, where the left action applies w to the entries. For a row-standard μ-tableau s, let d(s) be the unique permutation with s=tμ⋅d(s), where tμ is filled by 1,2,…,n in row-major order. Explicitly, if s carries entry a in the p-th node in that order, then d(s)(a)=p: d(s) is the inverse of the row-reading permutation. The action on tableaux is free; the stabilizer of the row tabloid of tμ is Sμ (Row and column stabilizers).

Write Dμ for these distinguished permutations. Row-standardness says that d−1 is increasing on each canonical row block. The coset Sμd consists exactly of the tableaux with the same row sets, so sorting each row produces its unique representative in Dμ. Moreover, ℓ(wd)=ℓ(w)+ℓ(d)(w∈Sμ, d∈Dμ). To verify this, count inversions of (wd)−1=d−1w−1. Pairs of labels within one canonical block contribute exactly the inversions of w−1, since d−1 is increasing there. For labels in different blocks, w−1 permutes the labels within their respective blocks, so the total number of cross-block inversions equals that of d−1. The two contributions give the displayed equality, using inversion invariance of length. It also proves minimality and uniqueness in Sμd. These conventions extend to compositions by using their consecutive row blocks. For row-standard μ-tableaux s,t define the Murphy element mst:=Td(s)∗ mμ Td(t)∈H, and for a standard λ-tableau t write the diagonal element as mtt=Td(t)∗mλTd(t); the notation mt is reserved for a cell-module vector, rather than an element of H. Then mst∗=mts for all row-standard s,t of the same shape: applying the anti-automorphism, which fixes mμ because mμ∗=∑w∈SμTw−1=mμ, gives mst∗=(Td(s)∗mμTd(t))∗=Td(t)∗mμ∗Td(s)∗∗=Td(t)∗mμTd(s)=mts. Finally, mμTw=qℓ(w)mμ for every w∈Sμ: it suffices to prove this for w=si a simple transposition with i,i+1 in the same block of μ, since any w∈Sμ∖{1} has a reduced expression w=w′si with ℓ(w)=ℓ(w′)+1 and the claim follows by induction, mμTw=mμTw′Ti=qℓ(w′)mμTi=qℓ(w)mμ. For such i the right multiplication v↦vsi is an involution of the finite group Sμ, and pairing the summands of mμTi=∑v∈SμTvTi in twos gives, in the two cases of the standard-basis multiplication rule TvTi=Tvsi if ℓ(vsi)=ℓ(v)+1 and TvTi=(q−1)Tv+qTvsi if ℓ(vsi)=ℓ(v)−1, TvTi+TvsiTi=q (Tv+Tvsi), so summing over the 12∣Sμ∣ pairs yields mμTi=qmμ.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The cell form is associative and its radical is a submodule

Statement

Let R be a commutative ring and A a cellular R-algebra with cellular basis (C,Λ) and cell modules Cλ (Cellular bases and cell modules). For each λ∈Λ there is a unique R-bilinear form ⟨ , ⟩λ:Cλ×Cλ⟶R with cusλctvλ≡⟨csλ,ctλ⟩λ cuvλ(modA⊳λ) for all s,t,u,v∈T(λ); in particular the scalar coefficient on the right hand side is independent of u and v, and ⟨csλ,ctλ⟩λ depends only on s,t. This form is (i) symmetric, ⟨x,y⟩λ=⟨y,x⟩λ; (ii) associative, ⟨xa,y⟩λ=⟨x, i(a)y⟩λ for all a∈A, where i(a)y denotes the right action y i(a) of i(a) on y, i.e. the left action a⋅y:=y i(a); (iii) characterised by x cuvλ=⟨x,cuλ⟩λ cvλ for x∈Cλ; and (iv) its radical rad Cλ:={x∈Cλ:⟨x,y⟩λ=0 for all y∈Cλ} is an A-submodule of Cλ, namely the kernel of x↦⟨x,−⟩λ.

Facts & Assumptions

Given: A commutative ring R, a cellular R-algebra A with cellular basis (C,Λ), a label λ∈Λ, and the cell module Cλ with basis {ctλ:t∈T(λ)} (Cellular bases and cell modules).

[F1]

The cellular axioms and cell-module structure (Cellular bases and cell modules): C={cstλ} is an R-basis of A; A⊳λ=⟨cuvμ:μ⊳λ⟩R; the R-linear map i with i(cstλ)=ctsλ is an algebra anti-automorphism with i2=id; for all λ, t∈T(λ), a∈A there are rv∈R with cstλa≡∑vrvcsvλ(modA⊳λ) for all s; Cλ is a right A-module by ctλa:=∑vrvcvλ when cttλa≡∑vrvctvλ(modA⊳λ), and a left A-module via i with a⋅ctλ:=ctλi(a); and A⊵λ/A⊳λ≅Cλ⊗RCλ via cstλ+A⊳λ↦csλ⊗ctλ, where A⊵λ=⟨cuvμ:μ⊵λ⟩R.

Proof

technique · direct
1.1givenF1algebra

The submodules A⊵λ and A⊳λ are two-sided ideals of A, and the following two congruence rules hold modulo A⊳λ: for all a∈A and u,v∈T(λ), cusλa≡∑w∈T(λ)rw cuwλ,a ctvλ≡∑w∈T(λ)sw cwvλ, where the rw do not depend on u and the sw do not depend on v. Indeed, the first is the cellular rule [F1] applied to the fixed label λ, the second-slot index s and the element a, which gives coefficients independent of the free first index u; right multiplication by a therefore preserves each A⊵μ and A⊳μ, so A⊵λ and (as its span over all μ⊳λ) A⊳λ are right ideals, while applying the anti-automorphism i to the first rule — it swaps the two indices, fixes R and preserves both spans — gives the second rule and shows that they are also left ideals.

2.1givenstep 1.1F1algebra

Existence and uniqueness of the form: for all s,t∈T(λ) there is a unique r=r(s,t)∈R with cusλctvλ≡r cuvλ(modA⊳λ) for all u,v, and r depends only on s,t. Since A⊳λ is a two-sided ideal by step 1.1, the quotient ring A/A⊳λ contains Q:=A⊵λ/A⊳λ with R-basis the classes cˉuv:=cuvλ+A⊳λ. Applying the two rules of step 1.1 to the product cusλctvλ — first with a:=ctvλ, then with a:=cusλ — gives cˉuscˉtv=∑wρwcˉuw=∑xσxcˉxv, where ρw does not depend on u and σx does not depend on v. Comparing the coefficients of cˉab in the two bases: the left expansion contributes ρb when a=u and 0 otherwise, the right expansion σa when b=v and 0 otherwise; hence σa=0 for a≠u and ρb=0 for b≠v, leaving cˉuscˉtv=σucˉuv=ρvcˉuv. The common value σu=ρv is independent of v (being σu) and independent of u (being ρv), so it depends only on s,t; call it ⟨csλ,ctλ⟩λ. It is determined by the displayed congruence, because the coefficient of cˉuv in the indicated free basis is unique, including over the zero ring. Bilinear extension gives the unique R-bilinear form with the stated property.

3.1step 2.1F1algebra

Symmetry: for all s,t,u,v, using that i is an anti-automorphism with i(cabλ)=cbaλ, fixes R and preserves A⊳λ, one has ⟨csλ,ctλ⟩λcˉuv≡cusλctvλ=(cvtλcsuλ)i≡(⟨ctλ,csλ⟩λcvuλ)i=⟨ctλ,csλ⟩λcˉuv, so ⟨csλ,ctλ⟩λ=⟨ctλ,csλ⟩λ, and by bilinearity ⟨x,y⟩λ=⟨y,x⟩λ for all x,y∈Cλ.

3.2step 1.1step 2.1F1algebra

Associativity: fix s,t∈T(λ) and a∈A, and write csλa=∑wrwcwλ in Cλ — the coefficients rw are those of step 1.1. Then, by step 2.1 applied first to csλa and bilinearity of the form, ⟨csλa,ctλ⟩λcˉuv=∑wrwcˉuwcˉtv=(cˉusaˉ)⋅cˉtv=cˉus⋅(aˉcˉtv). The second rule of step 1.1 writes actvλ≡∑xsxcxvλ(modA⊳λ) with coefficients sx characterised by ctλi(a)=∑xsxcxλ in Cλ; hence cˉus⋅(aˉcˉtv)=∑xsxcˉuscˉxv=∑xsx⟨csλ,cxλ⟩λcˉuv=⟨csλ,ctλi(a)⟩λcˉuv=⟨csλ,a⋅ctλ⟩λcˉuv. Cancelling the basis element cˉuv gives ⟨csλa,ctλ⟩λ=⟨csλ,i(a)ctλ⟩λ; by bilinearity this is ⟨xa,y⟩λ=⟨x,i(a)y⟩λ for all x,y∈Cλ. Replacing a by i(a) and using i2=id gives the equivalent left-action form ⟨x i(a),y⟩λ=⟨x, i(a)⋅y⟩λ, where i(a)⋅y=y i(i(a))=y a is the left action of i(a): this is the dual statement.

3.3step 2.1F1algebra

The adjointness identity x cuvλ=⟨x,cuλ⟩λcvλ holds for all x∈Cλ and u,v∈T(λ): it suffices to treat x=csλ, and there step 2.1 with (u,s,t,v):=(s,s,u,v) gives cssλcuvλ≡⟨csλ,cuλ⟩λcsvλ(modA⊳λ); by the definition of the right action in [F1], the coefficients of csvλ on the right are exactly the coefficients of cvλ in csλ⋅cuvλ, so csλ cuvλ=⟨csλ,cuλ⟩λcvλ; bilinearity in x extends this to all x.

4.1step 3.2step 3.3algebra∎

The radical is a submodule and a kernel: for fixed y∈Cλ the assignment x↦⟨x,y⟩λ is an R-linear map with kernel {x:⟨x,y⟩λ=0}, so rad Cλ=⋂yker⁡(x↦⟨x,y⟩λ) is an R-submodule; and if x∈rad Cλ then for every a∈A and y∈Cλ step 3.2 gives ⟨xa,y⟩λ=⟨x,i(a)y⟩λ=0, so xa∈rad Cλ: the radical is an A-submodule, namely the kernel of the A-module map x↦⟨x,−⟩λ. This completes the proof of (i)-(iv).

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The Murphy tableau elements form a cellular basis

Statement

Let R be a commutative ring, q∈R×, and H=HR,q(Sn) (The generic type-A Hecke algebra). Let Λ be the set of partitions of n ordered by dominance ⊵ (Dominance order on partitions), and for λ∈Λ let T(λ)=Std(λ) be the set of standard λ-tableaux (Tableaux and standard tableaux). Then the Murphy basis theorem holds: the family M={mst:λ⊢n, s,t∈Std(λ)} is an R-basis of H, and (M,Λ) is a cellular basis of H in the sense of Cellular bases and cell modules. Explicitly: (i) mst∗=mts for all λ and s,t; and (ii) for every λ, every t∈Std(λ) and every h∈H there exist rv∈R with msth≡∑v∈Std(λ)rv msv(modH⊳λ), where H⊳λ is spanned by the muv with μ⊳λ. The theorem holds over every commutative coefficient ring with q∈R× and assumes no semisimplicity; the total number of Murphy elements is ∑λ⊢n∣Std(λ)∣2=n! (The sum of squares of the standard tableau numbers), matching the rank of H.

Facts & Assumptions

Given: A commutative ring R, a unit q, the type-A Hecke algebra and the Murphy elements mst=Td(s)∗xλTd(t) in the Statement.

[F1]

The independent integral construction proves that these exact elements form a base-change-compatible basis; their dominance spans are two-sided ideals, star interchanges the indices, and their multiplication satisfies the fixed-first-index cell law over every commutative coefficient ring with unit parameter (The Murphy cellular basis, the cell law and the Murphy form).

[F2]

The elements xλ and d(t) are the row symmetrizer and distinguished tableau permutations of Murphy elements and Murphy tableau elements, using the standard Hecke basis of The standard basis of the generic type-A Hecke algebra. The dominance poset, tableau sets and cardinality sum are Dominance order on partitions, Tableaux and standard tableaux and The sum of squares of the standard tableau numbers.

Proof

technique · direct
1.1givenF1F2algebra

Identify the objects in [F1]. Its row symmetrizer is xλ=∑w∈SλTw, its permutation is the unique distinguished d(t) carrying the row-filled tableau to t, and its element is Td(s)∗xλTd(t). These are precisely [F2]'s Murphy elements. The proved integral basis in [F1] therefore gives the required R-basis and mst∗=mts, including the empty tableau when n=0.

2.1F1F2step 1.1algebra∎

Its dominance ideal I⊳λ and the present H⊳λ are the spans of exactly the same basis elements, so they are equal. The independent cell law says msth≡∑vrvmsv modulo this ideal, with coefficients independent of s. Together with step 1.1 and the same finite dominance poset, these are exactly the cellular axioms and all asserted formulas. The basis has ∑λ∣Std⁡(λ)∣2=n! elements by [F2]. Every part holds after every base change by [F1], so no specialized semisimplicity or factor inversion is needed. No choice principle is used.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Nonzero cell heads classify the simple modules of a cellular algebra

Statement

Let F be a field and A a finite-dimensional unital cellular F-algebra with cellular basis (C,Λ) over the finite poset Λ (Cellular bases and cell modules). For λ∈Λ put Dλ:=Cλ/rad Cλ, where rad Cλ is the radical of the cell form (The cell form is associative and its radical is a submodule). Then:

  1. if Dλ≠0 then Dλ is an absolutely irreducible (absolutely simple) A-module: it is simple over F and remains simple after every extension of scalars to a larger field;
  2. {Dλ:λ∈Λ, Dλ≠0} is a complete set of pairwise non-isomorphic simple A-modules (Simple module: a nonzero module with no proper nonzero submodule, Jordan–Hölder theorem for modules);
  3. Dλ≠0 if and only if the cell form ⟨ , ⟩λ is not identically zero, if and only if rad Cλ≠Cλ; and, when these equivalent conditions hold, rad Cλ is the unique maximal proper submodule and the Jacobson radical of Cλ, so Dλ is its simple head. If the form is identically zero, the cell-form quotient Dλ is zero; no assertion about the Jacobson radical or the actual head of Cλ is made.

No semisimplicity of A is assumed; the theorem is the Graham-Lehrer classification and applies in particular to A=HF,q(Sn) for every field F and every q∈F×.

Facts & Assumptions

Given: A field F, a finite-dimensional unital cellular F-algebra A with cellular basis (C,Λ) over the finite poset Λ, cell modules Cλ and cell forms ⟨ , ⟩λ (Cellular bases and cell modules).

[F1]

Cell-form calculus (The cell form is associative and its radical is a submodule): the form ⟨ , ⟩λ is the unique bilinear form with cusλctvλ≡⟨csλ,ctλ⟩λcuvλ(modA⊳λ); it is symmetric and associative, ⟨xa,y⟩λ=⟨x,i(a)y⟩λ; x cuvλ=⟨x,cuλ⟩λcvλ for x∈Cλ; and rad Cλ is the kernel of x↦⟨x,−⟩λ, an A-submodule.

[F2]

The cellular axioms (Cellular bases and cell modules): C is an F-basis of A; A⊳λ=⟨cuvμ:μ⊳λ⟩F; condition (ii) reads cstλa≡∑vrvcsvλ(modA⊳λ) for all s, and its image under the anti-automorphism i reads acstλ≡∑uru′cutλ(modA⊳λ) for all t.

[F3]

Every finite-dimensional module has a composition series: choose a proper submodule of largest dimension, whose quotient is simple, and induct on dimension. This also applies to any simple module over A, since a nonzero vector generates it as a quotient of the finite-dimensional regular module. The Jordan-Hölder theorem gives well-defined composition multiplicities (Composition series and length of a module, Jordan–Hölder theorem for modules).

Proof

technique · direct
1.1givenF2algebra

For λ∈Λ the spans A⊵λ and A⊳λ are two-sided ideals: by [F2] both cstλa and acstλ are congruent modulo A⊳λ to combinations of the cλ-elements, so A⊵λ⋅A⊆A⊵λ and A⋅A⊵λ⊆A⊵λ, and A⊳λ, the sum of the ideals A⊵μ over μ⊳λ, is a two-sided ideal as well. Consequently A⊵νA⊵λ⊆A⊵ν∩A⊵λ and A⊵λA⊵ν⊆A⊵ν∩A⊵λ, because a product of a cν-element and a cλ-element lies in A⊵ν by the ideal property of A⊵ν and in A⊵λ by that of A⊵λ. The intersection A⊵ν∩A⊵λ is spanned by the cγ with γ⊵ν and γ⊵λ; if λ⋭ν then no such γ equals λ, since γ=λ would force λ⊵ν, so all of them satisfy γ⊳λ and A⊵ν∩A⊵λ⊆A⊳λ. Hence, when λ⋭ν, every product cttλb with b∈A⊵ν lies in A⊳λ; the right action of b on Cλ is read off from cttλb≡∑vrvctvλ(modA⊳λ) with unique coefficients rv, so b acts as the zero operator on Cλ, that is, A⊵ν⋅Cλ=0.

1.2givenF1algebra

Generation by vectors outside the radical: let x∈Cλ with x∉rad Cλ. Since rad Cλ={z:⟨z,−⟩λ=0} there is y∈Cλ with ⟨x,y⟩λ≠0, and after rescaling y we may assume ⟨x,y⟩λ=1. Write y=∑uaucuλ and put yv:=∑uaucuvλ∈A for v∈T(λ). Then [F1] gives xyv=∑uau(xcuvλ)=∑uau⟨x,cuλ⟩λcvλ=⟨x,y⟩λcvλ=cvλ, so every basis vector of Cλ lies in the submodule xA, hence xA=Cλ.

1.3givenF1algebra

Nontrivial action of the upward ideal: suppose Dμ≠0. Since rad Cμ≠Cμ there is t∈T(μ) with ctμ∉rad Cμ; by definition of the radical there is u∈T(μ) with ⟨ctμ,cuμ⟩μ≠0, and then cuμ∉rad Cμ as well. By [F1] the element cutμ∈A⊵μ acts on Cμ by ctμ⋅cutμ=⟨ctμ,cuμ⟩μctμ, so on the quotient Dμ it sends the nonzero class of ctμ to its nonzero multiple ⟨ctμ,cuμ⟩μ[ctμ]≠0. Thus A⊵μ does not annihilate Dμ.

2.1givenstep 1.2F1F3

Consequences for the radical: every proper submodule M⊊Cλ is contained in rad Cλ, since x∈M with x∉rad Cλ would give Cλ=xA⊆M by step 1.2, a contradiction. Hence, if rad Cλ≠Cλ, then rad Cλ contains every proper submodule, is the unique maximal proper submodule, and equals the Jacobson radical of Cλ; then Dλ=Cλ/rad Cλ is simple, because a nonzero submodule of the quotient has the form N/rad Cλ with N⊋rad Cλ a submodule, and N=Cλ by maximality. Moreover Dλ≠0 if and only if rad Cλ≠Cλ if and only if the form ⟨−,−⟩λ is not identically zero: the radical is the kernel of x↦⟨x,−⟩λ, so it is all of Cλ exactly when ⟨x,y⟩λ=0 for all x,y, and otherwise this kernel is a proper subspace containing 0.

2.2step 1.1step 1.3

Pairwise distinctness: suppose Dλ≅Dμ≠0. If λ does not dominate μ, then step 1.1 gives A⊵μ⋅Cλ=0, hence A⊵μ⋅Dλ=0, and transporting this along the isomorphism gives A⊵μ⋅Dμ=0, contradicting step 1.3. Hence λ⊵μ; the same argument with the roles of λ and μ exchanged gives μ⊵λ, so λ=μ by antisymmetry of the poset. Thus the nonzero cell heads are pairwise non-isomorphic.

3.1givenstep 1.2step 2.1F1algebra

Absolute irreducibility: let F′/F be a field extension and let C′λ=Cλ⊗FF′ be the base-changed cell module of the base-changed cellular algebra A′=A⊗FF′. The cellular axioms and the cell form base change, so the Gram matrix of the form on C′λ is the scalar extension of the Gram matrix on Cλ; the rank of a matrix is the largest size of a minor with nonzero determinant, a field-independent computation with the polynomial determinants of the entries, so dim⁡F′rad C′λ=dim⁡Frad Cλ. If Dλ≠0 then D′λ:=C′λ/rad C′λ≅Dλ⊗FF′ is nonzero, and steps 1.2 and 2.1 applied over F′ show that every element of C′λ outside rad C′λ generates C′λ, so rad C′λ is the unique maximal submodule of C′λ and D′λ is simple over F′. Hence Dλ remains simple after every extension of scalars, i.e. it is absolutely irreducible.

3.2givenstep 1.1step 2.1F1F2F3

Completeness: every simple right A-module S is isomorphic to some Dλ with Dλ≠0. Order Λ as λ1,…,λN so that λi⊳λj implies i<j, so larger labels come first, and put Aj:=⟨cuvλi:i≤j⟩F; then each Aj is a two-sided ideal (if μ occurs among λ1,…,λj and γ⊵μ, then γ occurs there too, so A⊵μ⊆Aj and the claim follows from step 1.1), A0=0, AN=A. Moreover Aj/Aj−1≅A⊵λj/A⊳λj, which as a right A-module is the direct sum over s∈T(λj) of the column spans ⟨csvλj+A⊳λj:v∈T(λj)⟩≅Cλj (the right action preserves the first index by [F2], and A⊳λj⊆Aj−1 while A⊵λj∩Aj−1=A⊳λj). Let S≠0 be simple and let j be least with SAj≠0 (such j exists since SAN=SA=S by unitality). Then SAj is a nonzero submodule of S, so SAj=S, while SAj−1=0 by minimality of j; choosing s∈S with sAj≠0, the map Aj/Aj−1→S, a+Aj−1↦sa, is a well-defined nonzero A-module surjection. As Aj/Aj−1 is a direct sum of copies of Cλj, the images of these copies sum to S≠0, so some copy surjects onto the simple module S; thus S is a simple quotient of Cλj. If the form on Cλj were identically zero, then cstλjcuvλj≡0(modA⊳λj) for all s,t,u,v by [F1]; since A⊵λjA⊵λi⊆A⊵λi⊆Aj−1 for i<j and A⊵λjA⊳λj+A⊳λjA⊵λj⊆A⊳λj⊆Aj−1, this gives Aj2⊆Aj−1, whence S=SAj=SAj2⊆SAj−1=0, a contradiction. Hence the form on Cλj is not identically zero, so by step 2.1 rad Cλj is the unique maximal submodule and the simple quotient S of Cλj satisfies S≅Dλj with Dλj≠0.

4.1step 2.1step 2.2step 3.1step 3.2∎

Assembly: part 1 is step 3.1; part 2 is step 3.2 (exhaustion) together with step 2.2 (pairwise non-isomorphism) and step 2.1 (each nonzero Dλ is simple); part 3 is step 2.1. The proof classifies right modules, and since the anti-automorphism i identifies right and left A-modules, the statement holds on either side. The classification applies to A=HF,q(Sn) because the Murphy basis of The Murphy tableau elements form a cellular basis is a cellular basis of the type-A Hecke algebra over every field. No semisimplicity was assumed, all posets and tableau sets are finite, and no choice principle is used.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Cellular decomposition matrices are unitriangular for the cell order

Statement

Let F be a field, A a finite-dimensional cellular F-algebra with cellular basis (C,Λ) and cell modules Cλ, Dλ=Cλ/rad Cλ (Cellular bases and cell modules, Nonzero cell heads classify the simple modules of a cellular algebra). For λ,μ∈Λ with Dμ≠0 let dλμ:=[Cλ:Dμ] be the multiplicity of Dμ as a composition factor of Cλ (well defined by Jordan–Hölder theorem for modules and Composition series and length of a module). Then dμμ=1anddλμ≠0 ⟹ λ⊵μ, i.e. a nonzero off-diagonal entry can occur only in the allowed direction of the cell order ⊵ (larger cell first). Order the labels by a linear extension from smaller to larger. The square submatrix whose rows and columns both have nonzero D is lower unitriangular; the full rectangular matrix has the same labelled diagonal and the stated vanishing region. This determines only the diagonal and the vanishing region: no off-diagonal entry is computed by cellularity.

Facts & Assumptions

Given: A field F, a finite-dimensional unital cellular F-algebra A with cellular basis (C,Λ), cell modules Cλ and cell forms ⟨ , ⟩λ (Cellular bases and cell modules).

[F1]

Classification (Nonzero cell heads classify the simple modules of a cellular algebra): Dλ≠0 if and only if rad Cλ≠Cλ if and only if ⟨−,−⟩λ is not identically zero; in that case Dλ is simple and rad Cλ is its unique maximal submodule, and {Dλ:Dλ≠0} is a complete set of pairwise non-isomorphic simple A-modules.

[F2]

Cell-form calculus (The cell form is associative and its radical is a submodule): cusκctvκ≡⟨csκ,ctκ⟩κcuvκ(modA⊳κ) for a fixed label κ; x cuvκ=⟨x,cuκ⟩κcvκ for x∈Cκ; and rad Cκ={x:⟨x,−⟩κ=0} is the kernel of x↦⟨x,−⟩κ.

[F3]

Cellular axioms (Cellular bases and cell modules): A⊳λ is the span of the cuvμ with μ⊳λ, A⊵λ is the span with μ⊵λ; condition (ii) reads cstλa≡∑vrvcsvλ(modA⊳λ) and its i-image reads acstλ≡∑uru′cutλ(modA⊳λ).

[F4]

Composition multiplicities are additive in short exact sequences and well defined by Jordan-Hölder (Composition series and length of a module, Jordan–Hölder theorem for modules).

Proof

technique · direct
1.1givenF2F3algebra

Annihilation: if λ,ν∈Λ with λ⋭ν, then A⊵ν⋅Cλ=0. Indeed A⊵ν and A⊵λ are two-sided ideals by [F3], and their intersection is spanned by the cγ with γ⊵ν and γ⊵λ; no such γ equals λ, since γ=λ would give λ⊵ν, so the intersection lies in A⊳λ. Hence A⊵νA⊵λ⊆A⊵ν∩A⊵λ⊆A⊳λ and, since cttλ∈A⊵λ, every product cttλb with b∈A⊵ν lies in A⊳λ; the right action of b on Cλ is read off from cttλb≡∑vrvctvλ(modA⊳λ) with unique coefficients, so b acts as the zero operator on Cλ.

1.2givenF1F2algebra

Nontrivial action: if Dμ≠0 then some element of A⊵μ acts nontrivially on Dμ. Since rad Cμ≠Cμ by [F1], there is t∈T(μ) with ctμ∉rad Cμ, and by [F2] there is u∈T(μ) with ⟨ctμ,cuμ⟩μ≠0; then the element cutμ∈A⊵μ satisfies ctμ⋅cutμ=⟨ctμ,cuμ⟩μctμ by [F2], so on Dμ it sends the nonzero class of ctμ to its nonzero multiple ⟨ctμ,cuμ⟩μ[ctμ]≠0.

2.1step 1.1step 1.2F4

Off-diagonal vanishing: suppose dλμ≠0 with Dμ≠0. If λ⋭μ, then step 1.1 gives A⊵μ⋅Cλ=0; an element of A acting as zero on a module acts as zero on each of its submodules and quotients, hence on every subquotient of Cλ, so A⊵μ annihilates the composition factor Dμ of Cλ. This contradicts step 1.2. Hence λ⊵μ.

2.2step 1.2F1F2F4

Diagonal: dμμ=1 for every μ with Dμ≠0. The form radical gives the subquotient Dμ=Cμ/rad Cμ, and additivity of composition multiplicities [F4] gives dμμ=[Cμ:Dμ]=[Cμ/rad Cμ:Dμ]+[rad Cμ:Dμ]=1+[rad Cμ:Dμ], because Cμ/rad Cμ=Dμ is simple by [F1]. The span of the cuvμ annihilates rad Cμ: for x∈rad Cμ and all u,v one has x cuvμ=⟨x,cuμ⟩μcvμ=0 by [F2]. Hence every element of this span acts as zero on rad Cμ and on all its subquotients, so Dμ is not a composition factor of rad Cμ; otherwise step 1.2 would produce an element of span{cuvμ}⊆A⊵μ acting nontrivially on it. Therefore [rad Cμ:Dμ]=0 and dμμ=1.

3.1step 2.1step 2.2∎

Assembly: order the labels by a linear extension from smaller to larger, and restrict both rows and columns to labels with nonzero form quotient. Step 2.1 puts every nonzero entry on or below the diagonal of this square submatrix, and step 2.2 gives diagonal entries 1. For the full rectangular matrix retain the label comparison λ⊵μ; deleting zero-quotient columns need not leave the labelled diagonal on the numerical matrix diagonal. These statements determine only the diagonal and the vanishing region.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

The type-A Hecke Specht module and its cell form

Definition

Let R be a commutative ring and q∈R×. With the Murphy cellular basis (M,Λ) of H=HR,q(Sn) (The Murphy tableau elements form a cellular basis, Cellular bases and cell modules) and the canonical tableau tλ of shape λ⊢n (Murphy elements and Murphy tableau elements), the Murphy cell module SMλ is the right cell module Cλ of the Murphy basis: it is the free R-module with basis {mt:=mtλt:t∈Std(λ)} - the classes of the Murphy elements whose first index is the canonical tableau - and H acts by mth=∑vrvmv whenever mtλth≡∑vrvmtλv(modH⊳λ). (The cellular action rule transforms the second index and fixes the first, so the cell module is defined using the fixed-first-index family above; the diagonal span in H need not be stable under multiplication. For λ=(n) it is stable, since mλTi=qmλ.) Its cell form is the unique bilinear form ⟨ , ⟩λ:SMλ×SMλ→R with musmtv≡⟨ms,mt⟩λ muv(modH⊳λ) for all s,t,u,v∈Std(λ); it is symmetric and associative and rad SMλ is a submodule, so DMλ:=SMλ/rad SMλ is a right H-module (The cell form is associative and its radical is a submodule).

Convention (Dipper-James signed cellular normalization). Let θ:H→H be the involutive algebra automorphism defined by θ(Ti)=−qTi−1=(q−1)−Ti (The Hecke sign automorphism, pullback and contragredient dual). For a right module M, write Mθ for the same R-module with action x⋅h=xθ(h). The page's ordinary Specht normalization is the signed conjugate Murphy construction Sλ:=(SMλ′)θ, where λ′ is the conjugate partition (Partitions, English diagrams, and conjugation). Its form is the form of SMλ′ on the same underlying module; because θ commutes with ∗ this is associative for the twisted action (The Hecke sign automorphism, pullback and contragredient dual). Over a field put Dλ:=Sλ/rad⁡formSλ=(DMλ′)θ. Thus SMλ′=(Sλ)θ and DMλ′=(Dλ)θ; conjugation alone does not identify these modules (Murphy cells are the same-shape contragredient Specht duals, Ordinary Specht modules are the signed conjugate Murphy cells). At q=1, θ(σ)=sgn⁡(σ)σ, so these identities contain tensoring with sign; in characteristic 2 the sign twist becomes trivial at q=1 (Polytabloid specialization and the exact signed multiplicity dictionary). The nonzero quotients in this signed normalization have e-regular labels by The simple type-A Hecke modules are indexed by e-regular partitions ↗: that theorem proves the nonzero Murphy quotient criterion in e-restricted labels, and conjugation makes these precisely e-regular labels (e-regular and e-restricted partitions). No generic root-of-unity Hecke claim is inferred from the published prime-characteristic group-only sign dictionary, and no semisimplicity or choice principle is assumed.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

The Jantzen filtration of a lifted cell module

Definition

Let R be a principal ideal domain (Principal ideal domain) with a chosen prime element π, let F:=R/πR be the residue field, and let M be a free R-module of finite rank (The free module on a set and its standard basis) equipped with a symmetric R-bilinear form ⟨ , ⟩:M×M→R whose extension to the fraction field K=Frac⁡(R) is non-degenerate (equivalently det⁡G≠0 for a Gram matrix G of the form). For i≥1 put M(i):={x∈M:⟨x,y⟩∈πiR for all y∈M},MF(i):=(M(i)+πM)/πM⊆MF:=M⊗RF. Then M(0)=M, the M(i) are R-submodules with M(i+1)⊆M(i), the descending chain MF=MF(0)⊇MF(1)⊇MF(2)⊇⋯ stabilises at 0 (that is, MF(z)=0 for all sufficiently large z, because det⁡G≠0), and MF(1)=rad MF, the radical of the reduced form. This finite descending filtration is the Jantzen filtration of M with respect to (R,π,⟨ , ⟩). The hypotheses are exactly: R a PID, π a prime element, the form non-degenerate over Frac⁡(R); no valuation-ring or DVR hypothesis is substituted, and the prime element π, its ideal πR and the fraction field K are kept distinct. Each M(i) is a submodule: for the cell forms on this page the associativity identity ⟨xa,y⟩=⟨x,ya∗⟩ shows closedness under the action. For 0≠r∈R, define νπ(r)=max⁡{k≥0:πk∣r}. This maximum is finite: otherwise the uniquely determined elements r/πk give an ascending chain of ideals whose union is principal, say generated by an element in its N-th ideal. The chain then stabilizes at N, whereas (r/πN)=(r/πN+1) and cancellation would make π a unit. For termination, put a=νπ(det⁡G). If x∈M(i), its coordinate column v satisfies Gv∈πiRd, so the adjugate identity gives (det⁡G)v∈πiRd. For i>a, primality of π forces every coordinate of v into πR. Thus M(i)⊆πM and MF(i)=0. In rank zero the filtration is already zero. Finally a reduced vector belongs to the reduced form radical exactly when any lift pairs with every vector of M into πR, which is exactly membership in M(1). No choice principle is used.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

The Hecke Jucys-Murphy action is dominance triangular

Statement

Let R be a commutative ring, q∈R×, H=HR,q(Sn), and let L1,…,Ln be the Hecke Jucys-Murphy elements (Hecke Jucys-Murphy elements and q-contents). For every λ⊢n, every standard λ-tableau t and every 1≤k≤n there exist av∈R with mtLk=[content⁡t(k)]q mt+∑v⊳tav mv, where (mt)t∈Std(λ) is the Murphy basis of the Murphy cell module SMλ (The type-A Hecke Specht module and its cell form) and the sum is over standard λ-tableaux v strictly dominating t in the dominance order on tableaux (Dominance order on partitions, Tableaux and standard tableaux). In particular Lk acts on the Murphy cell module SMλ with Murphy basis (mt) by a triangular matrix whose diagonal entries are the q-content values. Consequently the Lk commute pairwise and every symmetric polynomial in L1,…,Ln is central in H.

Facts & Assumptions

Given: A commutative ring R, a unit q, the type-A Hecke algebra H, its additive Jucys-Murphy elements Lk and its Murphy cell module SMλ with basis (mt).

[F1]

The standard basis multiplication, the quadratic and braid relations, and the integral row action are those of The row permutation module: distinguished basis and Hecke action. In particular Ti2=(q−1)Ti+q, and xρTi=qxρ if i,i+1 lie in one row of tρ.

[F2]

The integral Murphy basis, dominance ideals, cell multiplication and finite Garnir straightening are proved in The Murphy cellular basis, the cell law and the Murphy form. We write I⊳λ=H⊳λ and xλ=mλ. The proof there supplies the dominance support rule: if s′=ssi is standard with s⊳s′ and ℓ(d(s′))=ℓ(d(s))+1, multiplying any same-shape term strictly above s by Ti and then straightening produces only standard terms strictly above s′. Straightening a nonstandard row-standard tableau only raises its tableau order in the same shape. All these identities hold over A=Z[v±1] and specialize along v↦q.

[F3]

A finite-dimensional algebra has nilpotent Jacobson radical and semisimple quotient (For a finite-dimensional algebra, the Jacobson radical is nilpotent and the quotient by it is semisimple). A semisimple algebra is a finite product of matrix algebras over division rings (Wedderburn–Artin theorem for semisimple rings); its two-sided ideals and their quotients consequently have no nonzero nilpotent two-sided ideals.

Proof

technique · direct
1.1givenF1algebra

Braid identities. Put Ti=T(i,i+1). The reduced word for (j,k+1) gives Lk+1=q−1(TkLkTk+Tk). We prove TiLk=LkTi whenever i≠k−1,k. For i≥k+1, each generator in the displayed words defining Lk commutes with Ti. For i≤k−3 the recurrence and induction apply. For the remaining case k=i+2, put a=Ti, b=Ti+1 and C=Li; then bC=Cb by the already established disjoint case and Li+2=q−1b+q−2bab+q−2baCab. The braid and quadratic relations give [a,bab]=−q[a,b] and a(baCab)=(baCab)a (replace aba by bab and move C past b), so its commutator with a vanishes. Thus Lk centralizes H(Sk−1); since Lj∈H(Sk−1) for j<k, all Lj commute. Multiplying the recurrence by Ti and using Ti2=(q−1)Ti+q gives TiLi+1=LiTi+1+(q−1)Li+1; starring gives TiLi=Li+1Ti−1−(q−1)Li+1. Hence Ti commutes with Li+Li+1 and LiLi+1: for the product substitute the first identity into (Li+1Ti−1−(q−1)Li+1)Li+1. Every symmetric polynomial is a polynomial in the elementary symmetric polynomials over the coefficient ring: in each homogeneous degree, its lexicographically leading exponent vector satisfies a1≥⋯≥an by symmetry. Subtract its coefficient times e1a1−a2⋯en−1an−1−anenan, whose leading monomial has that vector and coefficient 1, and repeat on the finite set of degree-d monomials. No coefficient is divided. Each elementary symmetric polynomial splits, at the adjacent pair, as ed(L^i,L^i+1)+(Li+Li+1)ed−1(L^i,L^i+1)+LiLi+1ed−2(L^i,L^i+1). It therefore commutes with every Ti and is central.

1.2F2algebra

Lifting smaller-rank congruences. Here is the precise ideal check used in the induction below. Let τ be either a whole-row prefix (λ1,…,λr) of size m<n, or the prefix (λ1,…,λr,1) ending at the first box of the last row, of size m<n. In both cases xλ=hxτ=xτh, where h is the row symmetrizer of the remaining blocks, embedded in Hn; in the second case its last block starts at the singleton label m, and no generator of xτ meets that block. If xτLk−cxτ∈I⊳τ in Hm, expand this difference in its smaller Murphy basis. Every shape η⊳τ lies in HmxηHm. Embedded in Hn, xη is xκη for the partition κη=(η,1n−m), so [F2] puts its two-sided ideal in I⊵κη. Some prefix j before the final row of τ has ∑a≤jηa>∑a≤jτa=∑a≤jλa: strict dominance cannot first differ at or after the final row, where τ has total m. In the whole-row case the same argument permits j<r. Hence λ does not dominate κη, and none of these ideals has a shape-λ component. Multiplying the smaller congruence on the appropriate side by h gives xλLk−cxλ∈∑ηI⊵κη. This difference also belongs to I⊵λ because both terms are in xλHn. Their intersection, read in the Murphy basis, has only shapes strictly dominating λ, and the lifted congruence therefore holds modulo I⊳λ.

2.1F1F2F3step 1.1algebra

An integral scalar for the central sum. For this step work over A=Z[v±1], with fraction field K=Q(v). The matrix of the regular trace pairing B(a,b)=Tr⁡K(ℓab) in the standard basis has entries in A. At v=1 it is the matrix n! δu,w−1, since a nonidentity permutation has no fixed point in the regular permutation action. Its determinant is nonzero, so B is nondegenerate over K. If a belongs to the Jacobson radical J then ab∈J is nilpotent for every b, by [F3]; thus ℓab is nilpotent and has trace zero. Nondegeneracy forces J=0, so HK is semisimple. In its cell layer IK⊵λ/IK⊳λ, [F2] identifies multiplication with X⋅Y=XGλY on d×d matrices, d=∣Std⁡(λ)∣. If Gλ were singular, the nonzero subspace N={X:GλX=0} would be a two-sided ideal of this layer with N2=0, contradicting [F3]. Hence Gλ is invertible and X↦GλX identifies the layer with Mat⁡d(K). A central element of HK acts on this layer by a bimodule endomorphism of that matrix algebra, necessarily a scalar: its value at the identity commutes with every matrix and therefore is a scalar matrix. Applied to Zn=∑kLk, central by step 1.1, this shows that its matrix on the cell module is αλId over K. The cell action matrix already has entries in A, so αλ∈A, and freeness over A makes the identity hold integrally and after every base change to R. Thus mtZn=αλmt for every t, without any assumption on the specialized cell form or its head.

2.2F1F2step 1.1algebra

Transport along standard adjacent swaps. Suppose s′=ssi is standard with s⊳s′ and length increasing by one, and suppose msLk=rs(k)ms+∑u⊳saumu for all k. By [F1], ms′=msTi. For k≠i,i+1 step 1.1 gives ms′Lk=msLkTi, and [F2] puts every error strictly above s′. For k=i+1, the same step gives ms′Li+1=ms(LiTi+1+(q−1)Li+1); its coefficient at ms′ is rs(i), since all remaining terms are strictly above s′. The second adjacent identity similarly gives coefficient rs(i+1) at ms′ for Li. Thus the diagonal data are transposed in positions i,i+1 and unchanged elsewhere. Every standard tableau is reachable from tλ by such standard length-increasing swaps: reverse a right-descent reduction of d(t); the two consecutive entries at a descent lie in incomparable cells, so their interchange remains standard. Consequently diagonal data at the row-filled tableau determine the asserted diagonals at every standard tableau.

3.1F1step 1.1step 2.1step 2.2step 1.2inductionalgebra

Row-filled induction away from the final singleton. Induct on n, the cases n=0,1 being immediate, and on k within the row-filled tableau. If k is in a row which is not the last row, choose the whole-row prefix τ ending with that row. It has size m<n, its row-filled tableau has no more dominant standard tableaux, and the induction on rank gives xτLk=[content⁡tτ(k)]qxτ modulo I⊳τ. Lift by step 1.2. If k is in the last row but not its first column, Tk−1 belongs to its row subgroup, and the recurrence gives mtλLk=(1+q[content⁡tλ(k−1)]q)mtλ=[content⁡tλ(k)]qmtλ, by induction on k and [c+1]q=1+q[c]q. If k<n is in the first column of the last row, use the singleton-ended prefix τ of step 1.2 and induction on its smaller rank. These arguments leave only k=n for a shape λ=(λ1,…,λr,1). All Lk with k<n have already been shown to act on mtλ by their claimed scalars. Step 2.1 then supplies mtλLn=rnmtλ for some rn∈R. Step 2.2 consequently applies with these diagonal data to every standard tableau; at this point all Lk are triangular, though rn remains to be identified.

4.1F1F2step 1.1step 2.2step 3.1algebra

The final singleton is fixed by one Garnir calculation. In the remaining shape let i be the first entry in row r of tλ and put t=tλsn−1⋯si+1. Then t is standard, its last row contains i+1, and its penultimate row contains i,i+2,…,n. Step 2.2 gives mtLi=[1−r]qmt+∑v⊳tavmv and mtLi+1=rnmt+∑v⊳tbvmv. The tableau g:=tsi is exactly the Garnir tableau for the first-column belt i,…,n between the last two rows. For j=i,…,n, let uj have last-row entry j and the other belt labels increasingly in row r. The finite belt identity of [F2] gives ∑j=inxλTd(uj)≡0(modI⊳λ): its other side is a sum of multiples of the symmetrizer obtained by merging these two rows, whose sorted shape strictly dominates λ. Here ui=g, ui+1=t, and all uj with j>i+1 are standard and strictly dominate t. The length-increasing row rule gives mtTi=xλTd(g)+I⊳λ, so the belt identity explicitly yields mtTi=−mt−∑j>i+1muj. Put U=span⁡{mv:v⊳t}. Step 3.1 and transport show ULi⊆U. Also UTi⊆U: dominance forces each v⊵t to agree with t on the filled first r−1 rows and to place i in node (r,1). If i+1 occupies the singleton last row, all remaining labels must occupy row r increasingly, forcing v=t. Thus every v⊳t places i+1 in (r,2), and the row rule gives mvTi=qmv. (If λr=1, the higher span is zero.) Working modulo U, the recurrence now gives mtLi+1=q−1mt(TiLiTi+Ti)=q−1([1−r]q−1)mt=[−r]qmt. Comparing its coefficient at mt proves rn=[−r]q, exactly the content of the final singleton. This completes the rank induction and identifies all row-filled diagonals.

5.1step 1.1step 2.2step 4.1F2algebra∎

The required flag and the initial left generator. Step 2.2 now gives mtLk=[content⁡t(k)]qmt+∑v⊳tavmv for every standard t, over the given ring. Order the standard tableaux by any linear extension with the most dominant first. The spans of initial segments are stable under all Lk, and their successive rank-one quotients have exactly the q-content diagonals; this proves the claimed common triangular flag. Commutativity and symmetric-polynomial centrality were established independently in step 1.1. In particular the maximal tableau tλ has the exact eigenrelation mtλLk=[content⁡tλ(k)]qmtλ. Since Lk∗=Lk, starring its defining cell congruence gives the corresponding left-cell generator relation Lkzλ=[content⁡tλ(k)]qzλ. For the multiplicative normalization Xk=1+(q−1)Lk this reads Xkzλ=qcontent⁡tλ(k)zλ, using 1+(q−1)[c]q=qc for all integral c. These identities concern the cell generator, hence hold after taking the indicated cell quotient; they do not assert the same equality for the raw symmetrizer in H. All formulas specialize from A to R, and no quantum integer or factorial is inverted in the specialized algebra.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Jantzen layer dimensions sum to the Gram determinant valuation

Statement

In the setting of The Jantzen filtration of a lifted cell module (R a PID, π a prime element, F=R/πR, M free of finite rank with a form whose extension to K=Frac⁡(R) is non-degenerate), let νπ be the π-adic valuation normalised by νπ(π)=1 and let G∈R∖{0} be the Gram determinant of the form with respect to any R-basis of M. Then νπ(G)=∑i>0dim⁡FMF(i), where MF(i) are the Jantzen layers of The Jantzen filtration of a lifted cell module; in particular the sum is finite and independent of the chosen basis.

Facts & Assumptions

Given: A PID R with prime element π, residue field F=R/πR, fraction field K, a free R-module M of finite rank d with a symmetric R-bilinear form ⟨ , ⟩ that is non-degenerate over K, and its Jantzen filtration M(i)⊆M with layers MF(i)=(M(i)+πM)/πM (The Jantzen filtration of a lifted cell module).

[F1]

(The Jantzen filtration of a lifted cell module) The M(i), i≥0, are submodules with M(0)=M and M(i+1)⊆M(i), and MF(i)=0 for all sufficiently large i.

[F2]

(Every matrix over a PID has a Smith normal form) There are R-bases e1,…,ed of M and f1,…,fd of M together with nonzero r1,…,rd∈R such that ⟨ei,fj⟩=δijri for all i,j; the ri are the elementary divisors of the Gram matrix.

[F3]

For any R-basis of M with Gram matrix G one has det⁡G=r1⋯rd up to a unit, so νπ(G)=∑iνπ(ri), and νπ is normalised by νπ(π)=1 and takes the value 0 on units.

Proof

technique · direct
1.1givenF1F2

Description of the Jantzen layers: write x=∑iaiei in the basis of [F2]. Since f1,…,fd is an R-basis of M, the condition ⟨x,y⟩∈πkR for all y∈M is equivalent to ⟨x,fj⟩∈πkR for all j; as ⟨x,fj⟩=ajrj, this gives M(k)={∑iaiei:νπ(airi)≥k for all i} with the convention νπ(0)=∞. Reducing modulo πM, whose basis is πe1,…,πed, shows that MF(k) has as an F-basis the images of those ei with νπ(ri)≥k: if νπ(ri)≥k then the image of ei lies in MF(k), while if νπ(ri)<k then every element of M(k) has ei-coefficient divisible by π. Hence dim⁡FMF(k)=#{i:νπ(ri)≥k}.

2.1step 1.1F1

Summation: since each ri is nonzero, the sets {k>0:νπ(ri)≥k} are finite of cardinality νπ(ri); by step 1.1 and [F1], ∑k>0dim⁡FMF(k)=∑k>0#{i:νπ(ri)≥k}=∑iνπ(ri).

3.1step 2.1F3∎

Conclusion: by [F3] the right-hand side is νπ(G) for any Gram matrix G of the form in any R-basis of M; the left-hand side is defined purely in terms of M and the form, so the identity holds for every basis and the sum is finite and basis-independent.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Separated Hecke residues give seminormal idempotents and bases

Statement

Let F be a field, q∈F×, let e=e(F,q) and assume e>n (with e=∞ allowed); let λ⊢n, H=HF,q(Sn), and let SMλ be the Murphy cell module with Murphy basis (mt)t∈Std(λ) (The type-A Hecke Specht module and its cell form).

  1. (Separation) If s,t are standard λ-tableaux with [content⁡s(k)]q=[content⁡t(k)]q for all 1≤k≤n then s=t. More precisely, if the q-content values agree for all k∉{i,i+1} for some i, then s=t or t=s(i i+1). 2. (Idempotents) Let Rk be the set of distinct q-content values of the entry k over standard tableaux of all partitions of n. For a standard λ-tableau t define Ft:=∏k=1n ∏c∈Rkc≠[content⁡t(k)]qLk−c[content⁡t(k)]q−c∈F[L1,…,Ln]. These are orthogonal idempotents of H; their actions on SMλ project onto the corresponding simultaneous eigenlines. Put ft=mtFt. Then ftLk=[content⁡t(k)]qft and ft=mt+∑s⊳tasms. The global content sets are essential for the asserted idempotency in H, rather than only the induced same-shape endomorphisms. 3. (Orthogonal seminormal basis) {ft:t∈Std(λ)} is a basis of SMλ satisfying ftFs=δtsft and ⟨fs,ft⟩λ=δst⟨ft,ft⟩λ; it is the seminormal basis of the Murphy cell module. 4. (Generator action) Let s be a standard λ-tableau, 1≤i<n and t:=s(i i+1), and put ρ:=content⁡s(i)−content⁡s(i+1)∈Z. If i and i+1 lie in the same row of s then fsTi=q fs; if they lie in the same column then fsTi=−fs; otherwise t is standard and fsTi=αi(s) ft−1[ρ]qfs,αi(s):={1,s⊳t,[1+ρ]q[1−ρ]q[ρ]q[−ρ]q,t⊳s, where [−ρ]q is the extended quantum integer of Hecke Jucys-Murphy elements and q-contents and for the swapped tableau content⁡t(i)−content⁡t(i+1)=−ρ. No semisimplicity of H is assumed and no choice principle is used.

Facts & Assumptions

Given: A field F, q∈F× with quantum characteristic e>n, a partition λ⊢n, the Murphy cell module SMλ with Murphy basis (mt) and cell form (The type-A Hecke Specht module and its cell form), and the q-content values of Hecke Jucys-Murphy elements and q-contents.

[F1]

(The Hecke Jucys-Murphy action is dominance triangular) mtLk=[content⁡t(k)]q mt+∑v⊳tavmv in SMλ; the Lk commute pairwise and every symmetric polynomial in them is central.

[F2]

(The quantum characteristic of an invertible Hecke parameter) For e>n no m with 1≤m≤n has [m]q=0; more precisely, if two integer contents c,c′ with ∣c−c′∣≤n satisfy [c]q=[c′]q then c=c′.

[F3]

(The type-A Hecke Specht module and its cell form) The cell form on SMλ is symmetric and associative, and the star anti-involution fixes each Lk; the Murphy basis is triangular along the dominance order on tableaux.

[F4]

Source results: separation of q-content sequences for e>n and the seminormal spectral construction are Mathas, Lemma 3.32, Proposition 3.33 and Theorem 3.34 (printed pp. 30-34); the coefficient system of part 4 as displayed is that of Hu-Mathas, Example 3.11 with the axial distance (3.8), Lemma 3.12 and Proposition 3.17, the 1998 manuscript's t⊳s branch being inconsistent with the Hecke relations. The abstract form of the spectral construction under the separation condition is Mathas, Proposition 4.13 with the appendix.

Proof

technique · direct
1.1givenF1F2

Reconstruct a tableau from its residue tuple. At a prefix of size k−1, two different addable corners have integer content difference of absolute value at most k. Since [a]q−[b]q=qb[a−b]q and e>n, their q-contents differ. Starting with the empty diagram, the tuple thus recovers each added node and the final shape. For two tableaux of a fixed shape with identical entries' residues outside i,i+1, first reconstruct the common prefix through i−1, and reconstruct the common suffix by successively deleting the unique appropriate removable corner from the fixed final shape. The intervening skew diagram has two boxes; its only possible orders are the original order and its swap. This proves both separation assertions.

2.1F1step 1.1

Diagonalize the commuting JM operators on a cell. Their triangular basis gives a filtration with one-dimensional joint characters indexed by standard tableaux. Those characters are distinct by step 1.1. For commuting triangular operators, the simultaneous generalized eigenspaces split along their distinct joint characters: the corresponding maximal ideals of the polynomial algebra are pairwise comaximal. Each joint character occurs once in this cell, so each generalized eigenspace is one-dimensional and hence an actual joint eigenline. This finite Chinese-remainder argument works over any field and needs no choice of a generic scalar or algebraic closure. The Lagrange product of the Statement is 1 on its target tuple and 0 on every other tuple. Applied to mt, its triangular diagonal coefficient is 1, and the other possible terms are strictly more dominant. Thus it gives the asserted ft.

2.2F1F2step 1.1

Compute the diagonal coefficient using the correctly ordered JM relation TiLi=Li+1Ti−(q−1)Li+1−1. For k≠i,i+1, Ti commutes with Lk. Consequently separation restricts fsTi to the span of fs and ft if the swap is standard, or to fs alone otherwise. Write its coefficient of fs as cs. The displayed relation gives cs([content⁡s(i)]q−[content⁡s(i+1)]q)=−(q−1)[content⁡s(i+1)]q−1. Its denominator is qcontent⁡s(i+1)[ρ]q, while the numerator is −qcontent⁡s(i+1), so cs=−1/[ρ]q. This does not claim that Ti commutes with Li.

3.1step 2.1

At this stage step 2.1 establishes the projector identities on each individual cell module. The global identities in H will follow below after proving that the sum of the cell modules is faithful. No finite-e classification is a premise.

3.2F3step 1.1step 2.1

The transition from mt to ft is unitriangular, so these vectors form a basis. For s≠t, choose k at which their q-contents differ. Self-adjointness Lk∗=Lk and associativity give ([content⁡s(k)]q−[content⁡t(k)]q)⟨fs,ft⟩=0. The scalar is nonzero, proving orthogonality. The Lagrange action also gives ftFs=δtsft.

3.3step 2.2

If the swap is not standard, the consecutive entries lie adjacently in one row or one column. Then ρ=−1 or ρ=1, respectively, and step 2.2 gives cs=q or cs=−1. These are the stated row and column cases; the row action is q, not the scalar 1 at a general parameter.

4.1step 3.2step 2.2

Suppose the swap is standard. In the branch s⊳t, the length-additive Murphy action has leading term msTi=mt; the unitriangular eigenbasis change then gives the off-diagonal coefficient αi(s)=1. Higher-dominance terms cannot alter the coefficient at t in this two-dimensional eigenline span. This is the leading-term argument in Mathas's source theorem on the seminormal basis. In both branches the quadratic relation gives αi(s)αi(t)=q+(q−1)cs−cs2=[1+ρ]q[1−ρ]q[ρ]q[−ρ]q. The last equality follows directly from [−ρ]q=−q−ρ[ρ]q and the quantum-integer addition identities. Thus the opposite branch has exactly the displayed coefficient. This proves the generator formula without accepting the inconsistent branch in the 1998 manuscript.

5.1F2F3step 3.2step 4.1algebra

Prove nondegeneracy in the separated range locally. The canonical Murphy basis vector has form value [λ]!q=∏a[λa]!q, because xλ2=[λ]!qxλ; its seminormal image has the same value since the canonical tableau is dominance-maximal. This scalar is nonzero when e>n. If s⊳t=s(i,i+1) is a standard swap, put a=1/[ρ]q. Step 4.1 gives ft=fs(Ti+a). Associativity, orthogonality and the quadratic relation give ⟨ft,ft⟩=(q+a)(1−a)⟨fs,fs⟩=q[ρ+1]q[ρ−1]q[ρ]q−2⟨fs,fs⟩. Indeed expansion of (Ti+a)2 and its fs coefficient −a gives q−a(q−1)−a2=(q+a)(1−a). The swapped incomparable boxes have 2≤∣ρ∣≤n−1: their row and column separations plus one are at most the size of the diagram. Thus all three quantum integers here are nonzero. Every standard tableau is connected to the canonical one by length-increasing swaps of adjacent incomparable entries: bubble-sort its linear extension of the box-order poset into the canonical row-order extension, then reverse the swaps. Induction gives nonzero diagonal norm at every ft, so each cell form is nonsingular.

6.1step 5.1step 2.1step 1.1algebra

Each cell is now its nonzero simple form quotient, absolutely simple, and all these cells are pairwise distinct and exhaust the simple modules by Nonzero cell heads classify the simple modules of a cellular algebra. Thus the split semisimple quotient H/J(H) has dimension ∑λ∣Std⁡(λ)∣2. This equals dim⁡H because the Murphy cellular basis has exactly one element for each pair of standard tableaux of the same shape (The Murphy tableau elements form a cellular basis). Hence J(H)=0, H is split semisimple, and the direct sum of all its simple cell modules is faithful. On that faithful module the global Lagrange products of the Statement are the orthogonal projectors from step 2.1, with different shapes having disjoint tuples by step 1.1. Therefore FsFt=δstFt holds in H itself, proving the global idempotents. This argument proves only the separated range and does not assert a finite-e nonzero-label criterion when e≤n.

7.1step 1.1step 3.2step 4.1step 6.1∎

Steps 1.1-6.1 prove all four claims. No semisimplicity was imposed as a hypothesis: it was derived locally from nondegenerate cells and their complete finite-cell classification. The calculation concerns the intrinsic Murphy cell and keeps the signed ordinary-module dictionary separate. All products and basis changes are finite, and no choice principle is used.

PropositionStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Hecke Specht theory specialises to group Specht theory at q = 1

Statement

Let F be a field, q=1∈F, and let HF,1(Sn) be the specialization of the generic type-A Hecke algebra at v↦1, so that HF,1(Sn)≅F[Sn] with Tw↦w (Polytabloid specialization and the exact signed multiplicity dictionary, step 1.1). Then the Hecke theory of this page specializes as follows.

  1. The Murphy elements mμ=∑w∈SμTw specialize to the row symmetrizers ∑w∈Sμw, and the Murphy basis {mst} of HF,1(Sn) specializes to the Murphy basis of the group algebra F[Sn] (the base change Z[Sn]→F[Sn] of the integral Murphy basis).
  2. For every λ⊢n the specialization of the page's Hecke Specht module Sλ (The type-A Hecke Specht module and its cell form) is the ordinary Specht module in the Dipper-James convention: Sq=1λ≅SDJλ as F[Sn]-modules, with the standard polytabloid basis (Standard polytabloids form a basis of a complex Specht module); the specialized cell form is the standard bilinear form on Sλ whose radical defines the James quotient Dλ (Modular Specht form and radical quotient).
  3. The quantum characteristic of q=1 is e=char⁡(F) when char⁡(F)>0, and e=∞ when char⁡(F)=0 (The quantum characteristic of an invertible Hecke parameter); in characteristic p>0 a partition is e-regular exactly when it is p-regular. Hence Dq=1λ≠0 exactly for p-regular λ (Nonzero modular Specht quotient criterion), and for non-p-regular λ one has rad Sλ=Sλ. Over splitting residue fields this also matches the group-side classification and conjugate-sign dictionary of Modular simple modules of the symmetric group and p-regular and p-restricted labels under transpose and sign; the assertion here holds over every field by the cellular classification below. In characteristic 0 the specialization is split semisimple and all Specht modules are irreducible.

Facts & Assumptions

Given: A field F and the specialization HF,1(Sn)≅F[Sn] (Polytabloid specialization and the exact signed multiplicity dictionary, step 1.1).

[F1]

(Ordinary Specht modules are the signed conjugate Murphy cells, Polytabloid specialization and the exact signed multiplicity dictionary) The Dipper-James ordinary Specht module with its polytabloid basis and standard form is identified with the signed conjugate Murphy cell module of The type-A Hecke Specht module and its cell form by a base-change compatible isomorphism whose Laurent unit form factor is qℓ(w0(Sλ′))−ℓ(wλ), equal to 1 at q=1 over every field; hence at q=1 the ordinary module and the standard form agree on the specialization, including on zero-form quotients.

[F2]

Over every field, the integral-polytabloid specialization and standard tabloid form are supplied by Polytabloid specialization and the exact signed multiplicity dictionary, clause 1 and proof step 2.1. Over a splitting residue field the form quotient is exactly Modular Specht form and radical quotient; Standard polytabloids form a basis of a complex Specht module records the complex-field basis. These latter items are used only within their stated coefficient fields.

[F3]

(The quantum characteristic of an invertible Hecke parameter) At q=1 the quantum characteristic is e=p=char⁡(F) when p>0 and e=∞ when p=0; a partition is e-regular exactly when it is p-regular.

[F4]

At q=1 in positive characteristic, the ordinary group Specht radical quotient is nonzero exactly for p-regular labels (Nonzero modular Specht quotient criterion). In characteristic zero e=∞, and the complete local separated-range proof gives nonsingular Murphy cell forms and split semisimplicity (Separated Hecke residues give seminormal idempotents and bases); the signed-conjugate form identity in [F1] transfers their nondegeneracy to every ordinary Specht module. No finite-e Hecke nonzero-label criterion is used.

[F5]

Over every field, the nonzero cell-form quotients of a cellular algebra form a complete set of pairwise distinct absolutely simple modules (Nonzero cell heads classify the simple modules of a cellular algebra). The exact signed-conjugate equivalence of [F1] transports this classification to ordinary Specht quotients; no splitting-field-only group theorem is invoked over an arbitrary F.

Proof

technique · direct
1.1givenF1algebra

Murphy basis: base change along Z[v±1]→F, v↦1, sends Tw to w and mμ=∑w∈SμTw to the row symmetrizer ∑w∈Sμw; the structure constants of the Murphy basis are polynomials in q, so they specialize to structure constants in F[Sn] and the specialized family {mst} satisfies the cellular axioms over F; it is a basis because base change of the free integral Murphy basis is a basis, by The Murphy tableau elements form a cellular basis. This is part 1.

2.1step 1.1F1F2

Module and form: by [F1] the specialization of the page's Specht module is the ordinary Dipper-James Specht module with the standard polytabloid basis, and the specialized cell form differs from the standard form by the Laurent factor qℓ(w0(Sλ′))−ℓ(wλ), which is 1 at q=1; hence the two forms agree over every field and have the same radical, so the specialized quotient is the James quotient Dλ. This is part 2.

3.1step 2.1F1F3F4F5∎

Labels: by [F3], e=p in positive characteristic, and e-regular means p-regular. Step 2.1 identifies the specialized module and its form exactly with the ordinary group module and form, so the ordinary criterion in [F4] gives precisely the nonzero p-regular quotients and the zero form on all other labels, These are all the simples by the cellular classification [F5] and the exact signed-conjugate equivalence of [F1]. In characteristic zero, e=∞>n, so the local separated-range proof in [F4] makes the Murphy cell forms nonsingular and the algebra split semisimple. The exact signed-conjugate unit form dictionary [F1] gives the same conclusion for all ordinary Specht modules. Thus all claims follow over the original field, without using the held finite-e Hecke classifier.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Nonzero-form cellular heads, cell purity and shared-factor linkage

Statement

Let A be a finite-dimensional cellular algebra over a field F (Cellular bases and cell modules) with cell modules Cλ and cell-form quotients Dλ=Cλ/Rλ. Then:

  1. every nonzero Dλ is an absolutely simple head, all simple A-modules occur exactly once this way, and [Cλ:Dμ]≠0 implies λ≥μ, with [Cμ:Dμ]=1 whenever Dμ≠0; here "nonzero quotient" means nonzero form, not necessarily a nondegenerate form on Cλ;
  2. every nonzero cell module, including labels with zero-form quotient, has all its composition factors in a single block (Blocks of a finite-dimensional algebra via primitive central idempotents);
  3. two nonzero cell modules share a block exactly when they are linked by a finite chain of nonzero cell modules whose neighbouring terms share a simple composition factor;
  4. for one primitive idempotent eμ per simple, dim⁡FeμAeν=∑λ[Cλ:Dμ] [Cλ:Dν].

If the cellular index set T(λ) is empty, then Cλ=Dλ=0. Its block support, the set of primitive central idempotents b with Cλb≠0, is empty, and it has no simple composition factors. It does not participate in the nonzero-cell linkage criterion of (3), and its term in the corner sum of (4) is zero.

Facts & Assumptions

Given: A finite-dimensional cellular F-algebra A with cellular basis cstλ, higher ideals A>λ, cell ideals Iλ=A≥λ, cell layers Jλ=Iλ/A>λ, right cell modules Cλ and their Gram forms ⟨−,−⟩.

[F1]

The two cell axioms yield the scalar product and right cell action derived in step 1.1: xcstλ=⟨x,csλ⟩ctλ for x∈Cλ. The form matrix is Gλ(s,t)=⟨csλ,ctλ⟩, and the cell layer satisfies Jλ≅Cλleft⊗FCλ (Cellular bases and cell modules). Here Cλleft is the star-converted left cell module, not the linear dual; the cell-layer tensor uses its first-index action.

[F2]

A has a complete orthogonal set of primitive idempotents; projective covers exist and are unique; the Jacobson radical is nilpotent with semisimple quotient; every simple module appears in A/rad⁡A (Finite-dimensional algebras admit primitive idempotent decompositions, Every finite-dimensional module has a projective cover, unique up to isomorphism over the target, For a finite-dimensional algebra, the Jacobson radical is nilpotent and the quotient by it is semisimple).

[F3]

Composition multiplicities [M:D] are well defined by the Jordan–Hölder theorem (Jordan–Hölder theorem for modules, Composition series and length of a module).

[F4]

Blocks of A are the primitive-central-idempotent components; a central idempotent acts as 0 or 1 on each indecomposable projective and cannot split a nonzero corner (Blocks of a finite-dimensional algebra via primitive central idempotents).

Proof

technique · direct

Given: The cellular data of [F1]–[F4] and the cell modules Cλ with

their forms.

1.1F1algebra

The cell-form scalar and its symmetry. For basis elements cusλ,ctvλ the product cusλctvλ equals a scalar Gλ(s,t) times cuvλ modulo A>λ with Gλ(s,t) independent of u,v: the right cell axiom fixes the first index and the left cell axiom fixes the last one, and comparing the two evaluations leaves the same scalar. The cellular involution gives Gλ(s,t)=Gλ(t,s). Associativity of the threefold product yields ⟨xa,y⟩=⟨x,ya∗⟩, since both sides compute the coefficient in the cell layer of the same product.

1.2F1F4algebra

Cell purity and the zero cell. If T(λ) is empty, then Cλ=0, its Gram matrix and form quotient are zero, and every central block projection acts with zero image; thus its block support is empty and it has no simple factors. The corresponding cell layer Jλ is zero as well. Now assume Cλ≠0 and let z be a central idempotent of A. On the cell layer Jλ≅Cλleft⊗FCλ the equality of left and right multiplication by z gives B⊗Id⁡=Id⁡⊗Aλ for the first- and second-factor coefficient matrices; comparing matrix coefficients shows every off-diagonal entry of B and Aλ vanishes and all diagonal entries of B and Aλ are equal, so both are a single scalar θλ times the identity. Since z is idempotent, θλ∈{0,1}. Applying this to all primitive central idempotents, whose sum is 1, exactly one acts as 1 on the nonzero cell module Cλ and the others as 0; hence Cλ, and therefore every composition factor of it, lies in one block. This covers labels with zero-form quotient because the tensor argument never divides by the Gram matrix.

2.1F1step 1.1

Nonzero form gives a simple head. Let Rλ:={x∈Cλ:⟨x,Cλ⟩=0} be the radical of the form. By step 1.1 the rank-one action is xcuvλ=⟨x,cuλ⟩cvλ, which shows that Rλ is a submodule and that every vector x∉Rλ generates Cλ: if ⟨x,cuλ⟩≠0, then scaling xcuvλ by the inverse scalar produces cvλ for every v. Hence every proper submodule is contained in Rλ and Dλ=Cλ/Rλ is simple when the form is nonzero; the criterion is nonzero form, and a degenerate but nonzero form is allowed. Extending scalars preserves the Gram rank and the rank-one action, so Dλ is absolutely simple.

3.1F1step 2.1

Every simple occurs. Let D be a simple A-module, and choose a cell ideal Iλ acting nontrivially on D, maximal among such ideals in the finite cell order; then A>λ annihilates D, while Jλ=Iλ/A>λ does not, so DJλ=D. If the Gram matrix of Cλ were zero, the cell-layer multiplication would satisfy Jλ2=0 and DJλ2=0, a contradiction; hence the form is nonzero. Choose s,u and d∈D with dcsuλ≠0; the map cvλ↦dcsvλ has nonzero image, which is all of D by simplicity and factors through the nonzero head Dλ of step 2.1, so D≅Dλ. This exhausts the simple labels without classifying which multipartitions have nonzero forms.

3.2F1step 2.1

Order and multiplicity. If λ does not dominate μ, then Cλ annihilates Iμ: products in Iλ∩Iμ involve only shapes strictly above λ. Since Dμ does not annihilate Iμ by the rank-one action, [Cλ:Dμ]≠0 forces λ≥μ. The radical Rλ annihilates Iλ, while Dλ does not, so [Cλ:Dλ]=1 when Dλ≠0. Two distinct nonzero heads are not isomorphic: their ideal supports would force λ≥μ and μ≥λ simultaneously.

4.1F1F3step 2.1step 3.2algebra

The corner identity. Choose one primitive idempotent eμ for each simple Dμ with dim⁡Dνeμ=δμν. The exact functor V↦Veμ (lift a vector along a surjection and multiply by eμ; restrict along an injection) gives dim⁡Cλeμ=[Cλ:Dμ]. The nonzero heads are self-dual under the involution by the symmetric associative nondegenerate quotient form of steps 1.1 and 2.1, so the corresponding left factor has the same multiplicities. Filtering A by a linear extension of the cellular ideals and applying the two exact projections eμ(−)eν to the cell layers Jλ≅Cλleft⊗Cλ, dimension additivity gives dim⁡FeμAeν=∑λ[Cλ:Dμ][Cλ:Dν]. An empty cell layer contributes zero to both the filtration dimension and every product of its composition multiplicities.

5.1F2F4step 1.2step 4.1

Blocks and linkage. A finite split algebra has blocks equal to the connected components of the graph on its primitive idempotents with an edge e–f whenever eAf≠0 or fAe≠0: a sum of full primitive idempotents over a union of components is central, and conversely a central idempotent cannot separate a nonzero corner, while repeated primitive idempotents of the same simple are linked through the matrix units of A/rad⁡A. By step 4.1 two simple labels have a nonzero corner exactly when they occur together as factors of some cell module, so two simples share a block exactly when a chain of cell modules links their factors. Since by step 1.2 every nonzero cell module is pure and by step 3.1 every simple occurs in a nonzero-form head, two nonzero cell modules lie in the same block exactly when there is a finite chain of nonzero cell modules each neighbouring pair of which shares a simple composition factor. Each nonzero cell has a simple composition factor because it has positive finite dimension. A zero cell has no such factor and has empty block support by step 1.2, so it is absent from this support graph and cannot create a chain edge or a common supported block.

6.1step 3.2step 4.1step 5.1∎

Conclusion. Steps 1.1, 2.1, 3.1 and 3.2 prove the head, exhaustion, order and multiplicity statement (1); step 1.2 proves cell purity (2); step 4.1 proves the corner identity (4); and step 5.1 proves the exact shared-factor linkage criterion (3). All arguments work over every field and allow degenerate nonzero cell forms, nonzero cells with zero-form quotient, and empty index sets with zero cell modules and empty block support.

Remarks

The correct criterion in part (1) is that the cell form be nonzero, not that it be nondegenerate on Cλ: degenerate but nonzero forms give simple heads whose radical is the form radical. The purity argument (1.2) is a tensor argument on the cell layer and never inverts the Gram matrix, so it applies to zero-form labels as well. No choice principle is used: all algebras are finite-dimensional and all filtrations finite.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Type-A Hecke permutation modules: semistandard Murphy bases and Specht filtrations

Statement

For every commutative ring R with invertible parameter z, the ordinary finite type-A Hecke algebra Hn and a composition ρ of n, the permutation module xρHn has R-basis m(S,t)=∑s: ρ(s)=Smst, where S ranges over the semistandard tableaux of partition shape and type ρ and t over the standard tableaux of the same shape. It has a Specht filtration with multiplicity #SStd⁡ρ(λ) of the ordinary Specht module Sλ (Semistandard tableaux and Kostka numbers, Tableaux and standard tableaux). The row-double-coset membership uses each coset word once and no quantum-factorial division. Over the generic field this number equals the trivial-character multiplicity of the ρ-row parabolic in Sλ. Moreover the explicit ordinary Garnir row-coset identity, the additive nonstandard-tableau factorization and the same-column generator refinement Tamst≡−mst+∑u⊳scumut(modhigher shapes) hold when a,a+1 are in one column of the standard tableau s; row-standard straightening has no smaller-shape terms and its same-shape terms increase tableau-prefix dominance. Shape support uses the already proved ordinary Murphy dominance ideals (The Murphy tableau elements form a cellular basis, Murphy elements and Murphy tableau elements); the finite Garnir algorithm terminates in lexicographic shape/tableau order before that dominance refinement.

Facts & Assumptions

Given: A commutative ring R with invertible z, the ordinary finite type-A Hecke algebra Hn with standard basis Tw and Murphy elements mst, a composition ρ of n with row symmetrizer xρ, and the semistandard/standard tableaux of shape λ⊢n.

[F1]

The Murphy elements mst form a cellular basis of Hn with the fixed-first-index cell law, and the dominance ideals are the higher-cell ideals of the cellular structure; the standard basis Tw exists over R and right multiplication by Ta has the two-term rule TwTa=zTwsa+(z−1)Tw for ℓ(wsa)<ℓ(w) (The Murphy tableau elements form a cellular basis, The standard basis of the generic type-A Hecke algebra, Murphy elements and Murphy tableau elements).

[F2]

Over the generic field, the Jucys–Murphy action is dominance triangular and its word-character separates tableaux of different shapes; every simple module of the cellular algebra is a nonzero cellular head and the cell modules of the ordinary Hecke algebra form a complete set of standard modules (The Hecke Jucys-Murphy action is dominance triangular, Nonzero-form cellular heads, cell purity and shared-factor linkage).

[F3]

The dominance order on partitions is Dominance order on partitions. The length-additive support lemma, Garnir identity, nonstandard-tableau factorization, finite increasing straightening and dominance ideals are proved in steps 2.1–5.1 and 8.1–9.1 of The Murphy cellular basis, the cell law and the Murphy form. The same-column refinement below is deduced from these rules, rather than assumed as part of cellularity.

[F4]

The independent same-shape perfect pairing identifies CM(λ)≅P(λ)∘ over every commutative ring with unit parameter; finite-free biduality gives CM(λ)∘≅P(λ). Star dual has action (fh)(m)=f(mh∗) (Murphy cells are the same-shape contragredient Specht duals, The Hecke sign automorphism, pullback and contragredient dual).

Proof

technique · direct

Given: The data and suppliers of [F1]–[F3]; work first over the universal

domain Z[z,z−1], where all coefficient statements are polynomial

identities, and specialize at the end.

1.1F1algebra

The row-double-coset identity and membership. For a semistandard tableau S of shape λ and type ρ and a standard t of shape λ, every row-standard refinement s of the column-strict tableau S is standard, and ∑sTd(s)∗xλ is the sum of Tw over the double coset Sρd(s0)−1Sλ, each w occurring exactly once; its left Sρ-coset expansion writes it as xρh0, and appending Td(t) gives m(S,t)=xρh for some h∈Hn. Hence each m(S,t) lies in xρHn, and no row-intersection quantum factorial is introduced.

1.2F1F3algebra

Independence and the Garnir coefficient rules. The sums m(S,t) are R-independent because their Murphy fibres (the index sets {s:ρ(s)=S}) are disjoint and every coefficient in the expansion of m(S,t) in the mst basis is 1; they therefore have disjoint unit pivots. For the coefficient rules, consider a violation at adjacent rows i,i+1 and column j and the composition ν=(λ1,…,λi−1,j−1,λi+1,λi+1−j,λi+2,… ); the two length-additive coset sums of SνSλ give ∑w∈Sν∩DλxλTw=∑v∈Sλ∩DνTv∗xν, whose distinguished Garnir term occurs with coefficient 1. Every other term in the original shape has strictly more dominant row tableaux, the reordered ν has strictly higher lexicographic shape, and the ordinary Murphy dominance refinement places these shape errors in higher-cell ideals; a nonstandard tableau factors as that Garnir tableau followed by an additive-length word (removing inversions while keeping the column violation), and Bruhat subword support preserves the strict tableau-prefix inequality. In the isolated relation for consecutive a,a+1 in one column, sorting the Garnir belt has a unique standard term whose single adjacent swap produces the distinguished Garnir term, with coefficient −1, and every other same-shape term is strictly more dominant. This yields the displayed congruence of the Statement, and the right analogue follows by the cellular involutions ∗.

2.1F1algebra

The row eigenspace test. For a fixed a the left z-eigenspace of Ta in Hn is (1+Ta)Hn: in the Tw basis pair w with saw of larger length, and coefficient comparison in Tah=zh gives equality of the two coefficients, whose sum is (1+Ta)Tw. This argument uses only that z is a unit. Over the universal domain, no element of this space has a nonzero Murphy coefficient at a tableau with a,a+1 in one column: choose a least shape and then a least left tableau in a dominance-compatible support order; higher-cell terms cannot contribute to its shape, and a column correction from another tableau can contribute only from a strictly less dominant left tableau, absent by minimality. If a,a+1 are in a column, its coefficient in Tah is the negative of its coefficient in h by step 1.2, contradicting the eigenvalue equation since z+1≠0 in the domain; if they share a row, the basis element is already a z-eigenvector and is subtracted; if their swap is standard, the exact two-tableau rules make the two coefficients equal and their sum is a z-eigenvector, which is subtracted. Each subtraction stays in the row ideal and removes the chosen support term without creating new ones, so induction on the finite support proves the column exclusion; specializing the resulting coordinate-zero identities gives it over every base ring, with no division by z+1 at a singular parameter.

3.1F1step 1.2step 2.1algebra

The basis theorem. Let h∈xρHn. It is a z-eigenvector for every generator inside every ρ-row interval, so step 2.1 excludes any supported tableau with a consecutive pair inside one column; for an adjacent standard swap, comparison of the exact two-tableau equations makes the two coefficients equal (no column-state correction can interfere, since every such state has coefficient 0). The standard refinements of a fixed row-label tableau are the linear extensions of the finite node posets of its repeated-label classes, and any two are connected by swaps of adjacent incomparable elements; finite induction on the inversion distance shows that if a repeated label occupies one column, a consecutive vertical cover realises an excluded state and forces the whole fibre coefficient to be 0, while otherwise the row-label tableau is column-strict and every fibre coefficient equals one common value. Hence h has zero coefficients off semistandard fibres and constant coefficients on each semistandard fibre, i.e. h lies in the span of the m(S,t); with step 1.2 this proves that the m(S,t) form an R-basis of xρHn.

4.1F1F4step 3.1algebra

The two filtrations, keeping the ordinary dictionary explicit. The higher-shape Murphy-cell filtration obtained from [F1] has one quotient CM(λ) for every semistandard tableau S of shape λ and type ρ: its second-index action is the fixed-first-index Murphy cell action. These quotients are free over R, so every short exact sequence of this filtration splits as a sequence of R-modules. Star duality is therefore exact on this filtration. On the distinguished coset basis bd=xρTd of xρHn, define β(bd,bc)=δdczℓ(d). The row-permutation generator cases prove contravariance: a same-row generator acts by z; a length-increasing adjacent coset pair acts by bdTi=bc, bcTi=zbd+(z−1)bc, with ℓ(c)=ℓ(d)+1, and the diagonal weights give β(bdTi,bc)=zℓ(c)=zβ(bd,bd). All other entries are zero or the corresponding diagonal equality. Thus β gives an Hn-isomorphism xρHn≅(xρHn)∘, since every diagonal zℓ(d) is a unit. The independently proved same-shape bridge gives CM(λ)∘≅P(λ), the ordinary Dipper–James Specht module, by finite-free biduality. Dualize the split Murphy filtration and transport it through this permutation self-duality. The resulting reversed filtration is an ordinary Specht filtration with exactly the same multiplicities. The original Murphy filtration is not called the ordinary one. This preserves the full every-ring/unit-parameter existence Statement without generic semisimplicity or form nondegeneracy on a Specht module.

5.1F2step 4.1algebra

The generic multiplicity interpretation. Over the generic field the finite Hecke algebra is split semisimple: by [F2] every simple is a nonzero cellular head, a simple factor of an ordinary cell module has a word character from that module and from the head's own cell shape, and disjoint word sets force the shapes to agree; existence of a factor forces its own head to be nonzero, diagonal multiplicity 1 forces the cell module to be simple, and the sum of squared dimensions equals the Hecke rank, so the algebra and each parabolic are split semisimple. Consequently the filtration multiplicity #SStd⁡ρ(λ) equals the multiplicity of the trivial character of the ρ-row parabolic in Sλ, by induction/restriction adjunction in the semisimple category.

6.1step 3.1step 4.1step 5.1∎

Conclusion. Steps 1.1, 1.2, 2.1 and 3.1 prove the semistandard Murphy basis of xρHn, step 1.2 gives the explicit Garnir and same-column generator rules with their termination, step 4.1 gives the Specht filtration with multiplicity #SStd⁡ρ(λ), and step 5.1 gives the generic parabolic-multiplicity interpretation. Everything is proved universally over Z[z,z−1] and specializes; the row-double-coset membership uses each coset word once and introduces no quantum-factorial division.

Remarks

This is the narrow ordinary type-A supplier consumed by the finite Mackey count of the higher-level theory: the basis and filtration are proved here rather than imported from a definition of the ordinary Schur algebra. No choice principle is used; all tableaux and quotient spaces are finite.

DefinitionDefinition: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The type-A q-Schur algebra and its Weyl modules

Definition

Let R be a commutative ring, q∈R×, d,n≥0, and H=HR,q(Sn) (The generic type-A Hecke algebra). Let Λ(d,n) be the set of weak compositions μ=(μ1,…,μd) of n (so μi∈Z≥0 and ∑iμi=n; zero parts are allowed and give empty rows). For μ∈Λ(d,n) let mμ=∑w∈SμTw (Murphy elements and Murphy tableau elements) and let Mμ:=mμH be the right ideal it generates, the (Hecke) permutation module; Mμ is free over R with basis {mμTd(t):t row-standard μ-tableau} and is the Hecke analogue of the module induced from the trivial representation of the Young subgroup (Young subgroups, tabloids, and permutation modules).

For a weak composition μ∈Λ(d,n), define T0(λ,μ) to be the fillings of [λ] by 1,…,d with exactly μi entries equal to i, weakly increasing rows and strictly increasing columns. Put T0(λ)=⋃μ∈Λ(d,n)T0(λ,μ) and Kλμ:=∣T0(λ,μ)∣. This explicitly extends the partition-content definition of Semistandard tableaux and Kostka numbers to weak compositions, including internal zero counts; a zero count means that its label is absent. The set is finite, since at most dn fillings occur for n>0, and at n=0 its unique member is the empty filling.

Here is the freeness statement in detail: the cosets Sμd with d∈Dμ partition Sn, and ℓ(ud)=ℓ(u)+ℓ(d) for u∈Sμ, d∈Dμ (Murphy elements and Murphy tableau elements), so the standard basis theorem (The standard basis of the generic type-A Hecke algebra) gives TuTd(t)=Tud(t) and mμTd(t)=∑u∈SμTu d(t); these are the standard basis elements indexed by the single coset Sμd(t), and the cosets are disjoint, whence Mμ=⨁tR mμTd(t) is free with the displayed basis as t runs over the row-standard μ-tableaux.

Put M:=⨁μ∈Λ(d,n)Mμ (The direct sum of an indexed family of modules) and define the q-Schur algebra S(d,n):=EndH(M), the R-algebra of right H-module endomorphisms of M (Unital left and right modules over a ring; unqualified module means left module).

Cellular structure. For all μ,ν∈Λ(d,n), HomH(Mν,Mμ) is free with the semistandard-pair basis constructed below; for every partition λ of n with at most d parts and all semistandard λ-tableaux S,T there is an element φST∈S(d,n) (Semistandard tableaux and Kostka numbers), and the family {φST:λ∈Λ+(d,n), S,T∈T0(λ)}, where Λ+(d,n) is the set of partitions of n with at most d parts ordered by dominance ⊵ (Dominance order on partitions), is an R-basis of S(d,n); the map φST↦φTS is an algebra anti-automorphism and the triangular axiom holds modulo the span of the φUV with μ⊳λ. Hence (φ,Λ+(d,n)) is a dominance-cellular basis of S(d,n) (Cellular bases and cell modules) and its cell modules are the Weyl modules Wλ, free over R with basis {φT:T∈T0(λ)}. Over a field F, Wλ has nonzero simple head Lλ, the Lλ for λ∈Λ+(d,n) form a complete set of pairwise non-isomorphic absolutely irreducible S(d,n)-modules, and the decomposition matrix satisfies dλλ=1 and dλμ≠0⇒λ⊵μ.

Explicit normalization of the semistandard maps. For a standard λ-tableau s, let μ(s) replace each entry by the row of that entry in the canonical μ-tableau. For semistandard S,T of respective types μ,ν, put mST:=∑s,t∈Std⁡(λ)μ(s)=S, ν(t)=Tmst. The normalized basis map φST is zero on the other summands and sends mνh∈Mν to mSTh∈Mμ. The intersection mST∈Mμ∩(Mν)∗ makes this well-defined: if mνh=0, write mST=amν and obtain mSTh=0. The integral intersection and Hom construction below proves that these are exactly the Hom basis; their composition is ordinary composition of endomorphisms. When d≥n, the regular type ω=(1n,0d−n)∈Λ(d,n) has Mω=H; its fibers are singleton standard tableaux, so evaluation at 1 identifies the corresponding regular-type corner map with mst. For d<n this regular type is absent and no such corner is asserted. This fixes the actual module-and-form normalization used by the corner and weight-Gram calculations (Mathas (4.13), with Corollary 4.12 and Theorem 4.14). No quantum factorial is inverted in this definition.

Weight idempotents and weight spaces. For each composition ν∈Λ(d,n), let 1ν∈End⁡H(M) be the identity on the summand Mν and zero on every other summand. These weight projections satisfy 1ν2=1ν,1μ1ν=0 (μ≠ν),∑ν1ν=1. They are not all of the diagonal cellular elements φTT: a general cellular diagonal is not asserted idempotent or orthogonal. For a partition ν the canonical tableau Tν of shape and type ν gives 1ν=φTνTν; for a general composition the projection is defined directly as above, without pretending that an arbitrary composition is a partition-shaped semistandard tableau. The basis map φST is supported between the summands indicated by the types of S and T. Thus the fixed-first-index Weyl basis vector φT survives right multiplication by 1ν exactly when T has type ν. Over any field, dim⁡F(Wλ1ν)=∣T0(λ,ν)∣=Kλν. This follows by applying the projection to the displayed free Weyl basis, not by assuming every diagonal cellular element is a projection (Semistandard tableaux and Kostka numbers).

Facts & Assumptions

Given: The commutative ring R, its unit q, the finite Hecke algebra H, its row ideals Mμ=mμH, and S=End⁡H(⨁μMμ) in the Definition. Multiplication in S is ordinary composition: (fg)(x)=f(g(x)).

[F1]

The standard Hecke basis and the length-additive distinguished coset representatives give mμTd=∑u∈SμTud and mμTi=qmμ for each adjacent generator of Sμ (The standard basis of the generic type-A Hecke algebra, Murphy elements and Murphy tableau elements). The involution satisfies Tw∗=Tw−1 and mμ∗=mμ.

[F2]

The proved integral permutation-module basis is m(S,t)=∑s: μ(s)=Smst, with S semistandard of type μ and t standard of the same shape (Type-A Hecke permutation modules: semistandard Murphy bases and Specht filtrations). Thus, in Murphy coordinates, membership in Mμ means that the first tableau has semistandard type μ, its coefficient is constant on each first-index fibre, and every other coefficient is zero. This is the exact basis assertion, over every R and unit q, rather than an inference from coset freeness.

[F3]

The Murphy elements form an integral cellular basis of H. In particular msth≡∑vrtv(h)msv modulo the span I⊳λ of strictly dominant shapes, with rtv(h) independent of s (The Murphy tableau elements form a cellular basis).

[F4]

For a finite-dimensional cellular algebra over a field, its nonzero cell-form quotients are a complete set of distinct absolutely simple modules and are simple heads; their decomposition numbers satisfy diagonal 1 and dominance support (Nonzero cell heads classify the simple modules of a cellular algebra, clause 1 of Nonzero-form cellular heads, cell purity and shared-factor linkage).

Proof

technique · direct
1.1givenF1algebraconstruct

The integral Hom test. The cyclic right module Mν has presentation H/∑i(Ti−q)H, where i ranges over the generators of Sν. Indeed, a length-additive decomposition w=ud reduces Tw in this quotient to qℓ(u)Td, and the map Td↦mνTd maps the resulting spanning family bijectively to the independent disjoint-coset basis. Therefore evaluation at mν identifies Hom⁡H(Mν,Mμ) with the elements y∈Mμ satisfying yTi=qy for those generators. Pairing Tw,Twsi with ℓ(wsi)=ℓ(w)+1 in the standard basis shows that this equation forces their two coefficients to be equal: the coefficient equations are qb=qa and a+(q−1)b=qb, so a=b since q is a unit. Requiring all these equalities makes the coefficients constant on each right Sν-coset. Its unweighted coset sum is Tcmν for the minimal right-coset representative c, by length additivity. Hence this simultaneous right eigenspace is Hmν=(Mν)∗, over every coefficient ring. Evaluation consequently gives an isomorphism Hom⁡H(Mν,Mμ)≅Mμ∩Hmν. For y=amν its inverse is mνh↦yh, which is well defined because mνh=0 implies yh=amνh=0.

2.1F2F3step 1.1algebraconstruct

The semistandard intersection. Expand y∈H uniquely in the Murphy basis. By [F2], membership in Mμ requires zero coefficients outside semistandard first-index fibres and constant coefficients inside each fibre. Apply ∗ to [F2] to see that membership in Hmν imposes the identical condition on the second-index fibres of type ν. The two requirements together say precisely that the coefficients are constant on each rectangle {(s,t):μ(s)=S,ν(t)=T}, and zero outside these rectangles. Thus their unweighted sums mST form a basis of the intersection. The rectangles are disjoint and have a coefficient 1 at every member, so independence and coefficient extraction hold over arbitrary R, including singular parameters; no quantum factorial is cancelled. Every nonempty rectangle has shape with at most d rows, since a strictly increasing column can use only d labels. Combining this with step 1.1 gives exactly the maps φST and the asserted basis of each Hom block, hence of S. The construction also commutes with arbitrary base change, because the same free basis and formulas describe each specialized Hom block.

3.1F1step 1.1step 2.1algebra

The involution under composition. Define f∗ on a Hom block by replacing its evaluation element y=f(mν)∈Mμ∩Hmν by y∗∈Mν∩Hmμ, and extend linearly to S. Step 2.1 gives φST∗=φTS, so this is an involution. To check reversal, let f:Mν→Mμ have f(mν)=amν and g:Mκ→Mν have g(mκ)=bmκ=mνh. Then (fg)(mκ)=abmκ, so (fg)∗(mμ)=mκb∗a∗. On the other hand f∗(mμ)=mνa∗ and g∗(mν)=mκb∗, whence (g∗f∗)(mμ)=mκb∗a∗. Noncomposable blocks give zero on both sides. Since each block map is determined by its generating element, (fg)∗=g∗f∗ as claimed.

4.1F3step 1.1step 2.1step 3.1algebra

The cellular multiplication law. Fix T of shape λ and type ν, and first take f:Mκ→Mν. Write f(mκ)=mνh. Then (φSTf)(mκ)=mSTh. By [F3], its shape-λ Murphy coefficient at (s,v) is ∑t:ν(t)=Trtv(h) if μ(s)=S, and zero otherwise; all remaining shapes strictly dominate λ. This coefficient is independent of s. The full element lies in Mμ∩Hmκ by step 1.1, so step 2.1 forces these coefficients to be constant on semistandard second-index fibres κ(v)=V and zero on the other fibres. For a fixed T,h, these constants are independent of S: choose any member s of its nonempty first fibre and read the displayed sum, which contains no s. Calling the constants rV, evaluation and the intersection basis give φSTf≡∑V∈T0(λ,κ)rVφSV modulo the span of strictly dominant Schur shapes, for every S. Sum over Hom blocks for arbitrary f∈S. Step 3.1 gives the corresponding left law, so each upward span is a two-sided ideal and the cellular axioms hold. This proves cellularity by actual composition and Murphy coefficient comparison.

5.1step 2.1step 4.1F4algebra

Partition projections and nonzero forms. For the canonical semistandard tableau Tλ of shape and type λ, its refinement fibre consists just of tλ, so mTλTλ=mλ. Accordingly φTλTλ is the identity on Mλ and zero on other summands; it is the genuine projection 1λ. Squaring it gives 1λ2=1λ. In the free shape-λ cell quotient, the cell product is 1λ2≡Bλ(φTλ,φTλ)1λ, and the coefficient of this basis vector is therefore 1. Over a field this form is not identically zero. Step 4.1 and [F4] consequently show that every Wλ has the nonzero absolutely simple head Lλ, that these heads give all simple modules exactly once, and that the stated diagonal and dominance decomposition conditions hold.

6.1givenstep 2.1step 4.1step 5.1algebra∎

Weight ranks and edge cases. Direct summand projections 1ν satisfy the displayed orthogonality and sum-to-one relations. The source support of φST implies φST1ν=δtype⁡(T),νφST, so the same formula holds on the right Weyl cell basis, proving its weight rank Kλν. It asserts no idempotence for other cellular diagonal elements. Deleting empty rows leaves the Young subgroup unchanged and identifies the row-type fibres after the order-preserving relabelling of the remaining row labels; hence all constructions allow zero parts. At n=0 the unique empty tableau and empty partition give H=R, S=R and cell form 1. If d=0<n, the indexing set of weak compositions and the direct sum are empty, S=0, and every basis and simple-label assertion is empty. No division except by powers of the unit q, generic semisimplicity or choice principle enters any step.

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

The Schur idempotent and the Schur functor for type-A q-Schur algebras

Definition

Let R be a commutative ring with 1, let q∈R×, let d,n≥0 with d≥n, and let H=HR,q(Sn) (The generic type-A Hecke algebra). Write S:=S(d,n)=EndH(M) for the type-A q-Schur algebra with M=⨁μ∈Λ(d,n)Mμ the direct sum of the permutation modules (The type-A q-Schur algebra and its Weyl modules, The direct sum of an indexed family of modules) and let {φST:λ∈Λ+(d,n), S,T∈T0(λ)} be its cellular semistandard basis (Murphy elements and Murphy tableau elements for the underlying Murphy elements and The standard basis of the generic type-A Hecke algebra for the standard basis along which this basis is defined). Put ω:=(1n,0d−n)∈Λ(d,n), the length-d composition with n entries equal to 1 (legitimate because d≥n), so that the Young subgroup Sω is trivial and mω=1; hence Mω=mωH=H is the regular right H-module. Let tω be the unique standard ω-tableau, with entries 1,2,…,n down its single column; it is in particular the unique row-standard ω-tableau whose entries increase down the column. Set e:=φtωtω∈S.

Then:

  1. e is the projection of M onto the direct summand Mω=H along the other summands Mμ, μ≠ω; in particular e2=e and eSe≅EndH(Mω)=EndH(H), via the algebra isomorphism ρ:H⟶eSe,h⟼ρh,ρh(x):=hx, left multiplication by h on Mω=H being a right H-module endomorphism. Here the isomorphism eSe≅EndH(Mω) sends efe to (efe)∣Mω and is inverted by extending an endomorphism of Mω by zero on the other summands, and the identification EndH(H)≅H sends an endomorphism to its value at 1. By the construction of the semistandard basis elements φST (Mathas (4.13) with Corollaries 4.9 and 4.12; see the locator above), the diagonal element φtωtω is exactly the endomorphism of M that is the identity on Mω and zero on all Mμ with μ≠ω, which is the projection asserted above.

  2. The Schur functor is F:mod-S⟶mod-H,F(X):=Xe=X⊗SSe, with the right H-action transported along ρ, so that (xe)⋅h:=x ρh for x∈X, h∈H (Unital left and right modules over a ring; unqualified module means left module). It is exact and R-linear on morphisms: as a left S-module, Se is the image of the left-S-linear projection s↦se on S, hence is a direct summand of the regular left module and is projective. Tensoring right S-modules with this left module is therefore exact. Equivalently, for a short exact sequence of right modules, an element ye in the target lifts to xe from any lift x of y; kernels and injections are likewise preserved by the same idempotent projection. The bimodule corner action makes these maps right H-linear. The convention is fixed: the functor is X↦Xe on the right, and the left-module formula X↦eX is not used on this page.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Semistandard weight dimensions detect virtual Weyl classes

Statement

Let F be a field, q∈F×, d,n≥1, and let S=S(d,n) be the q-Schur algebra with Weyl modules Wλ for λ∈Λ+(d,n) (The type-A q-Schur algebra and its Weyl modules). Let M be a finite-dimensional right S-module and let (aλ)λ∈Λ+(d,n) be integers such that dim⁡F(MφTνTν)=∑λ∈Λ+(d,n)aλ dim⁡F(WλφTνTν) for every partition ν∈Λ+(d,n), where φTνTν are the diagonal semistandard basis elements (The type-A q-Schur algebra and its Weyl modules). Then [M]=∑λaλ[Wλ] in the Grothendieck group G0(S-mod) (Grothendieck group of an essentially small abelian category). Consequently equality of all semistandard weight-space dimensions forces equality in the Grothendieck group.

Facts & Assumptions

Given: A field F, the type-A q-Schur algebra S=S(d,n) over F, its Weyl modules Wλ and simple heads Lλ for λ∈Λ+(d,n), and the semistandard elements φST (The type-A q-Schur algebra and its Weyl modules).

[F1]

Semistandard structure (The type-A q-Schur algebra and its Weyl modules): S is finite dimensional over F; the Lλ, λ∈Λ+(d,n), form a complete set of pairwise non-isomorphic absolutely irreducible S-modules; the weight projections pν onto the permutation summands are orthogonal idempotents and, for the canonical tableau of the partition ν, pν=φTνTν; arbitrary diagonal semistandard elements need not be idempotents; the decomposition numbers dλμ:=[Wλ:Lμ] satisfy dλλ=1 and dλμ≠0⇒λ⊵μ; and dim⁡F(WλφTνTν)=Kλν for all λ,ν∈Λ+(d,n) (Semistandard tableaux and Kostka numbers).

[F2]

Kostka unitriangularity (The Kostka change of basis is dominance-unitriangular): Kλν=0 unless λ⊵ν and Kλλ=1; with rows and columns ordered by a linear extension of dominance from smaller to larger, (Kλν)λ,ν∈Λ+(d,n) is lower unitriangular over Z, hence invertible over Z.

[F3]

Grothendieck group and multiplicities (Grothendieck group of an essentially small abelian category, Jordan–Hölder theorem for modules): [Y]=[X]+[Z] for every short exact sequence 0→X→Y→Z→0 of finite-dimensional S-modules, and [N]=∑μ[N:Lμ][Lμ] in G0(S-mod), where the composition multiplicity [N:Lμ] is well defined.

Proof

technique · direct
1.1givenF1algebra

Exactness of a weight projection. Fix an idempotent p=pν∈S. For a short exact sequence 0→A→B→fC→0 of right S-modules, the sequence 0→Ap→Bp→Cp→0 is exact as vector spaces. Injectivity and the kernel identity follow from the underlying sequence and a=ap for a∈Ap. For surjectivity, lift c∈C to b∈B; then f(bp)=cp. Right multiplication by p is a linear projection, and preserves every S-submodule, although it need not be an S-linear endomorphism when p is not central. Taking dimensions proves additivity. Only the canonical partition weight projections are used.

2.1step 1.1F1F3

Weight functionals on composition series. Apply step 1.1 to every short exact sequence of a finite composition series of N. Its factors are the simple modules Lμ, so dim⁡F(Npν)=∑μ[N:Lμ]dim⁡F(Lμpν). The defining relations of the Grothendieck group similarly give [N]=∑μ[N:Lμ][Lμ]. This argument requires exactness on vector spaces, not the false assertion that every noncentral weight projection lies in End⁡S(N).

3.1step 2.1F1F2

Invertibility of the weight matrix: put Xμν:=dim⁡F(LμφTνTν) for μ,ν∈Λ+(d,n). Feeding a composition series of Wλ into step 2.1 gives Kλν=dim⁡F(WλφTνTν)=∑μdλμXμν, that is, K=dX with d=(dλμ) and K=(Kλν). Both d and K are unitriangular over Z by [F1] and [F2] respectively, hence invertible over Z, and therefore X=d−1K is invertible over Z.

4.1step 2.1step 3.1F1F3

Conclusion: write cμ:=[M:Lμ] and bμ:=cμ−∑λaλdλμ∈Z. By step 2.1 applied to M and to the identity dim⁡F(WλφTνTν)=Kλν, for every ν 0=dim⁡F(MφTνTν)−∑λaλdim⁡F(WλφTνTν)=∑μcμXμν−∑λaλ∑μdλμXμν=∑μbμXμν. Since X is invertible over Z by step 3.1, bμ=0 for all μ. Hence cμ=∑λaλdλμ, and step 2.1 together with the defining relations [F3] gives [M]=∑μcμ[Lμ]=∑λaλ∑μdλμ[Lμ]=∑λaλ[Wλ].

5.1step 3.1step 4.1F3∎

Consequence: if two finite-dimensional right S-modules M,N satisfy dim⁡F(MφTνTν)=dim⁡F(NφTνTν) for all ν∈Λ+(d,n), then applying the argument of step 4.1 to the difference of their multiplicity vectors shows ∑μ([M:Lμ]−[N:Lμ])Xμν=0 for all ν, so the invertibility of X gives [M:Lμ]=[N:Lμ] for all μ and hence [M]=[N] in G0(S-mod).

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Virtual Weyl and Specht symbols attached to beta sequences

Definition

Fix a beta length L≥1. For a partition ν with at most L columns (that is, ν1≤L), put βi(ν)=νi′+L−i(1≤i≤L). Its beta numbers are strictly decreasing nonnegative integers. Conversely, from any strictly decreasing nonnegative sequence b recover the unique partition with conjugate parts νi′=bi−L+i, of degree ∣ν∣=∑ibi−L(L−1)/2 (Partitions, English diagrams, and conjugation).

For arbitrary b∈ZL, first set all its alternating symbols to zero if it has repeated entries or a negative entry. Otherwise there is a unique sorting permutation w taking it to decreasing order; let ν be the recovered partition and let ϵ(b)=(−1)ℓ(w). Uniqueness of the sorting permutation is claimed only in this distinct-entry case. In the fixed degree-r Grothendieck groups define [Wb]d,r:={ϵ(b)[Wν],∣ν∣=r and ℓ(ν)≤d,0,otherwise,[Sb]r:={ϵ(b)[SMν],∣ν∣=r,0,otherwise. The notation [Δb] is synonymous with [Wb]d,r when d,r are fixed. The ordinary Dipper-James translation conjugates every partition label and pulls every compared module back by the same θ (The type-A Hecke Specht module and its cell form, The type-A q-Schur algebra and its Weyl modules).

For a composition μ define the signed semistandard number directly by dμ(b):={ϵ(b)∣T0(ν,μ)∣,b has distinct nonnegative entries and ∣ν∣=∣μ∣,0,otherwise. Here the tableau alphabet is the length of μ; a shape with too many rows automatically has no such tableau (Semistandard tableaux and Kostka numbers). This function is alternating in the beta entries. It also obeys the branching identity dμ(b)=∑C⊆{1,…,L}∣C∣=zdμˉ(b−1C), where z is the last nonzero part of μ and μˉ deletes that part. The selected entries are decreased by one, not replaced by −1. For a decreasing beta sequence this is the deletion of the largest semistandard entries: they occupy a horizontal strip, at most one box in each selected column. Sorting extends the identity to distinct arbitrary sequences; if entries repeat, terms selecting just one of the equal entries cancel in pairs, while terms selecting both or neither vanish. Negative entries remain negative after decrementing. Thus the identity also holds in all zero-symbol cases. At μ=0 its value is the sorting sign for a permutation of (L−1,…,0) and is zero otherwise, so the recursion terminates without another unproved extension rule.

In the formulas of this page take L=r when r>0. A nonzero degree-r partition has width at most r, so this length suffices; the Weyl cutoff ℓ(ν)≤d is retained even when d<r. A balanced displacement +heb−hec preserves total degree. An unbalanced change is not silently treated as a class in the same fixed-degree group. The empty degree is handled by the empty beta sequence and unit symbol. No choice principle is used.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The simple type-A Hecke modules are indexed by e-regular partitions

Statement

Let F be a field, q∈F×, let e=e(F,q)∈{2,3,… }∪{∞} be the quantum characteristic (The quantum characteristic of an invertible Hecke parameter) and let H=HF,q(Sn) for n≥0. For λ⊢n let Sλ be the Hecke Specht module and Dλ=Sλ/rad Sλ its cell-form quotient (The type-A Hecke Specht module and its cell form). Then:

  1. Dλ≠0 if and only if λ is e-regular (e-regular and e-restricted partitions);
  2. {Dλ:λ⊢n is e-regular} is a complete set of pairwise non-isomorphic absolutely irreducible H-modules;
  3. H is split semisimple if and only if e>n (including e=∞); when e≤n the algebra has nonzero radical.

This is the exact root-of-unity replacement for the ordinary Specht classification. At q=1 in characteristic p>0 it specialises to the classification of the simple F[Sn]-modules by p-regular partitions (Modular simple modules of the symmetric group). No semisimplicity is assumed and no choice principle is used.

Facts & Assumptions

Given: A field F, a unit q, the type-A Hecke algebra H, its Murphy cells CM(η) and form quotients DM(η), and the ordinary signed-conjugate normalization in the Statement.

[F1]

The nonzero cell-form quotients are pairwise distinct absolutely simple modules and exhaust the simples. A quotient is nonzero precisely when its form is not identically zero; a zero form quotient makes no assertion about the actual module head (Nonzero cell heads classify the simple modules of a cellular algebra).

[F2]

The actual ordinary module/form bridge gives Sλ=CM(λ′)θ and Dλ=DM(λ′)θ, with θ(Ti)=(q−1)−Ti an involution commuting with star. Pullback is exact and preserves nonzero modules and simplicity (The type-A Hecke Specht module and its cell form). Conjugation exchanges regular and restricted partitions (e-regular and e-restricted partitions).

[F3]

The locally proved Jucys–Murphy elements commute and preserve a common tableau flag of each Murphy cell, with diagonal word ([ct(1)]q,…,[ct(n)]q), where ct(a) is the integer node content. The row-filled maximal tableau has an exact eigenrelation (The Hecke Jucys-Murphy action is dominance triangular).

[F4]

Cellular support gives [CM(η):DM(ρ)]=0 unless η⊵ρ, and gives diagonal multiplicity one when that quotient is nonzero (Cellular decomposition matrices are unitriangular for the cell order).

[F5]

The integral Murphy basis, dominance ideals, row action and finite Garnir straightening are valid over A=Z[Q,Q−1] and commute with every base change (The Murphy cellular basis, the cell law and the Murphy form, The row permutation module: distinguished basis and Hecke action). For a row group Sα, xα2=[α]!Qxα by length-additive parabolic cosets; [α]!Q=∏j[αj]!Q (The q-integer, q-factorial and q-multinomial coefficients).

[F6]

At q=1, the quantum characteristic is the field characteristic when positive, and is infinity in characteristic zero (The quantum characteristic of an invertible Hecke parameter); the ordinary group labels are the regular Specht-head labels (Modular simple modules of the symmetric group). The Jacobson radical of a finite-dimensional algebra is the intersection of the annihilators of its simple modules (The Jacobson radical of a finite-dimensional algebra is the intersection of its maximal left ideals).

Proof

technique · direct
1.1F3F5givenconstructalgebra

Use finite joint-primary projections without presupposing which labels survive. The regular right module has a cellular filtration with quotients copies of the cells; refining their common flags in [F3] gives a simultaneous triangular flag on it. Thus each La is annihilated by a polynomial ∏b(X−b)N, with finitely many diagonal values b∈F and N≥dim⁡H. Polynomial Bezout and the Chinese remainder construction give pa,b congruent to one modulo (X−b)N and zero modulo the other factors. Substituting La gives commuting idempotents. For a joint word ξ, their product Pξ is idempotent in H and on a cell flag has diagonal one exactly at tableaux with word ξ, zero elsewhere. An idempotent has zero image if and only if all these diagonal entries vanish: its triangular matrix would otherwise be nilpotent and idempotent, hence zero. The vector-space functor M↦MPξ is exact on H-modules, because a lift x of y=yPξ can be replaced by xPξ, and kernels are preserved. No centrality or H-submodule assertion for this image is needed.

1.2givenF3F6algebra

For finite e, equality of two diagonal values [a]q,[b]q is equivalent to a≡b(mode). Indeed [a]q−[b]q=qb[a−b]q for all integers, including negative integers. When q≠1, e is the multiplicative order of q, and when q=1, e=char⁡F and the q-integer is the integer reduced to F. Thus a joint word is exactly a residue word in the node convention c−r(mode).

1.3givenconstructalgebra

Prove the complete ladder-boundary comparison. Put L(s,c)=(e−1)s+c−e. Suppose α is restricted, every occupied node has L<l, and the addable ladder-l set is nonempty. Set C=l+e−1, T=⌊C/(e−1)⌋, d=C−(e−1)T∈{0,…,e−2} and us=C−(e−1)s. For 1≤s≤T, 0≤αs≤us, and no positive row occurs beyond T. The deficits hs=us−αs are nonnegative and satisfy hs+1−hs=αs−αs+1−(e−1)≤0. An addable ladder-l row has deficit zero; thereafter every deficit is zero. Consecutive such rows have width difference e−1>0, so the ladder addables form a terminal interval s0,…,T. A first equality row that is not addable simply precedes this interval. Adding its bottommost k nodes therefore adds in rows T−k+1,…,T. The length of α is T for d>0 and T−1 for d=0, including the empty case T=1,d=0. If β⊵α has the same size, its length is at most that of α, by the prefix inequality at that length. For d=0 all addable rows of β are at most T. For d>0 the sole possible extra row is T+1, with residue −T, different from i=l mod e=d+1−T mod e since 1≤d+1<e. Hence every addable i-node of β lies in a row at most T. If γ adds any k of these initial addables, at row cutoff r its prefix increment is at least max⁡(0,k−max⁡(T−r,0)), exactly the increment for the bottommost-k extension δ of α. Adding β's prefix inequalities proves γ⊵δ. This holds for every k simultaneously and needs no same-content premise.

1.4F5constructalgebra

The integral intersection factorization. Work over A=Z[Q,Q−1]. Suppose a row-standard tableau t already agrees with tη on rows before j, and let B be the canonical label interval of row j. In rows r≥j let βr count its B-labels. First rearrange labels inside B into increasing row-reading order, then do the same with all remaining tail labels, preserving the number of labels from each interval in every row. This gives a tableau v whose row r consists of a B-segment of length βr followed by a tail-segment of length ηr−βr. The sorting removes inversions separately within the two label intervals, so d(t)=d(v)wa with additive length, w∈SB, and a a permutation of the remaining tail labels. The intervals are disjoint, so Ta commutes with xB, and TwxB=Qℓ(w)xB. Let K′ be the subgroup cutting each canonical row r≥j into lengths βr,ηr−βr, while retaining the earlier rows. Let K cut B into consecutive lengths βr and the tail into consecutive lengths ηr−βr, again retaining earlier rows. The permutation d(v) increases on these segments on both sides and transports K′ to K. Hence xK′Td(v)=Td(v)xK, by expansion into length-additive standard-basis words. If E consists of the minimal representatives with Sη=⨆u∈EuK′, then xη=∑u∈ETuxK′. Write ν=(η1,…,ηj−1,ηj,ηj−βj,…,ηk−βk), omitting zero parts. Multiplication of xK by xB gives [β]!Qxν: the B-intersection subgroup contributes ∑Qℓ(b)=[β]!Q, while its tail and earlier-row factors commute with xB. Consequently the exact identity is xηTd(t)xB=Qℓ(w)[β]!Q∑u∈ETuTd(v)xνTa. No scalar is divided out. Sorting ν to a partition uses the invertible block-reordering identity in [F5], so this is in [β]!QHxν+H. If ν+⋬η, the dominance-ideal assertion in [F5] makes its shape-η part vanish. Otherwise the first j+1 largest parts of ν have sum at least η1+⋯+ηj+ηj−βj; comparison with η gives βj≥ηj−ηj+1.

2.1F5step 1.4algebra

Canonical-row support without factorial cancellation. The semistandard permutation-basis theorem Type-A Hecke permutation modules: semistandard Murphy bases and Specht filtrations, followed by star, gives an exact coordinate condition for Hxρ: every supported right Murphy tableau has semistandard type ρ. Apply it to the factor remaining after [β]!Q in step 1.4, before putting back Ta. This factor belongs to Hxν. In shape η, semistandardness forces the first η1 labels into the first row, the next η2 into the second, and so on through B: a label cannot occur below its own row, and each earlier row is already full. Thus its right tableaux have the first j canonical rows. The permutation a uses only later labels. Expanding Ta by the row action and straightening cannot alter these canonical rows: their prefix counts are maximal, and same-shape straightening increases every tableau-prefix count by that supplier's Statement. This proves the canonical-row assertion even for the quotient by the displayed factorial. Starting at j=1, repeat steps 1.4 and 2.1 for each surviving standard-tableau term. If ηj−ηj+1≥e, every surviving term at that stage has βj≥e, so [e]!Q divides its factor [β]!Q. Later multiplication and integral straightening preserve this common divisor. This establishes the full repeated-symmetrizer support and divisibility used below.

2.2step 1.3constructalgebra

For restricted η, number its nodes by increasing L, taking lower rows first on a tie, to obtain tη. Moving right increases L by one and moving down by e−1, so it is standard. The diagrams αl of nodes with L<l and δl with L≤l are restricted: their row widths are the minimum of the restricted widths of η and the positive part of the affine cutoff bound, each having adjacent difference at most e−1. A node on ladder l forces every lower positive position on that ladder to be occupied, since ηs+1≥ηs−(e−1). Thus δl adds the bottommost al ladder addables to αl. Any competing standard tableau with the same full residue word has, in the corresponding block, al additions all of residue l. Every such node was addable before the block: adding an i-node creates new addable corners only of residues i+1,i−1, distinct from i for e≥2. Starting with the empty diagrams, step 1.3 inductively shows its shape dominates δl at every completed block, and hence its final shape dominates η. No strictly lower shape has the word of tη, and no same-shape tableau uniqueness is asserted.

3.1F1F4step 1.1step 1.2step 2.2algebra

Choose Pξ for the word of tη. It has nonzero image on CM(η) and zero image on every CM(ρ) with ρ⊲η, by steps 1.2 and 2.2. Therefore it has zero image on their form quotients. Apply the exact projection to a composition series of CM(η). Some constituent has nonzero image; by [F1] and [F4] it is a nonzero DM(ρ) with ρ⊴η. The exclusion forces ρ=η, proving the restricted Murphy quotient nonzero over the original field. This is a joint-word and cellular-support proof, not an import of cellular/crystal label identification.

4.1F1F5step 1.4step 2.1step 3.1algebra

If ηj−ηj+1≥e for some j, every surviving term at that row has βj≥e by steps 1.4 and 2.1 and is divisible by [e]!Q. Later multiplication and straightening cannot remove this polynomial factor. Every Gram entry is the coefficient of xη in xηTd(s)Td(t)∗xη modulo higher shapes; first expand its middle factor in the row-module basis and apply the proved row calculation. Thus every entry is divisible by [e]!Q. Specializing Q to q makes that factor zero, so the entire Murphy form vanishes and DM(η)=0. This concerns a common divisor of entries, not a product-of-hooks formula for a determinant. Combining with step 3.1 proves the finite-e Murphy criterion.

4.2F3F4step 1.1step 3.1constructalgebra

For e>n, including infinity, distinct standard tableaux of any shapes have distinct full diagonal words. At their first unequal step the preceding diagram has size a−1; its distinct addable-corner contents differ by a nonzero integer of absolute value at most a≤n, so their q-integers differ. Induction recovers every next node. Consequently every tableau word of CM(η) occurs in no strictly lower cell. Exact projections as in step 3.1 and diagonal multiplicity one in [F4] show that all dim⁡CM(η) flag factors occur in DM(η); thus this quotient has the full cell dimension and its form radical is zero. In particular at e=∞ every partition is restricted and has nonzero quotient. At n=0 the unique cell is F with norm one.

5.1F1F5F6step 4.2algebra

Establish the complete semisimplicity clause. Put fη=dim⁡CM(η) and dη=dim⁡DM(η), with zero for a zero quotient. The Murphy basis gives dim⁡H=∑ηfη2. On each nonzero quotient its nondegenerate form and the cell law supply all rank-one operators. Since the cells are right modules, their action gives a surjective algebra map H→End⁡F(DM(η))op, a full matrix algebra after transpose. Its kernels are distinct maximal two-sided ideals: equality would give the same matrix-algebra simple module, contradicting [F1]. They are pairwise comaximal. Their finite product map is surjective: for each kernel Ia and each other Ib choose uab∈Ib congruent to one modulo Ia, multiply over b≠a, and use these elements to isolate each prescribed matrix component. Its kernel is the radical by the complete simple list and [F6]. Hence dim⁡(H/rad⁡H)=∑ηdη2. Step 4.2 makes this equal to dim⁡H when e>n, giving an isomorphism with a product of full matrix algebras over F. When finite e≤n, the one-dimensional Murphy row cell has norm [n]!q=0, since x(n)2=[n]!qx(n). Its quotient dimension is zero while its cell dimension is one; every other dη≤fη. The dimension sum is therefore strictly smaller and rad⁡H≠0. This proves both directions of part 3 without any claim that some Specht module must be reducible.

6.1F1F2F6step 3.1step 4.1step 4.2step 5.1∎

Apply the same exact involution to every Murphy quotient: Dλ=DM(λ′)θ is nonzero exactly when λ′ is restricted, equivalently when λ is regular. The nonzero quotients remain pairwise distinct absolutely simple and complete by [F1] and [F2]. This proves parts 1 and 2, and step 5.1 gives part 3. At q=1, [F6] gives precisely the ordinary p-regular group classification, including characteristic two; no splitting or semisimplicity assumption was made. All selections and polynomial computations were finite, so no choice principle is used.

Remarks

The finite ladder-boundary lemma, joint-primary projection argument and row-entry divisibility are local proofs. The cited manuscript documents their source; its erroneous displayed ladder slope and unsupported single-node truncation sentence are replaced by the complete simultaneous-block comparison above. The richest original classification and radical assertions are retained. Zero cell-form quotients are distinguished from actual module heads throughout.

CorollaryStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The type-A Hecke decomposition matrix is dominance unitriangular

Statement

Let F be a field, q∈F×, e=e(F,q) and H=HF,q(Sn) (The quantum characteristic of an invertible Hecke parameter). For λ⊢n and e-regular μ⊢n let dλμ:=[Sλ:Dμ], the multiplicity of Dμ in a composition series of the Specht module Sλ (The type-A Hecke Specht module and its cell form, The simple type-A Hecke modules are indexed by e-regular partitions). Then dμμ=1anddλμ≠0 ⟹ μ⊵λ, where ⊵ is the dominance order on partitions (Dominance order on partitions): a simple factor Dμ of Sλ can occur only if the e-regular label μ dominates λ. Equivalently the decomposition matrix (dλμ) is unitriangular along dominance. This constrains but does not compute the entries: no off-diagonal decomposition number is determined by cellularity.

Facts & Assumptions

Given: A field F, q∈F×, H=HF,q(Sn) with Specht modules Sλ and simple quotients Dμ in the signed conjugate normalization (The type-A Hecke Specht module and its cell form), together with the dominance order on partitions of n (Dominance order on partitions).

[F1]

(The type-A Hecke Specht module and its cell form) Sλ=(SMλ′)θ and Dμ=(DMμ′)θ for the conjugate partitions, where SMν is the Murphy cell module and θ is the involutive automorphism θ(Ti)=−qTi−1; pullback along θ is exact and preserves submodules, quotients, composition multiplicities and simplicity.

[F2]

(Cellular decomposition matrices are unitriangular for the cell order) For the Murphy cellular basis of H the composition multiplicity [SMν:DMρ] satisfies [SMρ:DMρ]=1 whenever DMρ≠0 and is zero unless ν⊵ρ.

[F3]

(Dominance order on partitions) Conjugation reverses dominance: λ′⊵μ′ if and only if μ⊵λ.

[F4]

(The simple type-A Hecke modules are indexed by e-regular partitions) Dμ≠0 exactly for the e-regular μ.

Proof

technique · direct
1.1givenF1F4

Invariance of composition multiplicities under the normalisation: by [F1] the twist (−)θ is an exact equivalence of module categories with inverse (−)θ itself, so it is additive on short exact sequences and carries composition series to composition series; hence [Sλ:Dμ]=[SMλ′:DMμ′] for all λ⊢n and e-regular μ⊢n.

2.1step 1.1F2F3

Vanishing: if dλμ≠0, then [SMλ′:DMμ′]≠0 by step 1.1, so λ′⊵μ′ by [F2], and conjugation reversal [F3] gives μ⊵λ.

2.2step 1.1F2

Diagonal: taking λ=μ in step 1.1 gives dμμ=[SMμ′:DMμ′]=1 by [F2].

3.1F1F4step 2.1step 2.2∎

Assembly: steps 2.1 and 2.2 are exactly the two claims; ordering the rows and columns of (dλμ) by any linear extension of dominance displays the unitriangular shape, and no off-diagonal entry is determined by the cellular structure. At q=1, [F1] and [F4] identify the same ordinary group labels; over a splitting p-modular system this agrees with Dominance unitriangularity of the symmetric-group decomposition matrix within that supplier's hypotheses. The present proof establishes the bound over every field.

TheoremStatement: AI-adaptedProof: AI-adaptedOpen item page →

The Schur functor sends Weyl and simple modules to Specht and Hecke simple modules

Statement

Let k be a field, q∈k×, d≥n, and let F(X)=Xe be the right-module Schur functor of The Schur idempotent and the Schur functor for type-A q-Schur algebras. Set eq=e(k,q) (The quantum characteristic of an invertible Hecke parameter). For each λ∈Λ+(d,n) let Wλ be the Weyl module with Schur cell form Bλ and nonzero simple head Lλ (The type-A q-Schur algebra and its Weyl modules). Write CM(λ) and DM(λ) for the independent Murphy cell module and its cell-form quotient (The Murphy cellular basis, the cell law and the Murphy form). Then:

  1. F(Wλ)≅CM(λ) as right H-modules, and this isomorphism identifies Bλ∣Wλe exactly with the Murphy cell form. 2. F(Lλ)≅DM(λ), including the zero quotient; it is nonzero exactly when λ is eq-restricted. 3. For every eq-restricted ν⊢n, [Wλ:Lν]=[CM(λ):DM(ν)].

In the page's ordinary Dipper–James normalization (The type-A Hecke Specht module and its cell form, Ordinary Specht modules are the signed conjugate Murphy cells), these identities become F(Wλ′)≅(Sλ)θ,F(Lλ′)≅(Dλ)θ. The latter module is nonzero exactly for eq-regular λ and is zero otherwise. For eq-regular ν, [Wλ′:Lν′]=[Sλ:Dν]. The accepted ordinary polytabloid comparison identifies Sλ with the historical DJ module P(λ) and identifies their form radicals through an explicit unit factor. Thus the dictionary concerns the actual ordinary modules, not merely a renamed cell module. A zero Hecke cell-form quotient is not asserted to be its actual module head. No semisimplicity or choice principle is assumed, and n=0 is included.

Facts & Assumptions

Given: The field, parameter, stable range and modules in the Statement; all modules are right modules and multiplication in S=End⁡H(M) is ordinary composition (fg)(x)=f(g(x)).

[F1]

The actual projection e onto Mω=H, for ω=(1n,0d−n), satisfies e2=e and eSe≅H by left multiplication ρ(h)(a)=ha. The functor is X↦Xe (The Schur idempotent and the Schur functor for type-A q-Schur algebras).

[F2]

The legitimate semistandard cellular construction is supported from Mtype⁡(T) to Mtype⁡(S) and sends its generating mtype⁡(T)h to mSTh; its star swaps S,T and its right-cell coefficients fix the first index modulo higher shapes. The Weyl cell basis is (wT)T (The type-A q-Schur algebra and its Weyl modules). Only the actual summand projections are weight idempotents; no assertion that all diagonal cellular elements are idempotent is used.

[F3]

The independent Murphy cellular datum uses mst=Td(s)∗xλTd(t), with its higher ideal I⊳λ, right cell basis (ct)t and form Gλ characterized by masmtb≡Gλ(cs,ct)mab modulo that ideal (The Murphy cellular basis, the cell law and the Murphy form).

[F4]

The nonzero cell-form quotients are pairwise distinct absolutely irreducible modules; when the form is not identically zero its radical is the unique maximal submodule. These are the general cellular conclusions of Nonzero cell heads classify the simple modules of a cellular algebra.

[F5]

The genuine ordinary bridge gives P(α)≅CM(α′)θ and an explicit unit-scaled form identity, hence DDJ(α)≅DM(α′)θ including zero quotients. This is the page's signed Specht normalization, and θ is an involutive algebra automorphism whose pullback is exact (Ordinary Specht modules are the signed conjugate Murphy cells, The type-A Hecke Specht module and its cell form).

[F6]

The full type-A classifier proves that DM(ν) is nonzero precisely for eq-restricted ν over the original field, including the finite-eq range and the empty partition; its ordinary-label statement is transported through the signed-conjugate form bridge, not inferred from a group-only specialization (The simple type-A Hecke modules are indexed by e-regular partitions, e-regular and e-restricted partitions).

Proof

technique · direct
1.1givenF1algebra

Under [F1], ρ(h)ρ(k)=ρ(hk) because both act on H by left multiplication, so the identification uses H, without an opposite algebra. The functor X↦Xe is exact: for a short exact sequence, a lift x of an element y∈X′′e yields the lift xe, and an element in the kernel lies in X′ and is fixed by e, hence lies in X′e. The tensor description uses the (S,eSe)-bimodule Se, which is a direct summand as a left S-module.

2.1F1F2F3step 1.1constructalgebra

The support in [F2] gives eφSTe=δtype⁡(S),ωδtype⁡(T),ωφST and wTe=δtype⁡(T),ωwT. Semistandard tableaux of type ω have each label once and are exactly standard tableaux. For standard s,t, their defining sum mst has one term, so φst∣H(a)=msta and ρ−1(φst)=mst. Thus the higher Schur ideal cuts out exactly I⊳λ in the corner. Read the Schur right-cell law with first index any standard tableau of type ω; coefficient independence permits this choice. Restricting the multiplication by ρ(h) to H gives msth, so its coefficients are the Murphy right-cell coefficients. Consequently Ψλ:Wλe→CM(λ), wt↦ct, is an H-isomorphism.

3.1F2F3step 2.1algebra

By the Schur cell product, φasφtb≡Bλ(ws,wt)φab modulo higher Schur shapes, with coefficient independent of the outer indices. Choose all four indices standard of shape λ and type ω. They lie in eSe; applying ρ−1, or evaluating their endomorphisms at 1∈H, gives masmtb≡Bλ(ws,wt)mab modulo I⊳λ. The unique coefficient in [F3] is Gλ(cs,ct), proving Bλ∣Wλe=Ψλ∗Gλ exactly, with factor 1.

4.1F2step 3.1algebra

Since e∗=e, contravariance gives Bλ(xe,y(1−e))=Bλ(x,y(1−e)e)=0. The decomposition Wλ=Wλe⊕Wλ(1−e) is therefore orthogonal. A vector in Wλe pairs trivially with its complement, so it is in the restricted form radical exactly when it lies in rad⁡formWλ. Since the latter is an S-submodule, rad⁡form(Wλe)=(rad⁡formWλ)e. This holds even if the corner form is identically zero.

5.1F2F4step 1.1step 2.1step 3.1step 4.1algebra

For the canonical semistandard tableau Tλ of shape and type λ, the map φTλ,Tλ is the actual projection onto Mλ: it sends mλh to itself and is zero on every other summand. Its square equals itself, so the Schur cell product gives Bλ(wTλ,wTλ)=1. Hence the Weyl form quotient is nonzero and is its simple head Lλ by [F4]. Exactness, step 4.1 and step 3.1 give Lλe≅Wλe/(rad⁡formWλ)e≅CM(λ)/rad⁡formCM(λ)=DM(λ), including when this corner quotient is zero.

6.1F4F6step 1.1step 2.1step 5.1algebra

By [F6] and step 5.1, Lλe≠0 precisely for eq-restricted λ. Apply the exact functor to a finite composition series of Wλ: every factor Lν gives DM(ν) or zero. Delete repeated terms. The remaining factors are the distinct nonzero Murphy simples in [F4], giving [Wλ:Lν]=[CM(λ):DM(ν)] for each eq-restricted ν. No multiplicity preservation is asserted for a killed simple label.

7.1F4F5F6step 2.1step 5.1step 6.1algebra∎

Apply [F5] and the involution θ to obtain CM(λ′)≅(Sλ)θ and DM(λ′)≅(Dλ)θ. Replacing the Weyl label by λ′ in steps 2.1 and 5.1 gives the ordinary dictionary, including zero quotients. Conjugation makes λ′ restricted precisely when λ is regular. Twisting both modules by the same exact equivalence preserves composition multiplicities, so step 6.1 gives [Wλ′:Lν′]=[Sλ:Dν] for regular ν. The genuine unit-scaled ordinary form bridge in [F5] also identifies these with the historical DJ polytabloid modules and quotients. At n=0, e=1 and each form has value 1, so the same proof includes the empty partition.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The q-Schur Weyl weight-space Gram determinant is a hook product

Statement

Let R be an integral domain, q∈R×, d,n≥1, and let Wλ be the Weyl module of S(d,n) for a partition λ⊢n with at most d parts. For a composition μ of n of length d, let Gμλ be the Gram determinant of its μ-weight space in the semistandard basis (The type-A q-Schur algebra and its Weyl modules). Put βj=λj′+n−j and hab=λa−b+λb′−a+1. Then Gμλ=qN∏(a,b),(a,c)∈[λ]b<c([hab]q[hac]q)dμ(β+haceb−hacec), where N=∑T∈T0(λ,μ)ℓ(d(last⁡(T))). Here last⁡(T) is the least-dominant standardization in the fiber of T, and dμ is the exact alternating semistandard number of Virtual Weyl and Specht symbols attached to beta sequences. Both beta shifts use the same removed hook length hac.

The exponent is the sorting sign times ∣T0(η,μ)∣ if that balanced beta sequence has distinct nonnegative entries and recovers η; it is zero otherwise. When the shifted entries are distinct and nonnegative, equivalently lower the bead βc to βc−hac and sort to obtain the partition κ=λ∖Rac; then raise the bead originally labelled b from βb to βb+hac and sort to obtain η. The added strip η/κ has hac boxes. Its lowest node is in the column determined by the raised bead's new sorted position, which need not be b. The sign is the parity of the heights of the removed strip and the newly added strip, the latter measured in the new diagram η; it is not generally the sum of two old λ hook legs (Removable border strips and their height, Hooks of a partition correspond bijectively to removable border strips).

Form the product first in the universal field Q(Q). It equals a Laurent polynomial in Z[Q,Q−1], namely the universal integral Gram determinant divided by its displayed unit QN. Over R the formula means the specialization of that Laurent polynomial. It does not require inverting a vanishing hook number or evaluating 0/0. All weights and d<n are retained; an empty weight space has determinant 1.

Facts & Assumptions

Given: The normalized semistandard maps, weight projections and Weyl cell form of the q-Schur Definition; the beta symbols and branching identity; and the hook-to-bead-gap correspondence in the cited suppliers.

[F1]

The ordinary cell maps have the normalization φST(mνh)=mSTh, with mST=∑μ(s)=S,ν(t)=Tmst. Their star swaps the indices, and their four-index cell product defines the Weyl form (The type-A q-Schur algebra and its Weyl modules). The actual regular corner identifies this product with the Murphy product with factor 1 (The Schur functor sends Weyl and simple modules to Specht and Hecke simple modules).

[F2]

Over K=Q(Q), the corrected intrinsic Murphy seminormal basis has its unitriangular normalization, adjacent-generator action and self-adjoint JM operators (Separated Hecke residues give seminormal idempotents and bases). For a semistandard T and node (i,j) of entry v, its predecessor set is precisely ΓT(i,j)={(k,l):l<j, T(k,l)<v, T(k′,l)>v for every k′>k}. Equivalently T(k,l)<v<T(k+1,l) with sentinel +∞ below the column. Both inequalities are strict; an equal v below excludes that column. Define γT:=∏(i,j)∏(k,l)∈ΓT(i,j)[j−i+k−l+1]Q[j−i+k−l]Q. The standard-tableau version is defined by the same rule.

[F3]

The signed Kostka numbers satisfy dμ(a)=∑∣C∣=zdμˉ(a−1C), with zero values for repeated or negative beta entries (Virtual Weyl and Specht symbols attached to beta sequences).

Proof

technique · direct
1.1givenF1

Preserve small alphabets. Enlarge to D=max⁡(d,n) temporarily. The sum of permutation summands with types supported on the first d letters is a literal summand of the D-alphabet permutation module, with projection p and pS(D,n)p=S(d,n). The normalized maps whose two types have that support, their cell multiplication and their Weyl form coefficients are unchanged. Every semistandard shape with these types has at most d rows. Thus proving the weight norm in the enlarged algebra, where the regular corner exists, proves the original norm as well. No hypothesis d≥n is added.

1.2F1F2

Compute the standard norms. For the canonical standard tableau, γtλ telescopes rowwise to [λ]!Q, also its norm by xλ2=[λ]!Qxλ. If s dominates t=s(i,i+1), the adjacent action gives ft=fs(Ti+α) with α=1/[ρ]Q. Contravariance, orthogonality and the quadratic relation imply ⟨ft,ft⟩=(Q+α)(1−α)⟨fs,fs⟩. The two swapped predecessor ratios give γt=Q−1(Q+α)(1−α)γs: use [ρ+1]=1+Q[ρ] and [ρ−1]=Q−1([ρ]−1). Increasing-length adjacent swaps of incomparable boxes reach every standard tableau, so ⟨ft,ft⟩=Qℓ(d(t))γt.

2.1F1step 1.1construct

Define the cross-weight maps. In the enlarged algebra of step 1.1 let ω=(1n,0D−n), so Mω=H. Let aμ:Mμ→H be inclusion, aμ(mμh)=mμh, and let bμ:H→Mμ be bμ(h)=mμh; both are zero on the other permutation summands. These are actual H-linear maps, not maps depending on an unspecified T. Under the Hom/intersection coordinate identification of the q-Schur construction, both maps have image coordinate mμ. Since mμ∗=mμ, the index-swapping star in [F1] gives aμ∗=bμ; this works for compositions as well as partitions. For a standard s, composition of its Weyl map with aμ evaluates at mμ as msmμ, whereas composition of a type-μ Weyl map with bμ evaluates at 1 as mT. We use right-action composition throughout.

3.1F1F2step 2.1algebra

Establish the support and the initial scalar. Write ms=mλTd(s) in the Murphy cell. For s=first⁡(T), d(s) is the least-length double-coset representative for the row blocks of λ and μ. The intersection subgroup has one symmetric-group factor of size civ=∣{(i,j):T(i,j)=v}∣ for every nonempty row/label intersection. Decomposing both row subgroups into their distinguished intersection cosets, every reduced coset word occurs once; the remaining intersection sum acts on mλ by its row character Qℓ(w). Hence the exact identity is msmμ=(∏i,v[civ]!Q)mT. No factorial is divided out. The same-entry predecessor ratios for this first refinement are [2]/[1],[3]/[2],…,[civ]/[civ−1] within each intersection row, so their product πs is exactly that factorial. We also need support after multiplication by mμ. Filter standard Murphy vectors by the shapes of their prefixes at the ends of the μ label blocks. Every generator Ti inside such a block preserves this filtration: its row case is multiplication by Q; its standard-swap terms have the same block-end prefixes; in its column case the Garnir correction terms have larger tableau-prefix dominance. The last assertion follows by isolating the distinguished term in the length-additive row-coset Garnir identity; all other same-shape terms increase prefix dominance, as proved in Type-A Hecke permutation modules: semistandard Murphy bases and Specht filtrations. Iterating over each word in mμ shows that mvmμ has only coarsened types dominating μ(v). Its expansion has constant coefficients on semistandard fibers and zero coefficients elsewhere, by the right-hand (starred) permutation-module basis in that supplier. Thus only semistandard U⊵μ(v) occur, strictly if μ(v) is not semistandard. In particular, if v▹first⁡(T), every surviving U is strictly above T: equality would put v in the fiber of T, whose most dominant member is first⁡(T). This proves the needed support assertion including non-semistandard types.

4.1F1F2step 3.1algebra

Determine the scalar on every standardization. Sums of JM elements over a label block commute with that block's row symmetrizer: the adjacent JM relation makes Li+Li+1 commute with Ti, and every other Lj commutes with it. The dominance-triangular standard JM action and the support filtration of step 3.1 consequently give triangular block-sum operators on the semistandard maps, with diagonal entries ∑T(i,j)=v[j−i]Q. Their joint eigenvalues distinguish T: the Laurent coefficients and the known prefix sizes recover every initial-label content multiset, whose diagonal counts recover its Young diagram. They are self-adjoint, so finite triangular diagonalization gives orthogonal ψT=φT+ strictly more dominant terms. The same block-sum identities show that ftaμ lies in the T joint eigenspace whenever μ(t)=T, hence equals rtψT. At s=first⁡(T), expand fs=ms+ more dominant standard vectors. Step 3.1 gives coefficient πs at φT and only higher types in the remaining terms. Thus rs=πs. Now connect standardizations of T by increasing-length adjacent swaps inside each label block; these are the linear extensions of the repeated-label node posets, and bubble sorting gives such a chain from their most dominant extension. If t=s(i,i+1) is one step, [F2] gives ft=fs(Ti+α), α=1/[ρ]Q, while Tiaμ=Qaμ because Timμ=Qmμ. Therefore rt=(Q+α)rs. The only newly included same-entry predecessor pair has content difference ρ, so its ratio is [ρ+1]Q/[ρ]Q=Q+α, proving πt=(Q+α)πs. Induction proves the exact identity ftaμ=πtψT for every standardization.

5.1F1F2step 1.2step 2.1step 4.1

Determine the last-standardization coefficient and the norm. For t=last⁡(T), evaluation at 1 gives φTbμ=mT=∑μ(v)=Tmv. Every other member of this fiber is more dominant than t. Also every refinement of U▹T dominates t: compare at label-block ends, then use that t is the least-dominant refinement within its own blocks. Consequently the two unitriangular basis changes give ψTbμ=ft+ more dominant standard eigenvectors, with coefficient exactly 1 at ft. At this last refinement the standard predecessor set partitions into the strict semistandard boundary ΓT and same-entry predecessors, so γt=πtγT. By adjointness of the explicit maps in step 2.1 and orthogonality, πt⟨ψT,ψT⟩=⟨ftaμ,ψT⟩=⟨ft,ψTbμ⟩=Qℓ(d(t))γt. All factors of πt are nonzero over K, so ⟨ψT,ψT⟩=Qℓ(d(t))γT. The transition determinant is 1, yielding Gμλ=QNgμλ with gμλ=∏TγT. This calculates the cross-weight scalar rather than inferring it from the standard norm alone.

6.1F2F3step 5.1

Prove the normalized beta product at the level of formal exponents. For h≥1 put Ah(β,μ)=−∑b≠c, βb−h<βcdμ(β−heb+hec). A nonzero term requires 0≤βb−h, so the product is finite. Repeated beta entries cancel by exchanging the equal indices; a negative entry cannot become a valid term because, if it is the receiver, the lowered donor is still smaller. Thus these invalid sequences contribute zero exponents. Delete the largest semistandard label, occurring z times in column feet C, to get β−1C,μˉ. The strict predecessor boundary excludes every column also in C. Consequently the literal exponent Eh in g obeys Eh(β,μ)=∑∣C∣=zEh(β−1C,μˉ)+∑∣C∣=z∑b∉C,c∈C(1βb−βc+1=h−1βb−βc=h)dμˉ(β−1C). The final sum is exactly the axial ratio contributed by each deleted largest-label box.

7.1F3step 6.1

Verify the same recurrence for Ah. Apply [F3] to its summands and compare with ∑CAh(β−1C,μˉ). Set δ=βb−βc−h. The original condition is δ<0 and the deleted one δ−1C(b)+1C(c)<0. They differ only when b∈C,c∉C,δ=0 or b∉C,c∈C,δ=−1. In the first case, exchanging the two shifted beta entries turns the contribution into −dμˉ(β−1C′) with C′=C−b+c, giving the negative term of step 6.1. In the second case, the exchanged entries give +dμˉ(β−1C), giving its positive term. Every other case cancels. At degree 0 both exponent families vanish: a nonzero shifted empty beta sequence would have to exchange two entries with h=βb−βc, excluded by the strict condition. Induction gives Eh=Ah and therefore gμλ=∏h≥1∏b≠c, βb−h<βc[h]Q−dμ(β−heb+hec). This proves the regrouping without copying the inconsistent signs in the printed display.

8.1givenF3step 7.1

Convert to hooks. A surviving lowered bead βb−h is a nonnegative gap, so the bead-gap correspondence makes h=hab for a node (a,b). The remaining condition βc>βb−hab=n−1−λa+a is equivalent to c≤λa; the paired nodes therefore lie in the same row. For b<c write h=hab and k=hac. Since h−k=βb−βc, the two ordered displaced sequences β−heb+hec and β−kec+keb exchange their two changed entries. Their signed numbers are negatives of each other, and their factors are exactly ([h]Q/[k]Q)dμ(β+keb−kec). This proves the stated balanced hook product. For the strip interpretation, first lower βc to the gap g=βc−k=n−1−λa+a, whose sorted position is r≥c. Recovering conjugate parts from the sorted sequence replaces λj′ by λj+1′−1 for c≤j<r and by g−n+r for j=r, leaving other columns unchanged. The removed nodes form the rim strip Rac in columns c,…,r, with k boxes. Since b<c, its original bead βb is unaffected and is still in position b in this intermediate diagram κ. Raising it to βb+k and sorting puts it in position s≤b; applying the same column calculation in reverse shows that η/κ is a k-strip in columns s,…,b, with lowest node in column s. The two sorting permutations make r−c and b−s crossings. The strip-height counting identity gives heights k−1−(r−c) and k−1−(b−s), so their sum has the same parity as the total crossings and gives exactly the stated sign. Colliding or negative sequences vanish by definition.

9.1givenstep 5.1step 7.1step 8.1∎

Specialize integrally. The semistandard form matrix has entries in Z[Q,Q−1], so its determinant and Q−NGμλ are Laurent polynomials. Steps 5.1 and 7.1 identify the rational products with these same polynomials in Q(Q). Base change of the free semistandard basis and its form now proves the identity over the given domain, including singular specializations and weights of dimension zero. No individual vanishing ratio is evaluated. All constructions are finite; no choice principle is used.

TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

The q-Schaper virtual radical-layer formula

Statement

Let R be a principal ideal domain, π a prime element, F=R/πR the residue field, and let q^∈R× satisfy [n]!q^≠0 in R; put q:=q^+πR∈F×. Let d≥1, let λ be a partition of n with at most d parts, and let WFλ be the Weyl module of the q-Schur algebra SF(d,n)=S(d,n)⊗RF with its Jantzen filtration WFλ(i) with respect to (R,π) (The Jantzen filtration of a lifted cell module, The type-A q-Schur algebra and its Weyl modules).

  1. (Jantzen sum formula) In the Grothendieck group of finite-dimensional SF(d,n)-modules, ∑i>0[WFλ(i)]=∑(a,b),(a,c)∈[λ]b<c(νπ([habλ]q^)−νπ([hacλ]q^))[WF(β1,…,βb+hacλ,…,βc−hacλ,…,βn)], where β=β(λ) is the beta sequence of λ, habλ are its hook lengths and the symbols are the virtual Weyl symbols of Virtual Weyl and Specht symbols attached to beta sequences. 2. (q-Schaper, d≥n) If d≥n and Π denotes the Schur functor of The Schur idempotent and the Schur functor for type-A q-Schur algebras, then applying Π to (1) gives the corresponding identity for the Hecke Specht modules in the source's normalisation, that is, for the Murphy cell modules Π(WFλ)=SMλ of The type-A Hecke Specht module and its cell form (the Dipper-James form is obtained by conjugating partitions and applying the same θ pullback to every Hecke module), ∑i>0[SFλ(i)]=∑(a,b),(a,c)∈[λ]b<c(νπ([habλ]q^)−νπ([hacλ]q^))[SF(β1,…,βb+hacλ,…,βc−hacλ,…,βn)] in the Grothendieck group of finite-dimensional HF,q(Sn)-modules, with the virtual Specht symbols of Virtual Weyl and Specht symbols attached to beta sequences. The formula is a positive filtration-sum identity expressed in a signed Weyl/Specht basis. A single nonzero signed Weyl coefficient does not force the corresponding labelled simple factor: the entire right side must first be expanded and cancelled in simple classes. For a Weyl module and an off-head label ν, the resulting multiplicity of Lν is an upper bound for [Wλ:Lν], and is positive exactly when that factor occurs in the radical. This does not give a general closed algorithm for decomposition numbers.

Facts & Assumptions

Given: A PID R with prime π, residue field F, q^∈R× with [n]!q^≠0, the q-Schur algebra SF(d,n) and its Weyl modules with Jantzen filtrations (The Jantzen filtration of a lifted cell module, The type-A q-Schur algebra and its Weyl modules), and the virtual Weyl and Specht symbols (Virtual Weyl and Specht symbols attached to beta sequences).

[F1]

(The q-Schur Weyl weight-space Gram determinant is a hook product) The Gram determinant of Wλ on its ν-weight space equals qN times the hook-ratio product ∏(a,b),(a,c)∈[λ],b<c([habλ]q^/[hacλ]q^)dμ(… ); under [n]!q^≠0 every factor is nonzero in the domain R.

[F2]

(Jantzen layer dimensions sum to the Gram determinant valuation) The total dimension of the positive Jantzen layers on a non-degenerate form equals the π-adic valuation of its Gram determinant.

[F3]

(Semistandard weight dimensions detect virtual Weyl classes) Equality of all semistandard weight-space dimensions forces equality in the Grothendieck group of SF(d,n)-modules.

[F4]

The balanced displacement removes the hac-strip and adds the same number of boxes, preserving degree; its sign is the beta sorting sign (Removable border strips and their height, Hooks of a partition correspond bijectively to removable border strips).

[F5]

The exact Schur functor has integral corner isomorphism and exact restricted form factor 1, with e∗=e (The Schur idempotent and the Schur functor for type-A q-Schur algebras, The Schur functor sends Weyl and simple modules to Specht and Hecke simple modules). Filtration transport is proved below, rather than assumed from exactness.

[F6]

Source results (Mathas, Theorem 5.31 and Corollary 5.32, printed pp. 58-60): the Jantzen sum formula for the q-Schur algebra and its transport to the Hecke side, with the coefficient νπ([habλ]q^)−νπ([hacλ]q^) and the virtual symbols.

Proof

technique · direct
1.1givenF1F2F4

Work on a fixed weight space of the lifted free Weyl module. Every hook quantum integer is nonzero because its index is at most n and [n]!q^≠0 in the domain. The balanced Gram formula [F1] gives its determinant, and the unit power of q^ has valuation zero. The Jantzen Gram-valuation lemma [F2] thus gives the sum of positive filtration-submodule dimensions as ∑(a,b),(a,c), b<c(νπ([hab]q^)−νπ([hac]q^))dμ(β+haceb−hacec). The signed number is exactly the weight dimension of the corresponding balanced virtual Weyl symbol, including zero and cutoff cases.

2.1F3step 1.1

Apply step 1.1 to every weight. The Weyl weight-character matrix is unitriangular, so [F3] detects equality of Grothendieck classes and proves part 1. These are classes of the filtration submodules WFλ(i), not their successive quotients and not simply the radical class.

3.1F5step 2.1

Establish filtration transport before applying the exact functor. On the lifted Weyl module W, the identity e∗=e makes We⊥W(1−e). For x∈We and every i≥0, pairing x with all of W is divisible by πi exactly when its pairing with We is. Thus W(i)e=(We)(i). Reducing modulo π commutes with the direct summand projection, giving WF(i)e=(We)F(i). The actual corner isomorphism and factor-1 form identity [F5] identify the latter with the Murphy Specht filtration. Applying the exact functor to the proved Weyl-class identity therefore transports each submodule and every signed term, proving part 2 even when a reduced cell form is identically zero. For the ordinary convention, apply the same θ to both modules and conjugate the labels; the independently proved Laurent-unit form factor preserves these divisibility filtrations as well.

4.1F4step 1.1step 2.1step 3.1∎

Explain the valid multiplicity information. The Weyl form has nonzero simple head, WF(1)=rad⁡WF, and WF(i)⊆rad⁡WF for i>0. Consequently for ν≠λ its actual multiplicity in WF is its radical multiplicity, bounded above by its multiplicity in the whole positive sum. This whole-sum multiplicity is positive if and only if that factor occurs in the radical, since the first submodule is the radical and later ones lie inside it. No such conclusion is drawn from an individual positive or negative Weyl coefficient before cancellation. All claims follow from steps 1.1-3.1 and this submodule inclusion.

RemarkRemark: AI-adaptedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

General type-A decomposition numbers remain unsolved

Statement

The two preceding constraints on the decomposition matrix of HF,q(Sn) are real but limited, and neither solves the general problem.

(i) Dominance unitriangularity (The type-A Hecke decomposition matrix is dominance unitriangular) determines only the diagonal entries dμμ=1 and the vanishing region dλμ≠0⇒μ⊵λ; it gives no value for an off-diagonal entry.

(ii) The q-Schaper/Jantzen sum formula (The q-Schaper virtual radical-layer formula) is an identity for the sum of the positive Jantzen filtration submodules. Its individual signed hook terms are not multiplicity bounds. After the whole virtual sum is expanded in simple classes and all cancellations are performed, its nonnegative simple coefficients bound the corresponding radical composition multiplicities from above; it neither determines a general multiplicity nor produces a positive combinatorial rule.

Special coefficient regimes and low-rank calculations determine additional entries (canonically based, weight-one, and small-n cases), and the classification of irreducible Specht modules for symmetric groups in prime characteristic is known (Fayers, Introduction, printed p. 2 of the cited 2012 paper). That classification is distinct from computing all composition multiplicities. No general closed formula for the decomposition numbers of Sn in a fixed positive characteristic is claimed anywhere on this page. This remark records the boundary; it carries no proof obligation and no choice principle.

Remarks

The two cited results are the constraints proved on this page: unitriangularity is a vanishing statement about the dominance order, and the q-Schaper formula expresses the sum of the positive Jantzen filtration submodules as a virtual combination of Weyl symbols whose coefficients are π-adic valuations of hook q-integers. Neither statement computes an individual off-diagonal decomposition number in general, and the remark is not used as a supplier to prove any replacement claim.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Central Hecke Jucys–Murphy scalars separate q-Schur residue contents

Statement

Let R be a commutative unital ring, q∈R×, H=HR,q(Sn), M=⨁α∈Λ(d,n)Mα and S=End⁡H(M). For a symmetric polynomial f over R, put zf=f(L1,…,Ln) for the additive Hecke Jucys–Murphy elements. Right multiplication ρzf:m↦mzf is a central element of S. On the right Weyl cell Wλ it acts by

aλ(f)=f([c(A)]q:A∈[λ]),c(r,s)=s−r.

The identity holds over every R and unit q, without division by a quantum integer or a Gram determinant. In particular, if R=F is a field of finite quantum characteristic e≥2 and Lμ is a constituent of Wλ, then λ and μ have the same multiset of residues c(A) mod e. Neither partition is required to be restricted or to survive the Hecke corner. This proves a necessary content-separation condition, not an assertion that equal content is sufficient for common-block membership.

Facts & Assumptions

Given: The ring, parameter, ranks, right permutation modules and Schur algebra of the Statement.

[F1]

The integral Murphy cells CM(λ) have free standard basis mt, dominance ideals I⊳λ, a symmetric cell form Gλ, and cell-layer multiplication X⋅Y=XGλY. The standard trace satisfies τ(Tu∗Tv)=δuvqℓ(u) (The Murphy cellular basis, the cell law and the Murphy form).

[F2]

The additive Lk commute, symmetric polynomial evaluations are central, and their matrices in every Murphy cell have diagonal entries [ct(k)]q and strictly dominant off-diagonal terms (The Hecke Jucys-Murphy action is dominance triangular).

[F3]

The actual Schur maps are φST(mνh)=mSTh, supported on the indicated source and target types, with mST the unweighted standard-tableau fibre sum. They form the cellular basis and Wλ has basis wT=φTλT+S⊳λ, where Tλ has shape and type λ and its refinement is tλ. All Weyl forms have canonical norm one, hence their simple form quotients Lλ are nonzero over every field (The type-A q-Schur algebra and its Weyl modules).

[F4]

A finite-dimensional algebra has nilpotent Jacobson radical; its semisimple quotient is a product of matrix algebras over division rings. Ideals and ideal quotients of a semisimple algebra are semisimple and have no nonzero nilpotent two-sided ideal (For a finite-dimensional algebra, the Jacobson radical is nilpotent and the quotient by it is semisimple, Wedderburn–Artin theorem for semisimple rings).

[F5]

Finite quantum characteristic e is the characteristic of F when q=1, and the order of q when q≠1. The extended quantum integers are [c]q=(qc−1)/(q−1) when q≠1, and [c]1=c (The quantum characteristic of an invertible Hecke parameter).

Proof

technique · direct
1.1F1F4algebra

Work first over A=Z[u,u−1] with fraction field K=Q(u). The regular trace pairing (a,b)↦Tr⁡(ℓab) has entries in A in the standard Hecke basis. At u=1 its matrix is n! δv,w−1, so its determinant is nonzero and it is nondegenerate over K. If a belongs to the Jacobson radical, ab is nilpotent for every b by [F4]; its left multiplication is nilpotent and has trace zero. Nondegeneracy forces the radical to vanish. Thus HK is semisimple. Its shape-λ cell layer has the multiplication XGλY of [F1]. If Gλ were singular, the nonzero subspace {X:GλX=0} would be a two-sided ideal with square zero, contradicting [F4]. Hence Gλ is invertible and X↦GλX identifies this layer with a full matrix algebra over K.

1.2F1F3algebraconstruct

Construct an injective right S-module map j:Wλ→Hom⁡H(M,CM(λ)). Project the output of φTλT:M→Mλ through π:Mλ→CM(λ)=Mλ/(Mλ∩I⊳λ). For T of type ν, the resulting map is zero on the other summands and sends mν to mT=∑t:ν(t)=Tmt. Higher Schur maps with output type λ have Hecke values of strictly dominant shape, so their output is killed by π. Thus this assignment respects the cell quotient and multiplication by any s∈S becomes composition on the right: j(ws)=j(w)∘s. For each fixed type the sets of standard t with ν(t)=T are disjoint. Each is nonempty: standardize equal entries of a semistandard tableau in increasing column order; equal entries cannot share a column, row order is retained, and different entries occupy disjoint consecutive label blocks. Hence their sums mT are independent in the free Murphy cell basis, over every R. This proves injectivity, including zero type entries. No surjectivity onto all specialized Hom spaces is asserted.

2.1F1F2step 1.1algebra

For an integral symmetric polynomial f, zf is central by [F2]. Its action on the generic cell layer is a bimodule endomorphism of that full matrix algebra, hence scalar: its value at the identity commutes with every matrix and the rest follows by multiplication. Accordingly its matrix on CM(λ)K is scalar. The triangular matrices in [F2] give its diagonal as f([ct(1)]u,…,[ct(n)]u), equal to aλ(f) for every t because f is symmetric and the node multiset is fixed. Thus zf acts exactly by this scalar. Both sides have matrices over A, and injection into K proves the identity before specialization. Every symmetric polynomial over an arbitrary R is an R-linear combination of integral monomial symmetric polynomials: coefficients are constant on each monomial orbit. Apply the integral identities to these monomial polynomials and specialize u↦q. Therefore every zf acts by aλ(f) on the actual Murphy cell over R, including singular parameters.

3.1F2F3step 2.1step 1.2algebra

For central zf∈H, right multiplication preserves every Mα and is H-linear. Every H-linear endomorphism s of M satisfies s(mzf)=s(m)zf, so ρzf is central in S. For w∈Wλ and m∈M, step 1.2 and H-linearity give j(wρzf)(m)=j(w)(mzf)=j(w)(m)zf=aλ(f)j(w)(m), the last equality by step 2.1. Injectivity gives wρzf=aλ(f)w, proving the full ring-level assertion. If M=0 all cell assertions are empty. At rank zero the empty cell is R with the empty polynomial evaluation, so the same conclusion holds.

4.1F3F5step 3.1algebra∎

Suppose now that R=F and Lμ is a constituent of Wλ. Step 3.1 gives scalar aλ(f) on this constituent. Since Lμ is the nonzero quotient of Wμ by [F3], its scalar is also aμ(f); hence they agree for every symmetric f. Taking all elementary symmetric polynomials gives ∏A∈[λ](X−[c(A)]q)=∏B∈[μ](X−[c(B)]q). By [F5], if q=1 the distinct e residues are the distinct prime-field values [c]1; if q≠1, [a]q=[b]q is equivalent to qa=qb, hence to a≡b(mode). Unique factorization of these monic products into distinct field-linear factors therefore gives equality of every residue multiplicity, also when the field characteristic divides a multiplicity. There is no restriction on either label's Hecke-corner image, and no splitting extension, Gram division or choice principle enters the argument.

Remarks

The map in step 1.2 is intentionally only an injection. At H2 with q=−1, the sign Murphy cell of shape (1,1) and the permutation module of type (2) both have T1 acting by −1, so their Hom space has dimension one, while the corresponding Weyl weight has Kostka number zero. An unrestricted singular-parameter full-Hom identification would therefore add a nonexistent Weyl weight. The central scalar proof needs none of that surjectivity.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

The type-A quantum algebra and its tensor-action formulas

Definition

Let F=Q(q) with q an indeterminate, let N≥1, and put Ki=LiLi+1−1 for 1≤i<N. Start with the free associative F-algebra on Lj,Lj−1 (1≤j≤N) and Ei,Fi (1≤i<N), and quotient by the two-sided ideal generated by the following relations:

  1. LjLj−1=Lj−1Lj=1 and LjLk=LkLj for all j,k.
  2. LjEiLj−1=qδj,i−δj,i+1Ei and LjFiLj−1=q−δj,i+δj,i+1Fi.
  3. [Ei,Fj]=δij(Ki−Ki−1)/(q−q−1).
  4. [Ei,Ej]=[Fi,Fj]=0 when ∣i−j∣>1.
  5. For ∣i−j∣=1, Ei2Ej−(q+q−1)EiEjEi+EjEi2=0 and Fi2Fj−(q+q−1)FiFjFi+FjFi2=0.

Here [x,y]=xy−yx. The free algebra and quotient construction are those of The free associative R-algebra on a set and descent of relations; this definition asserts existence of the presented associative algebra, not the well-definedness of structural maps on its quotient.

On VN with ordered basis e1,…,eN, prescribe the candidate matrices Ljea=qδjaea,Eiea=δa,i+1ei,Fiea=δa,iei+1. Prescribe candidate coproduct and counit values by Δ(Lj)=Lj⊗Lj,Δ(Ei)=Ei⊗Ki+1⊗Ei,Δ(Fi)=Fi⊗1+Ki−1⊗Fi, and ϵ(Lj±1)=1, ϵ(Ei)=ϵ(Fi)=0. The following relation-descent lemma proves that these assignments define the vector representation and bialgebra structure, and hence the tensor actions used below.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

The type-A quantum presentation descends to its coproduct tensor action

Statement

For the presented algebra UN and candidate assignments in The type-A quantum algebra and its tensor-action formulas, the matrices on VN satisfy every defining relation. The coproduct assignments descend to a coassociative algebra homomorphism Δ:UN→UN⊗FUN and the counit assignments descend to an algebra homomorphism ϵ:UN→F satisfying both counit identities. Consequently every tensor power VN⊗n has the action obtained by iterating Δ; all its generator matrices have entries in Z[q,q−1].

Facts & Assumptions

Given: F=Q(q), N≥1, the algebra presentation and candidate maps in The type-A quantum algebra and its tensor-action formulas.

[F1]

A free associative algebra modulo the two-sided ideal of its displayed relations is a presented algebra, and assignments descend exactly when they annihilate every defining relation (The free associative R-algebra on a set and descent of relations).

[F2]

The tensor product of algebras has multiplication (a⊗b)(c⊗d)=ac⊗bd, and maps agreeing on the displayed generators agree on the presented algebra (The tensor product of R-algebras has multiplication (a⊗b)(a′⊗b′)=aa′⊗bb′, Presentation base change and transport of explicit bases to commutative specializations).

[F3]

For aij=2δij−δi,j+1−δi+1,j, the defining L-weight relations imply KiEjKi−1=qaijEj and KiFjKi−1=q−aijFj; in particular aij=aji, aii=2, and aij=−1 for adjacent indices.

[F4]

The associator α((a⊗b)⊗c)=a⊗(b⊗c) is natural and satisfies the pentagon and unit triangle (Associator naturality, pentagon, unit triangle and symmetry hexagons on elementary tensors). The unit maps are λ(r⊗a)=ra and ρ(a⊗r)=ar (The regular module is a tensor unit: R⊗RN≅N and M⊗RR≅M). These maps are algebra isomorphisms for the tensor-algebra products, as is checked on elementary tensors using [F2].

Proof

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

1.1givenF1F3algebra

On VN, each Lj is diagonal and invertible, and the Lj commute. Conjugating the matrix unit Ei:ei+1↦ei by Lj multiplies its sole nonzero entry by qδj,i−δj,i+1; conjugating Fi:ei↦ei+1 gives the inverse exponent. Also Ki has eigenvalue q on ei, q−1 on ei+1 and 1 on every other basis vector, so (Ki−Ki−1)/(q−q−1) is the diagonal matrix with entries 1,−1,0 in those positions. Directly, [Ei,Fj]=0 for i≠j and [Ei,Fi] is that diagonal matrix. Products EiEj and EjEi (and the corresponding F products) both vanish when ∣i−j∣>1; Ei2=Fi2=0, and each middle three-letter Serre product also vanishes because its matrix-unit indices do not compose. Thus every defining relation holds, and the quotient universal property [F1] gives the vector representation.

1.2givenF1F2F3algebra

Define Δ on the free generators by the displayed formulas in The type-A quantum algebra and its tensor-action formulas. The Δ(Lj) are mutually commuting units with the displayed inverses. Conjugation by Δ(Lj) gives the required weights on each of the two terms of Δ(Ei) and Δ(Fi), since each Ki is a Laurent monomial in the commuting L's. For any i,j, expansion gives [Δ(Ei),Δ(Fj)]=[Ei,Fj]⊗Ki+Kj−1⊗[Ei,Fj]+[Ei⊗Ki,Kj−1⊗Fj]. The last cross term is zero: its first product can be reordered as qaji−aijKj−1Ei⊗FjKi=Kj−1Ei⊗FjKi, which is its reverse product by [F3]. If i≠j, the remaining terms vanish; if i=j, they sum to (Ki⊗Ki−Ki−1⊗Ki−1)/(q−q−1)=Δ((Ki−Ki−1)/(q−q−1)). For ∣i−j∣>1, aij=0 and the Ki commute with Ej,Fj; expanding the two commutators therefore proves that the distant E and F relations are preserved.

1.3givenF1F2F3algebra

Let γ=q+q−1 and Sij(X,Y)=X2Y−γXYX+YX2 for adjacent i,j. For the E relation write Δ(Es)=As+Bs with As=Es⊗Ks, Bs=1⊗Es. In each of the three words iij,iji,jii, choose an A at each selected position and a B at each other position, then move the selected K factors to the right using KrEs=qarsEsKr. Grouping the resulting 24 terms by the number of selected positions gives: degree 0 in the first factor is 1⊗Sij(Ei,Ej); degree 3 is Sij(Ei,Ej)⊗Ki2Kj; degree 1 has respective coefficients q+q−1−γ, q2+1−γq, 1+q−2−γq−1 on Ei⊗EiEjKi, Ei⊗EjEiKi, Ej⊗Ei2Kj; degree 2 has respective coefficients q−2+1−γq−1, q2+1−γq, q+q−1−γ on Ei2⊗EjKi2, EiEj⊗EiKiKj, EjEi⊗EiKjKi. All six mixed coefficients are zero by the definition of γ, and the two pure terms vanish by the defining Serre relation. Thus Δ preserves every positive Serre relation.

2.1givenF1F2step 1.3algebra

The assignment ϕ(Lj)=Lj−1, ϕ(Ei)=Fi, ϕ(Fi)=Ei preserves the presentation: it exchanges the two weight relations, sends the mixed commutator to its negative with Ki replaced by Ki−1, and exchanges the distant and Serre relations. It is an involution. On generators Δ(Fi)=τ(ϕ⊗ϕ)Δ(Ei), where τ(x⊗y)=y⊗x is an algebra isomorphism. Since step 1.3 proves that the positive Serre polynomial maps to zero, applying the algebra maps τ and ϕ⊗ϕ proves that the negative Serre polynomial maps to zero as well. Together steps 1.2–2.1 show every relation is killed, so [F1] descends Δ to the quotient. The counit assignment kills the relations directly: each relation becomes either 1=1 or 0=0, so it too descends.

3.1givenF1F2F4step 1.1step 2.1algebra∎

Compare α∘(Δ⊗id)∘Δ and (id⊗Δ)∘Δ as maps to UN⊗(UN⊗UN), and compare λ∘(ϵ⊗id)∘Δ and ρ∘(id⊗ϵ)∘Δ with idUN. All these composites are algebra homomorphisms by [F2] and [F4], so it suffices to check generators. The two counit composites return Lj,Ei,Fi. After applying the associator, both iterated coproducts on Lj give Lj⊗Lj⊗Lj; on Ei, both give Ei⊗Ki⊗Ki+1⊗Ei⊗Ki+1⊗1⊗Ei; on Fi, both give Fi⊗1⊗1+Ki−1⊗Fi⊗1+Ki−1⊗Ki−1⊗Fi. Hence Δ is coassociative with counit ϵ. The vector representation of step 1.1 and the iterated coproduct therefore define actions on every VN⊗n. They are finite sums and products of matrices with entries 0,1,q±1, so all entries lie in Z[q,q−1].

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Integral divided-power tensor actions generate the type-A q-Schur algebra

Statement

Put A=Z[v,v−1], q=v2, N≥1, r≥0, V=AN, and T=V⊗r. Let UQ(v)(glN) have the presentation of The type-A quantum algebra and its tensor-action formulas with its indeterminate renamed v and its diagonal generators written Kj. Define UA to be its A-subalgebra generated by Kj±1, Ei(a)=Eia/[a]v!, Fi(a)=Fia/[a]v!, and [Kj;0t]=∏s=1tKjv1−s−Kj−1vs−1vs−v−s(t≥0). Use Kjeb=vδjbeb, Eieb=δb,i+1ei, Fieb=δb,iei+1 and the coproduct Δ(Ei)=1⊗Ei+Ei⊗KiKi+1−1,Δ(Fi)=Ki−1Ki+1⊗Fi+Fi⊗1,Δ(Kj)=Kj⊗Kj. The resulting action preserves T and commutes with the right HA,q(Sr) action e…ab…Ts={ve…ba…a<b,qe…aa…a=b,(q−1)e…ab…+ve…ba…a>b. It gives a surjection ρ:UA⟶End⁡HA,q(Sr)(T)≅SA(N,r) onto the actual permutation-module endomorphism algebra of The type-A q-Schur algebra and its Weyl modules. Its composition-weight projections are 1μ=ρ(∏j=1N[Kj;0μj])(μ∈Λ(N,r)). Every statement survives any homomorphism A→R to a commutative ring, including parameters at arbitrary roots of unity; SA⊗AR is the actual specialized endomorphism algebra. The proof supplies a terminating exact divided-power expression for each integral orbit-basis map, with Laurent-unit pivots.

Let τ be the antiautomorphism Ei↔Fi, Kj↦Kj, let ∗ be the current cellular antiautomorphism of SA, and put C=∑μcμ1μ, cμ=v−∑j(μj2). Then ρ(τ(u))=C−1ρ(u)∗C(u∈UA).

There is also a square-root-free version over B=Z[q,q−1]. On the permutation-module word basis define weight-block operators Ei,a,μ and Fi,a,μ, zero outside content μ, by replacing a subset J of a occurrences of i+1 by i, or of i by i+1, respectively, with coefficients q∑j∈J#i(w>j),q∑j∈J#(i+1)(w<j). Together with 1μ these generate SB(N,r). After q=v2 they are precisely va(μi+1−a)ρ(Ei(a))1μ and va(μi−a)ρ(Fi(a))1μ. Thus this generating assertion holds over every original coefficient ring with any unit q, whether or not q has a square root. This assertion concerns the displayed polynomial action algebra; it does not assert a quantum group presentation over the original ring without choosing v.

Facts & Assumptions

Given: The finite-rank objects and conventions in the Statement. For a word w, let hi(w)=#i(w)−#(i+1)(w) and let inv⁡(w) count pairs of positions with strictly decreasing letters. Composition and matrix indices range over 1,…,N.

[F1]

The generic presentation has the displayed vector representation and coassociative coproduct, by The type-A quantum presentation descends to its coproduct tensor action, under the field isomorphism renaming its indeterminate v. No generic mutual-centralizer theorem is used.

[F2]

The permutation module Mμ=mμH is free on mμTd for distinguished left cosets. Its cyclic presentation is H/∑s∈Sμ(Ts−q)H, with the sum taken over adjacent generators of the row subgroup. The Schur algebra, its semistandard basis, and its involution are the actual endomorphism construction of The type-A q-Schur algebra and its Weyl modules.

[F3]

Quantum binomial coefficients [mt]v for m,t≥0 are Laurent polynomials, equal to zero for t>m and to one for t=m, by The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality.

Proof

1.1givenF1F3algebraconstruct

Integral matrices. Write the iterated coproduct Ei as its sum of single-position raising operators. The summand at position j has coefficient vhi(w>j); the lowering summand has coefficient v−hi(w<j). A position cannot be used twice. For a distinct raising positions, swapping two consecutive choices changes the exponent by 2, since changing i+1 to i increases hi by 2. Summing the orders gives va(a−1)/2[a]v! times the coefficient using the original suffix counts: explicitly ∑π∈Sav2inv⁡(π)=va(a−1)/2[a]v!, as follows by inserting the largest letter, which multiplies the sum by 1+v2+⋯+v2(a−1). The lowering calculation uses prefixes and the same identity. Therefore, over the generic field and then as integral matrices, Ei(a)ew=∑J⊆{j:wj=i+1}∣J∣=ava(a−1)/2+∑j∈Jhi(w>j)ew(J↦i),Fi(a)ew=∑J⊆{j:wj=i}∣J∣=ava(a−1)/2−∑j∈Jhi(w<j)ew(J↦i+1). The toral generator acts on content α by [αjt]v, integral by [F3]. Thus every generating matrix preserves T. No factorial is inverted after specialization.

2.1F2algebraconstructstep 1.1

Transport of the Hecke action. For wμ=1μ1⋯NμN define θμ(mμTd)=vℓ(d)ewμd. Every word of content μ occurs once, ℓ(d)=inv⁡(wμd), and each coefficient is a unit; hence θμ is an integral bijection. Standard Hecke multiplication on distinguished cosets gives an ascending swap with coefficient 1, a descending swap with coefficient q plus (q−1) times the original coset, and coefficient q when the two letters coincide. Multiplying the basis vectors by vinv⁡(w) changes the two unequal-letter swap coefficients to v, giving exactly the displayed tensor formula. Consequently this is an actual Hecke action, with quadratic and braid relations inherited from H, and θ=⨁μθμ is a right-module isomorphism.

3.1step 1.1step 2.1algebra

Commutation can be checked locally. Put j=i+1. On the four two-letter words ii,ij,ji,jj, the nonzero local raising values are E(ij)=ii, E(ji)=vii, E(jj)=v−1ij+ji, and the nonzero lowering values are F(ii)=v−1ij+ji, F(ij)=jj, F(ji)=vjj. The Hecke values are H(ii)=qii, H(ij)=vji, H(ji)=vij+(q−1)ji, H(jj)=qjj. Substitution proves EH=HE, FH=HF: on ij and ji the raising composites give respectively qii and vqii, and on jj they give vij+qji; lowering gives the transposed three checks. With one active letter and one outside {i,j} the suffix or inverse-prefix multiplier is 1, and the outside letter has the same comparison with i and j, so swapping or retaining that letter commutes with its replacement. With no active letter both operators are zero. Terms of the full coproduct acting outside the adjacent pair only see its total hi, unchanged by its Hecke action; diagonal toral operators depend only on content. This proves commutation for Ei,Fi,Kj. Over the generic field divided powers commute too; since their integral matrices are given in step 1.1, their commutator entries are zero Laurent polynomials. Toral binomials commute by content. Thus ρ has image in the actual integral commutant.

4.1F2step 2.1algebraconstructstep 3.1

Orbit coordinates for that commutant. Fix source content ν and split its sorted word into contiguous column blocks of lengths νj. For an N×N nonnegative integer matrix D=(dij) of total r, with column sums ν and row sums μ, let WD be the words containing exactly dij letters i in block j, and put zD=∑w∈WDvinv⁡ν(w)ew, where inv⁡ν counts inversions separately inside those blocks. Within a block, pairing an ascending word and its descending swap in yTs=qy forces the descending coefficient to be v times the ascending coefficient, since v is a unit. Adjacent swaps connect every arrangement to the uniquely blockwise sorted word wD. Hence all simultaneous q-eigenvectors for the source row subgroup are exactly the free span of the zD, whose supports are disjoint and whose coefficient at wD is one. By the cyclic presentation [F2], evaluation at ewν identifies Hom⁡H(Tν,Tμ) with this eigenspace. Write ξD for the map with that evaluation. These maps give an explicit integral basis, independently of any generic rank comparison, over every ring with a chosen invertible v.

5.1F3step 4.1algebra

The toral element Pμ=∏j[Kj;0μj] acts on content α by ∏j[αjμj]v. If α≠μ and both sum to r, at least one αj<μj, making that factor identically zero; if α=μ, every factor is one. Thus ρ(Pμ)=1μ. For a diagonal matrix D=diag⁡(μ) the orbit map ξD is this projection. These conclusions remain identities at parameters where several Kj eigenvalues coincide.

6.1givenalgebraconstructstep 5.1

Define the triangular order, within fixed row and column sums, by all northeast and southwest rectangle sums σab(D)={∑s≤a, t≥bdsta<b,∑s≥a, t≤bdsta>b. Write D′⪯D if every such sum is at most the corresponding sum for D. This is an actual partial order: differences of northeast rectangle sums recover each strictly upper entry, differences of southwest sums recover each strictly lower entry, and the fixed row sums then recover the diagonal. Put δ(D)=∑i,j∣i−j∣dij and s(D)=∑a≠bσab(D). The diagonal-boundary sums give δ(D)=∑a=1N−1(σa,a+1(D)+σa+1,a(D)). Therefore D′≺D implies δ(D′)≤δ(D) and s(D′)<s(D). The pair (δ,s) of nonnegative integers supplies a terminating induction even when intermediate matrices have different row sums.

7.1step 1.1step 4.1step 6.1algebraconstruct

Extreme-column multiplication. Acting by Ei(b) on zD transfers b letters from row i+1 to row i, distributed as tj among the column blocks, with 0≤tj≤di+1,j and ∑jtj=b. Its expansion in step 4.1 has only the matrices D+∑jtj(Eij−Ei+1,j). Choosing the rightmost available columns greedily maximizes every suffix ∑j≥ktj and minimizes every prefix ∑j≤ktj. A transfer across the row boundary i changes a northeast rectangle only when its row cutoff is i, by such a suffix; it changes a southwest rectangle only when its lower row cutoff is i+1, by the negative of such a prefix. Thus this greedy matrix dominates every other supported matrix in ⪯. For several Ei executed in increasing i, the source row i+1 has not yet been changed, and each operation changes rectangle coordinates at its own boundary only. Consequently simultaneous greedy choices still give a single maximal supported matrix. If at each boundary the target row originally contains zero letters in every selected column, its coefficient is a Laurent unit: to obtain the blockwise sorted final word, all newly present i's in those columns must have been raised, giving exactly one predecessor word and one subset. That predecessor is blockwise sorted, with coefficient one in zD, and step 1.1 gives a single Laurent monomial. Earlier operations only depleted this target row, so its zero entries persist. Multiplying these monomials gives the claimed unit pivot, and uniqueness of successive row transfers rules out an additional path to the same final matrix.

8.1step 1.1step 4.1step 6.1step 7.1algebra

The lower version is equally explicit. Acting by Fi(b) transfers letters from row i to row i+1. Greedy selection of the leftmost available columns maximizes southwest prefix increments and minimizes northeast suffix decrements, hence gives the maximal matrix. Execute several Fi in decreasing i; each source row is then unchanged before its turn, and the rectangle boundaries are again distinct. If all selected target entries are initially zero, the blockwise sorted final word has exactly one predecessor and chosen subset, so its coefficient is a Laurent monomial by the lowering formula of step 1.1. This proves the same maximal-support and unit-pivot assertion without invoking a Gaussian coefficient or cancelling one.

9.1step 6.1step 7.1algebraconstructstep 8.1

Upper elimination. Suppose D has a strictly upper entry and let k>0 be the largest distance j−i of such an entry. Set bi=di,i+k (zero when i+k>N) and D0=D−∑i=1N−1biEi,i+k+∑i=1N−1biEi+1,i+k,X=EN−1(bN−1)⋯E1(b1). Zero terms with column index greater than N are omitted. Thus X executes its operations in increasing i. The rightmost nonzero column of source row i+1 in D0 is at most i+k: its original distance-k entry was removed, and the shifted entry from row i is at i+k. There are at least bi letters at that column. Hence the greedy transfer selects exactly bi letters there and recovers D. Target row i in D0 has zero at column i+k, since that entire outer entry was removed and its added entry is at i+k−1. Step 7.1 therefore gives XξD0=uDξD+∑D′≺DaD′ξD′,uD∈A×, aD′∈A. Its source is still ν, and its target row sum is the row sum of D, so these lower terms belong to that same Hom block. Also δ(D0)=δ(D)−∑ibi<δ(D). Every coefficient is explicitly obtained by the finite subset sums in step 1.1 and reading the blockwise sorted word coefficient of step 4.1.

10.1step 6.1step 8.1algebraconstructstep 9.1

Lower elimination. If D is lower triangular but not diagonal, let k>0 be its largest lower distance and put bi=di+1,i+1−k. Set D0=D−∑i=1N−1biEi+1,i+1−k+∑i=1N−1biEi,i+1−k,X=F1(b1)⋯FN−1(bN−1), with zero terms omitted when the column index is out of range. Now operations execute in decreasing i. The leftmost source column in row i of D0 is at least i+1−k, with at least bi letters there; the target entry at that column is zero. Therefore step 8.1 gives the same expansion with unique unit pivot at D, and again δ(D0)=δ(D)−∑ibi.

11.1step 4.1step 5.1step 6.1step 9.1step 10.1constructalgebra

Exact recursive preimages and surjectivity. Induct on (δ(D),s(D)). For a diagonal matrix use RD=Pμ of step 5.1. In either non-diagonal case, D0 has smaller first coordinate, while each D′≺D in steps 9.1–10.1 has a strictly smaller pair by step 6.1. With their already constructed preimages define RD=uD−1(XRD0−∑D′≺DaD′RD′). This is a finite A-linear combination of ordered words in simple divided powers and toral weight projections, with completely specified coefficient extraction; uD−1 is only a Laurent monomial. Its image is exactly ξD. The finite matrix inventory and the decreasing nonnegative pair guarantee termination. Since the ξD are the actual integral Hom basis, their preimages prove surjectivity. Tensoring this expression with any A-algebra gives the same basis and preimages; step 4.1 proves that the specialized commutant itself has this basis. Thus specialization commutes with the endomorphism construction, including nonflat specialization and roots of unity.

12.1F2step 2.1algebrastep 11.1

Identify the adjoint involution. In the coset basis equip Mμ with diagonal form ⟨mμTd,mμTe⟩=δdeqℓ(d). Under θμ this becomes ordinary tensor dot product. To see that the involution of [F2] is its adjoint, work temporarily over Q(v) with the standard Hecke trace t(Tw)=δw,1, for which t(Tx∗Ty)=δxyqℓ(x) by standard-basis multiplication. Write pμ=∑w∈Sμqℓ(w), so mμ2=pμmμ; the coset form is t(x∗y)/pμ on Mμ. If f(mν)=y∈Mμ∩Hmν, then f∗(mμ)=y∗ by the actual definition. For x=mνh and z=mμk, both adjoint pairings are t(k∗yh): use mμy=pμy in the first, ymν=pνy in the second, and the trace property. Thus ∗ is the dot adjoint. The conclusion concerns equality of integral matrices, so it holds over A and every specialization; the temporary nonzero pμ is never divided in those rings.

13.1step 1.1step 12.1algebra

The assignment τ(Ei)=Fi, τ(Fi)=Ei, τ(Kj)=Kj reverses and preserves the generic defining relations: reversing the toral relation replaces its root exponent by the negative one; the mixed commutator and its right side are both fixed; the Serre polynomial is carried to the reversed negative polynomial. It fixes the toral binomials and exchanges divided powers, hence preserves UA. Let β=μ+a(ϵi−ϵi+1). For a chosen raising subset, subtracting the reverse lowering exponent in step 1.1 gives a(μi−μi+1)+a2, whereas cβ/cμ=v−a(μi−μi+1)−a2. Thus the weighted dot form ⟨x,y⟩C=⟨x,Cy⟩ makes the raising and lowering matrices adjoint; all toral matrices are diagonal and self-adjoint. Its adjoint operator is C−1s∗C. Equality on all integral generators, followed by reversal of products and linearity, proves ρ(τ(u))=C−1ρ(u)∗C for every u.

14.1step 1.1step 2.1step 3.1algebraconstructstep 13.1

Square-root-free matrices. In step 2.1 the permutation-module word basis is bw=vinv⁡(w)ew. If raising a subset J of a positions changes w to w′, counting inversions involving a changed letter gives inv⁡(w)−inv⁡(w′)=∑j∈J(#i(w>j)−#(i+1)(w<j))+(a2). The final correction counts pairs of changed positions, counted incorrectly by changing each letter in isolation. Add the exponent in step 1.1 and use #(i+1)(w<j)+#(i+1)(w>j)=μi+1−1. The coefficient in the b basis is va(a−μi+1)+2∑j∈J#i(w>j). Scaling by va(μi+1−a) gives the displayed q-coefficient. For lowering, the analogous inversion difference is ∑j∈J(#(i+1)(w<j)−#i(w>j))+(a2), giving coefficient va(a−μi)+2∑j∈J#(i+1)(w<j) and the asserted normalization. These define matrices over B. Their Hecke commutation follows from step 3.1 after the injective substitution B↪A, so all their polynomial commutator entries are zero already over B.

15.1F2step 4.1step 6.1step 11.1step 14.1algebraconstruct∎

Over B the permutation-basis Hecke formulas force equal coefficients for ascending and descending arrangements within each source block: an ascending word goes to its swap, a descending word to q times its swap plus (q−1) times itself, and the equation yTs=qy uses only the unit q. Thus the unweighted sums ∑w∈WDbw give the same orbit Hom basis, denoted ΦD. The cross-block inversion count d(D)=∑j<k, a>bdajdbk is constant on WD, so ΦD=vd(D)ξD under extension to A. Repeat steps 6.1–11.1 directly with the normalized operators of step 14.1. Their supports and greedy maximal matrices are identical, and every unique pivot is now a single power of q, because every contributing subset coefficient is a power of q. The recursion therefore uses only B-coefficients and q-unit pivots and proves generation over B. The same orbit presentation and recursion work after every map B→R. Finally, adjoining z with z2=q gives R′=R[z]/(z2−q), free of rank two over R, with z−1=q−1z; it is faithfully flat even in characteristic two. Quantum assertions requiring a square root may be used there, while any specified map, equality, kernel, cokernel, or exact sequence already defined over R descends by faithful flatness. The square-root-free generation proved here itself needs no such extension. At r=0 every construction is the identity map of A or B, and at N=1 all matrices are diagonal, so the base case covers both edge cases. No Choice principle, generic rank argument, or nonunit denominator is used for generation.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passjudge pass (gpt-6.1-sol)Open item page →

Polynomial quantum highest vectors satisfy every divided-power highest relation

Statement

Put A=Z[v,v−1], and use the integral UA(glN) of Integral divided-power tensor actions generate the type-A q-Schur algebra. Let R be any commutative A-algebra and UR=R⊗AUA. Let X be a left UR-module with a specified composition-label decomposition X=⨁μ∈Λ(N,r)Xμ, where r≥0, Λ(N,r) consists of nonnegative integer N-tuples of total r, every integral toral element acts on Xμ by its integer-weight character μ, and the positive and negative divided powers shift labels by their root degrees. Thus the toral rank-one binomial with indices c,t acts by [μi−μi+1+ct]v. This requirement uses the full integral toral characters, including specialized binomials; it does not recover labels from the specialized Kj eigenvalues. Each Xμ may be an arbitrary R-module.

For a partition λ∈Λ(N,r) and a vector x∈Xλ killed by every Ei(s), s>0, put mi=λi−λi+1. Then Fi(a)x=0(1≤i<N, a>mi). These are all divided powers beyond the highest bound, including those whose quantum factorial vanishes after specialization. Consequently, if X=URx, the highest-vector map gives a surjection of negative-half modules UR−/∑i=1N−1∑a>miUR−Fi(a)⟶X,1⟼x. Whenever this quotient carries its integral highest-module action, with the same toral character and positive annihilation on 1, that map is a UR-module map. In particular it applies to the actual highest quotient used by the normalized q-Schur Weyl-cell comparison. No Schur factorization of X is assumed. The relation proof and negative-half surjection are choice-free and hold at every specialization, over rings with torsion and zero divisors as well as fields.

Facts & Assumptions

Given: The rings, the integral quantum algebra, the specified nonnegative composition-label decomposition, and the highest vector in the Statement.

[F1]

The integral rank-one reordering identity and triangular spanning hold after every base change (Divided-power multiplication, toral binomials and the Ei(a)Fi(b) reordering identity). On a highest vector of simple-coroot weight m, reordering and the integer toral character give Ei(s)Fi(b)x=[m+s−bs]vFi(b−s)x for b≥s.

[F2]

The symmetric nonnegative quantum binomials are Laurent polynomials, are symmetric in their lower complementary indices, and satisfy both quantum Pascal recurrences (The quantum Pascal recurrences, the Gauss product formula and Gaussian integrality).

Proof

1.1givenF2algebraconstruct

Extend the symmetric binomial to integer top indices using its finite product in the generic variable. If d≥1 and s≥0, negating every numerator quantum integer gives [−ds]v=(−1)s[d+s−1s]v. The right side is a Laurent polynomial by [F2], so this equality defines its integral specialization without dividing a specialized factorial. Put gd(s)=[d+s−1d−1]v; symmetry makes the negative binomial (−1)sgd(s), and gd(0)=1.

2.1F2step 1.1algebraconstruct

Establish an exact recurrence for this sequence. For an indeterminate Q, let Gn,k(Q) be the ordinary Gaussian polynomial, characterized by Gn,k(v2)=vk(n−k)[nk]v. Both Pascal recurrences in [F2] give Gn,k=Gn−1,k−1+QkGn−1,k, with out-of-range terms zero. Put hd(s)=Gd+s−1,d−1 and hd(−1)=0. Thus h1(s)=1 and hd+1(s)=hd(s)+Qdhd+1(s−1) for s≥0. Multiplying formal series coefficientwise yields ∑s≥0hd(s)ts=∏j=0d−1(1−Qjt)−1 by induction on d. Each inverse here is the formal geometric series, so no coefficient-ring element is divided. Substitution Q=v2 and t↦v−(d−1)t gives ∑s≥0gd(s)ts=∏j=0d−1(1−v2j−d+1t)−1. Writing the denominator as ∑j=0dpjtj, its constant term is p0=1 and its top coefficient is pd=(−1)dv∑j=0d−1(2j−d+1)=(−1)d. Coefficient comparison therefore gives ∑j=0dpjgd(n−j)=0 for every n≥d, with a unit coefficient on the oldest term.

3.1step 1.1step 2.1algebra

A zero tail forces a zero initial coefficient over every ring. More precisely, if z belongs to any R-module and gd(s)z=0 for every s≥S, first use the recurrence of step 2.1 at n=S+d−1 to obtain pdgd(S−1)z=0 when S>0. The other d terms have indices at least S and are zero. Since pd=(−1)d is a unit, gd(S−1)z=0. Repeat this finite backward argument until gd(0)z=z=0. If S=0 the conclusion already follows from gd(0)=1. This argument never divides a quantum integer or assumes that a nonzero scalar acts injectively.

4.1givenF1step 1.1step 3.1algebra

Fix i and a>mi, put d=a−mi>0 and z=Fi(a)x. The only surviving term of the rank-one reordering of Ei(s)Fi(a+s)x has contraction index s, since every other term ends in a positive divided power killing x. Its toral factor acts on x by [mi−as]v, so [F1] and step 1.1 give Ei(s)Fi(a+s)x=(−1)sgd(s)z. For all s≥S:=max⁡(0,λi−a+1), the putative composition label of Fi(a+s)x has ith coordinate λi−a−s<0, hence this vector is zero by the given support. Thus gd(s)z=0 for every s≥S. Step 3.1 proves Fi(a)x=z=0. This establishes every required divided relation independently, including a larger than the characteristic or quantum characteristic.

5.1F1step 4.1constructalgebra

If X=URx, triangular spanning in [F1] and the highest conditions give X=UR−x: positive nonconstant terms kill x and the middle toral terms evaluate by its character. The negative-half map y↦yx is onto, and step 4.1 makes each generator Fi(a), a>mi, of the displayed left ideal vanish at x. It therefore factors through exactly the stated negative quotient. This is a concrete quotient construction over R, rather than a specialization of a generic surjectivity claim.

6.1givenF1step 5.1algebra∎

Suppose the quotient is supplied with the highest-module action described in the Statement. The map of step 5.1 commutes with negative divided powers by construction and with all toral elements by homogeneous degrees and the integer-weight characters. For a positive divided generator acting on a negative word, apply the same finite integral reordering identity in the quotient and in X; move the toral coefficients to the highest line and kill the positive tails. Each resulting negative term has the same coefficient and the same image in the two modules. Linearity proves commutation with every positive divided generator, hence with all of UR. Any such map is determined by its highest vector because the quotient is generated by the negative words. At N=1 there are no simple-root relations and the same argument gives the rank-one cyclic quotient directly; the zero module and r=0 are included. All scalar operations in the relation proof were Laurent-polynomial identities and multiplication by the units (−1)d, so no flatness or Choice hypothesis is required.

LemmaStatement: AI-adaptedProof: AI-adaptedprecheck passOpen item page →

Integral quantum highest modules are the normalized q-Schur Weyl cells

Statement

Assume the Axiom of Choice, inherited only through the integral highest-lattice supplier. Put A=Z[v,v−1], q=v2, N≥1, and r≥0. Use the integral UA(glN), its surjection ρ:UA→SA(N,r), and τ(Ei(a))=Fi(a), τ(Kj)=Kj of Integral divided-power tensor actions generate the type-A q-Schur algebra. For a partition λ of r with at most N parts, padded by zeros, set mi=λi−λi+1 and QA(λ)=UA−/∑i=1N−1∑a>miUA−Fi(a). Equip this quotient with its integral highest-module action and highest vector z=1+∑UA−Fi(a), with Kjz=vλjz and the integral toral binomials acting by the corresponding integer-weight characters. Let WAλ be the actual fixed-first-index right Weyl cell of The type-A q-Schur algebra and its Weyl modules, with semistandard basis wT, cellular form Bcell and h=wTλ. Give its underlying module the left action u⋅w=wρ(τ(u)). Then the unique highest-vector map f:QA(λ)→WAλ, z↦h, is an isomorphism. In particular bT=f−1(wT) is a complete integral semistandard basis, of weight type⁡(T), and the displayed divided-right-power relations are the entire negative-half presentation. This does not identify bT with a particular ordered root monomial.

Set cμ=v−∑j(μj2). There is a unique homogeneous normalized τ-contravariant form B on QA(λ), explicitly B(xz,yz)=[z](τ(x)yz). Here [z] means projection onto the free highest-weight line followed by its coefficient in z. It is integral and symmetric, and for homogeneous a,b of weight μ satisfies B(a,b)=cλcμBcell(f(a),f(b)). Different weights are orthogonal. Every ratio in this formula is a Laurent unit. The module, basis, quotient presentation, highest-coefficient formula and form comparison commute with arbitrary commutative A-algebra base change, including fields at roots of unity and singular Gram matrices. Form radicals agree under f in every such fibre; no assertion that radicals commute with arbitrary base change is made.

Over every commutative A-algebra R, every cyclic left UR-module with nonnegative composition-label support of total degree r and the full integer toral characters, generated by a vector of weight λ killed by every positive divided generator, is a quotient of QR(λ). Equivalently, the left Weyl cell is the polynomial highest-induced module SR⊗SR+Rλ, where SR+ is the image of the integral toral-positive subalgebra and Rλ is its highest character. This includes every polynomial Schur module and the zero module. The full toral-character label convention is the one specified in Polynomial quantum highest vectors satisfy every divided-power highest relation; no factorization through the Schur quotient is assumed for this stronger cyclic-highest assertion.

Facts & Assumptions

Given: The ring, degree, partition, integral hyperalgebra and actual normalized cells in the Statement.

[F1]

The surjection and weight projections hold integrally and after arbitrary base change, and, with C=∑μcμ1μ, the involutions obey ρ(τ(u))=C−1ρ(u)∗C (Integral divided-power tensor actions generate the type-A q-Schur algebra).

[F2]

The right cell has the semistandard weight basis, star-contravariant symmetric form and Bcell(h,h)=1. The canonical partition projection is 1λ=φTλTλ; the cell product has coefficient Bcell (The type-A q-Schur algebra and its Weyl modules).

[F3]

The displayed negative-half quotient is the free integral highest lattice, with finite free weight pieces and the finite Weyl character, with inherited Choice (Finitely generated free integral weight lattices and deformation of the classical weight character). For type AN−1 extend its labels to composition labels of fixed total r by Kj acting as vμj on weight μ; the integer-weight toral characters and root shifts give the stated glN action. At N=1 this is the free rank-one module directly.

[F4]

The finite type-A Weyl character is the bialternant Schur character, whose coefficient at xμ is Kλμ (Semistandard tableaux expand Schur characters). The Bender–Knuth bijections permute composition contents (Bender--Knuth involutions permute the weights of semistandard tableaux).

[F5]

Integral triangular spanning is UA=UA−UA0UA+; the same spanning holds after every base change (Divided-power multiplication, toral binomials and the Ei(a)Fi(b) reordering identity). Positive and negative divided generators shift composition labels by their root degrees.

[F6]

Every highest vector with nonnegative composition-label support satisfies all Fi(a)x=0 for a>mi, over every coefficient ring; integral reordering makes its negative-quotient map a full UR-module map (Polynomial quantum highest vectors satisfy every divided-power highest relation).

[C1]

The Axiom of Choice is used only as inherited by [F3] and [F4]. The finite cellular constructions and ring arguments below make no additional choice assumption.

Proof

1.1F2F4algebra

Tableau support. In any semistandard tableau, each column has at most k entries in {1,…,k}; summing over columns gives ∑j≤kμj≤∑j≤kλj. By [F4] the same inequality holds after permuting the content. Thus no weight λ+aαi, a>0, occurs. No weight λ−aαi occurs when a>mi: swapping its ith and (i+1)st coordinates makes its first i coordinates sum to ∑j≤iλj+a−mi, violating that inequality. Negative coordinates also cannot occur. The type-λ tableau is uniquely Tλ: the first content inequality is an equality forcing all 1's into row one, and successively equality for k forces all k's into row k. Hence the top weight line is Ah.

2.1F1F2F3step 1.1constructalgebra

The highest map. The action in the Statement is a left action since τ reverses products. It has the stated weight labels by [F1]. Step 1.1 kills every Ei(a)h for a>0 and every Fi(a)h for a>mi; the toral characters are those of weight λ. Thus [F3] gives a highest-module map f:QA(λ)→WAλ. By the cell product and Bcell(h,h)=1, hφTλT=wT. Surjectivity in [F1] supplies an integral preimage under ρτ of each of these endomorphisms, so h generates the whole cell and f is onto.

2.2F1F2step 1.1algebraconstruct

Cellular highest induction over any R. Put I>λ equal to the span of cellular shapes strictly dominating λ. This ideal is generated by the 1η for η>λ: choose a finite order with larger shapes first, and use φS,Tη1ηφTη,T≡φST modulo higher shapes, whose coefficient is 1 by [F2]. Induction absorbs those higher terms in the already generated ideal; conversely each 1η lies in I>λ. The quotient SR1λ/I>λ1λ has exactly the basis φT,Tλ of shape λ: any semistandard type λ in shape η forces η⊵λ by the column count in step 1.1, and shape λ has the single second tableau Tλ. Star identifies this left cell with the right cell acted on by s∗; the weight-unit map sending its weight-μ basis vector to (cμ/cλ)wT instead identifies it with the action s⋅w=wC−1s∗C of the Statement. Its highest vector maps to h.

3.1F1F3F4F5step 2.1algebraconstruct

Integral isomorphism. In type AN−1 the finite Weyl alternating quotient of [F3], on composition labels of fixed total r, is det⁡(xiλj+N−j)/det⁡(xiN−j): the Weyl group permutes the N coordinates, and multiplying numerator and denominator by the common monomial removes the half-sum shifts. This is the bialternant of [F4]. Consequently, for each weight μ, [F3] and [F4] make the source and target finite free of the same rank Kλμ. The map in step 2.1 is graded, hence onto on each weight. Choose finite free bases and write its square matrix D; lifting the finitely many target basis vectors gives a matrix P with DP=I. Therefore det⁡(D)det⁡(P)=1, and the adjugate formula gives an inverse matrix over A. Zero-rank weights have the unique empty inverse. Only finitely many weights occur, so these inverses assemble to f−1. This proves the entire quotient presentation and the basis bT. Concretely a preimage under the surjection of φTλT, followed by integral triangular spanning and highest-character evaluation, gives a representative of bT in UA−; different preimages give the same quotient class. No generic-rank argument replaces the proved integral surjection.

4.1F1F5F6step 2.2step 3.1constructalgebra

Let X=URx be the cyclic highest module with the composition support and full toral characters in the Statement. By [F6], every divided highest relation holds, and the highest-vector map QR(λ)→X is a surjective UR-module map. The integral isomorphism of step 3.1 and its inverse remain inverses after arbitrary base change. Thus this is a quotient of the actual normalized Weyl cell. In particular X factors through SR: [F1] makes ker⁡ρ stable under τ, so it annihilates that cell and every quotient. No factorization of X was assumed. Via the unit identification of step 2.2, the corresponding left-cell quotient map preserves the highest generator. Apply this argument also to Y=SR⊗SR+Rλ: its canonical generator has the stated toral character, is killed by all positive divided powers, and is fixed by 1λ. The last assertion follows because the integral toral projection ∏j[Kj;0λj] is 1λ and has highest-character value 1. Thus Y is a quotient of the left cell. Conversely the highest vector of that cell defines a surjection Y onto it. Both compositions fix the cyclic highest generators, hence are identities, proving the induction equivalence. This is a direct cellular proof of the universal property.

4.2F1F2step 3.1algebraconstruct

Construct the form on the actual cell first. Give weight μ the scalar dμ=cλ/cμ times Bcell and pair distinct weights by zero. Weight spaces are orthogonal for Bcell because its self-adjoint projections 1μ are orthogonal; thus the new form is symmetric and integral and has value 1 on h. For s=ρ(u), [F1] gives ρ(τ(u))∗=CsC−1. On a homogeneous component, right multiplication by this conjugate contributes cν/cμ when s takes right weight ν to right weight μ. Hence dν(cν/cμ)=dμ, and cellular contravariance gives B(u⋅a,b)=B(a,τ(u)⋅b). Linearity handles sums of homogeneous components. Pull this form back by the integral isomorphism f.

5.1F3step 1.1step 3.1step 4.2algebra

Highest coefficient and uniqueness. For x,y∈UA−, contravariance gives B(xz,yz)=B(z,τ(x)yz). Orthogonality and the top line Az make the last expression exactly [z](τ(x)yz). This proves the displayed coefficient construction descends through the complete quotient, including both arguments, because the already constructed form is defined on that quotient. Conversely the same equality is forced for any homogeneous normalized contravariant form, and negative words span by [F3], proving uniqueness. The construction has used only Laurent units and the integral action; it has not restricted a tensor form or divided by a tensor highest norm.

6.1C1step 3.1step 4.2step 5.1step 2.2step 4.1algebra∎

Base change and singular forms. Tensor the proved isomorphism and its inverse with any R; the quotient is its specialized presentation by right exactness of tensor product, the basis remains the specialized bT, and the integral form matrices and highest projection specialize entrywise. The weight factors dμ remain units. Thus a vector pairs to zero for the specialized form exactly when its image pairs to zero for the specialized cellular form, even if the Gram determinant is zero. Steps 2.2 and 4.1 used the same free cellular basis and unit coefficients over R, so their universal property also holds without flatness. At r=0 the unique empty highest cell and quotient are R with form 1; at N=1 the only degree-r cell and quotient are likewise rank one. These prove all claims with only the inherited Choice of [C1].

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Polynomial quantum Schur first levels: Weyl filtration and the actual Hecke corner

Statement

Put A=Z[v,v−1], q=v2, and use the actual integral tensor action and the finite normalized-cell constructions of Integral divided-power tensor actions generate the type-A q-Schur algebra and Integral quantum highest modules are the normalized q-Schur Weyl cells. For N>d≥1, λ⊢d, and WN(λ) its Weyl module, the first level is WN(λ)1=⨁αN=1WN(λ)α. It has an integral lower-Schur Weyl filtration with one factor WN−1(λ(i)) for each removable row i, ordered by decreasing dominance of λ(i). This filtration and its quotient identifications commute with arbitrary coefficient-ring base change.

Over every field with a chosen unit v, write ∇=Wτ and L=W/rad⁡Bτ, with the suppliers' abstract highest norm-one form. Then Hom⁡(WN−1(μ),∇N(λ)1) is one dimensional exactly for μ=λ(i), and zero otherwise. The same Hom-space with target LN(λ)1 has dimension at most one and vanishes off these labels. Equivalently every lower-Levi primitive line of LN(λ)1 has one of these weights, with dimension at most one; primitive means annihilated by all positive divided generators.

For every commutative ring R, unit q, and left SR(N,d)-module V, its first level carries the actual lower algebra SR(N−1,d−1) action induced on permutation modules, and there is a natural isomorphism elowerV1≅Res⁡Hd−1HdeV. The quantum Levi action, when a square root is chosen, agrees with this action under the actual tensor identification and the suppliers' weight-unit conjugation. This statement neither equates first level with a simple-root layer nor asserts that an exact corner functor preserves socles.

Facts & Assumptions

Given: The rings, ranks, actual permutation-module Schur algebras, weight projections, and normalized Weyl modules of the Statement.

[F1]

The actual integral divided tensor action surjects onto S, its weight blocks identify tensor space with the permutation-summand realization, and this survives arbitrary base change (Integral divided-power tensor actions generate the type-A q-Schur algebra).

[F2]

The finite cellular construction and weight-unit transport are the explicit arguments in the cellular-highest-induction, polynomial-universality and direct-cell-form paragraphs of Integral quantum highest modules are the normalized q-Schur Weyl cells. The integral highest-lattice quotient and its global-basis isomorphism are not used. Step 1.1 below proves the exact needed cell interfaces without their inherited Choice. Its universal assertion concerns actual Schur modules; the lower modules used in steps 3.1 and 5.1 carry that action by steps 1.2 and 7.1. The broader finite-label-support highest universality is a separate assertion of the supplier and is not used here.

[F3]

The Weyl cell is free with the actual semistandard-tableau basis, weight ranks are its tableau counts, and all weights are dominated by λ (The type-A q-Schur algebra and its Weyl modules). Permuting composition contents preserves their tableau counts by the finite bijections of Bender--Knuth involutions permute the weights of semistandard tableaux. The divided-power reordering establishes triangular spanning integrally; it does not require the freeness or full PBW-rank theorem (Divided-power multiplication, toral binomials and the Ei(a)Fi(b) reordering identity).

Proof

1.1F1F2F3algebraconstruct

Establish the finite cell interfaces directly. Give the actual right Weyl cell the left action u⋅w=wρ(τ(u)). Its canonical vector h is highest: the semistandard weight bounds exclude λ+aαi, and its toral character is λ; the canonical cell form has Bcell(h,h)=1. The cell law gives hφTλT=wT, and [F1]'s integral surjection makes it cyclic highest. For an actual polynomial Schur module X=U−x cyclic highest of weight λ, triangular spanning gives weights in λ−Q+, so every partition projection 1η with η>λ annihilates it. The higher cellular ideal is generated by these projections: in decreasing shape order φS,Tη1ηφTη,T≡φST modulo higher shapes, with coefficient one. Hence that ideal kills X. Thus S1λ→X, s1λ↦sx, factors through the actual left Weyl cell S1λ/I>λ1λ; its basis is exactly the shape-λ columns because semistandard type λ requires shape at least λ. The unit diagonal C=∑μcμ1μ, cμ=v−∑j(μj2), of [F1] transports this left-star cell to the displayed left quantum action, giving its universal highest property. On its actual weight-μ vectors define B=(cλ/cμ)Bcell and different-weight pairings zero. The exact identity ρ(τ(u))=C−1ρ(u)∗C makes this symmetric integral form τ-contravariant: the right-action weight factor cν/cμ is canceled by (cλ/cν)(cν/cμ)=cλ/cμ. Its highest value is one. All factors are units, so its radical is precisely the actual cell radical and its simple quotient is self-dual. These are finite cellular and matrix arguments, valid after arbitrary base change and with no use of the free global highest lattice.

1.2givenF3algebraconstruct

Construct the corner over the original R,q. Put M0=⨁α∈Λ(N−1,d−1)mαHd−1. Length-additive parabolic coset bases identify M1=⨁αm(α,1)Hd with M0⊗Hd−1Hd, by mαh⊗a↦mαha. Hence f↦f⊗1, extended by zero on the other summands, embeds the lower Schur algebra with identity p=∑αN=11α. It is injective because the unit parabolic coset supplies a direct summand. The lower regular composition induces the upper regular type ω∗=(1d−1,0N−d,1), so elowerpV=e∗V. On that summand the lower Hecke corner acts by left multiplication by exactly h∈Hd−1 on Hd, since h⊗a↦ha.

2.1F2F3step 1.1algebraconstruct

Use the root convention Fi,i+1=Fi and Fi,j=vFi+1,jFi−FiFi+1,j. In the negative algebra, its last-simple-root-degree-one part is spanned by xFi,N with x in the negative lower Levi. Here is a direct spanning proof, requiring no specialized PBW independence. Every divided-simple-generator word of this degree has exactly one FN−1, exponent one; all other generators belong to the lower Levi. Move each factor to its right past the current root using Fi,NFi−1(s)=v−sFi−1(s)Fi,N+v−1Fi−1(s−1)Fi−1,N,Fi,NFi(s)=vsFi(s)Fi,N. Other lower simple divided generators commute with Fi,N. The first identity follows from vFi,NFi−1=Fi−1Fi,N+Fi−1,N and Fi−1,NFi−1=vFi−1Fi−1,N: induction on ordinary powers gives coefficient v−1[s], canceled with [s]! in the generic algebra, leaving the displayed integral identity. The second and remaining commutations follow by inserting the root recurrence into the rank-two Serre identity and then inducting on the interval length; the only noncommuting lower adjacent endpoint is i−1, already treated. Each move removes one right factor, so it terminates. Triangular spanning and the highest-vector relations now show W1=∑iUN−1−Fi,Nzλ. If λi=λi+1, the weight λ−ϵi+ϵi+1 is absent: its sorted weight strictly dominates λ, contrary to the tableau support. Thus Fizλ=0 and the root recurrence gives Fi,Nzλ=−FiFi+1,Nzλ. Iteration removes all nonremovable rows. Rows beyond the height contribute zero by nonnegative weight support. Therefore the claimed removable-row generators span integrally.

3.1F2F3step 1.1step 2.1algebra

Order these rows as i1>⋯>it, so μj=λ(ij) decreases in dominance, and let Wj be the negative lower-Levi span of the first j generators, with W0=0. Inductively suppose Wj−1 is invariant. In W1/Wj−1 every weight lies below a remaining generator weight by step 2.1, and μj is their maximum. Every positive divided generator kills the image of Fij,Nzλ, since its target weight is strictly above μj. Triangular spanning makes its negative span invariant. The actual universal highest property gives a surjection WN−1(μj)→Wj/Wj−1. This proves invariance and these integral surjections at each stage, without dividing a quantum integer.

4.1F3step 3.1algebra

Exactly one entry N in a semistandard λ-tableau lies at a removable corner, and deleting it gives a semistandard λ(i)-tableau on 1,…,N−1. Conversely appending N at that corner preserves semistandardness. Consequently the actual free ranks satisfy rank⁡W1=∑jrank⁡WN−1(μj). Over Q(v) the surjections of step 3.1 and this dimension equality force equality of every quotient dimension. The kernel of each integral surjection lies in the free A-module WN−1(μj) and has generic rank zero; injectivity into its fraction-field extension therefore makes that kernel zero. Each integral quotient is thus the actual free lower Weyl module. Its freeness makes the successive short exact sequences split as A-module sequences, so arbitrary base change preserves the filtration injections, quotients and surjections. Generic dimensions were used only to prove kernels of explicit integral surjections vanish, not to replace a specialized construction.

5.1F2step 2.1step 4.1algebra

Over a field let B− denote the actual lower Borel image. A B−-map W1→Fμ is determined by its values at the generators of step 2.1; their weights are distinct, so its dimension is at most one and is zero off μj. At μj, quotient by Wj−1. This quotient has no weight above μj, its μj-space is the one-dimensional generator line by step 4.1, and later generator weights lie strictly below it. Taking that generator's coefficient, and zero on every other weight, is a well-defined nonzero B−-map, since a nonconstant negative operator cannot reach μj. This proves dimension exactly one. The universal highest property gives Hom⁡(WN−1(μ),X)=Hom⁡B+(Fμ,X) for every polynomial X: maps are exactly primitive vectors of that weight. Taking contravariant duals identifies this with Hom⁡B−(Xτ,Fμ). With X=(W1)τ this proves the first Hom assertion. With X=L1, self-duality and the injection L1↪(W1)τ give the upper bound and label restriction. For a primitive vector x of any composition weight, the functional y↦B(x,y) on L1, pulled back to W1, is nonzero by the nondegenerate homogeneous form and kills every nonconstant negative lower operator by contravariance. Thus it is a B−-map to the character of that weight. The same generator bound excludes all other primitive weights, without presupposing their dominance. The form's toral weight orthogonality ensures first-level projection commutes with this duality.

6.1F2step 5.1algebra

Record the precise coefficient test needed by lowering arguments. If L1→∇N−1(λ(i)) is nonzero, compose with W1→L1 and with the highest-weight coefficient in ∇. The resulting B−-functional is nonzero, hence nonzero at Fi,Nzλ by step 5.1. Every nonempty cut product Fi,b1Fb1,b2⋯Fbs,Nzλ has a nonconstant lower-Levi factor to the left and is killed by this functional. Multiplying factors by the unit toral normalization used for F^ changes only their nonzero scalar factors on these fixed weight vectors. Thus the same zero/nonzero test applies to the normalized cut products. This argument needs neither an inherited tensor norm nor a claimed full-Hom surjection at singular parameters.

7.1F1F2step 1.2algebra∎

The summands of types ω∗=(1d−1,0N−d,1) and ω=(1d,0N−d) are both the actual regular module Hd. Their identity isomorphisms give block matrix units u,v in S with uv=e∗ and vu=e. Multiplication by u and v consequently identifies eV with e∗V, transporting every lower Hecke operator to its actual upper corner inclusion. This proves the natural restriction isomorphism, including d=1, whose lower algebra and corner are R. In the tensor realization of [F1], on words containing exactly one N every lower divided generator leaves that position untouched and applies its subset-sum formula to the remaining ordered positions. These are exactly the induced operators of step 1.2 under the actual tensor/permutation intertwiner. Weight projections agree as well, so [F1]'s lower surjectivity proves equality of the full lower actions. The weight-unit diagonal conjugation of [F2] restricts to this subspace and intertwines the same actions after left/right conversion. This verifies the quantum/cellular comparison at every specialization by explicit generators.

5 · Examples, counterexamples and false statements

None yet.

Sources