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

✓ 14 results · all verified · 1 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 13 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Modular Branching and the Good-Node Crystal

1 · Prerequisites

2 · Summary

This page develops the modular branching theory of the symmetric groups in the residue convention res⁡(r,c)=c−r mod p and in the p-restricted labelling of the simple modules, and isolates the good-node combinatorics as a self-contained crystal. The first layer fixes the objects that make the branching computable inside kSn: the Jucys-Murphy elements L1,…,Ln of The Jucys-Murphy elements of the symmetric group algebra are used to split the regular representation into simultaneous primary components, and the resulting central content idempotents cut the restriction and induction functors into residue summands Ei and Fi. These functors are the algebro-group-free form of the residue decomposition of the branching problem; they are exact, additive, duality-compatible and available over an arbitrary field of characteristic p, with no splitting hypothesis beyond the fact that symmetric groups are split over their prime field. On the combinatorial side, Residue signatures, normal, good, conormal and cogood nodes fixes the residue signature of the i-nodes of a p-restricted partition, the cancellation of (−,+) pairs and the resulting notions of normal, good, conormal and cogood nodes, together with the counts εi,φi, and it records the same-shape normal/good-node dictionary with negated residue names for Brundan's ℓ-residue r−c. Good-node deletion and cogood-node addition operators turns the good and cogood nodes into partial operators e~i,f~i on p-restricted partitions and proves, purely combinatorially, that they are mutually inverse and change the rank by one.

The second layer connects the functors with the nodes. Finite-group induction is coinduction, hence biadjoint to restriction records the relative Frobenius isomorphism Ind⁡≅Coind⁡ for a subgroup of a finite group, so that induction is both a left and a right adjoint of restriction in the modular setting. The socle of an uncoloured modular restriction is the multiplicity-free sum over the good residues states the residue-refined socle theorem for D(μ)↓Sd−1: the socle is the multiplicity-free sum of the simples D(μ∖Ai) over the good nodes, one for each residue with εi(μ)>0. From this, Every p-restricted partition is reached from the empty partition by cogood additions derives the connectivity of the modular branching graph: every p-restricted partition is reached from the empty partition by cogood-node additions, equivalently by good-node deletions. A remark draws the boundary of what is proved here: the level-one inductive labels agree with the cellular labels by the proved branching endpoints and induction on rank. Identifying this graph with the canonical Fock-space crystal is a separate theorem, and the broader cyclotomic labelling theorem requires its own argument.

The third layer compares the branching multiplicities with the first-level multiplicities over the algebraic group and with the Hecke algebra. The Schur functor compares first-level branching with Hecke restriction uses the type-A q-Schur algebra and its Schur functor to identify the Schur image of the first level of a simple module with the restriction of the corresponding Hecke simple module, and transfers composition multiplicities between the first level and the Hecke restriction; the comparison is stated at general quantum characteristic and specialized to q=1. Kleshchev's first-level branching multiplicity records Kleshchev's first-level branching multiplicity: for a removable node A of a p-regular partition the multiplicity of Dλ(j) in the restriction is zero when A is not normal and is one plus the number of normal nodes strictly above A in the same residue class when A is normal. The next two theorems give the residue-restriction and residue-induction multiplicities: the multiplicity of D(μ∖A) in EiD(μ) for a normal node A counts the normal nodes weakly below A when A is normal (and is zero otherwise), and, dually, the multiplicity of D(μ∪B) in FiD(μ) for a conormal node B counts the conormal nodes weakly above B. The layer closes with the socle and head theorems for the extreme nodes: if A is the good node then EiD(μ) has simple socle and head D(μ∖A) occurring with multiplicity εi(μ), and if B is the cogood node then FiD(μ) has simple socle and head D(μ∪B) occurring with multiplicity φi(μ).

Throughout, k is a field of characteristic p>0, all partitions in the crystal statements are p-restricted unless stated otherwise, all residues are read as c−r mod p with nodes ordered top to bottom, and every item is finite-dimensional and choice-free, with the characteristic 2 case included. The page records the source theorems it uses (Kleshchev's survey and 1997 paper, and Brundan's 1998 paper) by exact locators; the local proofs and their declared suppliers carry the mathematical arguments.

3 · Logical flowchart

4 · Definitions, theorems and proofs

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

Integral symmetric Jucys–Murphy polynomials span the center

Statement

For every commutative unital ring R and n≥0, every element of Z(RSn) is an R-linear combination of evaluations of integral monomial symmetric polynomials at Lr=∑a<r(a,r). Conversely every symmetric polynomial evaluation is central. In particular Z(RSn)=R[L1,…,Ln]sym, where the right side denotes evaluations of symmetric polynomials, not invariants of an action on the group algebra. No integer is inverted.

Facts & Assumptions

Given: n≥0, a commutative unital ring R, and the Jucys–Murphy elements.

[F1]

The elements Lr commute (The Jucys-Murphy elements commute pairwise); every symmetric polynomial evaluation over C is central (Symmetric polynomials in the Jucys-Murphy elements give exactly the centre). Only the centrality direction over C is used.

Proof

technique · direct
1.1F1givenalgebra

An integral symmetric polynomial evaluates in ZSn. Its commutator with any permutation vanishes in CSn by [F1], hence vanishes integrally by coefficientwise injectivity. For any coefficient ring, invariance of a polynomial under variable permutations says exactly that its coefficients are constant on monomial orbits, so it is a linear combination of integral monomial symmetric polynomials. All their evaluations are therefore central over R. A group-ring element is central exactly when its coefficients are constant on conjugacy classes: compare coefficients after conjugating by each permutation. Consequently the class sums form a basis of the center over Z and over R, even with zero divisors.

1.2givenalgebra

Define the reduced cycle type ρ(g) by subtracting one from each nontrivial cycle length and discarding fixed points. Its size d(g)=n−c(g) is the minimum number of transpositions expressing g: multiplying by a transposition changes the number of cycles by one, giving the lower bound, and each cycle of length s has a factorization with s−1 transpositions, giving equality. The possible types are precisely partitions ρ with ∣ρ∣+ℓ(ρ)≤n. Write Kρ for their integral class sums.

2.1step 1.2algebra

If a word of d transpositions has product of degree d, every prefix multiplication joins two different cycles; otherwise the final degree would be at most d−2. The graph whose edges are the transpositions is therefore a forest, and its connected components are exactly the cycles of every prefix product. Indeed initially both are singletons, and each multiplication joins two current components by one edge and joins their two cycles. Thus edges never repeat, and each final tree of s vertices gives a cycle of length s.

3.1step 2.1F1algebra

Let ρ be a possible reduced type of size d, and expand the monomial symmetric polynomial mρ(L1,…,Ln), summing once over distinct assignments of the positive parts of ρ to distinct indices r. Each term is a word of d transpositions, grouped into stars centered at those r: the group Lra has a edges incident to r. Every resulting permutation has degree at most d. If its degree is d, step 2.1 makes all these stars trees with distinct edges. Each star lies in one final tree; the degree of that tree is the sum of the exponents of its stars. Its reduced cycle type is therefore obtained from ρ by merging some parts. Any proper merging decreases the number of parts.

4.1step 3.1step 2.1algebra

The coefficient at any permutation g of reduced type exactly ρ is one. In the degree-d expansion, equality of the number of parts forces each final tree to contain exactly one star. For a cycle with support {r,a1,…,as}, the center of its star must be its largest letter r, since every factor from Lr is (a,r) with a<r. The ordered star factorization is unique: with right-to-left permutation composition, (a1,r)⋯(as,r) is the cycle (r,as,…,a1), as direct evaluation on each letter shows. Thus the cycle determines the leaf ordering. Different cycles have distinct maxima, their stars are disjoint and commute, and their assignments appear exactly once among the distinct monomials, including repeated exponents. This also constructs a term producing g.

5.1step 1.1step 1.2step 3.1step 4.1algebra∎

By centrality and steps 3.1–4.1, mρ(L)=Kρ+∑σaρσKσ, with integer coefficients, where every remaining type either has smaller degree or is a proper merging of ρ. Induct on degree and, within a degree, on the number of parts in increasing order. All remaining sums are already integral symmetric polynomial evaluations, so subtraction expresses Kρ that way too. The initial type is empty with m∅=K∅=1. This proves integral spanning without division. Specialization to R and the class-sum basis from step 1.1 prove the assertion over every R, including n=0 and the zero ring.

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

Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi

Definition

Let k be a field of characteristic p>0 and let L1,…,Ln∈kSn be the Jucys-Murphy elements Lr=∑s<r(s,r) of the symmetric group algebra (The Jucys-Murphy elements of the symmetric group algebra). Recall that they commute pairwise (The Jucys-Murphy elements commute pairwise), and for r≤n the element Lr lies in the subalgebra kSr⊆kSn and therefore commutes with Sr−1.

(i) Primary idempotents. In the commutative subalgebra k[L1,…,Ln]⊆kSn the minimal polynomial of each Lr on the regular module splits into linear factors X−a with a in the prime field Fp⊆k, and the commuting family admits the following simultaneous primary decomposition. There are pairwise orthogonal idempotents Pr,a∈k[Lr]⊆k[L1,…,Ln], indexed by r∈{1,…,n} and a∈Fp, with ∑a∈FpPr,a=1,Pr,aPr,b=δa,bPr,a, such that for every finite-dimensional kSn-module M the action of Pr,a on M is the projection onto the generalized eigenspace Mr,a={m∈M:(Lr−a)Nm=0 for N≫0}. The Pr,a for different r commute, and for each sequence i=(i1,…,in) with entries in Fp the products e(i):=∏r=1nPr,ir ∈ k[L1,…,Ln] are pairwise orthogonal idempotents with ∑ie(i)=1 and e(i)M=Mi, the simultaneous generalized weight space Mi={m:(Lr−ir)Nm=0 ∀r, N≫0}. Every Pr,a and every e(i) is fixed by the antipode g↦g−1 of kSn.

(ii) Content sums and blocks. The symmetric group Sn permutes the coordinates of sequences, and two sequences are called equivalent when they differ by a permutation, i.e. when they have the same content (the same multiset of entries of Fp). Write Cn=(Fp)n/Sn for the set of content classes (equivalently, multisets of n residues). For α∈Cn let Iα be the set of sequences representing α, and put eα:=∑i∈Iαe(i) ∈ kSn. Each eα is a central idempotent of kSn, and distinct eα are orthogonal; the nonzero eα are exactly the primitive central idempotents, that is the block idempotents of kSn (p-blocks from primitive central idempotents), and every block idempotent of kSn is of the form eα: this last identification of the content sums with the blocks is the block theorem of Lyle-Mathas and Brundan recorded as (2.41) in Kleshchev's survey (printed p. 14), with the content of the block being the content of any of its partitions. The present item proves centrality, idempotency, orthogonality, primitivity and exhaustiveness locally; the residue functors use the first three properties.

(iii) Residue-summand functors. For a finite-dimensional kSn-module M, a residue i∈Z/p and a content class α∈Cn−1, put eα,αi:=∑j∈Iαe((j,i)) = eα(n−1) Pn,i, where (j,i) denotes concatenation, eα(n−1)=∑j∈Iαe(j) is the content sum computed in kSn−1 and regarded in kSn through the inclusion kSn−1⊆kSn, and Pn,i∈k[Ln]. Each eα,αi is an idempotent of kSn commuting with kSn−1, the family {eα,αi}i∈Fp,α∈Cn−1 is a family of pairwise orthogonal idempotents with ∑i,αeα,αi=1, and EiM:=∑α∈Cn−1eα,αiM=⨁αeα,αiM is a kSn−1-submodule of the restricted module with Res⁡Sn−1SnM=⨁i∈Z/pEiM. Dually, for a finite-dimensional kSd-module M of content α∈Cd, i.e. M=eα(d)M, put FiM:=kSd+1 eα,αi⊗kSdM(i∈Z/p), with eα,αi=eα(d)Pd+1,i∈kSd+1; for a general finite-dimensional M, with the sum indexed by α∈Cd, put FiM:=⨁αkSd+1eα,αi⊗kSdeαM. Then Ind⁡SdSd+1M=⨁i∈Z/pFiM, and all the functors Ei,Fi are additive and exact, preserve finite-dimensionality, and commute with contragredient duality, because the projectors are fixed by the antipode. All statements hold at p=2; the construction is choice-free.

Facts & Assumptions

Given: A field k of characteristic p>0, an integer n≥1, and the Jucys-Murphy elements L1,…,Ln of kSn.

[F1]

The Lr commute pairwise, and Lr∈kSr commutes with kSr−1; in particular Ln commutes with kSn−1 (The Jucys-Murphy elements commute pairwise, The Jucys-Murphy elements of the symmetric group algebra).

[F2]

Over C, the joint spectrum of X1,…,Xn on the multiplicity-free sum ⨁λ⊢nSCλ of the complex Specht modules is the set of content vectors Cont⁡(T)=(cT(1),…,cT(n)) of the standard tableaux T of size n; for each T the vector vT spans a joint eigenspace with XkvT=cT(k)vT, the cT(k) are the contents of the node of T containing k, and T↦Cont⁡(T) is injective (The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors).

[F4]

Chinese remainder theorem for pairwise comaximal ideals: for a commutative ring R and pairwise comaximal ideals I1,…,Ir, the canonical map R→∏jR/Ij is surjective with kernel ⋂jIj=∏jIj; in particular the quotient R/∏jIj has orthogonal coordinate idempotents summing to 1. Representatives qj∈R may be chosen with qj≡δj,l modulo Il, but need not be idempotent in R (Chinese remainder theorem for pairwise comaximal ideals).

[F5]

Induction and restriction for group modules are Ind⁡SdSd+1M=kSd+1⊗kSdM and Res⁡SdSd+1N=kSdN (Restriction, induction, and coinduction); for the finite group Sd+1 and the subgroup Sd a coset transversal can be chosen as the set of least elements of the finitely many cosets for a fixed linear order of Sd+1, so kSd+1 is free as a right kSd-module (The group ring is free over a subgroup ring), and tensoring over kSd with a free right module preserves exactness.

[F6]

We use block idempotent to mean primitive central idempotent, as in p-blocks from primitive central idempotents. That supplier states the terminology for a splitting modular system; no such system is assumed here. The complete primitive central decomposition over the original arbitrary field is proved in step 6.2 below.

[F7]

Over every coefficient field the center is the set of symmetric polynomial evaluations in the Lr, by the integral class-sum triangular argument of Integral symmetric Jucys–Murphy polynomials span the center. This uses no division or splitting assumption.

[F8]

The standard polytabloids form a finite free integral Specht lattice whose specialization is the Specht module over every field (Integral Specht lattice and base change).

[F9]

Over C the finite group algebra is the product of matrix algebras on all irreducibles, so its regular representation is a direct sum of those irreducibles with finite multiplicities (If k is algebraically closed and char⁡k∤∣G∣, then k[G]≅∏i=1rMni(k)). The complex Specht list is the complete irreducible list in the construction underlying [F2].

Proof

technique · direct
1.1F2F9givenalgebra

Eigenvalues in Fp. Let hr∈Q[X] be the minimal polynomial of Lr acting on the left regular module QSn. Over C the regular module is the direct sum of the complex Specht modules with multiplicities, and by [F2] the eigenvalues of Lr on that module are the integers cT(r), the contents of the node containing r, over all standard tableaux T of n nodes; hence hr=∏a∈Er(X−a) is squarefree with the integer roots in the finite set Er. The group-basis coordinates of hr(Lr) are integers and vanish over Q, so this identity holds already in ZSn. Reduction of coefficients modulo p therefore gives hr(Lr)=0 in kSn, so the minimal polynomial fr of Lr on the regular module kSn divides the reduction hˉr=∏a∈Er(X−aˉ) in k[X], and every root of fr lies in the image Fp of Z in k.

1.2givenalgebra

Antipode invariance. The antipode σ:kSn→kSn, σ(g)=g−1, is an anti-automorphism fixing every transposition, hence fixes each Lr and therefore each Pr,a∈k[Lr] and each e(i).

1.3F1givenalgebra

An integral central identity. In ZSn one has ∏r=1n(u+Lr)=∑g∈Snuc(g)g, where c(g) is the number of cycles, including fixed points. To prove this by induction, regard Sn−1 as fixing n. A term multiplied by u leaves n fixed and adds one cycle. A term multiplied by (a,n) inserts n in the cycle containing a, without changing its cycle count. Conversely, deleting a nonfixed n from its cycle uniquely recovers the permutation in Sn−1 and the transposition used. Thus every permutation occurs exactly once. Comparing coefficients, each elementary symmetric polynomial Cs in L1,…,Ln is a sum of all permutations with n−s cycles and hence is central; the identity and centrality remain true after reduction to k.

2.1F4step 1.1algebra

Primary projectors. Write fr=∏a∈Fp(X−a)ma with ma≥0. For a≠b the ideals ((X−a)ma) and ((X−b)mb) of k[X] are comaximal, since two powers of distinct linear polynomials are coprime and Bezout gives 1=u(X)(X−a)ma+v(X)(X−b)mb. By [F4] applied to the ring k[X]/(fr) and its comaximal ideals, the canonical map k[X]/(fr)→∏a:ma>0k[X]/((X−a)ma) is an isomorphism; let εr,a be the preimage of the idempotent supported at the a-th factor when ma>0, and put εr,a=0 when ma=0. Then ∑aεr,a=1, εr,a2=εr,a, εr,aεr,b=0 for a≠b, and (X−a)maεr,a=0 in k[X]/(fr). Substituting the algebra element Lr for X (legitimate because fr(Lr)=0) gives elements Pr,a:=εr,a(Lr)∈k[Lr] with ∑aPr,a=1, Pr,aPr,b=δa,bPr,a and (Lr−a)maPr,a=0.

3.1step 2.1F1algebra

These are the primary projections. Let M be a finite-dimensional kSn-module. Since the Pr,a are polynomials in Lr, they commute with Lr and with one another; as 1=∑aPr,a one has M=∑aPr,aM, and (Lr−a)ma annihilates Pr,aM, so Pr,aM⊆Mr,a. Conversely, if m∈Mr,a, then (Lr−a)Nm=0 for N≥ma, and for b≠a the element Lr−b=(a−b)+(Lr−a) is invertible on the a-primary subspace because (a−b)∈k× and (Lr−a) is nilpotent there; from Pr,b(Lr−b)mb=0 we get Pr,bm=0 for b≠a, whence m=Pr,am. Thus Pr,aM=Mr,a and M=⨁aMr,a. The products e(i)=∏rPr,ir are idempotent, pairwise orthogonal and sum to 1 by multiplicativity of the Pr,a; applying the same argument successively to the commuting operators L1,…,Ln gives e(i)M=Mi.

4.1F4step 2.1step 3.1step 1.3algebra

Central CRT separates contents. Choose N≥1 such that (Lr−ir)Ne(i)=0 for every r and every tuple i, using step 2.1 and the finiteness of the indices. On the commutative algebra summand e(i)k[L1,…,Ln] with identity e(i), the commuting elements (Lr−ir)e(i) generate an ideal whose D-th power is zero for D=n(N−1)+1: every monomial of degree D has a factor with exponent at least N. Thus Cs−cs(i) belongs to that nilpotent ideal, where cs(i) is the elementary symmetric function of the residues. The tuple c(i)=(c1(i),…,cn(i)) determines the content, because ∏r(X−ir)=∑s=0n(−1)scs(i)Xn−s determines the multiplicities of its distinct linear factors, over every characteristic. In R=k[Y1,…,Yn], the distinct content tuples therefore define distinct pairwise comaximal maximal ideals mα=(Ys−cs(α):1≤s≤n); their powers mαD are also pairwise comaximal, since expanding 1=(a+b)2D−1 for a+b=1 places every term in one of the two D-th powers. By [F4], choose Qα∈R congruent to 1 modulo mαD and to 0 modulo every other mβD. The nilpotence just proved gives Qα(C1,…,Cn)e(i)=e(i) when i∈Iα, and 0 otherwise. Since the tuple idempotents sum to 1, it follows that Qα(C1,…,Cn)=∑i∈Iαe(i)=eα. This is central by step 1.3. Idempotency, pairwise orthogonality for distinct content classes, and ∑α∈Cneα=1 follow from step 3.1 and the partition of all tuples into their content classes.

5.1step 2.1step 3.1step 4.1F1F5algebra

The functor projectors. Fix i∈Fp and α∈Cn−1. The primary projectors for Lr, r<n, computed in kSn−1 agree with those in kSn: the primary idempotents in k[Lr] are uniquely determined by their congruences modulo the powers of the distinct linear factors of the minimal polynomial, and the inclusion preserves the polynomial relations of Lr. Summing once over each distinct sequence representing α gives eα,αi=∑j∈Iαe((j,i))=eα(n−1)Pn,i. By step 4.1 the first factor is central in kSn−1, while the second commutes with kSn−1 by [F1]; their product is therefore an idempotent commuting with that subgroup algebra. The sets {(j,i):j∈Iα} are disjoint for distinct pairs (α,i) and partition all tuples of length n. Consequently these idempotents are pairwise orthogonal and sum to 1, and their images are kSn−1-submodules. Grouping these actual direct summands by the last residue gives Res⁡M=⨁i∈FpEiM. The indexing is by content classes throughout, so no content is counted twice.

5.2step 4.1F7algebra

Every nonzero content summand has local center. Fix e=eα≠0. Since e is central, Z(ekSn)=eZ(kSn): an element central in the summand commutes with the complementary summand because their products vanish. By [F7] every element of this center is ef(L) for a symmetric polynomial f over k. For every i∈Iα, the difference (f(L)−f(i))e(i) belongs to the nilpotent ideal of step 4.1; symmetry makes f(i) the same scalar a=f(α) for all these tuples. The orthogonal sum of these differences is nilpotent with the common exponent D of that step. Hence every central element of the summand has the form ae+u with u nilpotent. The scalar a is unique: a nonzero scalar multiple of e is invertible in this nonzero summand and cannot be nilpotent. As the center is commutative, sums of commuting nilpotents and their products with any central element are nilpotent. Thus its nilpotents form an ideal, the scalar map is a surjective ring homomorphism onto k, and every element with nonzero scalar is invertible by the finite geometric series. The center is local over the original field k, without extending scalars.

6.1step 4.1step 5.1F5algebra

Induction side. The same computation with n replaced by d+1 shows that eα,αi=eα(d)Pd+1,i is an idempotent of kSd+1 commuting with kSd, that ∑i,αeα,αi=1 with pairwise orthogonal summands, and that kSd+1=⨁i,αkSd+1eα,αi; hence for any finite-dimensional M, kSd+1⊗kSdM=⨁i,αkSd+1eα,αi⊗kSdeαM=⨁iFiM, the middle step using M=⨁αeαM and the centrality of eα in kSd. This is Ind⁡M=⨁iFiM.

6.2step 5.2step 4.1F6algebra

Primitivity and exhaustiveness. A central idempotent b in ekSn has scalar 0 or 1 by step 5.2. In the first case b is nilpotent and idempotent, so b=0; in the second case e−b is nilpotent and idempotent, so b=e. Thus each nonzero eα is primitive central. Their orthogonal sum is 1 by step 4.1. Any primitive central idempotent b of kSn decomposes as ∑αbeα into orthogonal central idempotents; primitivity leaves exactly one nonzero term, and the primitivity of that eα forces b=eα. By [F6] these are precisely the block idempotents. At rank zero kS0=k and e(∅)=1 gives the unique block; restriction from rank zero is taken to be the zero functor, while induction to rank one has only residue 0. This convention does not invoke a group S−1.

7.1step 1.2step 5.1step 6.1F5algebra

Exactness and duality. Each Ei is a direct sum of the functors M↦eα,αiM; a map f:M→N of kSn-modules commutes with the action of the element eα,αi, so it restricts to a map eα,αiM→eα,αiN, and each such functor is exact as a direct summand of the identity, hence additive and finite-dimensionality preserving. Each Fi is a direct sum of the functors M↦kSd+1eα,αi⊗kSdeαM, which are direct summands of induction M↦kSd+1⊗kSdM; by [F5] kSd+1 is free as a right kSd-module, so induction, and with it each Fi, is exact, additive and finite-dimensionality preserving. For duality observe that eα,αi is fixed by the antipode by step 1.2, and that the standard nondegenerate pairing M×M∗→k satisfies (xm,f)=(m,x∗f); hence for finite-dimensional M the transpose of the projection on M is the projection on M∗ and (eα,αiM)∗≅eα,αiM∗, giving Ei(M)∗≅Ei(M∗). All these restriction-duality identifications are k-linear and natural.

7.2step 1.2step 5.1step 6.1F5algebra

Induction duality by a perfect coset pairing. Put G=Sd+1, H=Sd, and let πH:kG→kH retain the coefficients of the elements of H. For a finite-dimensional left kH-module M, with contragredient action (af)(m)=f(a−1m), define ⟨g⊗m,h⊗f⟩=f(πH(h−1g)m) between Ind⁡M and Ind⁡M∗. For a∈H, the kH-bimodule property of πH gives πH(h−1ga)=πH(h−1g)a and πH((ha)−1g)=a−1πH(h−1g); these identities prove balancing in the first and second tensor factors, respectively. Simultaneous left multiplication of g,h by any element of G leaves h−1g unchanged, proving G-invariance. On a finite left-coset transversal T one has πH(s−1r)=δs,r1 for r,s∈T. Thus the pairing is the direct sum of the perfect evaluations M×M∗→k and is perfect by [F5]. For e=eα,αi, right multiplication Re(g⊗m)=ge⊗m is a well-defined G-linear idempotent because e commutes with kH. Let τ:kG→k be the coefficient of 1; directly on group elements, τ(xy)=τ(yx). For every b∈H, the coefficient of b in ze equals τ(b−1ze)=τ(eb−1z)=τ(b−1ez), since e commutes with b. Therefore πH(ze)=πH(ez) for all z∈kG. Writing e∗ for its antipode image, step 1.2 gives e∗=e, so expansion in the group basis yields ⟨Re(g⊗m),h⊗f⟩=f(πH(h−1ge)m)=f(πH(eh−1g)m)=⟨g⊗m,Re(h⊗f)⟩. The two images of Re pair perfectly: a vector in either image annihilating the other annihilates the entire opposite space, since the opposite kernel is orthogonal to that image, and hence vanishes by perfectness. By tensor balancing, ge⊗m=ge⊗eαm, so these images are precisely kGe⊗kHeαM and kGe⊗kHeαM∗. Distinct eα,αi images are orthogonal by self-adjointness and projector orthogonality. Summing the perfect image pairings over α∈Cd proves the natural G-isomorphism Fi(M∗)≅Fi(M)∗; invariance supplies the contragredient action, and evaluation shows naturality in M. The construction uses finite transversals and holds over every characteristic, including 2.

8.1F2F8step 4.1step 6.2algebra∎

Partition content agrees with the block content. Let λ⊢n and let α be the multiset of its node contents reduced modulo p. Over C, [F2] makes every elementary symmetric Cs act on Sλ by the integer cs(λ). In the integral basis of [F8] the matrix of Cs−cs(λ) has integer entries and vanishes after tensoring with C, so it vanishes integrally and after specialization to k. Thus the CRT polynomial Qα(C1,…,Cn) of step 4.1 acts as 1 on Skλ, while the other content projections act as zero. The same is true on its nonzero subquotients. Hence any simple module obtained from this Specht module belongs to the block eα, establishing the stated content dictionary without a splitting-field descent or a reduced interpolation denominator.

Remarks

For every symmetric polynomial f over C the evaluation f(X1,…,Xn) is a central element of C[Sn] (Symmetric polynomials in the Jucys-Murphy elements give exactly the centre).

  • The correct invariant idempotents. Individual primary idempotents e(i) do not in general commute with Sn−1; the elements that commute with Sn−1 and carry the residue decomposition are the content sums eα(n−1) and the functor idempotents eα,αi=eα(n−1)Pn,i of step 5.1. All statements and proofs above use only the latter, so the residue-summand functors are well defined.
  • Why the eigenvalues are in Fp. Step 1.1 reduces the characteristic-p minimal polynomial of Lr to the squarefree integer polynomial with roots the tableau contents; this is the place where the published complex joint-spectrum theorem enters, and it is also why no algebraic closure of k or splitting hypothesis is needed anywhere in the construction.
  • Choice. The only transversals used are the finite ones of [F5], chosen by least elements; no choice principle is used.
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6.1-sol)Open item page →

Residue signatures, normal, good, conormal and cogood nodes

Definition

Let p be a prime and let μ be a p-restricted partition, so that μi−μi+1<p for all i≥1 (p-regular and p-restricted partitions, Partitions, English diagrams, and conjugation). A node (r,c) of the Young diagram [μ] is an i-node if its residue res⁡(r,c):=c−r mod p equals i∈Z/p; the i-nodes of μ are its addable and removable nodes of residue i (Removable and addable nodes).

The reduced i-signature. Fix i∈Z/p and list the i-nodes of μ as A1,…,An from top to bottom, that is, in increasing row index and, for equal row index, in increasing column index. Form the word σ=(σ1,…,σn) with σm=+ if Am is addable and σm=− if Am is removable. Whenever r<s, σr=−, σs=+ and σr+1=⋯=σs−1=0, replace σr and σs by 0; repeat until no − lies to the left of a +. The resulting reduced i-signature has the form +⋯+−⋯− with the zeros deleted, and the nodes attached to its signs are:

  • the normal i-nodes of μ are the removable nodes corresponding to the − signs of the reduced signature;
  • the good i-node is the topmost (first listed) of the normal i-nodes;
  • the conormal i-nodes of μ are the addable nodes corresponding to the + signs of the reduced signature;
  • the cogood i-node is the bottommost (last listed) of the conormal i-nodes.

Write εi(μ) and φi(μ) for the numbers of normal and of conormal i-nodes of μ; the good i-node exists exactly when εi(μ)>0, and the cogood i-node exactly when φi(μ)>0. At most one good and at most one cogood i-node occur, for each residue.

Well-definedness. Each reduction step deletes two nonzero entries, so any sequence of steps terminates after at most ⌊n/2⌋ steps, and in the resulting word no − lies to the left of a +: otherwise, take two nonzero entries that are consecutive among the nonzero entries of the current word and are ordered −, +; all entries strictly between them are 0 by the choice, so the pair would still be reducible. Hence, after deleting the zero entries, a terminal word is +a−b for some a,b≥0; cancelled positions remain in their original places and need not form a contiguous block. The terminal word does not depend on the order in which reducible pairs are chosen: two reducible pairs cannot overlap partially, because an endpoint of one pair lying strictly inside the other would be a nonzero entry in a position that the other pair requires to be 0, and pairs sharing exactly one endpoint would similarly place a nonzero entry strictly inside the other pair; so any two reducible pairs are either disjoint (and the corresponding steps commute) or equal, there are no critical pairs, and the rewriting relation is locally confluent. Uniqueness follows by induction on the number of nonzero entries. A terminal word admits no step. Otherwise, two distinct first steps commute and reach a common word after one further step each. All these successor words have fewer nonzero entries, so the induction hypothesis identifies their terminal words. Thus any two reduction sequences have the same terminal word; in it the first surviving − and the last surviving + are unique positions whenever they exist. Thus the reduced signature, the sets of normal and conormal nodes, and the good and cogood nodes are well defined. The empty partition has the unique addable node (1,1), of residue 0, and no removable nodes. Its 0-signature is (+) and its other signatures are empty. Thus εi(∅)=0 for every i, φ0(∅)=1, and φi(∅)=0 for i≠0. It has no good node and its cogood 0-node is (1,1).

Convention warning. Brundan's ℓ-residue r−c is the negative of our c−r. His normal and good removable nodes (§§2.2–2.4) are the same nodes on the same partition as ours, with residue names negated. Indeed, a minus survives our cancellation exactly when each prefix of the boundary word strictly below it has at least as many minuses as pluses. Brundan's lattice test expresses these inequalities after the noncorner entries common to his demand and support sets are removed, as in Remark 2.4(I). Remark 2.4(II) compares his convention with Kleshchev's older convention on the transpose; it does not identify our nodes with Brundan-normal nodes on the transpose. Transposition and residue negation must therefore be tracked separately (Removable and addable nodes, Partitions, English diagrams, and conjugation).

Remarks

  • Zero entries are not nodes. The zeros of the word record cancelled places and carry no node; only the surviving signs are attached to nodes, as in the definition of the normal, good, conormal and cogood nodes.
  • Why p-restrictedness is assumed. The nodes and their residues are defined for every partition, but the definition is applied on this page to the p-restricted labels, for which the good-node machinery matches the modular branching rules of the dual-Specht convention used throughout.
  • At most one sign of each outer type. In the zero-suppressed reduced word +a−b the first surviving − (if b>0) and the last surviving + (if a>0) are unique places, which is the content of the final assertion.
  • Choice. The definition and the well-definedness argument use only finite lists and a finite reduction; no choice principle is used.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Finite-group induction is coinduction, hence biadjoint to restriction

Statement

Let H≤G be finite groups and let k be any field. For every left kH-module M the map ΦM: Ind⁡HGM=kG⊗kHM⟶Coind⁡HGM=Hom⁡kH(kG,M),ΦM(g⊗m)(x)={(xg)m,xg∈H,0,xg∉H, is a natural isomorphism of kG-modules (Restriction, induction, and coinduction). Consequently Ind⁡HG≅Coind⁡HG naturally, so induction is both a left and a right adjoint of restriction (Induction and coinduction are the two adjoints) and is exact. No hypothesis on the characteristic of k, on splitting fields, or on the prime 2 is needed, and the argument is choice-free: it uses only the finite selection of least representatives of the finitely many left cosets.

Facts & Assumptions

Given: Finite groups H≤G, a field k, a left kH-module M, and a set T⊆G containing exactly one representative of each left coset gH (a left transversal), chosen as the set of least elements for a fixed linear order of G.

[F1]

Ind⁡HGM=kG⊗kHM is the tensor product of the (kG,kH)-bimodule kG with M, with g⋅(x⊗m)=gx⊗m; the elements of G form a k-basis of kG, and the defining relations are xh⊗m=x⊗hm for h∈H. The coinduced module Coind⁡HGM=Hom⁡kH(kG,M) consists of the k-linear maps φ with φ(hx)=hφ(x) for all h∈H, x∈G, with (gφ)(x)=φ(xg) (Restriction, induction, and coinduction).

[F2]

Induction is left adjoint and coinduction is right adjoint to restriction (Induction and coinduction are the two adjoints).

[F3]

kG is free as a right kH-module on any left transversal, so kG⊗kH−, that is induction, preserves exactness; a supplied transversal is the only choice input (The group ring is free over a subgroup ring).

[F4]

Every element of G is uniquely th with t∈T, h∈H, and G is the disjoint union of the cosets gH, g∈G; H is a finite group and every product in kG is a finite sum.

Proof

technique · direct
1.1givenF1

ΦM is a well-defined kG-linear map. For fixed g,m the formula defines a function on G: if xg∈H then (xg)m∈M, otherwise 0. It is k-linear in x by definition, and it is kH-linear: for h∈H and x∈G, ΦM(g⊗m)(hx)=((hx)g)m if hxg∈H and 0 otherwise; since hxg=(hx)g and hxg∈H  ⟺  xg∈H (as h,h−1∈H), this equals h((xg)m)=hΦM(g⊗m)(x) in the first case and 0 in the second. Hence ΦM(g⊗m)∈Coind⁡HGM. The map is k-linear and in the second tensor variable balanced: for h∈H, the functions ΦM(gh⊗m) and ΦM(g⊗hm) both send x to ((xg)h)m=(xg)(hm) when xg∈H and to 0 otherwise; so ΦM is well defined on the tensor product. Finally it is kG-linear: ΦM(g0g⊗m)(x)=((xg0)g)m if xg0g∈H and 0 otherwise, and (g0ΦM(g⊗m))(x)=ΦM(g⊗m)(xg0)=((xg0)g)m if xg0g∈H and 0 otherwise, the two conditions being the same.

1.2givenF1F4

The inverse on coinduced maps. For φ∈Coind⁡HGM, define ΨM(φ)=∑t∈Tt⊗φ(t−1). This is a finite sum and a k-linear map. Inverting the left cosets tH shows that the right cosets Ht−1 partition G. If a representative is replaced by t′=th with h∈H, then t′⊗φ(t′−1)=th⊗φ(h−1t−1)=th⊗h−1φ(t−1)=t⊗φ(t−1), by kH-linearity and the balancing relation. Thus the inverse formula is independent of the finite transversal.

2.1step 1.1step 1.2F1F4

ΦMΨM=id. For x∈G, there is exactly one t0∈T for which x∈Ht0−1, equivalently xt0∈H. Write x=ht0−1. Then ΦM(ΨM(φ))(x)=∑t∈T, xt∈H(xt)φ(t−1)=hφ(t0−1)=φ(x), using the right-coset partition from step 1.2 and kH-linearity. Equality on the group basis gives equality on kG.

2.2step 1.1step 1.2F1F4

ΨMΦM=id. For g∈G and m∈M, write uniquely g=t0h with t0∈T and h∈H. Then ΨM(ΦM(g⊗m))=∑t∈T, t−1g∈Ht⊗(t−1g)m=t0⊗hm=g⊗m, by the left-coset partition and tensor balancing. Since such elementary tensors span the induced module, this proves the second inverse identity.

3.1step 2.1step 2.2F2F3∎

Naturality and consequences. If f:M→M′ is a kH-map, then for all g,m,x one has ΦM′(g⊗f(m))(x)=f(ΦM(g⊗m)(x)), because the formula is evaluated by multiplication in M or M′ and f is linear; hence Φ is a natural transformation, and by steps 2.1 and 2.2 each ΦM is an isomorphism with natural inverse ΨM. Therefore Ind⁡HG≅Coind⁡HG as functors, and [F2] yields that induction is both a left and a right adjoint of restriction: the left adjunction is its induction adjunction, and the right adjunction is transported across this natural isomorphism from the coinduction adjunction. Induction kG⊗kH− is right exact, and coinduction Hom⁡kH(kG,−) is left exact; a natural isomorphism between the two functors therefore makes induction exact, in agreement with the freeness of kG over kH recorded in [F3]. No hypothesis on k, on characteristic, or on splitting is used, and the only selection made is the finite transversal T of least representatives.

Remarks

  • Freyd's adjoint functor heuristics. The isomorphism is the finite-group relative Frobenius map; it is the reason the modular branching page can use the biadjunction of restriction, and the two adjunctions are not identified by hand: the right adjunction is obtained by transporting the coinduction adjunction along Φ.
  • Finiteness of G/H is what is used. The argument needs the finiteness of T in step 1.2 and the total vanishing of all but one term in steps 2.1 and 2.2; for infinite G/H these fail in general. The finite transversal is selected by least elements, so no choice principle enters.
DefinitionDefinition: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Good-node deletion and cogood-node addition operators

Definition

On the set of p-restricted partitions (p-regular and p-restricted partitions) define partial operators e~i,f~i for i∈Z/p by e~iμ:=μ∖Aif εi(μ)>0, where A is the good i-node of μ (Residue signatures, normal, good, conormal and cogood nodes), the operator being undefined on μ when εi(μ)=0; and f~iμ:=μ∪Bif φi(μ)>0, where B is the cogood i-node of μ, the operator being undefined on μ when φi(μ)=0. Then μ=f~iν⟺ν=e~iμ for all p-restricted μ,ν; in particular e~i and f~i are mutual inverses on their domains, each e~i lowers the rank by one and each f~i raises the rank by one, and at most one good and at most one cogood node exist in each residue. No module-theoretic statement is made here: this item is pure combinatorics, and the identification of these operators with the crystal operators of the level-one Fock space is a theorem of the later Fock-space page, not an input here.

Facts & Assumptions

Given: A prime p, a residue i∈Z/p, and p-restricted partitions μ,ν of ranks d and d−1.

[F1]

For a p-restricted partition λ the i-signature is the word in {+,−} read off the addable and removable i-nodes ordered top to bottom, and its reduced form, after deleting zero entries, +a−b is well defined; the good i-node of λ is the removable node of the first surviving −, the cogood i-node is the addable node of the last surviving +, and εi(λ),φi(λ) are the numbers of surviving − and + signs (Residue signatures, normal, good, conormal and cogood nodes).

[F2]

Let λ be p-restricted and X=(r,λr) a removable i-node. On deleting X, only boundary nodes in rows r−1,r,r+1 can change. A newly removable node in row r−1 occurs only when λr−1=λr, and has residue i+1; a newly removable node (r,λr−1) has residue i−1. The former row-r addable node has residue i+1. A row-(r+1) addable node is lost only when λr−λr+1=1, and then has residue i−1. These residues are different from i for every prime p≥2. Thus the only change to an i-boundary node is that X changes from removable to addable: Rem⁡i(λ∖X)=Rem⁡i(λ)∖{X} and Add⁡i(λ∖X)=Add⁡i(λ)∪{X}. This follows directly from the row inequalities in Removable and addable nodes; it does not assert that every boundary node in row r+1 is retained.

[F3]

The reduction of a signature word is confluent, and the zero-suppressed normal form +a−b can be computed by scanning the word from left to right, pushing each non-cancelled − on a stack and letting each + cancel the top − of the stack if the stack is nonempty, and surviving otherwise; the surviving signs in their original order are exactly the normal form (Residue signatures, normal, good, conormal and cogood nodes).

[F4]

If λ is a partition and X a removable node of λ, then λ∖X is a partition, and λ∪Y is a partition for every addable node Y of λ; the restricted condition compares the consecutive differences λa−λa+1 with p (p-regular and p-restricted partitions, Removable and addable nodes).

Proof

technique · direct
1.1givenF3

The stack algorithm computes the normal form. The stack algorithm of [F3] terminates with a word containing no − before a + (a surviving − stays on the stack and blocks the stack from being empty, so no later + survives after it), and the reduction relation is confluent by [F3], so the surviving signs read in order are the reduced signature with zero entries deleted, +a−b; in particular the good node corresponds to the first surviving − and the cogood node to the last surviving +.

1.2givenF2

Comparison of the i-words. Let μ be p-restricted and X a removable i-node of μ; put ν:=μ∖X. By [F2] the i-nodes of ν are obtained from those of μ by removing X from the removable list and inserting X into the addable list, all other i-nodes and their top-to-bottom order being unchanged; hence the i-signature words of μ and ν have the same length and the same entries except at the position p of X, where the word of μ has − and the word of ν has +.

2.1step 1.1F3

First surviving − versus last surviving +. Let w be a signature word with wp=−, let w′ be w with the entry at p changed to +, let u be the prefix of w strictly before p, and let s be the suffix strictly after p. We prove that p is the position of the first surviving − of w if and only if p is the position of the last surviving + of w′. Let S be the stack of [F3] after scanning u; the prefix of w′ before p is the same word u, so the same stack S is present there. If S is nonempty, let q be its bottom entry; scanning w further, q can leave the stack only by being cancelled by a + that has first cancelled every entry above it, in particular the entry at p, so either q survives, giving a surviving − before p, or the entry p is cancelled before q and does not survive; in both cases p is not the first surviving − of w. Similarly, scanning w′ the entry at p is a +, which survives only if the stack just before it is empty, so if S is nonempty then p does not survive and is not the last surviving + of w′. Hence both events force S to be empty, and we may assume this. With S empty, push the − at p in the scan of w; while this entry is alive, the pending entries above it after scanning a prefix q of s are the − signs of q not yet cancelled, and since no + has yet occurred at height 0, that number is #−(q)−#+(q). Consequently p is cancelled at the first + of s whose preceding prefix q has #+(q)=#−(q), and such a + exists if and only if some prefix q of s has #+(q)>#−(q): counts change by one at each symbol, so a strict surplus arises only across a step of equality, and conversely a prefix with equality followed by a + would create a strict surplus. Thus, with S empty, the entry at p survives in w if and only if (C)#+(q)≤#−(q)for every prefix q of s. In w′, the + at p arrives at the empty stack S and survives; after it, a later + of s survives exactly when the stack is empty at its arrival. If (C) holds and a + of s survived, with preceding prefix q, then all − of q were cancelled, so #−(q)≤#+(q), while (C) applied to the prefix q extended by that + gives #+(q)+1≤#−(q), a contradiction; hence no later + survives. Conversely, if (C) fails then some + of s survives: the stack height after a prefix q of s equals #−(q)−#+(q)+c(q), where c(q) is the number of + signs of q that survived, as one checks by induction on the length of q (a − raises the height, and a + raises c by one and lowers the height by one exactly when it cancels); if no + of s survived then c(q)=0 for every prefix q, so #+(q)≤#−(q) for every prefix, contradicting the failure of (C). Therefore (C) holds if and only if, in w′, the entry at p is the last surviving +, and the claim follows.

3.1step 1.2step 2.1F1

Good versus cogood for a removable node. Let μ be p-restricted, X a removable i-node of μ and ν=μ∖X, assumed p-restricted. By step 1.2 the words of μ and ν differ exactly by the flip at the position of X, so step 2.1 gives: X is the good i-node of μ if and only if X is the cogood i-node of ν. Consequently, if εi(μ)>0 and X is the good i-node, then φi(ν)>0 with cogood node X, and f~i(ν)=ν∪X=μ.

3.2step 1.2step 2.1F4given

Removing the good node preserves restrictedness. Let μ be p-restricted and let A=(r,μr) be its good i-node; we show that ν=μ∖A is p-restricted. If r≥2 and μr−1−μr=p−1, then B:=(r−1,μr−1) is a removable node of μ (as μr−1>μr) with res⁡(B)=μr−1−(r−1)=μr−r+p≡μr−r=res⁡(A), so B is a removable i-node above A and hence occurs before A in the i-word. There is no i-node between B and A: these are consecutive rows, and any addable node in either row has residue i+1. Thus B is still on the stack when A is pushed. Either some − before A survives, and then A is not the first surviving −, or every − before A is eventually cancelled, in particular B; but a + cancels B only after cancelling every entry pushed after B, in particular the entry at A, so in that case A is cancelled and does not survive; both alternatives contradict that A is good. Hence μr−1−μr≤p−2, and then ν is p-restricted: deleting the last node of row r leaves (μr−1)−μr+1≤p−2<p and, if r≥2, μr−1−(μr−1)=(μr−1−μr)+1≤p−1<p, while all other consecutive differences are unchanged.

3.3step 1.2step 2.1F4given

Adding the cogood node preserves restrictedness. Let μ be p-restricted and let B=(r,μr+1) be its cogood i-node; we show that ν=μ∪B is p-restricted. Suppose first that μr−μr+1=p−1; then D:=(r+1,μr+1+1) is an addable i-node of μ, because μr>μr+1 and res⁡(D)=μr+1−r≡μr+1−r=res⁡(B); between B and D in the top-to-bottom order there is no i-node: the entries after B in row r do not exist, and the remaining i-node of row r is the removable node (r,μr), whose residue is res⁡(B)−1, while the addable node of row r+1 is D itself. Hence B and D are consecutive in the i-word, both with sign +. If the + at B survives, it leaves the stack empty, so the next entry, the + at D, also survives and is later than B; if the + at B does not survive, then B is not the cogood node. In both cases B is not the last surviving +, contradicting that B is cogood. Hence μr−μr+1≤p−2, and then (μr+1)−μr+1≤p−1<p, while μr−1−(μr+1)=(μr−1−μr)−1<p for r≥2 (no row above change is needed when r=1), and all other differences are unchanged; so ν is p-restricted.

4.1step 3.1step 3.3F1

Good versus cogood for an addable node. Let Y be the cogood i-node of the p-restricted partition μ and ν:=μ∪Y. Step 3.3 makes ν p-restricted, so step 3.1 applies. The node Y is removable in ν, and μ=ν∖Y; applying step 3.1 to the pair (ν,Y) gives: Y is the good i-node of ν if and only if Y is the cogood i-node of μ. Consequently, if φi(μ)>0 and Y is the cogood i-node, then εi(ν)>0 with good node Y, and e~i(ν)=ν∖Y=μ.

5.1step 3.1step 3.2step 3.3step 4.1

The inverse property. Let μ,ν be p-restricted partitions. If ν=e~iμ, then εi(μ)>0, ν=μ∖A for the good i-node A of μ, and step 3.1 gives that A is the cogood i-node of ν, so that f~iν=ν∪A=μ. Conversely, if μ=f~iν, then φi(ν)>0, μ=ν∪B for the cogood i-node B of ν, and step 4.1 gives that B is the good i-node of μ, so that e~iμ=μ∖B=ν. Hence μ=f~iν  ⟺  ν=e~iμ for all p-restricted μ,ν, both sides being false when the relevant node does not exist; and by steps 3.2 and 3.3 the operators map p-restricted partitions to p-restricted partitions.

6.1step 5.1F1∎

Conclusion. By [F1] at most one good and at most one cogood i-node exist in each residue, so the partial operators are well defined; removing a node lowers the rank by one and adding a node raises it by one, so e~i lowers and f~i raises the rank by one; and by step 5.1 each operator is defined at exactly the images of the other, so they are mutual inverses on their domains. No module theory and no choice principle are used.

Remarks

  • The word comparison is where the geometry enters. Step 1.2 is the only place where the partition structure is used; the reduction of a general word does not behave this way, so the inverse property is a theorem about the i-words of partitions, not a formal property of the cancellation procedure.
  • One-sided cancellation. The reduction cancels only −+ pairs, so a reduced word may contain both a surviving + before a surviving −, as in the reduced signatures (+,−) appearing on the companion page.
  • Choice. Everything is finite and explicit; no choice principle is used.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

An integral essential-subset basis and count for type-A root intervals

Statement

Let F have characteristic p>0, let N≥2, and let μ=(μ1≥⋯≥μN≥0) be a polynomial highest weight. Let LN(μ) be the nonzero Schur Weyl-cell simple at q=1, regarded as a left module by star, with its canonical highest vector v. Put ai=μi−μi+1. For every 1≤r≤s<N, define B(i,j)=j−i+∑t=ijat and C(i,j)=j−i+∑t=ij−1at, reduced modulo p for zero tests. A matching is an injection d with x≤d(x); it need not preserve order between different sources. Call J⊆(r,s] essential when no t<u outside J in [r,s+1] admits a zero-B matching {t}∪(J∩(t,u))→[t,u). Write εa(r,s) for the number of essential sets.

The vectors Tr,s(J)v constructed by the explicit integral coefficient recursion in the proof, indexed by essential J, form a basis of LN(μ)μ−αr−⋯−αs. In particular this weight-space dimension is εa(r,s), including dimension zero. The construction has integer-polynomial coefficients, and its positive-word pivots remain valid in every field of characteristic p.

Define a root x to be normal in [x,y] when ax≠0 and its demands m>x with B(x,m)=0 admit an injection z satisfying x<z(m)≤m and B(z(m),m)=0. If r is not normal set νa(r,s)=0; otherwise let it be the number of x∈[r,s] normal in [x,s] with C(r,x)=0. Set εa′(r,t)=εa+ωt(r,t), where only coordinate t is increased by one. Then, as ordinary integers, εa(r,s)=νa(r,s)+∑u=r+1sεa′(r,u−1)νa(u,s). No restrictedness condition is imposed on μ or on the shifted auxiliary highest weights.

Facts & Assumptions

Given: F,N,μ,r,s as in the statement, with the finite integer root intervals and modulo-p zero tests just defined.

[F1]

The actual Schur algebra is the endomorphism algebra of the sum of permutation modules and has its dominance cellular semistandard basis and Weyl cell modules, with canonical diagonal tableau element the projection onto its permutation summand (The type-A q-Schur algebra and its Weyl modules). We use this basis and its cell-product definition, not a characteristic-zero highest-weight realization.

[F2]

The cell rank-one multiplication implies that a nonzero form quotient is simple, remains simple on scalar extension, and that the nonzero cell quotients cover all simple modules (Cellular bases and cell modules, Nonzero cell heads classify the simple modules of a cellular algebra). The local argument below proves the needed highest-vector, polynomial-matrix and weight-spanning properties explicitly.

Proof

technique · direct
1.1F1F2construct

Extend only to K=F(t). This field is infinite, and extension preserves the rank of every finite Gram matrix. A nonzero Schur cell-form quotient stays simple after this extension: in any field a vector outside its radical generates the entire cell module by the cellular rank-one action, and the same argument applies to the extended nonzero Gram form. No algebraic closure or infinite-choice step is required.

2.1step 1.1construct

At q=1, identify ⨁νMν with the tensorword basis of (KN)⊗m,m=∣μ∣, by sending mνTd to the word whose jth letter is the row containing entry j in the row-standard tableau tνd. This is the explicit right-coset/tensorword convention; for regular type and basis d, that letter is jd−1 under right permutation notation. The symmetric-group action on tensor positions is transported through this map, so inverses in labels and right-position actions are fixed consistently. The symmetric group permutes the tensor positions. An endomorphism commuting with this permutation action has matrix coefficients constant on its orbits on pairs of words. Such orbits are indexed by nonnegative integer matrices A=(Aab) with ∑Aab=m, recording the number of positions with input b and output a. Let EA be the matrix with entry 1 on that orbit and 0 elsewhere. The EA have disjoint support and form a basis of the endomorphism algebra. For a matrix g, g⊗m=∑A(∏abgabAab)EA. The transpose involution sends EA to EAT; it is precisely the q=1 Schur star (the corresponding semistandard Hom maps are transposes under the orthonormal tensorword/permutation forms).

3.1step 2.1construct

Invertible-matrix evaluations span this Schur algebra over K. Indeed a linear functional annihilating all g⊗m gives a polynomial P(g)=∑AcAgA vanishing whenever det⁡(g)≠0. Then Pdet⁡ vanishes at every matrix over K. An elementary induction on the number of variables shows that a polynomial over an infinite field vanishing everywhere is zero: regard it as a polynomial in the last variable and use infinitely many values, then apply the induction to its coefficients. Thus Pdet⁡=0 as a polynomial, and the polynomial domain gives P=0, so all cA vanish. Finite-dimensional duality proves the spanning claim. Consequently the star-converted Schur simple is a simple rational left GL⁡N-module, with the same submodules and composition multiplicities as the right Schur module.

4.1step 3.1construct

The canonical semistandard tableau has weight μ and Schur form value 1. Indeed its diagonal Schur basis element is the projection onto the permutation summand Mμ: the defining Hom map is the identity there and zero on the other summands. Its square is itself, so the defining cell-product coefficient, which is the canonical tableau norm, is 1. This argument uses the canonical diagonal projection only, not an idempotence assertion for all diagonal tableau elements. Every semistandard tableau weight ν is dominated by μ: for each k, all entries ≤k occur in the first k rows by column strictness, so there are at most μ1+⋯+μk of them. The unique tableau of weight μ is the canonical one. Thus L has highest weight μ with one-dimensional highest space Kv, and its positive upper unipotent group fixes v: any nonconstant positive-root coefficient would have weight strictly above μ. Torus weights are integer characters, distinct as Laurent monomials over K; no Lie-eigenvalue congruence substitutes for weight equality.

5.1step 4.1construct

On the open set where leading principal minors are nonzero, Gaussian elimination gives g=u−du+. The negative-unipotent coefficient operators on v span L. To see this, let W be their span and let ℓ annihilate W. Then ℓ(gv)=0 on that open set because u+v=v and dv is a scalar multiple of v. A polynomial matrix coefficient vanishing there vanishes identically by the same polynomial-identity argument, so ℓ annihilates the coefficient orbit of v under all GL⁡N. That orbit spans L by simplicity. Hence W=L.

6.1step 5.1construct

Positive coefficient operators detect every nonzero vector x of weight μ−γ. If they all had zero highest coefficient on x, the Gaussian factorization would imply that the highest coefficient of gx was zero on the same open set: negative operators cannot raise a weight to μ, and no weight exceeds μ. The resulting polynomial identity would make that coefficient zero on the whole simple-module orbit of x, which spans L and contains v, a contradiction. Thus some positive coefficient operator of weight γ raises x to a nonzero multiple of v.

7.1step 6.1construct

For γ=α(r,s), every simple-root coefficient is 1. In a product expansion of a unipotent matrix, any monomial of total root weight γ therefore has each root-variable exponent 0 or 1, and its roots are pairwise disjoint intervals covering [r,s]. They are exactly cut partitions of that interval. Put fa,b=Eb+1,a,ei=Ei,i+1,Yr,s(U)=fr,u1−1fu1,u2−1⋯fuk,s, for U={u1<⋯<uk}⊂(r,s], with Y(∅)=fr,s. These words span the required negative coefficient space. Similarly the positive coefficient space is spanned by words using each er,⋯ ,es once. Root-matrix commutators expand every longer positive root into such simple words. Permutations of these simple letters are identified using eiej=ejei for ∣i−j∣>1; their relative orders on adjacent pairs determine the canonical representative Qr,s(I)=eik⋯ei1⋅∏j∈[r,s]∖Iincreasingej,I={i1<⋯<ik}⊂(r,s]. Every word is carried to this representative by exchanging adjacent incomparable letters in the corresponding path partial order. Hence these Q words span all positive tests at the interval weight. There are no divided powers greater than 1 or factorial denominators in this grade.

8.1step 7.1construct

The actions and all commutator calculations below use [Eab,Ecd]=δbcEad−δdaEcb,eiv=0, and (Eii−Ei+1,i+1)v=aiv. They are integral matrix identities and apply to the actual Schur module. The construction descends from K to F because the resulting matrices have entries in F and scalar extension preserves all ranks and linear relations.

9.1step 8.1construct

For M,U⊂(r,s], define ζr,s(M,U) recursively. For M=∅,ζ(∅,U)=∏j∈(r,s]∖UC(r,j). For M≠∅ let m=min⁡M and M′=M∖{m}. If m∉U, put ζ(M,U)=ζ(M′,U)/C(r,m). If m∈U, put ζ(M,U)=[ζ(M′,U)−ζr,m−1(∅,U∩(r,m))ζm,s(M′,U∩(m,s])]/C(r,m). Every division here is performed in the integer polynomial ring before specialization. It is exact. To prove this, induct on ∣M∣, keeping the stronger statement that ζ(M,U)=ζr,m−1(∅,U∩(r,m))P(C(r,m)), where P is an integer polynomial in the remaining differences independent of r and of U∩(r,m). At the next smallest cut, use C(r,j)=C(r,m)+C(m,j). If m∉U, the numerator contains the explicit factor C(r,m). If m∈U, the two terms are respectively evaluations P(C+D) and P(D), multiplied by the same left factor, with C=C(r,m); their difference is divisible by C, since (C+D)h−Dh=C∑a=1h(ha)Ca−1Dh−a. This gives the stronger factorization at the next step. The base case is the displayed product. Thus all coefficients are integer polynomials even when their displayed denominators vanish modulo p.

10.1step 9.1construct

Define Tr,s(M)=∑Uζr,s(M,U)Yr,s(U). The coefficient recursion is equivalently the exact negative-word recursion C(r,m)Tr,s(M)=Tr,s(M′)−Tr,m−1(∅)Tm,s(M′). (T) This follows by separating cut words according to whether the cut m occurs. Products of adjacent interval words concatenate with the boundary cut present; this is exactly the cut-word product in the numerator.

11.1step 10.1construct

The following splitting identity is integral: Tr,i−1(E)Ti,s(F)=Tr,s(E∪F)−Tr,s((E∖{e})∪{i}∪F)−C(e,i)Tr,s(E∪{i}∪F),(P) where E⊂(r,i),F⊂(i,s],e=max⁡E. If E=∅ omit the middle term and set e=r. For E=∅ this is (T) rearranged at cut i. For nonempty E, remove its smallest m, insert (T) on the left and apply the induction to the two shorter products. Use C(r,i)=C(r,m)+C(m,i). The terms containing the extra cut m cancel in pairs, and the remaining numerator is C(r,m)[T(E∪F)−T((E∖{e})∪{i}∪F)−C(e,i)T(E∪{i}∪F)]. Exact divisibility already proved permits cancellation in the integer polynomial ring; reduction to F is made only afterwards. This proves (P) by induction, including the singleton E case.

12.1step 11.1construct

Order subsets by their largest differing element, with the subset containing that element larger. Complements reverse this order. The transition from T(M) to Y(U) is unit triangular: Tr,s(M)=Yr,s((r,s]∖M)+∑U<(r,s]∖McUYr,s(U). (U) Here is an explicit induction. First (T), descending on j, gives Tr,s([j,s])=∑U⊂(r,j)(∏d∈(r,j)∖UC(r,d))Yr,s(U). For j=s+1 this is the defining empty-M product; to pass to j subtract Tr,j−1(∅)Tj,s([j+1,s]) in (T). The terms with cut j cancel, leaving the indicated sum divided by the common factor C(r,j). At j=r+1 this gives T((r,s])=Y(∅). For any other M choose i∉M, split M=E∪F around i, and rearrange (P). The product of the two shorter leading Y words is the cut word for the complement of M, with coefficient 1. The two other T terms have strictly larger M, hence strictly smaller complementary leading cuts. Induct on interval length and then downward on M. This proves (U). Therefore the T words span precisely the same interval negative coefficient space as the Y words.

13.1step 12.1construct

If J has consecutive components [β1,γ1],⋯ ,[βq,γq], matrix commutation and (T) give, for i<s,eiTr,s(J)v=0 unless i=βa−1 for some a; eβa−1Tr,s(J)v=−Tr,βa−2(J∩(r,βa−1))Tβa,s((βa,γa]∪⋃b>a[βb,γb])v. (X) Empty prefix operators are interpreted as 1. The endpoint action, with h=max⁡J, is esT(J)v=Tr,s−1(J∖{h})v+B(h,s)Tr,s−1(J)v if h<s; esT(J)v=Tr,s−1(J∖{s})v if h=s; esT(∅)v=B(r,s)Tr,s−1(∅)v. (E)

14.1step 13.1construct

These formulas follow directly as follows. In the empty-J expansion, group Y words by membership of i and i+1 in their cuts. The coefficient of each residual word cancels through −C(r,i+1)+C(r,i)+(ai+1)=0 for i<s. At the endpoint the two contributions are C(r,s) and as, whose sum is B(r,s), giving (E). For general J, remove m=min⁡J in (T). For i<m−1 the empty-prefix cancellation is unchanged. At i=m−1, the first term has zero action; on the product term the empty-prefix endpoint coefficient is B(r,m−1)+1=C(r,m), since the later negative interval increases its adjacent Cartan value by 1. This cancels the displayed denominator and gives the first component case of (X). For later component starts the positive operator commutes with the initial prefix, and applying the induction to both terms in (T) is exactly the same (T) recursion for the shorter first factor in (X). All other internal indices give two zero terms. Applying the endpoint induction to (T) gives (E); in the singleton case its numerator is B(r,s)Tr,s−1(∅)−B(m,s)Tr,m−1(∅)Tm,s−1(∅), and B(r,s)−B(m,s)=C(r,m) yields (E) by (T). The general case cancels in the same way after deleting the maximal cut. All identities were derived integrally before reduction, so no denominator is cancelled in F.

15.1step 14.1construct

Set Ξr,s(J) by erer+1⋯esTr,s(J)v=Ξr,s(J)v. The endpoint calculation and (T) give Ξ(∅)=∏a=rsB(r,a),Ξ(J)=[Ξ(J∖{m})−Ξr,m−1(∅)Ξm,s(J∖{m})]/C(r,m),m=min⁡J. (C) Again this is an integer polynomial: it is the actual integral highest coefficient of a matrix-word action, or follows by the same difference-divisibility induction as ζ. The product in the empty case is essential; the historical printed sum in 1995 Definition two point nine is not used.

16.1step 15.1construct

If J has a bounded zero-B matching d:J→[r,s], with image D, then Ξr,s(J)≡∏a∈[r,s]∖DB(r,a)(modp). (M) There is a polynomial proof preventing invalid modular cancellation. The stronger identity, for m=min⁡J (and m=s+1 when J=∅), is Ξr,s(J)=∏t∈[r,s]∖DB(r,t)+[∏t=rm−1B(r,t)]∑j∈JB(j,d(j))Pj(C(r,m)), where each Pj has integer-polynomial coefficients independent of r. The empty case is the defining product. Remove the smallest m, put x=C(r,m),bt=B(m,t),v=d(m), and D′=D∖{v}. The two induction formulas for J∖{m}, starting respectively at r and m, have exactly the same Pj. Their left factors differ by replacing each bt with x+bt. Substitute them into (C), factoring A=∏t=rm−1B(r,t). The principal numerator is ∏t∈[m,s]∖D′(x+bt)−∏t∈[m,s]∖D′bt=x∏t∈[m,s]∖D(x+bt)+bv[∏t∈[m,s]∖D(x+bt)−∏t∈[m,s]∖Dbt]. The bracket on the second line is divisible by x in the integer polynomial ring. Every old error term is likewise a difference R(x)−R(0), divided by x, because its prefactor and Pj undergo the same translation. Thus after the exact division the first term is the required product with D removed, the second is an integer-polynomial multiple of the new matched generator bv=B(m,d(m)), and the remaining terms are multiples of the old matched generators. For complete control of the universal cancellation, replace the variable ar by the formal coordinate x=C(r,m), since m>r and its coefficient in C(r,m) is 1. Thus the integer polynomial ring is Z[x,remaining a]. Every matched generator B(j,d(j)) has j≥m and is independent of x. Its quotient is therefore a polynomial ring in x over the remaining coefficient quotient, so multiplication by x is injective even if that coefficient quotient has torsion or zero divisors. The exact paired divisions retain the matched ideal before specialization; no cancellation in a characteristic-p coefficient field occurs. This proves the stronger identity, hence (M), without any division modulo p.

17.1step 16.1construct

Tr,s(J)v=0 if and only if there is an endpoint u∈(r,s+1]∖J and a bounded zero-B matching {r}∪(J∩(r,u))→[r,u). (Z) Write J as above and set βq+1=s+2. Every possible witness can be enlarged within its gap to u=βa−1 for some a∈[1,q+1], without changing its matched left set. Thus (Z) is equivalent to one of the following finite conditions π(a): the earlier components ⋃b<a[βb,γb] have a bounded zero-B matching into [r,βa−2], and there is an unused zero-B target for the additional left point r.

18.1step 17.1construct

Induct on interval length. The single-root case is frv=0 iff ar=0 modulo p, by erfrv=arv and positive detection, exactly (Z). Suppose π(a) holds. For each component-start action in (X), if its index b<a, the tail has the shorter witness obtained from the existing matching by taking its start βb as the extra left point; if b≥a, the prefix has the earlier witness π(a). Thus each such product is zero by the induction. All other ei with i<s annihilate by (X). If a≤q, the endpoint witness is ≤βq−1. Both shorter terms in (E) retain it after the last cut γq is deleted, so they are zero by induction. If a=q+1, all J has a regular matching D and its unused zero-B target r gives Ξ(J)=0 by (M). Since eiT(J)v=0 for i<s, any positive simple-word test of the full interval is either zero immediately or is forced to act in the order s,s−1,⋯ ,r: a smaller out-of-order first letter commutes past all the already acted larger letters and kills T(J)v. Its only possible surviving value is therefore Ξ(J), which is zero. Positive detection from the modular foundation already proved gives T(J)v=0.

19.1step 18.1construct

Conversely suppose T(J)v=0 but no π(a) holds. Its earlier prefix in each (X) is nonzero by induction; otherwise the shorter witness would already give one of the forbidden π(a). Separated prefix and tail operators in (X) commute, and their product on v is nonzero whenever both factors are nonzero: choose positive tests raising the two separate factors to nonzero multiples of v, commute them across the opposite negative factor, and their product raises the product to the nonzero product scalar. Thus each tail in (X) must be zero.

20.1step 19.1construct

Work backwards through the components. For the last component, its zero tail gives a bounded zero-B matching of all [βq,γq] into [βq,s]. In general the zero tail beginning βb gives a matching of components b,⋯ ,a−1 into [βb,βa−2] for some a>b. All later components a,…,q already have a regular matching by the backward induction, using targets ≥βa. These two target ranges are disjoint, so their union matches all components b,⋯ ,q. Thus all J is regular. But T(J)v=0 implies Ξ(J)=0, and (M) then supplies an unused target a with B(r,a)=0. Match r to that target to obtain π(q+1), a contradiction. This proves (Z).

21.1step 20.1construct

It follows immediately that J is nonessential iff Ti,s(J∩(i,s])v=0 for some i∈[r,s]∖J: its witness is precisely the t=i witness in the essential predicate.

22.1step 21.1construct

If J is nonessential and T(J)v≠0, choose i∈(r,s]∖J with Ti,s(J∩(i,s])v=0 by (Z); i=r would have made T(J)v=0 already. Put E=J∩(r,i),F=J∩(i,s],e=max⁡E if nonempty. The splitting identity (P) gives T(J)v=T((E∖{e})∪{i}∪F)v+C(e,i)T(J∪{i})v, with the first term omitted if E=∅ and e=r. Both new subsets are strictly larger than J. Repeating terminates because there are finitely many subsets; each nonessential vector is expressed through larger essential ones or zero. Combining with (U) and the modular foundation already proved shows that essential T vectors span the root weight space. If there are no essential sets, the result is the zero space; no division is involved in this straightening.

23.1step 22.1construct

For I=[b1,c1]∪⋯∪[bH,cH] and J=[β1,γ1]∪⋯∪[βq,γq], write I≪J when each block of I is a prefix of a block of J: ba=βua,ca≤γua. Put Δ0=⋃b<u1Jb,Δa=(Jua∖Ia)∪⋃ua<b<ua+1Jb,ΔH=(JuH∖IH)∪⋃b>uHJb. Call I linked to J if every Δa admits a bounded zero-B matching to targets ≤ba+1−2, with bH+1=s+2. If H=0 this means all J is regularly matched to (r,s]. Define J^ as the least linked I in the subset order; it exists since I=J is linked.

24.1step 23.1construct

Let h(I,J) be the highest coefficient Q(I)T(J)v=h(I,J)v. The action formulas give h(I,J)=0 unless I≪J, and h(I,J)=±Ξr,b1−2(Δ0)∏a=1H−1Ξca,ba+1−2(Δa)ΞcH,s(ΔH) if I≪J. (H) For H=0 use h(∅,J)=Ξr,s(J). The signs are the explicit signs from the occurrences of (X), hence ±1 and irrelevant to zero/nonzero tests.

25.1step 24.1construct

To verify (H), factor the positive word exactly as Q(I)=Qr,b1−2(∅)Qb1,b2−2((b1,c1])⋯QbH,s((bH,cH])eb1−1eb2−1⋯ebH−1. This is just the canonical Q word reordered by commutations of letters at distance >1. Apply the rightmost displayed gap letters using (X). A start ba not among the β's gives zero immediately. When starts align, each gap action separates the negative factors into intervals with that simple root removed, so they commute with the other interval's positive factors. The sign contributed is (−1)H.

26.1step 25.1construct

The remaining one-block calculation is completely explicit. For K⊂(b,d] and b≤c≤d,Qb,d((b,c])Tb,d(K)v=(−1)c−bΞc,d(K∩(c,d])v if (b,c]⊂K, and is zero otherwise. Indeed Q=ecec−1⋯eb+1ebec+1⋯ed. Move eb past ec+1,⋯ ,ed, which commute with it when c>b. If b+1 is a cut, (X) gives ebTb,d(K)v=−Tb+1,d(K∖{b+1})v; repeat for b+1,⋯ ,c−1. Each letter commutes with the still unacted end letters, and each application deletes exactly one initial cut and contributes −1. The last remaining word is ecec+1⋯ed on that tail, exactly Ξc,d. If the first missing initial cut is k+1, (X) says ek annihilates the current tail, so the result is zero. The case c=b is the definition of Ξ.

27.1step 26.1construct

Apply this one-block formula to the separated factors. It forces ca≤γua; its remaining cut set is exactly Δa, while the initial factor has cut set Δ0. This proves (H), with the explicit sign (−1)H+∑a(ca−ba). Empty intervals contribute 1. This proof uses only (X), the definition of Q and commuting separated roots, and no source lemma as a premise.

28.1step 27.1construct

For linked I, apply (M) to every factor in (H). Thus its value is, up to sign, the product of B(r,d) on the unmatched initial target interval and B(ca,d) on the unmatched later target intervals. This gives the following pivot assertions.

29.1step 28.1construct

First, if T(J)v≠0, then h(J^,J)≠0. A zero factor in the initial interval would match the extra left point r to that unused target, together with its Δ0 matching, yielding (Z). A zero factor at endpoint ca would let one remove that endpoint from J^ and match its newly released left point to the unused zero target. The old matchings remain disjoint; if that endpoint was a singleton block, merge the two adjacent target intervals, whose old ranges were disjoint. This produces a smaller linked subset, contradicting minimality of J^.

30.1step 29.1construct

Second, h(I,J)=0 whenever I>J^. Otherwise (H) gives I⊂J. Let i=max⁡(I∖J^). The two sets agree above i. It must be the endpoint of its I block: if i+1 were in that same block and in J^, it would start a J^ block at i+1, hence also a J block by ≪, contradicting i∈J. The next block start is common to both sets. The link matching for J^ therefore matches {i} together with the corresponding Δ block of I into the target interval up to that next start minus 2. Apply (M) to the Ξ factor starting at i. The unused target of i is a zero factor in its residual product, so that factor and h(I,J) are zero.

31.1step 30.1construct

Third, essential J have distinct J^. Suppose J>K are essential with the same J^, and let t=max⁡(J∖K). Their tails above t agree, and t∉J^. Locate t inside the Δ block between two consecutive J^ components. The link matching for that block restricts to a bounded zero-B matching on {t}∪(K∩(t,u)) into [t,u), where u is one less than the next common block start (or s+1 at the end). Indeed the J component containing t ends before that next start; all entries between t and u in K are the common tails of J. The lower bound follows from boundedness of the matching, and the upper bound is exactly the link target bound. Both t and u lie outside K. This makes K nonessential, a contradiction.

32.1step 31.1construct

In a putative nontrivial relation among essential T vectors, choose M whose J^ is largest among the nonzero coefficients. Apply Q(M^). A term with a smaller J^ is killed by the second pivot assertion, and a term with a larger J^ has coefficient zero by choice. Distinctness of hats leaves only the M term, with nonzero coefficient h(M^,M) by the first assertion and essentiality through (Z). This contradicts the relation. Thus essential vectors are independent; the essential straightening already proved supplied spanning. The exact dimension is therefore εa(r,s)=#{essential subsets}.

33.1step 32.1construct

All entries of the T/Q matrices are reduced integer polynomials in the ai. The construction over F(t) hence gives the same rank and basis over F: a relation over F would remain one over F(t), and the equality of finite Gram ranks on extension rules out a missing dimension. Empty root weight spaces and all modular zeros were retained. The proof works for arbitrary dominant polynomial weights and all intervals, including the shifted lower weights needed by first-level character inversion. It does not assert semisimplicity of the Schur or symmetric-group algebra.

34.1step 33.1construct

Fix a prime p, a rank l≥1, and arbitrary nonnegative fundamental-weight coordinates Λ=(λ1,⋯ ,λl). No p-restricted or p-small coordinate assumption is imposed. All B,C,λ zero/nonzero tests below are in Fp; all cardinalities are ordinary nonnegative integers. For 1≤a≤b≤l define B(a,b)=b−a+∑k=abλk, C(a,b)=b−a+∑k=ab−1λk. The identities used throughout are B(a,b)=C(a,b)+λb and, for a≤x≤b, B(a,b)=C(a,x)+B(x,b) and C(a,b)=C(a,x)+C(x,b). For integers r≤s, (r,s]={r+1,⋯ ,s}. An injection f:M→N is weakly increasing here when f(j)≥j for every j; it need NOT preserve the order of different source elements. Weakly decreasing means f(j)≤j. This agrees with Definition one point twelve and is important for the augmenting paths below.

35.1step 34.1construct

A subset J⊂(r,s] is nonessential if there are t<u in [r,s+1]∖J and an injection d:{t}∪(J∩(t,u))→[t,u) with d(x)≥x and B(x,d(x))=0 for every source x. Otherwise J is essential. Write E(r,s) for this family and ε(r,s)=∣E(r,s)∣. A subset J⊂(r,s] is regular if it has an injection f:J→(r,s] with f(j)≥j and B(j,f(j))=0. The empty subset is regular.

36.1step 35.1construct

An index a is normal in [a,b] if λa≠0 and its demand set M={m∈(a,b]:B(a,m)=0} has a compensation injection z:M→(a,b] with z(m)≤m and B(z(m),m)=0. Define σ(a,b) as its indicator. Also set σ(a,a−1)=1. The root normality depends only on [a,b]; an ambient earlier endpoint does not change it.

37.1step 36.1construct

If r is not normal, put N(r,s)=∅. If r is normal, set N(r,s)={a∈[r,s]:a is normal in [a,s] and C(r,a)=0}, ν(r,s)=∣N(r,s)∣. The primed functions refer to the last-interval-coordinate shift: εΛ′(r,s)=εΛ+ωs(r,s), νΛ′(r,s)=νΛ+ωs(r,s). Only λs is increased by 1. An interval ending before s sees no effect of that shift. All shifted weights remain dominant.

38.1step 37.1construct

The desired count recurrence, for every 1≤r≤s≤l, is εΛ(r,s)=νΛ(r,s)+∑u=r+1sνΛ(u,s)εΛ′(r,u−1). (R) In particular r=i,s=l gives the first-level count formula with the final fundamental coordinate shifted at u−1, not at l or at the first coordinate.

39.1step 38.1construct

Order subsets colexicographically: at the largest element of their symmetric difference, the subset containing that element is larger. The regular family is finite and nonempty, so it has a unique maximum P. Claim: an essential regular subset exists iff r is normal; if it exists it is exactly P.

40.1step 39.1construct

First let J be regular and essential, with matching f. If λr=0, add the source r with f(r)=r; this is disjoint from f(J), whose images are >r. It is a forbidden witness with endpoints r,s+1. Hence λr≠0. Let R={m∈(r,s]:B(r,m)=0}. Every m∈R must belong to f(J), since an unused m could be assigned to the extra source r and would again give a forbidden witness. For each m∈R choose j=f−1(m). Then j≤m and C(r,j)=B(r,m)−B(j,m)=0; hence j compensates m. These j are distinct, proving r is normal. Moreover, if I>J were another regular subset, let t be the largest element in I∖J at the highest difference. The subsets agree above t. Restrict a regular matching of I to {t}∪(J∩(t,s]); its targets lie in [t,s+1) and are distinct. Since t∉J, this is a forbidden witness for J. Thus J=P.

41.1step 40.1construct

Conversely assume r normal and let J=P with a regular matching f. Suppose a forbidden witness d has endpoints t<u. If t>r, the subset I={t}∪(J∩(t,s]) is regular: use d on its sources below u and use f on J≥u. Their targets are respectively <u and ≥u, so are disjoint. Since t∉J and all larger elements are retained, I>J, a contradiction.

42.1step 41.1construct

It remains to treat t=r. Put J0=J∩(r,u),δ=d∣J0, and m0=d(r). The target m0 is not in δ(J0), and m0>r since λr≠0. Let R0={m∈(r,u):B(r,m)=0}. Normality gives a compensation injection z on R0; its targets satisfy r<z(m)≤m<u and C(r,z(m))=0. Begin at the unused target m0. If z(m0)∉J0, add that new source and assign it m0. Otherwise set j1=z(m0), reassign j1 to m0, and release m1=δ(j1). Then B(r,m1)=C(r,j1)+B(j1,m1)=0, so m1∈R0. Continue: use compensation z(m1), reassign it to m1 if it lies in J0, and release its old δ-target. All targets and compensation sources along this path are distinct: δ and z are injective, and a cycle would force the initially unused m0 to be a δ-image. Finiteness therefore ends at a source z(mq)∉J0. Every reassignment has B=0 and respects the lower-bound constraint z(m)≤m. Keep δ on untouched J0 and f on J≥u; those latter targets are ≥u and disjoint. This constructs a regular matching for J together with one new source in (r,u), contradicting maximality. Thus J is essential.

43.1step 42.1construct

This proves the claim, including uniqueness, without assuming a source theorem or using a representation-theoretic count. Two elementary consequences of the witness definition will be used. Truncation. If M is essential in (r,s] and q∈(r,s]∖M, then M∩(r,q−1] is essential in (r,q−1]. Any forbidden witness for the truncated interval has endpoints ≤q, also outside M, and is a witness in the original interval. Concatenation. If P is essential in (r,v−2] and J essential in (v,s], then P∪{v}∪J is essential in (r,s]. A forbidden witness wholly to the left or right gives the corresponding forbidden witness. A witness crossing v contains v as a source; restrict it to {v}∪(J∩(v,u)). Since all such sources and their targets are ≥v, this is a forbidden witness for J. The virtual case v=r+1 uses P=∅ and the same restriction argument.

44.1step 43.1construct

Let M be essential. If it is regular it is the unique P(r,s) of the regular-essential matching argument already proved, and σ(r,s)=1. Otherwise let v be the largest element of M satisfying v−1∉M and M∩(r,v−2] is regular in (r,v−2]. Such v exists: take min⁡M, with empty prefix. The prefix is essential by truncation at q=v−1, hence equals the unique P(r,v−2); in particular σ(r,v−2)=1 (or the virtual value 1).

45.1step 44.1construct

We show J=M∩(v,s] is essential. If it had a witness t<u with t>v, that is already a forbidden witness for M. If t=v, the witness matches M∩(v,u) into (v,u); combine it with the regular prefix matching, whose images are ≤v−2. Because v−1∉M, this makes M∩(r,u) regular in (r,u−1]. If u=s+1 or there is no element of M above u, it makes M regular, contrary to assumption. Otherwise let q=min⁡(M∩(u,s]); then q≥u+1,q−1∉M, and that same matching makes M∩(r,q−2] regular. This contradicts maximality of v. Thus J is essential, and M=P(r,v−2)∪{v}∪J.

46.1step 45.1construct

The decomposition is unique. Indeed, in a concatenated set with essential tail J, no larger m>v can meet the same two prefix conditions: a regular matching for its prefix, restricted to {v}∪(J∩(v,m−1)), would be a forbidden witness for J with endpoints v,m−1. The regular essential case cannot equal a concatenated case, because a regular matching of the whole set restricted to {v}∪J would make J nonessential with endpoints v,s+1.

47.1step 46.1construct

Iterating this unique decomposition gives a bijection between essential subsets and σ-cut paths Q={q1<⋯<qf}⊂(r,s] satisfying σ(r,q1−2)σ(q1,q2−2)⋯σ(qf−1,qf−2)σ(qf,s)=1. For f=0 the condition is σ(r,s)=1. The inverse recursively inserts the unique regular essential prefix P and the cut point, so this is a genuine bijection, not merely equal cardinalities. In particular ε(r,s) counts these paths.

48.1step 47.1construct

For a fixed r, B(z,m)=B(r,m)−C(r,z). For a demand m with B(r,m)=0, its eligible compensation positions are exactly z∈(r,m] with C(r,z)=0. This is a prefix/Ferrers matching problem. A compensation injection exists iff at every cutoff x the number of demands ≤x does not exceed the number of eligible compensation positions ≤x: necessity follows by counting distinct targets; sufficiency follows by pairing increasing demands with increasing available eligible positions. This is a complete greedy matching proof.

49.1step 48.1construct

If λr≠0, initialize a stack with r. Scan m=r+1,⋯ ,s. When λm≠0, push m if C(r,m)=0, pop the last push if B(r,m)=0, and otherwise do nothing. These push/pop cases are disjoint, since B−C=λm. When λm=0 and B=C=0, the position supplies and consumes its own compensation slot, so it changes neither the matching inequality nor the stack; all other zero-coordinate positions are likewise neutral. Kill the root walk permanently if its initial push r is popped. The prefix matching inequalities prove that r is normal exactly when the walk is not killed.

50.1step 49.1construct

When it is not killed, its final stack is exactly N(r,s). A pushed position a has C(r,a)=0 and λa≠0. For every m≥a the B,C identities give B(a,m)=B(r,m) and C(a,m)=C(r,m). Thus a is normal precisely when no suffix after it has excess pops over pushes, equivalently when its push survives the last-in-first-out matching. This proves the claimed exact stack interpretation of ν and N. For a killed root, N is empty by definition. The same proof applies verbatim to every shifted weight.

51.1step 50.1construct

We record two consequences of the stack, with proofs exposing the endpoint shift. Bridge lemma. Suppose x<y,σ(x,y−2)=1 and ν′(x,y−1)=0. If y is normal in [y,s], then N(x,s)={x}⊔N(y,s), and x precedes all indices of N(y,s).

52.1step 51.1construct

For y=x+1, ν′(x,x)=0 means λx+1=0; hence λx=−1≠0 and C(x,y)=1+λx=0. This proves the claim by the stack identities. For y≥x+2, the unshifted walk is alive through y−2. Shifting only λy−1 cannot affect its earlier steps. To make ν′=0 at its final step, the shifted walk must pop its last surviving root: its prior stack therefore has height 1 and B(x,y−1)+1=C(x,y)=0, with λy−1+1≠0. In the original walk B(x,y−1)=−1≠0. Also C(x,y−1)=−1−λy−1≠0 by the last nonzero condition. Thus the original y−1 step is neutral, and the stack before y consists only of x. Since C(x,y)=0 and y is normal, y is a nonzero-coordinate push; for every later position the walks based at x and y have identical events. The stack is consequently {x} followed by N(y,s), as claimed. This argument works in p=2 as well, since −1 is always nonzero.

53.1step 52.1construct

Consecutive-normal lemma. In a nonempty N(r,s) let a<b be consecutive final stack entries. Then σ(a,b−2)=1 and ν′(a,b−1)=0. First normality of a gives prefix normality and hence σ=1. Both final entries satisfy C(r,a)=C(r,b)=0, so C(a,b)=0. Before b is pushed, the stack based at a has exactly its initial entry: any additional unmatched push earlier than b would survive whenever b survives (last-in-first-out pops cannot remove it before removing b), and would be an intervening final normal entry. The step b−1 is neutral in the original walk. Indeed B(a,b−1)=−1; if C(a,b−1)=0, then λb−1=−1, and b−1 would be such an intervening surviving push. Therefore λb−1+1≠0. Increasing λb−1 by 1 creates exactly one final pop of the height-one stack, proving ν′=0. The adjacent case is λa+1=C(a,b)=0, giving ν′(a,a)=0 directly. These conclusions also apply to normal sets under a shift at some final endpoint s: when a<b≤s, their bridge intervals end before s, so their B,C constants are unchanged by the outer shift. The λb term is absent from C(a,b), which is why this remains true even when b=s.

54.1step 53.1construct

For a σ-cut path M={m1<⋯<mh}, put m0=r. Retain exactly the cut points mw for which ν′(mw−1,mw−1)>0. Call the retained set Q={q1<⋯<qf}. Partition M into blocks between retained cuts. Every internal removed cut has prime-zero bridge; the next retained cut has prime-positive boundary. Repeated application of the bridge lemma, in the weight shifted at the next retained boundary endpoint, shows that the removed cuts in this block are precisely an initial segment of N′(qv,qv+1−1) (excluding its first entry qv), where q0=r. The final block is similarly an initial segment of N(qf,s), excluding qf. All these normal sets are nonempty, because the retained boundary has positive ν′ and the last σ condition makes the final root normal.

55.1step 54.1construct

More explicitly, the block containing a removed-cut chain x=a0<a1<⋯<at before a retained endpoint y has σ(aj,aj+1−2)=1 and prime-zero between consecutive removed cuts, while ν′(at,y−1)>0. The last root at is normal for the weight shifted at y−1. Repeated bridge identities therefore make a0,…,at the first t+1 entries of N′(x,y−1). This proves the asserted initial-segment property and determines t uniquely. The final block uses the same argument with unshifted N.

56.1step 55.1construct

Conversely, for any Q={q1<⋯<qf} choose integers 1≤av≤ν′(qv,qv+1−1) for v=0,⋯ ,f−1, and 1≤af≤ν(qf,s). For every segment insert the first av−1 normal indices after its initial index, and include every retained cut q1,⋯ ,qf. The consecutive-normal lemma proves each new bridge has the required σ condition and prime-zero value. Normality of the last inserted index proves σ up to the next retained boundary and a positive ν′ there; the final index is normal in its tail. Thus the result is a σ-cut path. Its retention operation returns exactly Q, and the initial-segment lengths return the chosen av. The two constructions are inverse.

57.1step 56.1construct

Hence there is an explicit bijection from σ-cut paths onto the disjoint union, over all Q⊂(r,s], of sets of size ν′(r,q1−1)ν′(q1,q2−1)⋯ν′(qf−1,qf−1)ν(qf,s), with size ν(r,s) when Q=∅. Together with the essential/path bijection already proved this proves that ε equals this weighted-cut sum. Grouping its nonempty cuts by their first point gives the complete local recurrence ε(r,s)=ν(r,s)+∑u=r+1sν′(r,u−1)ε(u,s). (A) This is the source item five point six, part (iv) seam established by finite injections/bijections, not by an essential-basis or branching citation.

58.1step 57.1construct

Fix s and consider indices 1,…,s. Let A be the strictly upper triangular integer matrix A[r,u]=νΛ′(r,u−1) for r<u, and B the strictly upper triangular matrix B[r,u]=εΛ′(r,u−1) for r<u. Apply (A) to the interval [r,u−1] in the dominant weight Λ+ωu−1. Its first primed factor on [r,v−1],v<u, does not see the outer endpoint shift, so it is νΛ′(r,v−1). The tail is εΛ′(v,u−1). Therefore B=A+AB.

59.1step 58.1construct

Since A is strictly upper triangular, I+B=I+A+⋯+As−1=(I−A)−1. Let E and N be column vectors with entries ε(r,s) and ν(r,s). Equation (A) is E=N+AE, so N=(I−A)E. Multiplying by I+B gives E=(I+B)N. Component r is precisely (R): εΛ(r,s)=νΛ(r,s)+∑u=r+1sεΛ′(r,u−1)νΛ(u,s). All entries are ordinary integers; only nilpotence and finite matrix multiplication are used. This is also the finite reverse-character-inversion arithmetic needed by the first-level construction. No division, characteristic-zero argument, or generic dimension count appears.

60.1step 59.1construct∎

For r=s, essential subsets consist only of ∅ and it is essential exactly when λr≠0; the normal set is then {r}. Both sides are 0 or 1 accordingly. All endpoint and zero-coordinate cases are therefore included. Nothing in the proof depends on the prime beyond working in a characteristic-p field for the zero tests and 1≠0. The recurrence is uniform in arbitrary dominant coordinates and every root interval.

Remarks

The operators, coefficient recursions and raising pivots are integral before specialization. The basis and count recurrence retain arbitrary dominant polynomial weights, including the nonrestricted shifted weights used in first-level character inversion.

In the empty-set definition of Ξ, the highest coefficient is the product forced by the explicit action. The printed sum in the 1995 definition is not used; neither that misprint nor a source count theorem is a proof premise.

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

Kleshchev's first-level branching multiplicity

Statement

Let k be a field of characteristic p>0 (every field is splitting for symmetric groups, so no algebraic closedness is needed) and let λ be a p-regular partition of n (p-regular and p-restricted partitions), so that Dλ is the simple head of the Specht module Skλ (Modular simple modules of the symmetric group). Let A=(j,λj) be a removable node of λ whose removal λ(j) is again p-regular, and call A normal for λ when the transposed node (λj,j) of the p-restricted partition λ′ is a normal node in the sense of Residue signatures, normal, good, conormal and cogood nodes (this is Kleshchev's normality; it is computed in the reduced signature of the correct residue class of λ′). Then [ Dλ↓Sn−1:Dλ(j) ]=0 if A is not normal, and [ Dλ↓Sn−1:Dλ(j) ]=1+#{B: B is a normal removable node of λ strictly above A with res⁡(B)=res⁡(A)} if A is normal. Here res⁡ is the residue c−r mod p and "above" means strictly smaller row index. Equivalently, the multiplicity is the piecewise integer γ(A)=1A normal⋅#{B:B normal removable, weakly above A, res⁡(B)=res⁡(A)}. Thus A is normal precisely when this piecewise multiplicity is nonzero.

Facts & Assumptions

Given: A field F of characteristic p>0, a p-regular partition λ⊢n and a removable A=(j,λj) whose removal is p-regular.

[F1]

The actual Schur endomorphism algebra, normalized semistandard maps, weight projections and right corner action are those of The type-A q-Schur algebra and its Weyl modules and The Schur idempotent and the Schur functor for type-A q-Schur algebras. The complete q=1 Weyl-corner, form/radical and first-level comparison required here are proved inline below, without the held general comparison or any finite-e classifier.

[F2]

The actual signed-conjugate bridge has unit form factor qNλ−Lλ, equal to one at q=1, and identifies ordinary Specht form quotients with signed conjugate Murphy form quotients. The published group radical criterion gives nonzero ordinary quotients exactly at regular partitions, distinctly labelled by those partitions (Ordinary Specht modules are the signed conjugate Murphy cells, p-regular and p-restricted labels under transpose and sign, Modular simple modules of the symmetric group, p-regular and p-restricted partitions, Nonzero modular Specht quotient criterion, The Murphy cellular basis, the cell law and the Murphy form, The standard basis of the generic type-A Hecke algebra).

[F3]

The complete local interval-basis/count lemma supplies the integral negative cut words, positive detection, exact essential-subset dimensions, and finite matching recurrence for arbitrary dominant polynomial weights and all root intervals, including the last-coordinate increase of one (An integral essential-subset basis and count for type-A root intervals). Its proof supplies these properties over every field, without a characteristic-zero PBW or external count theorem.

[F4]

The general cellular rank-one action gives simplicity, absolute simplicity and completeness of the actual nonzero Schur cell quotients (Nonzero cell heads classify the simple modules of a cellular algebra). The signature convention is Residue signatures, normal, good, conormal and cogood nodes, and restriction has its usual exact group-module meaning (Restriction, induction, and coinduction).

Proof

technique · direct
1.1F1F2F3F4construct

Use the actual q=1 Schur Weyl-cell simple LN(μ), μ dominant polynomial, converted from right to left by star. Its highest vector v has weight μ and norm 1. The local lemma [F3] proves from the tensorword endomorphism realization that negative coefficient operators span each weight space, positive coefficient operators detect every nonzero vector, and integral cut-root words span every grade whose simple-root coefficients are 0 or 1. It also proves the complete essential-subset basis and the dimension formula dim⁡LN(μ)μ−α(r,s)=εa(r,s), aj=μj−μj+1. The local lemma [F3] also proves for every dominant a and every interval, by finite matching/path/stack bijections and finite triangular matrix inversion, εa(r,s)=νa(r,s)+∑u=r+1sεa′(r,u−1)νa(u,s), where εa′(r,t)=εa+ωt(r,t). These are actual proved local inputs, including all zero dimensions and arbitrary nonrestricted auxiliary weights.

2.1step 1.1construct

We spell out a further modular consequence of the same foundation to close the algebraic support seam. Let Γ be a deficit with each simple-root coefficient 0 or 1, with disconnected support Γ=δ+ζ separated by at least one zero coefficient. Take the first component δ entirely inside the Levi on the first N−1 coordinates. Every negative cut word of grade Γ factors uniquely into a δ-word and a ζ-word, since no root crossing a missing simple root can occur; the two groups commute. Every positive coefficient word of grade Γ similarly factors. All positive/negative cross commutators between the separated groups vanish. Consequently the matrix of highest coefficients at Γ is the tensor product of the two separate coefficient matrices at δ and ζ: for positive tests e,e′ and negative words f,f′, highest⁡(ee′ff′v)=highest⁡(efv)highest⁡(e′f′v). The rightmost separated test/word leaves the Cartan coordinates of the other interval unchanged, since the intervals are nonadjacent; this verifies the displayed equality even though f′fv has shifted weight.

3.1step 2.1construct

Choose bases fav and fb′v of the separate images. Positive detection yields positive linear-combination tests ea and eb′ with eafcv=δacv, eb′fd′v=δbdv, by finite matrix inversion over the field. Thus the products fafb′v are independent, since eaeb′ tests detect their coefficients; they span by the preceding factorization. On the entire weight space at Γ the operator Pδ=∑afaea is the identity: applied to fcfb′v, its cross commutations give fcfb′v. Every ea is a positive Levi coefficient word of nonzero weight δ, and every fa is a negative Levi coefficient word. This argument proves the identity on arbitrary entangled linear combinations, not only pure products. If a separate image is zero, the full weight space is zero and cannot supply a primitive vector.

4.1step 3.1construct

Now let M0⊂M1 be consecutive terms of a finite composition series of the first level, and choose x∈M1 representing the highest vector of a simple factor, of full deficit Γ. Positive Levi operators of nonzero weight send x into M0, because they annihilate its highest class. If Γ had a disconnected initial component δ, the identity Pδx=x would put x into M0: eax∈M0 and fa preserve M0. This is impossible. Hence any primitive factor vector of binary deficit ending at the last simple root has support a single terminal interval. This is the disconnected-root primitive exclusion, proved here, without a characteristic-zero PBW theorem or a pure-product assumption for x.

5.1step 4.1construct

Suppose μN=0 and let l=N−1. Define the first level M as the sum of weight spaces of LN(μ) whose last diagonal coordinate is 1. It is a polynomial Schur/GLN−1 module of degree ∣μ∣−1; the Levi preserves that coordinate. Put βi=αi+⋯+αl. For any i write νi=(μ1,…,μN−1)−ϵi, as a weight, and write di=dim⁡LN(μ)μ−βi, bu=[M:LN−1(νu)] when νu is dominant, and bu=0 otherwise. Dominance of νu is equivalent to au>0. No modular restriction condition is imposed on a dominant νu. In particular non-p-restricted factors still contribute to all character equations below.

6.1step 5.1construct

A simple factor contributing to the νi weight must have highest weight η dominating νi. The standard Schur cell simples have unique highest vector, all other weights dominated by it, and cover all simple Schur modules by the cellular regular-module argument. Thus this statement applies to every factor over every field. Lift η by appending the last coordinate 1, and let Γ=μ−(η,1). Since η is a weight of the first level, Γ is a nonnegative integral combination of simple roots; since η dominates νi, βi−Γ is a nonnegative integral combination of Levi roots. Consequently Γj=0 for j<i, Γj∈{0,1} for i≤j<l, and Γl=1. The support exclusion just proved forces Γ=βu for some u≥i. Thus η=νu and νu must be dominant. Only these terminal labels can contribute to this character equation; no stronger assertion about the other first-level factors is needed.

7.1step 6.1construct

Weight-space dimensions are additive on a composition series. Indeed the actual weight idempotents give direct projections, so taking a fixed torus weight is exact. The own highest weight of LN−1(νi), when defined, has dimension 1. Thus di=bi+∑u>ibuaiu, aiu=dim⁡LN−1(νu)νi. For an invalid νu its term is omitted. The lower weight deficit is νu−νi=ϵi−ϵu=αi+⋯+αu−1. The fundamental coordinates of νu on that interval are ai,…,au−2,au−1+1. Any altered coordinate at u is outside the interval and has no effect on the local formulas. The proved interval-basis theorem therefore gives di=εa(i,l), aiu=εa′(i,u−1). This is valid for every legitimate dominant νu, including those not p-restricted. When au=0, νu is nondominant and bu=0; also νa(u,l)=0 because its root is not normal.

8.1step 7.1construct

Substitute these dimensions into the character equation and compare it with the local recurrence of [F3] at (i,l): εa(i,l)=bi+∑u>ibuεa′(i,u−1), εa(i,l)=νa(i,l)+∑u>iνa(u,l)εa′(i,u−1). Starting at i=l and proceeding downwards proves bi=νa(i,l) for all i. This is finite integer reverse substitution, never reduction of the character multiplicities modulo p. The rank is N−1, unrelated to the prime except in the B,C zero tests.

9.1step 8.1construct

The local lemma [F3] uses only the infinite purely transcendental extension K=F(t) for polynomial identities and Gaussian elimination. Its scalar-extension argument is reversible: all cut/raising matrices have entries in F, hence their finite ranks and kernels preserve extension; its essential labels and pivot tests yield bases over F itself. Schur cell simples remain simple under every field extension by the cellular rank-one action and their nonzero form. Extending a finite Schur composition series thus retains the simple factors and their labels, so the integers bi computed over K are exactly those over F. The first-level weight subspace commutes with extension because it is the image of a finite sum of weight idempotents. Neither an algebraic closure nor an assumption that the original field is infinite is used. All nil/zero-weight cases remain in the equations.

10.1step 9.1construct

Let λ be p-regular, λ≠(n), put N=n, μ=λ′, μN=0. The index of A=(j,λj) is i=λj, not j, and not p. The coordinate au=μu−μu+1 is the multiplicity of the part u in λ; in particular au<p, but the preceding algebraic proof did not need that restriction. A removable A is the last row of its width i block, hence j=μi.

11.1step 10.1construct

The root normal walk based at i starts with a push for A and scans u=i+1,…,l. At coordinates with au=0 the compensation walk is neutral, even when B=C=0: the same position supplies and consumes a compensation slot. At positive coordinates u, the last ordinary row k of the width u block gives a removable node, and C(i,u)=u−i+∑t=iu−1at=u−λj+j−k. Thus C(i,u)=0 is exactly the removable node's residue equal to A's residue. The first ordinary row k of the width u block has an addable node in column u+1, and B(i,u)=u−i+∑t=iuat=u−λj+j−k+1. Thus B(i,u)=0 is exactly that addable node's residue equal to A's residue. Since 0<au<p at a positive coordinate, B=C+au shows these two events cannot occur together at that same u. Empty widths give only the neutral compensation case. The artificial final zero-width row also has no effect. Scanning positive u in increasing order lists the ordinary corners above A in the order j−1,…,1, with a width block contributing its boundary event when the residue matches. The top extra addable node of width λ1+1 is already the B event of the width λ1 coordinate; no boundary event is omitted.

12.1step 11.1construct

Under transpose a removable ordinary node becomes a removable μ-node of opposite residue, and an addable becomes an addable of opposite residue. The top-to-bottom μ-signature following A′ lists exactly these above ordinary nodes in this order. The only possible equal-column lower ordinary addable node lies immediately below A and has residue differing by 1, so it is absent from this residue class. Consequently the root push/pop walk is exactly the reduced-signature stack after A′: push a removable −, pop on an addable +, implementing cancellation −+.

13.1step 12.1construct

Earlier signature signs do not change whether A′ or any later push is removed. A survives precisely when no later prefix has more pops than pushes; this is exactly root normality σ(i,l). If it survives, the final stack consists of A together with those above ordinary removable nodes in A's residue class whose transposes survive as normal nodes. The stack proof of [F3] identifies this final stack with N(i,l), so νa(i,l)=0 if A is not normal, and νa(i,l)=1+#{normal removable nodes strictly above A of A’s residue} if A is normal. The node count here is piecewise. It is not the unconditioned count of normal nodes weakly above A when A is nonnormal.

14.1step 13.1F1F2construct

Work at q=1 with right Schur modules, reversing the star conversion used for the algebraic count. The Hecke presentation has Ti2=1 and the symmetric-group braid relations; its standard basis Tw maps bijectively to the group basis w, so H(F,1,Sm)=FSm. Let e be the weight projection of type ω=(1m), with End⁡H(H)=H via ρh(x)=hx. The normalized semistandard map φST is supported from type⁡(T) to type⁡(S). Thus eφSTe survives exactly when both types are ω. These tableaux are ordinary standard tableaux, their defining fibers are singleton, and evaluation at 1 gives φst↦mst. The higher Schur ideal corner is exactly the higher Murphy ideal, as equality of the corresponding basis spans. The projection on a Weyl cell fixes wT exactly for type⁡(T)=ω. To read its right H action, choose the independent fixed outer index also of type ω; evaluation at 1 then turns φstρh into msth modulo the corresponding higher ideal. Hence Wξe≅CM(ξ) by wt↦ct, with the actual same-shape Murphy action, over every field.

15.1step 14.1F2F4construct

Choose all four indices a,s,t,b standard of shape ξ and type ω in the Schur cell product φasφtb≡Bξ(ws,wt)φab. Evaluate every map at 1 in the corner. The Murphy product is masmtb≡Bξ(ws,wt)mab, so its independent cell-product coefficient gives Bξ(ws,wt)=GM,ξ(cs,ct). The scalar is exactly 1. Since e∗=e, contravariance gives Bξ(xe,y(1−e))=Bξ(x,y(1−e)e)=0. Thus the Weyl decomposition Wξ=Wξe⊕Wξ(1−e) is orthogonal, and rad⁡form(Wξe)=rad⁡form(Wξ)e, including an identically zero corner form. The canonical shape/type ξ diagonal is the projection onto Mξ and is idempotent, so the same cell-product coefficient gives canonical norm 1; Lξ=Wξ/rad⁡form is nonzero simple. Projection by e is exact (lift ye by xe, and kernels are intersections fixed by e), so Lξe≅DM(ξ), including zero. At q=1 the unit form comparison [F2] gives DM(ξ)≅Dξ′⊗sgn⁡ when ξ′ is regular, and zero otherwise by the published ordinary radical criterion. These nonzero quotients are distinctly labelled group simples. This proves restricted survival locally and uses no general finite-e classification.

16.1step 15.1F1F3construct

Take N=m=n and the tensorword realization of S(N,m) already proved in [F3]. Let p be the sum of all actual weight projections with last coordinate 1. Its tensorwords have exactly one occurrence of N. Identify their remaining ordered positions with (FN−1)⊗(m−1). For each lower Schur orbit matrix EA, define κ(EA)=Ediag⁡(A,1), where the last row and column have only their final entry 1. On every word with one N this map preserves its position and applies EA to the other positions. Consequently products are exactly the lower products, κ(1)=p, and κ embeds S(N−1,m−1) as a unital subalgebra of pS(N,m)p. This describes the lower Schur action on Xp, and for the star-converted left simple it is exactly the block-diagonal GLN−1 action used in the character calculation, because g⊗(m−1) expands in EA and diag⁡(g,1) acts at the unchanged N position. Transpose sends EA to EAt, so κ respects star. The first level counted above is therefore precisely LN(μ)p, converted to the right; no source-only definition of first level is being substituted.

17.1step 16.1construct

Let e′ be the lower regular-type projection (1N−1). In this embedding κ(e′)=e, the full type (1N) projection. Use the explicit coset-word map mνTd↦(row of entry j in tνd)j. On the regular type its jth letter is jd−1, in right permutation notation. Consequently ρh:d↦hd changes a regular word by the corresponding label permutation h−1, because (hd)−1=d−1h−1. A lower corner element ρh′ acts by this same label permutation h−1 on 1,…,N−1 and fixes label N. The orbit embedding therefore gives exactly ρh on the full regular tensorword basis, with no extra inversion or opposite-algebra map. Thus κ(ρh′)=ρh, with the subgroup action in the right convention exactly Xρh. Consequently (Xp)e′=Xe as FSN−1-modules, with the latter the ordinary restriction of Xe. Apply this to X=LN(μ). This is the complete local q=1 first-level/corner identity; it is independent of the held generic comparison.

18.1step 17.1F2F4construct

Apply the exact lower projection e′ to a finite composition series of LN(μ)p. Each factor LN−1(η) becomes DM(η), proved by the lower-rank form/corner calculation of steps 14.1–15.1; it is a distinctly labelled simple when η is restricted, and zero otherwise. Deleting repeated terms leaves a composition series of the group restriction corner. Thus the multiplicity of a restricted η agrees exactly with its lower Schur multiplicity. Nonrestricted η were retained in the earlier character calculation and are killed only here. For μ=λ′, [F2] gives LN(μ)e≅Dλ⊗sgn⁡. The candidate νi=(λ∖A)′ is restricted by the regular-removal hypothesis, and its image is Dλ∖A⊗sgn⁡. Hence the desired group restriction multiplicity is bi. Twisting both modules by sign preserves multiplicity because sign of Sn restricts to sign of Sn−1. To match a left-module convention for the ordinary D in the Statement, apply the exact inverse/star equivalence from right group modules to left ones, g⋅x=xg−1. It commutes with restriction and sign twisting and preserves composition series. The ordinary polytabloid quotient is the same partition-labelled quotient in this convention; if the dictionary uses its contragredient realization, the induced nondegenerate invariant quotient form identifies that simple with its contragredient. Explicitly x↦(y↦β(x,y)) is bijective and equivariant since β(gx,y)=β(x,g−1y). This uses the form only after passing to the nonzero radical quotient, as in Modular Specht form and radical quotient; no self-duality of a possibly degenerate Specht module is assumed. Together with the algebraic count and signature calculation, this gives both displayed cases of the theorem.

19.1step 18.1construct

For λ=(n) the ordinary simple is trivial and restricts trivially, so the unique removable node has multiplicity 1. Its transposed μ=(1n) node is normal: no subsequent same-residue addable can cancel it, and the preceding possible addable gives a +− pair rather than a cancellation. There are no above ordinary removables. For n=1 this is the one-dimensional restriction to S0; for n=0 the removable-node hypothesis is empty. These cases avoid requiring μN=0 where it is false. All primes, all fields of characteristic p, all p-regular λ and all regular removals retain the original stated scope.

20.1step 19.1construct∎

The piecewise integer γ(A)=1A normal times the number of normal nodes weakly above A has value zero off normality and is at least one on normality, since A itself is counted. The preceding multiplicity and boundary proofs therefore establish both the formula and its stated equivalence over every field of characteristic p.

Remarks

The proof supplies the full local first-level count and signature calculation. The source Theorems 9.3 and 1.4 document its origin and are not proof premises. The rank is n−1 and the root interval starts at λj; the prime appears only in zero tests. All lower dominant Schur factors, including nonrestricted ones, are retained until the exact corner functor kills their images. The former unconditional above-count equivalence was false: for p=2, λ=(5,3,1), A=(3,1), A is nonnormal while a normal node of its residue exists above it. The piecewise correction preserves both original displayed cases.

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

Normal-node composition multiplicities under residue restriction

Statement

Let k be a field of characteristic p>0, μ a p-restricted partition of d and A a removable i-node of μ such that ν=μ∖A is again p-restricted; let D(μ) be the simple kSd-module labelled by μ in the dual-Specht (cellular) convention, so that D(μ)≅Dμ′⊗sgn⁡ (p-regular and p-restricted labels under transpose and sign, Modular simple modules of the symmetric group), and let Ei be the residue-summand functor of Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi. Then [ EiD(μ):D(ν) ]=0 if A is not a normal i-node of μ, and [ EiD(μ):D(ν) ]=#{B: B normal i-node of μ weakly below A} (counting A itself) if A is normal. The corresponding Specht-to-restriction Hom criterion (Brundan 1998 Theorem 2.5, equivalently Kleshchev II Theorem 0.4) is a distinct statement and is not asserted here.

Facts & Assumptions

Given: A field k of characteristic p>0, a p-restricted partition μ of d, a removable i-node A=(r,μr) with ν=μ∖A p-restricted, and the residue-summand functor Ei.

[F1]

Res⁡Sd−1SdM=⨁jEjM, and EjM is the sum of the generalized eigenspaces of the last Jucys-Murphy element Ld=Td−Td−1 with eigenvalue j, for every finite-dimensional kSd-module M; here Tm=∑1≤a<b≤m(a b) is the transposition class sum of Sm (Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi, The Jucys-Murphy elements of the symmetric group algebra).

[F2]

The central transposition class sum Tm acts on the ordinary integral Specht lattice and every field specialization by the total content zξ=∑(r,c)∈[ξ](c−r) (The transposition class sum acts on a complex Specht module by total content). At m=0,1, both the class sum and total content are zero directly. The actual same-shape perfect pairing identifies the Murphy cell CM(ξ) with the star dual of the ordinary Specht module (Murphy cells are the same-shape contragredient Specht duals). Since Tm∗=Tm, the same scalar acts on that dual and its nonzero form quotient D(ξ). This uses the ordinary module itself, not a false ordinary/Murphy equality of form radicals.

[F3]

For a p-restricted ν, the module D(ν) is nonzero, simple, self-dual and absolutely irreducible, so every kSd−1-endomorphism of D(ν) is a scalar (Modular simple modules of the symmetric group, p-regular and p-restricted labels under transpose and sign).

[F4]

The complete locally proved piecewise count is Kleshchev's first-level branching multiplicity. For the ordinary regular label λ=μ′ and the transposed removable node A′, its multiplicity is zero off normality and counts the same-residue normal nodes weakly above A′ on normality. The group sign/conjugate dictionary and signature order in [F5] transport this exact count; no bibliographic normal-node theorem is a proof premise.

[F5]

The dictionary between the two conventions: transposing exchanges removable nodes of λ with removable nodes of λ′, exchanges "strictly above" for the dual order of the same residue class, and negates residues, c−r↦r−c; ordinary normality on λ in Kleshchev's first-level branching multiplicity is defined by signature normality of the transposed node on λ′. Brundan's lattice convention instead agrees with our signature on the same restricted shape, with residue names negated (Residue signatures, normal, good, conormal and cogood nodes, p-regular and p-restricted labels under transpose and sign).

Proof

technique · direct
1.1F1F2F3given

Localization of an occurring factor. On D(μ) the class sum Td acts by zμ by [F2], hence it acts by that scalar on the whole restriction. The operator Ld=Td−Td−1 on this restriction is therefore zμ−Td−1, a central kSd−1 operator preserving every submodule. If D(ν) occurs as a composition factor, [F2] gives its Td−1 scalar zν. Thus Ld acts on this factor by zμ−zν=c(A)−r(A)=i. The generalized primary projections are exact by [F1]; every occurrence of this factor lies in EiD(μ), and none in another summand. Consequently [EiD(μ):D(ν)]=[D(μ)↓Sd−1:D(ν)], also when both sides are zero. This does not assert that a factor occurs before its multiplicity is computed.

2.1F4F5step 1.1algebra

Apply the local count [F4] to λ=μ′ and the ordinary node A′. The group dictionary is D(μ)≅Dμ′⊗sgn⁡ and likewise for ν; sign restricts to sign, so simultaneous twist preserves the restriction multiplicity. Transposing negates residues and reverses the order of corners in a fixed residue class, as [F5] states. The ordinary piecewise formula is therefore zero when A is not normal, and otherwise is the number of normal i-nodes weakly below A, counting A itself. Combine this with step 1.1. The unconditioned weakly-below count is not used off normality.

3.1F4F5step 2.1algebra∎

For p=3 and μ=(3,3,2,1,1), the normal residue-2 nodes are (3,2) and (5,1); the same-residue signature has the two minus signs and no plus sign. The two respective regular removals give multiplicities 2 and 1 by step 2.1. At degree one the same argument gives the one-dimensional restriction to S0; degree zero has no removable node. Thus the boundary cases and both displayed cases are included. No Specht-to-restriction Hom criterion is asserted.

Remarks

The complete count proof is the local first-level supplier, built from the integral root-interval basis and finite essential-subset recurrence. The cited Kleshchev and Brundan papers document the historical source of this formula; they are not external proof premises. The new local contribution here is the conditional class-sum localization and the exact transpose/sign transport. No unconditional count or implication from a zero form quotient to a zero actual module head is used.

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

Conormal-node composition multiplicities under residue induction

Statement

In the notation of Normal-node composition multiplicities under residue restriction, let B be an addable i-node of the p-restricted partition μ such that ν=μ∪B is again p-restricted, and let Fi be the residue-summand induction functor of Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi. Then [ FiD(μ):D(ν) ]=0 if B is not a conormal i-node of μ, and [ FiD(μ):D(ν) ]=#{B′: B′ conormal i-node of μ weakly above B} (counting B itself) if B is conormal. The dual Specht-to-induction Hom criterion (Kleshchev survey Theorem 11.7(i), Brundan 1998 Theorem 2.5 dual form) is a distinct statement and is not asserted here.

Facts & Assumptions

Given: A field F of characteristic p>0, a p-restricted partition μ of d, an addable residue-i node B such that ν=μ+B is p-restricted, and the actual residue induction functor Fi.

[F1]

The actual Schur coefficient foundation and root-interval basis/count supplier holds over every field, for arbitrary dominant polynomial weights and all intervals. Negative coefficient words span, positive coefficient words detect, binary-root weight spaces have dimension Ea(r,s)=εa(r,s), and the finite integer recurrence is Ea(r,s)=νa(r,s)+∑u=r+1sEa′(r,u−1)νa(u,s), with Ea′(r,t)=Ea+ωt(r,t). Its normal-stack proof includes zero coordinates and killed roots (An integral essential-subset basis and count for type-A root intervals).

[F2]

The proved local q=1 Schur/group corner in steps 14.1–15.1 of Kleshchev's first-level branching multiplicity identifies the regular Weyl corner and cell form with the Murphy cell and form, with scalar 1, and proves equality of their radical corners. Thus LN(λ)e=D(λ) for restricted λ and is zero otherwise; surviving labels are distinct. Its tensorword convention is explicit, and its proof uses ordinary-group survival rather than the held finite-e classifier. The integral ordinary Specht basis and signed-conjugate identification are Ordinary Specht modules are the signed conjugate Murphy cells and p-regular and p-restricted labels under transpose and sign.

[F3]

On the complex ordinary Specht module, the joint Jucys–Murphy spectrum is the tableau-content spectrum (The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors). Only its integral central operator-identity consequence is used, not any characteristic-zero composition count.

[F4]

The boundary signature is read top to bottom with addable +, removable − and cancellation −+ (Residue signatures, normal, good, conormal and cogood nodes). The actual primary projections define the direct residue decomposition of induction (Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi). Neither primitive-block classification nor an adjunction transfer of composition counts is used.

Proof

technique · direct
1.1givenF1F2construct

For d>0 take N=d+1, pad μ by zeros, set aj=μj−μj+1, let L=LN(μ) be the actual Schur simple, V=FN, and M=V⊗L. Tensor coefficient operators are the actual polynomial Schur operators of degree d+1, obtained by multiplying the two polynomial matrix actions. This works over finite fields without replacing coefficient actions by evaluated group elements. The case d=0 is treated below.

2.1step 1.1F1F2construct

Here is the local component identity used below. If a binary root deficit has separated connected components (a zero simple-root coefficient between consecutive components), its negative words split into products supported on those components. All cross-component positive and negative root operators commute, and their Cartan characters on the other component are unchanged: their simple-root supports are nonadjacent. Move the positive words past the other components and evaluate their highest coefficients one component at a time. The positive/negative coefficient matrix is consequently the tensor product of the component matrices. Negative-word spanning and positive detection identify its quotient by the common positive-test kernel with the actual simple weight space. Hence this weight space is the tensor product of the component quotients, including when one is zero. This proves the assertion directly from coefficient words; it does not assume a tensor-product decomposition of the whole simple module.

3.1step 2.1F1F2construct

In particular fix one component δ. Choose a negative basis f1v,…,ftv of its quotient and positive tests e1,…,et dual to it. They are finite linear combinations of actual coefficient words, with coefficients in F; their existence follows from positive detection and ordinary finite-dimensional linear algebra. Then Pδ=∑h=1tfheh is the identity on every binary weight space having this component and any separated other components. The same tests apply because the other components change none of the Cartan data of δ. If t=0, these weight spaces are zero. This is an identity of coefficient operators on those spaces, so it descends to subquotients.

4.1step 3.1F1F2construct

Write ξi=μ+ϵi. Suppose a simple composition factor with highest weight η contributes at ξi. All weights of M are at most μ+ϵ1, and weights of that factor are at most η. Thus ξi≤η≤μ+ϵ1.

5.1step 4.1F1F2construct

The deficit Γ=μ+ϵ1−η has simple-root coefficients 0 or 1 in positions 1,…,i−1 and zero elsewhere. On a tensor summand vj⊗Lη−ϵj the deficit in L is Γ−(α1+⋯+αj−1).

6.1step 5.1F1F2construct

It must be nonnegative. Consequently every possible label j lies before the first missing coefficient in Γ. If Γ has a component δ after that first gap, every positive or negative coefficient word supported on δ fixes the V factor (its nonconstant terms annihilate each of these labels). Its action on this tensor weight is therefore purely its action on L. The preceding Pδ is the identity on the entire weight Mη, not just on individual tensor summands.

7.1step 6.1F1F2construct

Choose a composition series and a lift x∈Mη of the nonzero highest vector of the proposed factor in its series quotient. Each ehx lies in the preceding submodule because it has strictly higher weight, and each fh preserves that submodule. But Pδx=x would then place x in it, a contradiction. If the component quotient is zero there was no such tensor weight to start with. Thus Γ has no later component. Its only possible nonzero coefficients form one initial interval, and η=μ+ϵufor some u≤i.

8.1step 7.1F1F2construct

This excludes only highest weights of factors contributing to ξi. It asserts nothing about distant tensor factors.

9.1step 8.1F1F2construct

Since every weight of L is at most μ, Mξi=⨁j≤ivj⊗Lμ+ϵi−ϵj,di:=dim⁡Mξi=1+∑j<iEa(j,i−1).

10.1step 9.1F1F2construct

Let bu be the actual composition multiplicity of LN(μ+ϵu) in M when that weight is dominant; set bu=0 otherwise. No restrictedness condition is imposed on these auxiliary factors. The support lemma and the one-dimensional highest spaces give di=bi+∑u<ibuEa+ωu(u,i−1). (equation C).

11.1step 10.1F1F2construct

Indeed μ+ϵu−ξi=αu+⋯+αi−1. On this interval the fundamental coordinates of the dominant weight μ+ϵu are those of a with its first coordinate u increased by one; the coordinate u−1 changed by minus one lies outside the interval. Nondominant rows have multiplicity zero, so their formal summands cause no alteration of (C).

12.1step 11.1F1F2construct

For completeness the weight-dimension symmetry needed here is local. Permutation matrices permute the integer weight spaces of L. Hence its lowest weight is w0μ, its space is one dimensional, and every weight lies between w0μ and μ. The contragredient dual twisted by det⁡d is a polynomial simple of highest weight μ∗=(d−μN,…,d−μ1).

13.1step 12.1F1F2construct

One can verify polynomiality without a rational-module classification theorem. The tensorword Schur algebra acts faithfully on V⊗d; its regular module embeds in a finite direct sum of copies of this tensor space by its action on a basis. Thus every simple is a subquotient of copies of this tensor space. Duality and the twist make it a subquotient of (V∗⊗det⁡)⊗d; the explicit exterior-complement pairing gives V∗⊗det⁡≅⋀N−1V over every field. It is therefore polynomial. Positive and negative coefficients interchange under duality, so the highest weight just identified determines the same actual Schur simple as in the accepted foundation. These statements are coefficient identities; over a finite field they can equivalently be checked over F(t) and descended as the identical finite matrices.

14.1step 13.1F1F2construct

Put aˉt=aN−t. Duality reverses roots and preserves weight dimensions, yielding Ea(j,i−1)=Eaˉ(N−i+1,N−j).

15.1step 14.1F1F2construct

This argument applies also to any dominant shifted weight. In particular the first-coordinate shift at u becomes the final-coordinate shift at N−u on the reversed interval. No restriction on its fundamental coordinates is needed.

16.1step 15.1F1construct

Reverse the indices: r=N−i+1, bˉr=bi, dˉr=di. On indices 1,…,N, let the strictly upper triangular matrices be A[r,v]=νaˉ′(r,v−1),B[r,v]=Eaˉ′(r,v−1)(r<v).

17.1step 16.1F1construct

For r<v, apply the accepted recurrence to [r,v−1] after increasing coordinate v−1. Every earlier interval [r,u−1] with u<v is unaffected, while the tail normal count is shifted at v−1. Thus B[r,v]=A[r,v]+∑r<u<vB[r,u]A[u,v], or B=A+BA. Hence (I+B)(I−A)=I. Since these are finite integer matrices, the inverse is two-sided and (I+B)−1=I−A. Equivalently, the supplier's first-cut recurrence gives B=A+AB and I+B=I+A+⋯+AN−1.

18.1step 17.1F1construct

Let Hr=∑s=rN−1νaˉ(r,s), with HN=0. Applying the accepted recurrence separately for every endpoint and summing gives dˉ=1+(I+B)H.

19.1step 18.1F1construct

Opposition turns (C) into dˉ=(I+B)bˉ. Multiplication by I−A gives, as ordinary integers, bi=1+∑s=rN−1(νaˉ(r,s)−νaˉ′(r,s)),r=N−i+1. (equation D).

20.1step 19.1F1construct

This is finite nilpotent matrix arithmetic. It neither divides in F nor replaces a composition multiplicity by a residue in F.

21.1step 20.1F1construct

Use the accepted normal-stack interpretation; every coordinate and B,C equality tested in this paragraph and the endpoint analysis is modulo p, whereas stack heights are ordinary integers. Write σ(r,t) for its alive indicator and put σ(r,r−1)=1. For every dominant coordinate array λ, νλ(r,s)−νλ′(r,s)=σ(r,s−1)(1B(r,s)=−1−1B(r,s)=0). (equation E).

22.1step 21.1F1construct

If killed before the final step, both counts are zero. Otherwise let its current height be h≥1. The endpoint shift keeps C(r,s) fixed and replaces B and λs by B+1 and λs+1. If B=−1 it creates a pop and lowers the count by one; when λs=−1, the unshifted step instead pushes and the shifted zero-coordinate step is neutral, with the same difference. If B=0 it removes a pop and increases the count by one; when λs=0, the old step is neutral and the new step pushes, again with that difference. For other B neither change alters the count. If a pop removes the initial root, its new count is zero, still h−1=0. At s=r the two counts are 1λr≠0 and 1λr+1≠0, giving the same formula. These alternatives are exhaustive and valid for p=2.

23.1step 22.1F1F4construct

Fix an actual addable row i and put Rj=μj+1−j, ρ=Ri(modp). If i>1, addability means ai−1>0. Since μ is restricted, 0<ai−1<p; the reversed root therefore starts alive. For r=N−i+1, s=N−j, direct substitution gives Baˉ(r,s)=Rj−Ri−1,Caˉ(r,s)=Rj+1−Ri.

24.1step 23.1F1F4construct

Thus the two indicators in (E) respectively detect an addable-position residue ρ in row j and a removable-position residue ρ in row j. The normal stack processes the boundary in reverse order, starting with the chosen + in row i. At step j its C=0 push corresponds to the plus in row j+1, and its B=0 pop to the minus in row j. The top-row plus is a pending final event. This reversal is exactly the stack evaluation of −+ cancellation: in a reverse scan, a minus cancels the most recently encountered plus.

25.1step 24.1F1F4construct

Here is the precise check at flat row blocks and at the endpoints. Let Ds=1+∑t=rsσ(r,t−1)(1B(r,t)=−1−1B(r,t)=0).

26.1step 25.1F1F4construct

While the chosen root remains alive, Ds is its current normal-stack height plus the pending indicator 1Rj=Ri, where j=N−s. At the initial step the removable event B(r,r)=0 cannot occur since 0<ai−1<p, and this identity follows immediately. At each subsequent live step the change in height is 1C(r,s)=0−1B(r,s)=0.

27.1step 26.1F1F4construct

For aj≠0 these are disjoint push/pop events. For aj=0 the indicators are equal and the step is neutral, as required by the actual stack. Subtracting this height change from the change in Ds gives 1Rj=Ri−1Rj+1=Ri,

28.1step 27.1F1F4construct

which replaces the previous pending indicator by the next. This proves the invariant by induction, including flat blocks. Equivalently, at each flat boundary aj=0, the virtual removable sign in row j and virtual addable sign in row j+1 have the same residue and form an adjacent −+ pair in the selected-residue row-boundary word. Deleting these pairs restores exactly the actual boundary word. By signature confluence their insertion or deletion has no effect on the surviving actual nodes. The chosen node is an actual addable, so it is never among the virtual pairs.

29.1step 28.1F1F4construct

If the initial root is killed, its preceding height was one, the current event is B=0, and B=−1 is false. The pending indicator after the step is zero. Thus Ds=0, and every later term is zero because the alive indicator remains zero. In the reversed boundary scan, killing the initial plus likewise means that the chosen node is canceled; later pluses above it cannot revive it. At the last step the pending indicator is the actual addable top-row plus. We have therefore evaluated exactly the reverse scan of the prefix ending at the chosen node. A minus below this prefix cannot cancel a plus in it under top-to-bottom −+ cancellation; the conormal decisions for this prefix agree with those in the entire signature.

30.1step 29.1F1F4construct

Consequently (D) is zero precisely when the chosen plus is canceled. If it survives, (D) is the number of surviving pluses of residue ρ in the prefix, namely the number of conormal nodes weakly above B. For i=1, (D) is b1=1: the top plus survives and it is the only node weakly above itself. For completeness, a nondominant row i>1 has ai−1=0; the first endpoint difference is −1, killing the virtual initial unit and all later differences, so (D) gives zero as required by (C). These rows were not silently discarded during the integer inversion.

31.1step 30.1F2construct

Let ω=(1N) be the regular degree-N weight. Then Mω=⨁j=1Nvj⊗Lω−ϵj.

32.1step 31.1F2construct

Let G=SN, H=Sd fixing label N, and W=Lω−ϵN. The accepted local q=1 corner/form calculation applies to degree d and rank N with regular weight (1d,0): its surviving semistandard indices are precisely standard tableaux, and evaluating the corner at 1 gives the same Murphy basis and scalar-1 form, regardless of the unused last label. Its radical-corner equality therefore makes W the left group module D(μ). To fix the action convention, the supplier's right corner element ρh permutes tensorword labels by h−1; star conversion makes left g act by right g−1, hence by label permutation g. The same conversion in the degree-N corner gives the output action. Thus the output regular-corner action is ordinary permutation of labels: on tensorwords the corresponding orbit matrix is exactly that label permutation. Since these are identities in the actual tensorword Schur algebra, the same equality holds on M; it does not depend on evaluated permutation matrices spanning the Schur algebra.

33.1step 32.1F2construct

The explicit map F[G]⊗F[H]W⟶Mω,g⊗w⟼g(vN⊗w).

34.1step 33.1F2construct

is well defined and G-equivariant. Left cosets of H correspond to the image label gN, and their summands map bijectively to the displayed summands of Mω. It is therefore an isomorphism. This proves Mω≅Ind⁡SdSd+1D(μ), without Frobenius reciprocity or an adjunction multiplicity assertion.

35.1step 34.1F2construct

Corner projection is exact. Each Schur composition factor LN(η) projects to the distinct restricted group simple D(η) if η is restricted, and to zero otherwise, by the accepted local form/radical and ordinary-group survival proof. Hence for a restricted μ+B=μ+ϵi, its total induction multiplicity is exactly bi. Nonrestricted near factors were kept until this exact projection. Distant factors were never excluded; distinct surviving labels ensure that they cannot change this particular count. When d=0, the single degree-one tensor/corner gives the unique plus and multiplicity one directly.

36.1step 35.1F2F3F4construct

The generalized Jucys--Murphy induction summands give a direct decomposition of total induction. For the ordinary group elements Lk=∑j<k(j,k), induction by inserting the letter n into a cycle gives the integral identity ∏k=1n(t+Lk)=∑g∈Snt#cycles⁡(g)g.

37.1step 36.1F2F3F4construct

The factor t makes n a new fixed point; each transposition (j,n) inserts n at the uniquely specified place in the cycle containing j. These alternatives are disjoint and exhaust the permutations. Coefficients on the right are class sums, so all coefficients of Qn(t)=∏k=1n(t−Lk) are central over the integers and every field.

38.1step 37.1F2F3F4construct

The published The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors says that Qn(t) acts on the complex ordinary Specht module of shape λ as ∏A∈λ(t−res⁡Z(A)). The ordinary integral Specht lattice has the free polytabloid basis provided by the accepted integral bridge. The operator equality has integer matrices on that lattice; its validity after scalar extension to C therefore implies its validity over Z. Reducing and taking its radical quotient proves the same content scalar on ordinary Dλ over every field. The accepted signed-conjugate dictionary sends each Lk to −Lk under the sign twist, and transpose negates contents. Hence Qn(t) acts on restricted D(λ)=Dλ′⊗sgn⁡ by the content polynomial of λ. This use of the published complex spectrum is an integral operator-identity descent; none of the multiplicity inversion uses characteristic-zero composition counts or semisimplicity.

39.1step 38.1F2F3F4construct

Let α be the multiset of residues of μ. The exact central content polynomial on D(μ) and the central CRT description of the content sums give eα(d)D(μ)=D(μ); this requires no primitive-block assertion. For clarity the functor idempotent e=eα(d)Pd+1,h implies the following test on FhD(μ)=FSd+1e⊗FSdD(μ). On its generating subspace e⊗D(μ), the first-d content polynomial has exactly the scalar for μ, and Ld+1−h is nilpotent. These operators commute and (Ld+1−h)me=0 for a fixed primary exponent m. A coefficient z of Qd+1(t)−(t−h)Qμ(t) is central by the integral identity. On e⊗w it is the corresponding scalar coefficient of Qμ(t) times h−Ld+1: balance the first-d central coefficient across e into w. Centrality lets this same calculation iterate, so zm(e⊗w)=0. Since the whole module is generated by these vectors and z commutes with every group translate, zm is zero on the whole module. On a simple factor a nilpotent central endomorphism is zero, since every nonzero simple-module endomorphism is invertible. Thus every factor in this summand has content polynomial (t−h)Qμ(t).

40.1step 39.1F2F3F4construct

Distinct residues give distinct polynomials: (t−h)Qμ(t)−(t−k)Qμ(t)=(k−h)Qμ(t)≠0 for h≠k. The content polynomial of μ+B appends exactly the residue of B. Its factors therefore occur only in the corresponding residue summand. The total multiplicity computed above is exactly the multiplicity in FiD(μ) required by the target. This argument does not use primitivity or exhaustiveness of any content-block idempotent.

41.1step 40.1F4construct

Transpose preserves boundary types. Literally (μ∪B)′=μ′∪Bt,(μ∖A)′=μ′∖At.

42.1step 41.1F4construct

It sends an addable node to an addable node and a removable node to a removable node; it negates the residue. The appropriate boundary reading order is reversed when transporting the signature convention. It does not exchange addable and removable sets. The proof above needs no claimed equality of induction and restriction multiplicities and no transpose transfer of a restriction count.

43.1step 42.1F1F2F4construct∎

The finite character inversion, boundary-stack calculation, exact induction corner and residue allocation just proved identify the stated multiplicity with zero off conormality and with the conormal weak-above count on conormality. Both cases hold over every field of characteristic p, with nonrestricted auxiliary factors retained until projection and no assertion about other tensor factors.

Remarks

The survey documents the formula's origin; its count is not a proof premise. Biadjunction does not equate these composition multiplicities: in characteristic 2, induction of D(1) to S2 has multiplicity 2 of D(1,1), whereas restricting that simple has multiplicity 1 of D(1). The proof instead uses actual tensor weights, finite integer inversion and an explicit coset map.

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

The cogood node gives the simple socle and head of the residue induction

Statement

Let k be a field of characteristic p>0, μ a p-restricted partition of d and i∈Z/p with φi(μ)>0; let B be the cogood i-node and ν=μ∪B (Residue signatures, normal, good, conormal and cogood nodes). Then FiD(μ) has simple socle and simple head, both isomorphic to D(ν), and the total (ungraded) multiplicity of D(ν) in FiD(μ) is φi(μ) (Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi).

Facts & Assumptions

Given: A field F of characteristic p>0, a p-restricted partition μ of d, a residue i with φi(μ)>0, its cogood node B, and ν=μ∪B.

[F1]

The integrated Schur endomorphism algebra has normalized semistandard cell maps and actual weight projections, and the right corner is transported by ρh(x)=hx (The type-A q-Schur algebra and its Weyl modules, The Schur idempotent and the Schur functor for type-A q-Schur algebras). Nonzero cellular form quotients are absolutely simple and classify the simples; canonical Schur norm one makes all Schur labels nonzero (Nonzero cell heads classify the simple modules of a cellular algebra). All corner and socle-lifting assertions needed below are proved locally.

[F2]

The accepted integral root-interval supplier gives the T,Q operators, splitting identity (P), zero criterion (Z), matched norm (M), and triangular hats, including distinct essential hats and the essential-regular characterization of root normality (An integral essential-subset basis and count for type-A root intervals). Its global tensor/positive-detection foundation is recalled explicitly below; no characteristic-zero PBW or strong-linkage premise is used.

[F3]

The independent Murphy datum and signed-conjugate module/form bridge have form factor one at q=1 (The Murphy cellular basis, the cell law and the Murphy form, Ordinary Specht modules are the signed conjugate Murphy cells). The published ordinary group form criterion and classification give distinct absolutely irreducible quotients exactly at regular labels, with nondegenerate invariant quotient forms (Nonzero modular Specht quotient criterion, Modular simple modules of the symmetric group, Modular Specht form and radical quotient). Thus the restricted convention is obtained through the actual sign/inverse dictionary, not a finite-e Hecke classifier.

[F4]

The complete locally proved Conormal-node composition multiplicities under residue induction gives, over every field of characteristic p, zero multiplicity off conormality and otherwise the number of conormal i-nodes weakly above the restricted addition B. The recovered reviewer independently verified its tensor-weight support, integer opposed recurrence, boundary-stack evaluation, actual induction corner and central-content residue allocation on the guarded companion proposal. Only the final total-multiplicity step uses this interface.

[F5]

Normal/good and conormal/cogood mean the surviving signs, first surviving minus and last surviving plus in the top-to-bottom reduced signature (Residue signatures, normal, good, conormal and cogood nodes). Primary projectors are commuting polynomials in the Jucys-Murphy elements, inverse fixes them, and Ld+1 commutes with FSd (Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi). Their needed content/adjunction interfaces are proved locally below. A self-dual finite-dimensional module has head dual to socle (The radical, socle, head, and Loewy series of a finite-dimensional module).

Proof

technique · direct
1.1givenF1F2construct

We first establish the restriction endpoint locally. Work with left Schur modules through star. In tensor degree m, the word of mαTw has jth letter the row containing j in tαw; at regular type it is jw−1, with zero-multiplicity labels omitted. Over K=F(t) the evaluations g⊗m span the tensor Schur algebra: a functional killing them gives a polynomial zero on invertible matrices; multiplication by det⁡ and the infinite-field polynomial identity force that polynomial to be zero. Schur simples are therefore simple polynomial GLN modules. The canonical shape/type diagonal is its permutation-summand projection, whose square gives canonical form value one. Semistandard column strictness bounds entries at most k by the first k rows, so all weights are dominated by the highest weight ξ and the highest space is Kv. Integer torus characters, rather than Lie eigenvalues modulo p, distinguish these weights.

2.1step 1.1construct

Gaussian factorization g=u−tu+ on the big cell shows that negative coefficient operators on v span its simple module: a functional killing them kills gv on that open set and hence everywhere by polynomial identity. Similarly, positive coefficient operators detect every nonzero vector x of weight ξ−Γ. If every positive highest coefficient vanished, the highest coefficient of gx would vanish on the big cell, because negative operators cannot raise any weight to ξ; it would then vanish on the orbit of x, which spans the simple and contains v. All coefficient operators have integral tensor replacement matrices, and the ranks and Hom kernels of finite matrices preserve extension from F to K. These arguments consequently descend to F.

3.1step 2.1construct

Let ξN=0, l=N−1, and let M be the full last-coordinate-one subspace of LN(ξ). A primitive vector means one killed by every nonconstant coefficient of the upper Levi unipotent group, not merely by its Lie generators. Factor the full upper group as VUl+, where V has only the last column above the diagonal nontrivial. A positive test of a Levi-primitive vector acts only through V, since the right-hand nonconstant Levi coefficients kill it. Raising last coordinate 1 to highest coordinate 0 requires a V monomial of degree exactly one. Positive detection therefore gives ErNx=cv≠0 for some r. Hence wt⁡(x)=ξ−βr, where βr=αr+⋯+αl, even when the initial first-level deficit was arbitrary. On that primitive weight space x↦ErNx is injective by the same detection argument, so its dimension is at most one.

4.1step 3.1F2construct

Put aj=ξj−ξj+1 and use B(r,s)=s−r+∑j=rsaj and C(r,s)=s−r+∑j=rs−1aj. For nonempty I, the canonical Q(I) kills a primitive vector: if b=min⁡I, its ascending-prefix letter eb−1 commutes past the remaining ascending letters, whose indices exceed b, and becomes a rightmost Levi letter with b−1<l. Expand a nonzero primitive vector of weight ξ−βr in the essential T basis and select the largest hat among its nonzero coefficients. The triangular pivot isolates a nonzero term. That hat cannot be nonempty, since its Q test would annihilate the vector. Distinct essential hats therefore leave exactly one essential set with empty hat. Empty is linked precisely to a regular set, and the essential-regular matching theorem says such a set exists precisely when r is normal. This proves necessity of normality.

5.1step 4.1F2construct

Conversely, for normal r let Rr={s∈(r,l]:B(r,s)=0} and choose its compensation f with r<f(s)≤s and B(f(s),s)=0. Put D=f(Rr). The inverse matching makes D regular, so its hat is empty. The matched norm is Ξr,l(D)=∏s∈[r,l]∖RrB(r,s)≠0: B(r,r)=ar≠0, and Rr removes exactly the other zero factors. Thus Tr,l(D)v is nonzero, and the maximal-hat assertion gives h(I,D)=0 for every nonempty I. For r≤j<l, every positive test of ejT(D)v has grade βr−αj. Expanding its root matrices into simple words and appending the rightmost ej gives full words with nonempty canonical Q index, since ej acts before ej+1. All highest coefficients vanish, so positive detection gives ejT(D)v=0. For j<r the target weight is outside dominance below ξ and is zero. A nonconstant Levi coefficient whose weight is not bounded by βr likewise has zero target. At a weight bounded by βr, root-variable exponents are at most one, so the coefficient is a product of positive root matrices, each an iterated simple-root commutator; its rightmost root kills the vector. This proves full group primitivity. The primitive line at ξ−βr is consequently one-dimensional exactly at normal r, and we denote any nonzero vector on it by vr.

6.1step 5.1construct

We separate primitive labels integrally, including p=2. In tensor degree b for Levi rank l, put Ha=Eaa and define (Ha2) to act on a weight ζ by the integer (ζa2) reduced in F. Concretely it is ∑x<yEaa(x)Eaa(y), with no division by 2 in F. The tensor action Zb of the group central transposition sum zb=∑x<y(x,y) satisfies the exact integer identity Zb=∑a(Ha2)+∑a<c(EacEca−Ha). The equal-position part of EacEca is Ha; after subtracting it, the terms are exactly the two swaps of unequal labels. The diagonal terms count equal-label pairs. Since zb commutes with the position group and every Schur endomorphism, this operator belongs to the Schur algebra and is central.

7.1step 6.1construct

On a primitive vector of dominant weight ζ, Eac kills it for a<c, so EacEca acts by Ha−Hc. Therefore Zb has scalar κ(ζ)=∑a(ζa2)−∑c(c−1)ζc=∑(c,j)∈[ζ](j−c). The binomial here is the actual diagonal weight operator of step 6.1. Centrality makes this scalar constant on the cyclic module generated by the vector. For first-level ζr=(ξ1,…,ξl)−ϵr, it is κ(ζr)=κ(ξ)−(ξr−r), so κ(ζt)−κ(ζr)=−C(t,r). Thus the cyclic Levi module Ψr generated by vr cannot contain another primitive vt when C(t,r)≠0. Equality of the scalars alone does not prove simplicity; we treat it explicitly next.

8.1step 7.1construct

Suppose t<r are normal and C(t,r)=0. Choose D for the demands of r as in step 5.1. For w≥r, B(t,w)=B(r,w), and B(t,r)=ar≠0. The demands of t split into Y={y∈(t,r):B(t,y)=0} and Rr. Compensation for Y, inherited from normality of t, has image E below r. Since B(t,r−1)=C(t,r)−1=−1≠0, all those targets and E lie at most r−2. Combining their matching with D gives compensation for every demand of t, so choose vt=Tt,l(E∪D)v and vr=Tr,l(D)v. For each e∈E its matched y gives B(e,y)=B(t,y)=0, hence C(t,e)=0. If E≠∅ and e=max⁡E, then C(e,r)=C(t,r)−C(t,e)=0.

9.1step 8.1F2construct

Splitting (P) gives Tt,r−1(E)vr=vt−Tt,l((E∖{e})∪{r}∪D)v−C(e,r)Tt,l(E∪{r}∪D)v. The last term is zero. The middle term has a (Z) witness with endpoint r−1, outside its cuts because E≤r−2 and D>r. Removing matched source e releases its zero-B target ye; assign t to ye and retain the matching on E∖{e}. All distinct bounded targets are below r−1. Hence that term is zero as well. For E=∅, (P) omits the middle term and its last coefficient is C(t,r)=0. In both cases vt=Tt,r−1(E)vr∈Ψr, without a field denominator.

10.1step 9.1F1construct

The Gaussian argument on a cyclic module, without assuming simplicity, shows that Ψr is spanned by negative Levi coefficients on vr and has weights at most ζr. Any nonzero proper Schur submodule contains a simple Schur submodule and thus a primitive vt by step 3.1. Dominance gives t≤r. For t=r, its one-dimensional line is the generating line and would generate all of Ψr; thus a proper submodule has t<r, and the central scalar requires C(t,r)=0. Conversely, such an earlier normal t gives a proper nonzero Ψt⊂Ψr by step 9.1, since its weights are at most ζt<ζr. Consequently Ψr is simple precisely when r is normal with no earlier normal t satisfying C(t,r)=0. All simple Schur submodules of M are exactly these Ψr, each once: every simple has a primitive highest vector, and each primitive line has dimension one.

11.1step 10.1F5construct

Now assume ξ restricted. The root criterion is its physical signature criterion: ar≠0 identifies the removable node in row r; scanning j>r, a nonzero aj gives a removable push if C(r,j)=0 and an addable pop at row j+1 if B(r,j)=0. These events have the residue of row r; at aj=0 the matching slot supplies and consumes itself and is neutral. For 0<aj<p, the two events are disjoint. The compensation-prefix inequalities are exactly survival of the initial push in the signature stack. Also C(t,r)=(ξt−t)−(ξr−r) compares the residues. Thus the simple cyclic modules in step 10.1 are exactly at the good nodes. Their lower labels are restricted: removing row r decreases ar by one and increases ar−1 by one. The only failure, when r>1, would be ar−1=p−1. Then C(r−1,r)=0, and r−1 is also normal, since its later demands are those of r, B(r−1,r)=ar≠0, and the compensation for r is also valid for r−1. This contradicts goodness. Hence every Schur socle factor survives the restricted-label corner; no assertion is made about the other composition factors.

12.1step 11.1F1F3construct

To transfer without a held generic classifier, for ξ⊢m choose N=m+1 and the regular composition ω=(1m−1,0,1), so ξN=0 even for columns. Compute the cell corner temporarily in its original right-module convention, then transport through star. Its permutation summand is Mω=FSm, and its actual projection e gives eSe=FSm via ρh(x)=hx. Type-ω tableaux correspond to standard tableaux by increasing relabeling 1,…,m−1,N to 1,…,m. Their normalized map fibers are singleton, and evaluation at 1 sends φst to mst. Higher ideals correspond as equality of corner basis spans. The Weyl weight projection keeps exactly these basis vectors; read its cell action using a fixed outer index of the same type and evaluate at 1 to get the Murphy action. Thus Wζe≅CM(ζ) with the actual same-shape normalization.

13.1step 12.1F3construct

In the Schur cell product choose all four indices a,s,t,b standard of type ω. Evaluation at 1 turns φasφtb≡Bζ(ws,wt)φab into masmtb≡Bζ(ws,wt)mab, so the unique Murphy coefficient gives Bζ(ws,wt)=Gζ(cs,ct). The factor is one. Since e∗=e, the Weyl splitting W=We⊕W(1−e) is orthogonal, giving rad⁡form(We)=rad⁡form(W)e, including zero corner forms. Projection is exact by lifting ye through xe and taking kernels fixed by e. Hence Lζe≅CM(ζ)/rad⁡form. The actual q=1 form-unit bridge identifies it with Dζ′⊗sgn⁡, nonzero exactly when ζ′ is regular. Transporting these right-cell identities through star gives the corresponding left corners eWζ and eLζ used below. Their nonzero images are exactly the distinct absolutely simple restricted-label modules D(ζ), with the inverse group convention fixed by the nondegenerate quotient form.

14.1step 13.1construct

Let π1 be the sum of actual weight projections with last coordinate one, so M=π1LN(ξ). The lower Schur orbit matrix EA embeds as Ediag⁡(A,1); on each word with one N it preserves that position and applies EA to the remaining ordered positions. Products agree and the lower identity is π1, and transpose/star is respected. The lower regular projection of ω′=(1m−1,0) maps to e. On the coset-word convention of step 1.1, ρh′ acts by label permutation h−1 on the used lower labels, fixing N, identically to ρh for the subgroup fixing the last entry of Sm. Thus, in the left convention, e′M=eLN(ξ)↓Sm−1. Write SL=S(N−1,m−1) for this lower Schur algebra; every socle and corner lift of M below is over SL. The inverse/star equivalence passes between right and left modules and commutes with this embedding, restriction and sign; the ordinary simple labels are fixed by their nondegenerate invariant quotient forms. No self-duality of a degenerate Specht module is assumed.

15.1step 14.1F1construct

Socle preservation requires more than exactness. By step 11.1 every Schur socle simple of M survives e′. A nonzero Schur submodule killed by e′ would contain a simple submodule inside that socle, whose corner is nonzero, a contradiction. Now a group-simple injection j:D→e′M corresponds to SLe′⊗e′SLe′D→M, se′⊗x↦sj(x), s∈SL. Its image I is generated by its corner e′I=j(D). A proper Schur submodule J of I has either e′J=0, excluded by the no-killed-submodule property, or e′J=e′I, which generates I and forces J=I. Thus I is simple. Every group-simple corner submodule lifts to an actual Schur simple submodule, and conversely every surviving Schur simple has simple corner. Exactness on the semisimple sum, distinct labels and the one-dimensional primitive lines yield soc⁡FSm−1(e′M)=e′soc⁡SLM, multiplicity-free with exactly the good-deletion labels. The unused coordinate includes columns and m=1, whose lower degree-zero corner is F.

16.1step 15.1F5construct

The group central zm acts on D(ξ) by κ(ξ), since its tensor action is step 6.1 and its regular-summand action is ρzm; right multiplication equals left multiplication for this central element. On the good lower label it acts by κ(ξ−A). Therefore Lm=zm−zm−1 has scalar res⁡(A) on that simple submodule, with the restricted convention c−r. Primary projection selects just that residue, and socles respect the actual direct sum. We obtain soc⁡EiD(ξ)=D(ξ−Ai) when εi(ξ)>0, and zero otherwise. In the latter case EiD(ξ)=0, since a nonzero finite-dimensional module contains a simple submodule.

17.1step 16.1F3F5construct

The invariant nondegenerate quotient form makes D(ξ) self-dual. A primary polynomial projector in Lm is self-adjoint, since the inverse involution fixes Lm, so its summand has a restricted nondegenerate invariant form. Its head is therefore dual to its simple socle and is the same simple. Thus for every restricted η,τ of consecutive degrees, dim⁡FHom⁡(EiD(η),D(τ)) is one if εi(η)>0 and η−good⁡i(η)=τ, and zero otherwise. The scalar endomorphism ring is F by absolute simplicity. This all-pairs criterion includes the zero case and all initially possible primitive weights; it does not discard middle composition factors.

18.1step 17.1F5construct

We justify the needed functor interfaces locally. In ZSn the Jucys identity is ∏r=1n(u+Lr)=∑g∈Snu#cycles⁡(g)g. Induct on n: choosing u leaves n fixed, and choosing (a,n) inserts it next to a in a cycle, bijectively covering the non-fixed permutations. Hence each elementary symmetric JM coefficient is central over every field. On a simultaneous primary tuple these operators have generalized eigenvalues equal to its elementary symmetric residue coefficients; nilpotence follows by expanding a polynomial in the commuting nilpotent differences. Distinct residue multisets have distinct coefficient tuples, since their monic products of prime-field linear factors retain multiplicities uniquely even in characteristic p. For each elementary symmetric operator, construct its univariate primary projectors by the same polynomial CRT construction as in [F5], then multiply these commuting projectors. This gives the content projector equal to the sum of tuple projectors of that content. This proves content centrality without factorial division, position-dependent symmetric-polynomial claims, or content-block primitivity. The projectors are inverse-fixed. For an input in content α, induction projection by right eαPd+1,i is the same as right Pd+1,i, because geα⊗x=g⊗eαx. An absolutely simple D(μ) lies in exactly one of these central contents, since their scalar idempotents are orthogonal and sum to one; denote it by α. Thus these interfaces agree with the actual functor definition.

19.1step 18.1construct

Put G=Sd+1, H=Sd, and let EH:FG→FH truncate group coefficients. For left modules the natural Frobenius map is Φ(g⊗x)(y)=EH(yg)x, with coinduction action (aq)(y)=q(ya). It is balanced and G-linear by EH(hz)=hEH(z) and EH(zh)=EH(z)h. For a left-coset transversal T of G/H, its inverse is Ψ(q)=∑r∈Tr⊗q(r−1). The right cosets Hr−1 partition G, so evaluation at y has exactly the term yr∈H and returns q(y). On g⊗x the unique term with r−1g∈H balances back to g⊗x. These verify both identities and naturality with correct cosets and only finite choices.

20.1step 19.1construct

Let e=eαPd+1,i, commuting with FH and inverse-fixed. For any such centralizer element, EH(eZ)=EH(Ze): the coefficient at h is the group coefficient trace τ(h−1eZ)=τ(h−1Ze), by cyclicity and commuting e with h−1. Under Φ, the value at one of right projection Re is consequently q(e). If f:N→Coind⁡X is G-linear, f(en)(1)=f(n)(e). Evaluation therefore identifies projected maps N→FiX with H-maps EiN→X; conversely an H-map extends via qn(y)=h(eyn), with h:EiN→X evaluated after the projector e. For X=eαX, every H-map already selects the matching content. Thus Hom⁡G(N,FiX)≅Hom⁡H(EiN,X) exactly, with no duality shift and no asserted equality of composition multiplicities.

21.1step 20.1F5construct

The labelled signature inverse is local. Adding or removing a corner flips its i-sign, and the other boundary statuses that can change have residues i±1, not i for p≥2. In the stack reduction, flipping the last surviving plus gives the first surviving minus and conversely: before that position the minus stack is empty, and its distinguished minus survives exactly when every suffix prefix has at least as many minus pushes as plus pops, equivalent to no later plus surviving after the flip. Good removal preserves restrictedness by step 11.1. Cogood addition also does: its only possible new forbidden difference is ar=p−1, in which case the addable node in row r+1 has the same residue, with no i-node between the two pluses. If the earlier plus survives, the later one also survives, contradicting that the earlier is cogood. Hence addition remains restricted and the inverse holds in both directions. In particular B is cogood for μ exactly when it is good for ν=μ∪B. No equality between εi(ν) and φi(μ) is used.

22.1step 21.1F3construct

Apply step 20.1 with N=D(η) and X=D(μ) for every restricted η⊢d+1. By step 17.1 the resulting Hom space is one-dimensional precisely when η−good⁡i(η)=μ, and zero otherwise. Step 21.1 makes exactly one such label, namely ν=μ∪B. The group simple classification covers every simple by these absolutely irreducible labels. The dimensions of all simple-to-module Hom spaces therefore identify the socle of FiD(μ) as the single D(ν), with socle multiplicity one, excluding every other label.

23.1step 22.1F3F5construct

Give Ind⁡HGD(μ) the invariant nondegenerate coset form β(r⊗x,s⊗y)=δrsβμ(x,y) on a finite left transversal. A group element permutes cosets and acts by H on the fibers, proving invariance. Equivalently its value on general group representatives is βμ(x,EH(g−1h)y). The projection Re is self-adjoint: moving it to the first argument gives EH(e∗g−1h), which equals EH(g−1he∗) by the trace calculation of step 20.1, and e∗=e. Its image is orthogonal to the complement and inherits a nondegenerate invariant form. Thus FiD(μ) is self-dual, and its head is the dual of its simple socle, namely D(ν) through the nondegenerate invariant quotient form. This proves both endpoints, including characteristic two.

24.1step 23.1F1F3construct

For d=0, the empty partition has one conormal node (1,1) of residue zero and φ0=1. Induction from S0 to S1 is F, with L1=0, so F0D(∅)=D(1)=F has these endpoints; other residue functors are zero. Every use of F(t) above descends to the original field: weight projections and coefficient operators have matrices over F, finite Hom ranks preserve extension, and the simple Schur and group labels remain absolutely simple. Therefore the endpoint assertions hold over every original field of characteristic p.

25.1step 24.1F4F5construct∎

The total multiplicity is the separate use of [F4]. Apply it to the cogood B, which is bottommost conormal. Its conormal nodes weakly above it are exactly all φi(μ) conormal nodes, so [FiD(μ):D(ν)]=φi(μ). Combining this count with the independently constructed endpoints proves the full statement. The implication uses no equality of induction and restriction composition counts and no equality εi(ν)=φi(μ).

Remark

Steps 1.1–17.1 also prove the following restriction endpoint, independently of the uncoloured-socle corollary: for every p-restricted ξ⊢m with m≥1, soc⁡EiD(ξ)={D(ξ∖Ai),εi(ξ)>0,0,εi(ξ)=0, where Ai is the good i-node and its deletion remains p-restricted. The scalar is the node residue in step 16.1. The proof covers every field of characteristic p, including p=2, using the unused coordinate N=m+1 and the degree-zero lower corner when m=1.

This is the recovered research-only first construction proposal for the exact cogood endpoint case, not a native-ready decision. The saved native50 construction and mathematical steps are reused; recovery has not opened another review or repair round. The endpoint proof is local; the complete target uses the independently reviewed conormal-count companion [F4], which must be integrated first. The actual canonical good-node/uncoloured-socle items and the survey statements are not endpoint proof premises. No general finite-e classifier is used or reopened.

The former unused equality in F3 was false: for p=2, μ=(1), its two addable 1-nodes are conormal, so φ1(μ)=2; for ν=(1,1) one has ε1(ν)=1. The true labelled good/cogood inverse is proved above. Simple endpoint multiplicity one and total composition multiplicity two in this example are consistent.

The authentic cached Kleshchev 1995 II scan (SHA-256 6a7a7856d3eb8c8198920c02bdcdd16d8b350f024d39ae96215f072050bc368c, 51 PDF pages) was recorded by the original native50 constructor as read visually on every printed page 198–212 and 163–166. The recovery constructor read the saved proof, proposal and handoffs; it does not claim to have repeated that visual reading. These include the full Theorems 4.2 and 4.11 proofs/continuations and the actual Theorem 0.5 statement. The scan ends with section 4 and references, not a section 5. The source's strong-linkage citation in 4.11 is replaced here by the integral central tensor operator and explicit compensated containment. No full-article/book reading or new retrieval is claimed. Source reading, preimages, pending interfaces and exact hashes are recorded in the accompanying handoff; all prior K/50 seals and caps remain untouched.

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

The socle of an uncoloured modular restriction is the multiplicity-free sum over the good residues

Statement

Let k be a field of characteristic p>0 and let μ be a p-restricted partition of d≥1; write D(μ) for the simple kSd-module labelled by μ (Modular simple modules of the symmetric group, p-regular and p-restricted labels under transpose and sign). Let Ai denote the good i-node of μ, for those i∈Z/p with εi(μ)>0 (Residue signatures, normal, good, conormal and cogood nodes). Then soc⁡Sd−1(D(μ)↓Sd−1)=⨁i: εi(μ)>0D(μ∖Ai), a multiplicity-free sum over distinct simple modules: distinct residues give distinct summands. The sum runs over the residues i with εi(μ)>0, one good node per such residue; the completely reducible special case (the restriction is semisimple if and only if every normal node is good, Kleshchev II Theorem 0.6) is a separate statement and is not asserted here.

Facts & Assumptions

Given: A field k of characteristic p>0, a p-restricted partition μ of d≥1, and the good i-nodes Ai of μ.

[F1]

Res⁡Sd−1SdM=⨁i∈Z/pEiM for every finite-dimensional kSd-module M, where each EiM is a kSd−1-submodule and Ei is the residue-summand functor attached to the primary Jucys-Murphy idempotents (Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi).

[F2]

For a residue i with εi(μ)>0 the good i-node Ai is the unique normal i-node with no normal i-node above it, and the nodes Ai for distinct residues i are distinct nodes of μ, so the partitions μ∖Ai of d−1 are distinct (Residue signatures, normal, good, conormal and cogood nodes).

[F3]

Steps 1.1–17.1 of The cogood node gives the simple socle and head of the residue induction prove the restriction endpoint independently of this corollary: the root interval primitive lines, compensated containment, Schur-corner socle lift and class-sum localization give soc⁡Sd−1(EiD(μ))={D(μ∖Ai),εi(μ)>0,0,εi(μ)=0. The good-deletion labels are p-restricted by that proof's step 11.1. Only this proved restriction argument is used here; the later induction endpoint and its conormal multiplicity are not needed.

[F4]

Over every field k of characteristic p, the conjugate-sign isomorphism of Conjugate Specht modules are sign-twisted duals over every field identifies S(ν)=(Skν)∗ with Skν′⊗sgn⁡. Twisting by sign preserves submodules and their radicals, since it multiplies each group operator by a unit scalar. Thus its head is D(ν)=Dkν′⊗sgn⁡ for p-restricted ν. These heads are nonzero and absolutely simple by Nonzero modular Specht quotient criterion. They are pairwise nonisomorphic: twisting an isomorphism back by sign and applying the separation assertion of Nonzero maps into tabloid quotients force dominance forces ν1′=ν2′, hence ν1=ν2. No splitting-field descent is assumed.

[F5]

The socle of a finite-dimensional module is the sum of its simple submodules, and the socle of a finite direct sum is the direct sum of the socles of the summands. Indeed each projection of a simple submodule is zero or simple, so that submodule lies in the sum of the summand socles; the reverse inclusion holds because each simple submodule of a summand is a submodule of the sum (The radical, socle, head, and Loewy series of a finite-dimensional module).

Proof

technique · direct
1.1givenF1F5

By [F1] the restriction decomposes as Res⁡D(μ)=⨁i∈Z/pEiD(μ) with each EiD(μ) a kSd−1-submodule, and by [F5] the socle of the restriction is the direct sum ⨁isoc⁡(EiD(μ)).

1.2givenF3F4

By the local restriction argument [F3], for each residue i the module soc⁡(EiD(μ)) is D(μ∖Ai) when εi(μ)>0 and is 0 when εi(μ)=0; by [F3] each μ∖Ai is a p-restricted partition of d−1, so each displayed D(μ∖Ai) is a simple kSd−1-module by [F4].

2.1step 1.1step 1.2F3

Summing the descriptions of step 1.2 over the finitely many residues i∈Z/p and using step 1.1 gives soc⁡Sd−1(D(μ)↓Sd−1)=⨁i: εi(μ)>0D(μ∖Ai).

3.1step 2.1F2F4

The sum is multiplicity-free and its summands are pairwise non-isomorphic: if i≠j and both εi(μ) and εj(μ) are positive, then the good nodes Ai and Aj have different residues and are therefore distinct nodes of μ, so the p-restricted partitions μ∖Ai and μ∖Aj of d−1 are distinct by [F2]; by [F4] their simple modules D(μ∖Ai) and D(μ∖Aj) are non-isomorphic. Each residue contributes its summand once, so each isomorphism class occurs with multiplicity one in the displayed socle.

4.1step 2.1step 3.1given∎

The displayed decomposition of step 2.1 has the left-hand side soc⁡Sd−1(D(μ)↓Sd−1) and, by step 3.1, is a multiplicity-free sum over distinct simple modules with one summand per residue i satisfying εi(μ)>0. No claim is made here about the restriction being semisimple. In the smallest case d=1 one has μ=(1), and the only node of residue 0 is the removable node (1,1), so ε0(μ)=1 and the right-hand side is the single term D(∅)=k, while the restriction to the trivial group S0 is k itself, in agreement with the display; this is the smallest instance in which the summands carry the empty partition as a label.

Remarks

  • Proof input. The per-residue endpoint is proved in steps 1.1–17.1 of The cogood node gives the simple socle and head of the residue induction. That argument does not depend on this corollary or on the later thm-good-node-gives-the-simple-socle-and-head-of-residue-restriction; the latter uses this corollary together with the normal-node count. The cited literature documents the origin of the result.
  • No character theory. Nothing in the proof uses complex characters or reciprocity; modular multiplicities are not computed from characteristic zero data.
  • Choice. All index sets are finite and no choice principle is used.
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Every p-restricted partition is reached from the empty partition by cogood additions

Statement

Let k be a field of characteristic p>0. Every p-restricted partition μ of d is obtained from the empty partition by d successive cogood additions: there are residues i1,…,id with μ=f~id⋯f~i1∅; equivalently, every p-restricted μ≠∅ has at least one good node, and successive good deletions carry μ to ∅ (Good-node deletion and cogood-node addition operators, Residue signatures, normal, good, conormal and cogood nodes). Hence, in the graph whose vertices are the p-restricted partitions and whose edges join ν to f~iν for every i for which the operator is defined, the empty partition is the unique vertex of rank 0 and every vertex is reached from it; dually every vertex reaches the empty partition by successive good deletions. The argument is choice-free.

Facts & Assumptions

Given: A field k of characteristic p>0, a p-restricted partition μ of d, and the simple kSd-module D(μ).

[F1]

For a finite-dimensional kSd-module M the multiplication kSd⊗kSdM→M is the identity, and the counit kSd⊗kSd−1M→M, g⊗m↦gm, of the induction-restriction adjunction is a surjective kSd-module map; the group ring kSd is free of rank d as a right kSd−1-module (Restriction, induction, and coinduction, The group ring is free over a subgroup ring).

[F2]

If M≠0 is a finite-dimensional module over a finite-dimensional k-algebra, then M has a nonzero simple submodule: a nonzero submodule of least positive dimension exists and has no proper nonzero submodule; the socle soc⁡(M) is the sum of the simple submodules of M (The radical, socle, head, and Loewy series of a finite-dimensional module).

[F3]

For every field k of characteristic p, the ordinary Specht module Skμ′ has nonzero absolutely simple head Dkμ′ when μ is p-restricted, since μ′ is p-regular (Nonzero modular Specht quotient criterion). The arbitrary-field isomorphism (Skμ)∗≅Skμ′⊗sgn⁡ identifies its dual-Specht head with D(μ)=Dkμ′⊗sgn⁡ (Conjugate Specht modules are sign-twisted duals over every field). Tensoring by sign is an exact equivalence, so this head is nonzero and simple over the original field. Only existence of this head is needed here, not completeness of a simple-label classification or a splitting modular system.

[F4]

Kleshchev's residue-refined socle theorem: for p-restricted μ, soc⁡Sd−1(D(μ)↓Sd−1)=⨁i: εi(μ)>0D(μ∖Ai), a multiplicity-free sum over the good nodes Ai, one for each residue with εi(μ)>0 (The socle of an uncoloured modular restriction is the multiplicity-free sum over the good residues).

[F5]

For a p-restricted μ and a residue i: the good i-node Ai exists exactly when εi(μ)>0; deleting it returns a p-restricted partition μ∖Ai of d−1; adding the cogood i-node returns a p-restricted partition; and μ=f~iν  ⟺  ν=e~iμ for p-restricted μ,ν (Good-node deletion and cogood-node addition operators).

Proof

technique · direct
1.1givenF1

Restriction is faithful on nonzero modules. Let M≠0 be a finite-dimensional kSd-module and consider the multiplication map φ:kSd⊗kSd−1M→M, φ(g⊗m)=gm, where M is regarded as a kSd−1-module by restriction. It is kSd-linear and surjective, since the image of 1⊗m is m and the elements m span M; hence if the restriction of M to kSd−1 were zero, the tensor product would be zero and M=0, a contradiction. Therefore restriction sends no nonzero module to zero.

1.2givenF2

Nonzero finite-dimensional modules have nonzero socle: choosing a nonzero submodule of least positive dimension gives a simple submodule, so the socle, which is the sum of all simple submodules, is nonzero.

1.3givenF3

D(μ) is a nonzero simple kSd-module by [F3], because μ is p-restricted.

2.1step 1.1step 1.3

Applying step 1.1 to M=D(μ) with d≥1: since D(μ)≠0 by step 1.3, its restriction to Sd−1 is nonzero.

3.1step 1.2step 2.1

By step 1.2 applied to the nonzero finite-dimensional kSd−1-module Res⁡D(μ) from step 2.1, the socle soc⁡Sd−1(D(μ)↓Sd−1) is nonzero.

4.1step 3.1F4

By the residue-refined socle theorem [F4], the socle is the multiplicity-free sum of the simple modules D(μ∖Ai) over the residues i with εi(μ)>0. Since this socle is nonzero by step 3.1, at least one residue satisfies εi(μ)>0.

5.1step 4.1F5

Fix such a residue i. By [F5] the good i-node Ai exists, ν:=μ∖Ai is a p-restricted partition of d−1, and μ=f~iν with f~iν=ν∪Ai.

6.1step 5.1induction

Induction on d. We prove that every p-restricted partition of d is reachable from ∅ by d cogood additions. For d=0 the empty partition is the only partition and it is reached by the empty sequence. For d≥1 and a p-restricted partition μ of d, if μ=∅ there is nothing to prove, and otherwise step 5.1 supplies a residue i and a p-restricted partition ν of d−1 with μ=f~iν; by the inductive hypothesis ν=f~id−1⋯f~i1∅ for suitable residues, whence μ=f~if~id−1⋯f~i1∅. The residue i is selected as, say, the least residue with εi(μ)>0, so no choice principle is used.

7.1step 6.1F5

Good deletions carry every p-restricted partition to ∅. At each nonempty stage step 5.1 produces a good node and, by [F5], the partition obtained by deleting it is again p-restricted of rank one less; iterating d times reaches the only partition of rank 0, which is ∅; equivalently, by the inverse property in [F5], the two procedures are mutually inverse step by step.

8.1step 6.1step 7.1∎

Consequences for the graph. By definition the edges of the graph are the partial operations ν↦f~iν, so step 6.1 says exactly that every p-restricted partition is reached from ∅; step 7.1 says every vertex reaches ∅ by good deletions e~i. The empty partition is the unique partition of 0, so it is the unique rank-0 vertex, and it has no incoming edge from a p-restricted partition because no partition of −1 exists; all ranks are finite. No step used the characteristic of k beyond the existence of the socle theorem [F4], and no choice principle was used.

Remarks

  • Where the mathematics sits. The two inputs are the residue-refined socle theorem [F4] and the combinatorial inverse property [F5]; the present item is the induction that turns them into the connectivity of the restricted-partition graph. This is the level-one case of Kleshchev's statement that the restricted multipartitions are exactly the vertices reachable from ∅ (survey (3.14) with Example 3.2(i)).
  • No circularity. The induction removes a good node and reduces the rank; the operator item's closure statements (proved there) keep the reduced partition in the class, so no restrictedness is assumed silently.
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

The good node gives the simple socle and head of the residue restriction

Statement

Let k be a field of characteristic p>0, μ a p-restricted partition of d and i∈Z/p with εi(μ)>0; let A be the good i-node and ν=μ∖A (Residue signatures, normal, good, conormal and cogood nodes). For the residue-summand functor Ei of Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi the module EiD(μ) has simple socle and simple head, both isomorphic to D(ν), and the total (ungraded) multiplicity of D(ν) in EiD(μ) is εi(μ). Thus the Loewy endpoints are simple even though the formal character of EiD(μ) may contain the additional normal-node factors of Normal-node composition multiplicities under residue restriction.

Facts & Assumptions

Given: A field k of characteristic p>0, a p-restricted partition μ of d, a residue i with εi(μ)>0, the good i-node A and ν=μ∖A.

[F1]

Kleshchev's uncoloured socle theorem in its residue-refined form (The socle of an uncoloured modular restriction is the multiplicity-free sum over the good residues): soc⁡Sd−1(D(μ)↓Sd−1)=⨁j:εj(μ)>0D(μ∖Aj), a multiplicity-free sum over the good nodes, one per residue with εj(μ)>0.

[F2]

Res⁡D(μ)=⨁jEjD(μ) is a direct sum of kSd−1-submodules. If X is a removable i-node of μ, μ∖X is p-restricted, and D(μ∖X) occurs as a composition factor of the restriction, then every occurrence belongs to the summand EiD(μ) with res⁡(X)=i (Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi); the localization is proved in Normal-node composition multiplicities under residue restriction.

[F3]

The normal-node multiplicity theorem (Normal-node composition multiplicities under residue restriction): if X is a removable i-node of μ with μ∖X p-restricted, then [EiD(μ):D(μ∖X)] is the number of normal i-nodes of μ weakly below X (counting X) when X is normal, and 0 otherwise.

[F4]

D(μ) is self-dual for p-restricted μ, and the functor Ei commutes with contragredient duality, so EiD(μ) is self-dual; and D(ν) is simple, self-dual and absolutely irreducible (p-regular and p-restricted labels under transpose and sign, Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi).

[F5]

For a finite-dimensional module M: soc⁡M is the sum of its simple submodules, the socle of a direct sum is the direct sum of the socles of its summands, and the head of a self-dual module is the dual of its socle, hd⁡M≅(soc⁡M)∗ (The radical, socle, head, and Loewy series of a finite-dimensional module).

[F6]

The good i-node is the topmost normal i-node, so the normal i-nodes weakly below it are exactly all normal i-nodes of μ, and there are εi(μ) of them (Residue signatures, normal, good, conormal and cogood nodes).

Proof

technique · direct
1.1givenF1F2F5

Socle. By [F5] the socle of Res⁡D(μ)=⨁jEjD(μ) is ⨁jsoc⁡(EjD(μ)). By [F1] the socle of the restriction is the multiplicity-free sum of the D(μ∖Aj) over the good nodes, and by [F2] each summand D(μ∖Aj) lies in EjD(μ) with its residue j; since a nonzero submodule of EjD(μ) cannot lie in ⨁l≠jElD(μ) by the directness of the sum, the j-summand of the socle is exactly the single simple module D(μ∖Aj) and soc⁡(EjD(μ))=D(μ∖Aj) is simple. For j=i this gives soc⁡(EiD(μ))=D(μ∖A)=D(ν).

2.1step 1.1F3F6

Multiplicity. Applying the normal-node theorem [F3] with X=A: since A is a normal i-node, [EiD(μ):D(ν)] is the number of normal i-nodes of μ weakly below A counting A; by [F6] this is εi(μ).

2.2step 1.1F4F5

Head. By [F4] the module EiD(μ) is self-dual; by [F5] its head is the dual of its socle, hd⁡(EiD(μ))≅(soc⁡(EiD(μ)))∗, which by step 1.1 is D(ν)∗≅D(ν) because D(ν) is self-dual by [F4]. Hence the head is simple and isomorphic to D(ν).

3.1step 1.1step 2.1step 2.2∎

Conclusion. Step 1.1 gives simple socle D(ν), step 2.1 the total multiplicity εi(μ) of D(ν) in EiD(μ), and step 2.2 simple head D(ν). The additional normal-node composition factors of [F3] may occur in the middle Loewy layers; the statement asserts only the endpoints and the total multiplicity, and no graded shift is displayed before the Hecke/KLR bridge.

Remarks

  • Where each input is used. The simple socle and the identification of its label come from the recorded uncoloured socle theorem and the localization of the factor in its residue summand; the multiplicity εi(μ) is the normal-node count at the good node, and self-duality produces the head. No complex character theory is used.
  • Distinct statements. The Hom criterion for Specht modules and the socle theorem beyond the good-node summands are not asserted here.
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

General Hecke residue branching endpoints from normalized Schur cells

Statement

Let F be any field, q∈F× have finite quantum characteristic e≥2, and let Hd=HF,q(Sd) with (Tj−q)(Tj+1)=0. Use the actual Murphy cell-form quotients D(λ), indexed by e-restricted partitions, converted to left modules by star. For additive Hecke JM elements Ld, let Ei be the [i]q-generalized eigenspace in restriction to Hd−1; let Fi be induction followed by its commuting right [i]q-primary projector. These functors are defined over F, for i∈Z/e, with [i]1=i and [i]q=(qi−1)/(q−1) otherwise.

For every restricted λ the nonzero EiD(λ) have simple socle and simple head D(e~iλ), each once, and EiD(λ)=0 exactly when the good i-deletion is undefined. Similarly the nonzero FiD(μ) have simple socle and simple head D(f~iμ), each once, and vanish exactly when the cogood i-addition is undefined. Here signatures use content c−r, top-to-bottom order, cancellation of −+, first surviving minus and last surviving plus (Residue signatures, normal, good, conormal and cogood nodes). In particular the restriction socle is the multiplicity-free sum over good residues. This proves endpoints, not total composition multiplicities. Composite e, arbitrary characteristic, nonsquare q, and rank zero are included.

Facts & Assumptions

Given: The field, parameter, actual cellular labels, residue convention and functors of the Statement.

[F1]

The first-level Weyl filtration, one-dimensional primitive/Hom bound and coefficient test, and the actual integral permutation/tensor corner identification are proved in Polynomial quantum Schur first levels: Weyl filtration and the actual Hecke corner. That supplier constructs the abstract highest norm-one form directly on the actual finite cell; it has radical the maximal submodule and gives self-dual simples. Its complete local finite-cell construction is used; no Choice-bearing free global highest-lattice isomorphism is invoked.

[F2]

Central symmetric JM operators act on actual Schur Weyl cells by their node-content scalars, and every constituent retains their full residue multiset (Central Hecke Jucys–Murphy scalars separate q-Schur residue contents).

[F3]

The actual corner and restricted-label classifier identifies the surviving Schur simple with the actual same-label Murphy simple; these are complete, distinct and absolutely simple over the original field (The Schur functor sends Weyl and simple modules to Specht and Hecke simple modules). The standard trace is symmetric and satisfies τ(Tu∗Tw)=δu,wqℓ(w) (The Murphy cellular basis, the cell law and the Murphy form). Additive JM elements commute, centralize the preceding algebra, are star-fixed, and have triangular q-content spectra (The Hecke Jucys-Murphy action is dominance triangular).

[F4]

At q=1, the actual group restriction endpoint is supplied by the initial restriction construction (the first seventeen phases) of The cogood node gives the simple socle and head of the residue induction, independently of its final composition-multiplicity argument. Its actual restricted-label convention is retained. No inverse of q−1 is specialized to zero.

Proof

1.1givenalgebraconstruct

First construct the coefficient polynomials without specializing denominators. For i<j, I=(i,j), D⊆I and pD(t)=max⁡({i}∪{d∈D:d<t}), define H(A,B)=∑D⊆B∖A(−1)∣D∣∏t∈A(xt−xpD(t))∏t∈B(xt−xpD(t)). Cancel common A∩B. For disjoint sets let h=min⁡(A∪B). If h∈A, multiply H(A∖{h},B) by xh−xi. If h∈B, put P=H(A,B∖{h}); splitting the sum according to h∈D gives (P−P∣xi=xh)/(xh−xi). Divided difference of xim is −∑a=0m−1xiaxhm−1−a, so induction proves H∈Z[x] even at coincident coordinates. Also H(∅,B)=δB,∅ by the same recursion. For k∈A, h=max⁡([i,k)∖A), splitting xk−xpD(k)=(xk−xh)+(xh−xpD(k)) gives H(A,B)=(xk−xh)H(A∖{k},B)+1h≠iH((A∖{k})∪{h},B)+1k∈BHi,k(A∩(i,k),B∩(i,k))Hk,j(A∩(k,j),B∩(k,j)). Indeed (h,k)⊆A, so common factors there first cancel. The second difference is zero when h∈D; otherwise its predecessor equals pD(h), giving the second term. The extra k∈D terms have negative sign and split independently at k, giving the positive third product after subtraction. This accounts for every summand.

2.1step 1.1algebra

Put C=I∖A and K(A)=∑B⊆IH(A,B)∏t∈{i}∪B(yt+1−xt). Expansion of each yt+1−xpD(t+1) as (yt+1−xt)+(xt−xpD(t+1)) gives K(A)=∑D⊆C(−1)∣D∣∏t=ij−1(yt+1−xpD(t+1))∏t∈C(xt−xpD(t)). Selected difference factors vanish when their index belongs to D; the remaining predecessor is pD(t), and collection gives exactly H(A,B) by cancellation of the complement numerator/denominator sets. For a bijection θ:C→B0⊆I with θ(c)≥c, this implies the matched-product identity K(A)≡∏t∈[i,j)∖B0(yt+1−xi)(mod(yθ(c)+1−xc:c∈C)). Here is an integral induction proof. If C=∅, the alternating expression is the asserted full product. Otherwise take h=min⁡C, remove its source and target, and apply induction on (h,j). Splitting the alternating sum by h∈D gives the prefix product times the divided difference of Kh,j in xh. The prefix is ∏t=ih−1(yt+1−xi) and the divided difference is (Kh,j∣xh=xi−Kh,j)/(xh−xi). All remaining match generators are independent of xh, so divided differencing retains their ideal. The induction product contains the target θ(h); modulo its match it vanishes before substitution, and after substitution its factor is xh−xi. Cancel that integral factor to leave exactly the tail product with this target removed. No target occurs below h, since targets are at least their sources. The prefix completes the stated product. All divisions here are polynomial divided differences, not evaluation of rational functions.

2.2F1step 1.1algebraconstruct

Suppose q≠1 and temporarily extend F to a field K containing v with v2=q. Take N>d, W=WN(λ), L=W/rad⁡Bτ, and z=zλ. Use the actual normalized root operators F^i,j=v−jKjFi,jKiv−i,ci,j=v−2i−1Ki2−v−2j−1Kj2v−v−1,bi,j=v−2i−1Ki2−v−2j−1Kj+12v−v−1. The denominator is a field unit since q≠1. Define Si,j(A)=∑B⊆(i,j)F^i,b1⋯F^bs,jH(A,B), evaluating xk=−v−2k−1Kk2/(v−v−1); use Si,i=1. The recurrence of step 1.1 gives Si,j(A)=Si,j(A∖{k})ch,k+1h≠iSi,j((A∖{k})∪{h})+Si,k(A∩(i,k))Sk,j(A∩(k,j)). Left-interval toral coefficients commute with right-interval lower roots, so the product order is exactly as displayed. The empty-set operator is F^i,j. Rank-one commutation and the root recurrence give EiF^i,i+1=F^i,i+1Ei+vbi,i, EiF^i,j=v−1F^i,jEi−vF^i+1,j if j>i+1, and Ej−1F^i,j=vF^i,jEj−1+F^i,j−1 if i<j−1. Disjoint indices commute; adjacent exterior indices contribute precisely their K-weight factors. These follow by induction inserting Fi,j=vFi+1,jFi−FiFi+1,j into the simple defining commutators.

3.1step 2.1step 2.2algebra

Modulo the left ideal UEl, the recurrence gives this complete table: ElSi,j(A)=0 if l+1∈A, or l∉{i}∪A and l+1∉A∪{j}; it is −vSi,l(A∩(i,l))Sl+1,j(A∩(l+1,j)) if l∈{i}∪A, l+1∉A∪{j}; it is Si,j−1(A) if l=j−1∉{i}∪A; finally for j−1∈A, h=max⁡([i,j−1)∖A) it is Si,j−1(A∖{j−1})bh,j−1+1h≠iSi,j−1((A∖{j−1})∪{h}). To verify the table induct on ∑a∈Aa using step 2.2. Empty A is the elementary table. For A={l+1}, l>i, expand again at l; the two cut remainders are F^i,lF^l+1,j and its negative and cancel. At l=i the cancellation is bi,iF^i+1,j=F^i+1,jci,i+1. For any other k∈A the recurrence splits into intervals, the remote factor commutes, and the other factor uses induction. For the split row reduce to l=i by expanding at k=l; if the replacement is i+1 its remainder is the vanishing row, and otherwise all terms combine into the recurrence for Si+1,j. The shortened-endpoint row uses the same induction at the other end. Expanding at k=j−1 gives the final row: Ej−1F^j−1,j contributes vbj−1,j−1, its weight factor is v−1, and ch,j−1+bj−1,j−1=bh,j−1. These exhaust all positions. Successive commutation through a cut product gives Ei⋯Ej−1F^Bz=v∏t∈{i}∪Bbt,t(λ)z. Summing proves Ei⋯Ej−1Si,j(A)z=vK(A)(λ)z.

4.1F1step 3.1algebra

Evaluate bi,k(λ)=(qλi−i−qλk+1−k)/(q−1) and ci,k(λ)=(qλi−i−qλk−k)/(q−1). Let Bi,j be the zero-b set in [i,j) and Ci,j the zero-c set in (i,j). Their vanishing is exactly the corresponding equal-residue comparison. If ci,k+1=0, then bi,k≠0, because ci,k+1−bi,k=qλk+1−k−1 is a unit. Write B↓C for an injection of demands B into supports C, sending each demand to a weakly smaller support. For C⊆Ci,j, we claim nonzero Si,j((i,j)∖C)z in L implies Bi,j↓C. Induct on j−i. At length one the elementary commutator and positive detection give equivalence with bi,i≠0. At larger length some El has nonzero image: otherwise all positive divided powers kill this vector, since its deficit has each simple-root coefficient zero or one, so powers greater than one have absent target weights; triangular spanning would generate a proper second highest submodule of the simple L. Use the table of step 3.1. In the split case its disjoint factors commute, so both their vectors are nonzero; induction gives matchings on both intervals, and ci,l+1=0, bi,l≠0 identify the split demands with the full ones. If j−1∈C, induction on the shortened interval matches old demands and the extra demand, when present, uses j−1. Otherwise put h=max⁡({i}∪C) in the last table row. A nonzero first term has bh,j−1=bi,j−1≠0, so there is no new demand. A nonzero second term matches old demands into C∖{h}; the released largest support h handles the only possible new demand j−1. This proves the claim in every case.

5.1F1step 2.1step 4.1step 3.1algebra

A primitive line of L1 at λ(i) exists exactly when Bi,N↓Ci,N. For necessity, dualize a nonzero primitive map using [F1] to get L1→∇(λ(i)). Its highest coefficient functional on W1 is nonzero at F^i,Nz and zero at all nonempty cut products, by [F1]'s exact coefficient test. On Si,N(A)z, A=(i,N)∖Ci,N, its value is therefore that nonzero value times H(A,∅)(λ)=∏t∈Aci,t(λ)≠0. This vector survives the radical, so step 4.1 gives necessity. Conversely choose a matching with image C⊆Ci,N of size ∣Bi,N∣ and invert it to a bijection C→Bi,N with targets at least their sources. The polynomial match generators in step 2.1 vanish, so K((i,N)∖C)(λ)=∏t∈[i,N)∖Bi,Nbi,t(λ)≠0. Step 3.1 makes the resulting w nonzero in L. Its lower-Levi commutators vanish in L: a potentially nonzero split has l+1∈C and demands Bi,l∪Bl+1,N. If its first factor survives, step 4.1 gives ∣Bi,l∣≤∣C∩(i,l)∣; since ∣Bi,N∣=∣C∣ and l+1∈C, the suffix demands outnumber suffix supports, forcing the second factor into the radical. Higher divided generators have absent target weights. Thus w is primitive. [F1] gives one-dimensionality and excludes every other primitive highest label.

6.1F1F2step 4.1step 5.1step 2.2algebra

Let vi be the nonzero primitive line for a matched removable row i and Ψi its cyclic lower-Schur module. If it has a proper nonzero submodule, that submodule contains a simple submodule, whose highest line is vh by [F1] and step 5.1. Triangular spanning puts its weight strictly below λ(i), so h<i; equality would contain the generating line. The universal Weyl map onto Ψi and [F2] force λ(h) and λ(i) to have the same residue multiset, hence ch,i=0. Conversely suppose h<i are matched and ch,i=0. The demand/support sets split as Bh,N=Bh,i∪Bi,N and Ch,N=Ch,i∪{i}∪Ci,N. A prefix matching exists by restricting any matching for h to demands below i; these cannot use later supports. Combine it with a matching for i, giving an image C omitting i with exactly ∣Bh,i∣ earlier and ∣Bi,N∣ later supports. Let A=(h,N)∖C, k=max⁡({h}∪(C∩(h,i))). Then ck,i=0, and the recurrence at i gives Sh,N(A)z=1k≠hSh,N((A∖{i})∪{k})z+Sh,i(A∩(h,i))Si,N(A∩(i,N))z. When present, the first term replaces support k<i by i; its earlier demands now outnumber earlier supports, so step 4.1 kills it in L. The other full and suffix vectors are the nonzero primitive vectors of step 5.1. Hence vh lies in Ψi and generates a proper submodule. Thus Ψi is simple precisely for the first matched row of its residue, and the full first-level socle is the multiplicity-free sum of these simples.

7.1step 4.1step 6.1algebra

The matching criterion is exactly the signature criterion. A zero ci,k records a later removable push of the same residue and a zero bi,k a later addable pop; nonremovable equal rows have both slots and cancel as a neutral pair. Removing common demand/support slots preserves the prefix inequalities for B↓C. The remaining prefix inequalities say that the minus at row i survives all later pops. Thus matched rows are normal, and the first matched row of a residue is its good row. Good deletion preserves restrictedness: its only possible new gap e is above the deleted row, when λi−1−λi=e−1. The adjacent removable corners then have the same residue and no intervening same-residue boundary corner; if the lower minus survives, the upper minus survives too, contradicting first-surviving selection. The dual adjacent-plus argument proves cogood addition preserves restrictedness. Flipping the selected minus to plus changes no other i-boundary status, since all other changed corners have residues i±1, different from i even at e=2. Before the first surviving minus the stack is empty, and every suffix prefix has at least as many remaining minus pushes as plus pops; after the flip these are exactly the conditions for the last surviving plus. Hence good deletion and cogood addition are inverse partial moves on restricted partitions.

8.1F1F3step 6.1step 7.1algebra

Transfer the socle through the actual corner, using more than exactness. By steps 6.1 and 7.1 all Schur socle labels of V=LN(λ)1 are restricted; [F3] makes their lower corners nonzero simples. Therefore V has no nonzero corner-killed submodule, since every nonzero finite-dimensional submodule contains a simple submodule. For a simple lower-Hecke injection D↪elowerV, the corner adjunction gives Aelower⊗elowerAelowerD→V, whose image I is generated by D and satisfies elowerI=D. A proper nonzero submodule J<I has corner zero or D. The first contradicts the no-killed-submodule property; the second contains D and thus generates I. Hence I is simple. Conversely every surviving Schur socle simple has simple corner by [F3]. These inclusions prove soc⁡H(elowerV)=elowersoc⁡A(V), with multiplicities and actual labels. [F1]'s explicit corner identifies this with the actual Hecke restriction of D(λ).

9.1F2F3F4step 8.1algebra

Define the primary functors over F. By [F3] the spectra of Ld in the regular module are q-contents, hence among the distinct [i]q, i∈Z/e; cellular layers and their common triangular flags give this for the regular action as well. The polynomial CRT applied to ∏i(X−[i]q)d! gives mutually orthogonal projectors Pd,i, with sum one, in F[Ld]. They centralize Hd−1 and are star-fixed. Taking exponent d! is sufficient for every Jordan block of the regular action and therefore every module; absent eigenvalues give the zero projector. On a good lower simple D(λ∖A) in restriction, Ld=∑r≤dLr−∑r<dLr has scalar [c(A)]q: the symmetric sums have their actual cell scalars by [F2]. Thus its primary projector selects exactly the good residue. Every nonzero primary summand contains a simple socle submodule, so a summand with no good residue is zero. The form quotient makes D(λ) star self-dual, and its star-fixed projector inherits a nondegenerate restricted form; its head is dual to its simple socle and has the same label. This proves the restriction endpoints when q≠1. At q=1 use the actual group endpoint [F4], with the same primary construction and residue normalization.

10.1F3step 9.1algebraconstruct

Induction and restriction are biadjoint over F. Let B=Hd+1, H=Hd, and let EH:B→H retain precisely the lower standard-basis terms. It is an H-bimodule map. For distinguished parabolic cosets c,t, the perfect trace gives EH(Tc∗Tt)=δc,tqℓ(t): pair against each lower basis element using τB(hEH(a))=τB(ha) and the disjoint length-additive coset supports. All diagonal values are units. Hence the relative Frobenius pairing gives B⊗HX≅Hom⁡H(B,X) naturally. For a commuting primary projector p=Pd+1,i, cyclicity of the trace and commutation with H give EH(pa)=EH(ap), by pairing both expressions against the lower algebra's perfect trace. Under this identification right multiplication by p corresponds to selecting p on restriction. Ordinary tensor adjunction and this Frobenius adjunction therefore give both Hom⁡B(FiX,Y)=Hom⁡H(X,EiY) and Hom⁡B(Y,FiX)=Hom⁡H(EiY,X).

11.1F3step 7.1step 9.1step 10.1algebra

For every simple label η of rank d+1, step 9.1 and absolute simplicity give each of these Hom dimensions with X=D(μ), Y=D(η) as one exactly when the good i-deletion of η is μ, and zero otherwise. Step 7.1 makes its inverse exactly the cogood addition, unique when defined. The complete cellular classifier [F3] covers every simple, so these two Hom tests identify respectively the simple head and simple socle of FiD(μ), once each. If no cogood addition exists both tests vanish for every simple, forcing FiD(μ)=0 by finite dimensionality. At rank zero H0=H1=F, L1=0, and the only move adds the residue-zero node; these formulas give F0F=F and every other summand zero.

12.1F1F3step 9.1step 11.1algebra∎

Descend the temporary square-root extension. The Hecke modules, their cell forms, all primary projectors and functors above are defined over F. The cellular quotients of [F3] remain absolutely simple under F→K, and finite-dimensional Hom spaces are kernels of finite linear systems over F, so their dimensions are unchanged by this field extension. Step 9.1's restriction and step 11.1's induction Hom tests therefore hold over F itself and give exactly the stated endpoints. This argument also permits a purely inseparable square-root extension in characteristic two; no Galois averaging is used. The polynomial, integral module, actual corner and coefficient-functional constructions never divide a specialized Gram determinant. No primality condition on e or Fock-space label classification entered the proof; no Choice principle is used.

RemarkRemark: Literature-sourcedProof: Not applicableOpen item page →

The crystal identification does not elementarily identify the cellular simple labels

Statement

At level one, distinguish the cellular labels D(μ), the nonzero Murphy cell-form quotients (the dual-Specht heads at q=1), from the inductive labels D˙(μ) defined by D˙(∅)=F,D˙(μ)=hd⁡(FiD˙(e~iμ)) for any defined good deletion e~iμ. Here F is any field, the Hecke parameter is invertible with finite quantum characteristic e≥2, and μ is e-restricted. At q=1, e=p and the functors are those of Generalized Jucys-Murphy primary idempotents and the residue-summand functors Ei, Fi; the general Hecke functors are constructed in General Hecke residue branching endpoints from normalized Schur cells. The group label convention is fixed by p-regular and p-restricted labels under transpose and sign.

The equality D˙(μ)≅D(μ) and independence of the chosen deletion follow at level one from the proved cellular branching endpoints and induction on rank, as explained below. They do not follow from the combinatorial inverse property alone (Good-node deletion and cogood-node addition operators). This local comparison uses no Fock-space classification.

The historical warning in Kleshchev's survey §11.2, equation (11.1), concerns the broader cyclotomic labelling theorem for restricted multipartitions. The survey attributes its proof to Ariki and a later graded argument, and describes both as relying on the wider theory. That warning does not preclude the finite level-one comparison here. Identifying the resulting graph with the canonical crystal B(Λ0) is a separate result of General Hecke cellular simple labels match the basic crystal ↗, using the independent Fock-component suppliers and their declared Axiom of Choice. Neither that identification nor Fock reachability is a premise of the cellular branching proofs on this page.

Remarks

Every nonempty e-restricted shape has a good deletion. Its bottom removable corner has residue μh−h, while the only boundary corner below it is the addable (h+1,1) of residue −h. Since 0<μh<e, that bottom minus cannot cancel, so a surviving minus exists. The finite signature argument in General Hecke residue branching endpoints from normalized Schur cells proves that good deletion remains restricted and that its inverse is the prescribed cogood addition. For the group specialization, reachability is also supplied by Every p-restricted partition is reached from the empty partition by cogood additions.

Now induct on rank. At rank zero both modules are F. For each allowed predecessor ν=e~iμ, induction gives D˙(ν)≅D(ν). The cellular induction endpoint is hd⁡(FiD(ν))≅D(f~iν)=D(μ). Thus every allowed deletion yields the same isomorphism class, and the bottom-corner argument ensures that a deletion exists. The argument is finite and choice-free; in the group specialization its induction endpoint is also The cogood node gives the simple socle and head of the residue induction.

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

The Schur functor compares first-level branching with Hecke restriction

Statement

Let F be a field, q∈F×, ℓ=e(F,q), and n≥r≥1; at the empty lower-rank boundary put S(0,0)=H(0)=F with its identity functor. Use the left-module version of the q-Schur algebra S(n,r) and its exact Schur functor fn,r:V↦eV with left adjoint hn,r:X↦S(n,r)e⊗eS(n,r)eX (The type-A q-Schur algebra and its Weyl modules, The Schur idempotent and the Schur functor for type-A q-Schur algebras). Right-module suppliers are converted to left modules through their star anti-involutions. All Specht and simple labels below are Murphy labels: f(Wμ)=SMμ and f(Ln(μ))=DMμ, the latter nonzero exactly when μ is ℓ-restricted (The Schur functor sends Weyl and simple modules to Specht and Hecke simple modules).

For a degree-r polynomial module V=⨁∣α∣=rVα, its first level is V1:=⨁αn=1Vα. It is a module for the Levi polynomial algebra S(n−1,r−1): the first n−1 coordinates sum to r−1. It is not the sum of the weights one simple root below the highest weight. For an ℓ-restricted partition λ⊢r, the following hold.

  1. There is a natural H(r−1)-module isomorphism fn−1,r−1(Ln(λ)1)≅Res⁡H(r−1)H(r)fn,r(Ln(λ)). 2. For any S(n,r)-modules W,V with W(e)=W and V(e)=0, the Schur functor induces Hom⁡S(n,r)(W,V)≅Hom⁡H(r)(fW,fV). Here W(e)=S(n,r)eW is the intersection of submodules whose quotient is killed by e, and V(e) is the sum of submodules killed by e. 3. The socle of Ln(λ)1 as a Levi module has only ℓ-restricted labels.

For every partition μ⊢r−1 with μ ℓ-restricted, [Ln(λ)1:Ln−1(μ)]=[Res⁡DMλ:DMμ]. The exact functor transfers these surviving multiplicities; it may kill nonrestricted simple factors. At q=1 these statements hold over every field for the group algebras. In ordinary James labels the dictionary is DMλ≅Dλ′⊗sgn⁡, not an untwisted identification with Dλ (Hecke Specht theory specialises to group Specht theory at q = 1).

Facts & Assumptions

Given: The field, parameter, ranks, polynomial weight decomposition, and q-Schur and Hecke algebras of the Statement.

[F1]

The permutation-summand realization is S(n,r)=End⁡H(r)(⨁αMα), with weight projections 1α. The regular summand for a composition with exactly r entries equal to 1 is Mα=H(r). The standard corner is ω=(1r,0n−r) (The type-A q-Schur algebra and its Weyl modules, The Schur idempotent and the Schur functor for type-A q-Schur algebras).

[F2]

The exact Schur functor sends Wμ to SMμ and Ln(μ) to DMμ, allowing zero images. The image DMμ is nonzero if and only if μ is restricted over the original field; the nonzero images are pairwise nonisomorphic simple modules (The Schur functor sends Weyl and simple modules to Specht and Hecke simple modules).

[F3]

Brundan, full author manuscript, §3.22 defines polynomial levels by last-coordinate weight, using both Kn and its binomial operators so the integer weight is determined even at a root of unity. The Levi U(n−1) commutes with these operators. The q-Schur polynomial realization is the corresponding finite-degree quotient. In §5.5 the functors are left-module functors; star converts the right-module suppliers to this convention.

[F4]

Every Schur simple L(μ) is its nonzero cell-form quotient, so the descended symmetric associative form makes L(μ)∘≅L(μ) under Schur star. The normalized maps are φST(xνh)=mSTh, with mST∈xμH∩Hxν and mTS=mST∗; Schur star is φST∗=φTS (The type-A q-Schur algebra and its Weyl modules). The standard coefficient trace satisfies τ(ab)=τ(ba) and τ(Tu∗Tv)=δuvqℓ(u); its complete generator-block proof is the actual standalone trace construction of The Murphy cellular basis, the cell law and the Murphy form and The standard basis of the generic type-A Hecke algebra. The following proof establishes the restricted-socle conclusion locally over the original field; no quantum-hyperalgebra square-root or unproved classical-specialization premise is used.

[F5]

At q=1 the actual ordinary polytabloid/signed-conjugate Murphy comparison gives the group module dictionary, with form factor 1, over every field. It follows through the corrected Definition and the actual NEW50 comparison and specialization suppliers, not the printed-page-25 untwisted warning (Hecke Specht theory specialises to group Specht theory at q = 1).

Proof

technique · direct
1.1givenF1F3

Construct the lower-rank action directly over the given field. Put M0=⨁α∈Λ(n−1,r−1)Mα for H(r−1). Length-additive parabolic coset bases give M(α,1)≅Mα⊗H(r−1)H(r) by xαh⊗a↦xαha. Thus the summands with last coordinate 1 form M1≅M0⊗H(r−1)H(r). The functorial algebra homomorphism f↦f⊗1 embeds S(n−1,r−1) into End⁡H(r)(M1): the Hecke algebra H(r) is free on its parabolic coset basis and contains the unit coset, so the map is injective. Extend these maps by zero to the remaining summands of M and put p=∑αn=11α. For every left S(n,r)-module V, V1=pV is therefore a natural S(n−1,r−1)-module. This supplies the lower-rank action without assuming that the first level is a sum of root-adjacent highest-weight spaces, and without adjoining a square root of the Hecke parameter. It agrees with the last-coordinate polynomial level of [F3].

1.2givenF1

Prove the Hom assertion algebraically. For S=S(n,r) put W‾=Se⊗eSeeW and let ε:W‾→W send se⊗w to sw. Its image is SeW=W(e), which is W under the stated hypothesis. Applying e identifies eε with the isomorphism eSe⊗eSeeW→eW. Exactness of e(−) therefore gives eK=0 for K=ker⁡ε. The exact sequence is 0⟶K⟶W‾→εW⟶0. For any S-map g:W‾→V, its image g(K) is an S-submodule killed by e, so it is contained in V(e)=0. Thus g factors uniquely through W. The adjunction then gives Hom⁡H(eW,eV)≅Hom⁡S(W‾,V)≅Hom⁡S(W,V). This proves assertion 2, with the kernel and quotient in the correct direction.

2.1F1step 1.1

Reconcile the corners for all n≥r. Put ω∗=(1r−1,0n−r,1) and e∗=1ω∗. Both Mω and Mω∗ are the regular module H(r). Their fixed identity isomorphism gives block matrix units u,v∈S(n,r) with u=e∗ue, v=eve∗, uv=e∗ and vu=e. Thus multiplication by u gives a natural isomorphism eV→e∗V, with inverse multiplication by v, and carries the standard regular corner action to the e∗ corner action. When n=r these corners coincide. This explicitly supplies the natural corner identification instead of treating an idempotent with last coordinate 0 as lying in the first level.

2.2F1F4step 1.1algebra

Construct a perfect Schur-contravariant form on the permutation-summand module M. On each distinguished coset basis bd=xαTd, put βα(bd,bc)=δdcqℓ(d). The row generator cases are a same-row scalar q, or an adjacent length-increasing pair with bdTi=bc and bcTi=qbd+(q−1)bc, ℓ(c)=ℓ(d)+1. Their weighted diagonal matrices verify βα(aTi,b)=βα(a,bTi), so the forms are Hecke-contravariant and perfect. To prove Schur adjointness, work first in A=Z[Q,Q−1]. Length-additive cosets and [F4] give τ(a∗b)=Pα(Q)βα(a,b) on Mα, where Pα=∑u∈SαQℓ(u) is nonzero in A with constant coefficient 1. For f=φST:Mν→Mμ, a=xνh and b=xμk, membership in [F4] gives mTSxμ=PμmTS and xνmTS=PνmTS. Thus Pμβμ(fa,b)=τ(h∗mTSxμk)=Pμτ(h∗mTSk),Pνβν(a,f∗b)=τ(h∗xνmTSk)=Pντ(h∗mTSk). Cancel the nonzero polynomials only in A, then specialize the resulting identity to F. The orthogonal sum β=⨁αβα is therefore perfect and satisfies β(sm,m′)=β(m,s∗m′) for every actual Schur basis map and hence every s∈S. It identifies the left S-module M with M∘. No Poincare factor is canceled in the given field, including at q=1.

3.1F1step 1.1step 2.1

Compute the first-level corner inside this induced action. The lower regular summand is H(r−1), whose induction is H(r−1)⊗H(r−1)H(r)=H(r), exactly the summand of type ω∗. Its weight projection on pV is e∗, so fn−1,r−1(V1)=e∗V. The lower corner operator given by left multiplication by h∈H(r−1) induces left multiplication by the same h on H(r) under a⊗b↦ab. Thus every generator T1,…,Tr−2 acts exactly as its image in the upper regular corner, by equality of these explicit endomorphisms. The matrix units of step 2.1 identify the upper standard corner with this regular summand. They consequently give fn−1,r−1(V1)≅Res⁡fn,r(V) on every module. This is an algebra-level calculation; it needs no generic semisimplicity or cellular/crystal label identification.

3.2F1F2F4step 2.2algebra

Determine the simple socle labels of M. Evaluation at 1 in the regular summand gives Se=Hom⁡H(H,M)≅M as a left S-module. Finite-dimensional star duality and [F4], together with step 2.2, give Hom⁡S(L,M)≅Hom⁡S(M∘,L∘)≅Hom⁡S(Se,L)≅eL for every simple L. The last bijection evaluates a map at e, with inverse v↦(se↦sv) for v∈eL. By [F2], eL(μ) is nonzero exactly for restricted μ. Thus every simple submodule of M has restricted label; for restricted λ, any nonzero map L(λ)→M is injective. The proof does not equate zero form quotients with zero actual module heads.

4.1F2step 3.1

Transfer composition multiplicities by exactness, not by a Hom-space count. Apply fn−1,r−1 to a finite composition series of Ln(λ)1. By [F2] its factors become either zero or the pairwise nonisomorphic DMμ for restricted μ. Removing repeated terms of the resulting filtration therefore preserves the number of each surviving simple factor. Step 3.1 identifies its result with Res⁡DMλ, proving the stated equality. Assertion 3 is not used to claim that every composition factor survives; a socle statement alone would not justify that claim.

4.2F2step 1.1step 3.2algebra

Prove the restricted-socle assertion over every original field. Applying p to the injection Ln(λ)→M of step 3.2 embeds Ln(λ)1 into pM=M1=M0⊗H(r−1)H(r) with the actual lower action of step 1.1. The length-additive parabolic coset basis makes H(r) free as a LEFT H(r−1)-module of rank r, so M1 is r copies of M0 as a left lower Schur module. Apply steps 2.2 and 3.2 to M0≅S(n−1,r−1)elower: its simple socle labels are exactly the surviving restricted labels. Every simple submodule of Ln(λ)1 is a simple submodule of M1, and therefore restricted. At degree zero M0=F, with the unique empty label; at n=r=1 this is the convention S(0,0)=F. This proves assertion3, without adjoining a square root, using a splitting extension, assuming a quantum-hyperalgebra specialization, or requiring λn=0.

5.1F5step 3.1step 1.2step 4.2step 4.1∎

At q=1, [F5] identifies the corner algebras with group algebras. In ordinary regular labels the two modules are simultaneously twisted by sign and both partition labels are conjugated. Sign restricts along the group tower, is exact, and preserves the two compared multiplicities. This is the ordinary group interpretation, including characteristic 2; it is not an untwisted identification of a restricted label with the same regular label. Steps 3.1, 1.2, 4.2 and 4.1 prove all the assertions.

Remarks

The first-level and ordinary-label reconciliation above is the new authored binding repair. The previously accepted source20 cell-form repair and NEW50 ordinary polytabloid construction are unchanged. Actual acceptance requires the repaired current source20/NEW50 supplier carriers after the live writers drain and the same reviewer checks the actual bound interfaces. No further primitive bridge construction is claimed. No identification of cellular and crystal simple labels is used (The crystal identification does not elementarily identify the cellular simple labels).

5 · Examples, counterexamples and false statements

None yet.

Sources