Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pass
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.

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.

Depends on

Used by

Dependency tree · two levels

62 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources