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.

Graded Specht restriction has the removable-node filtration

Statement

Keep the notation of The graded Specht module by homogeneous standard tableaux, let μ be a partition of d, α=cont⁡(μ), and let i∈I=Z/eZ. Let A1,…,Ac be the removable i-nodes of μ ordered from bottom to top, and let μAm=μ∖Am. Write Ei:=Eibasic for the restriction functor N↦e(α−αi,αi)N of Cyclotomic KLR induction and restriction functors (equivalently the i-part of the tower restriction of Induction and restriction bimodules for KLR algebras). Then EiS(μ) has a filtration 0=V0⊂V1⊂⋯⊂Vc=EiS(μ) of graded Rα−αiΛ-modules with Vm/Vm−1≅S(μAm){dAm(μ)} for 1≤m≤c.

Equivalently, the restriction of S(μ) to the previous rank has the removable-node filtration of [BKW, Theorem 4.11] over ALL removable nodes, and Ei selects the removable-i-node part. No choice is used.

Facts & Assumptions

Given: A partition μ of d with content α, a residue i, the removable i-nodes A1,…,Ac ordered bottom to top, and the graded Specht module S(μ) with its homogeneous tableau basis.

[F1]

The graded Specht module S(μ), its degree recursion and the standard vectors vT are those of The graded Specht module by homogeneous standard tableaux; by The graded Specht module has a homogeneous tableau basis the vT form a homogeneous basis with vT∈e(iT)S(μ) and deg⁡(yrvT)=deg⁡(yr)+deg⁡(T), deg⁡(ψrvT)=deg⁡(ψre(iT))+deg⁡(T).

[F2]

The restriction functor Ei, the idempotent decomposition Res⁡=⨁iEi and the tower induction/restriction bimodules are those of Cyclotomic KLR induction and restriction functors and Induction and restriction bimodules for KLR algebras; the type-A specialization and its Cartan data are those of The type-A cyclotomic specialization of the QG-KLR algebras.

[F3]

Tableaux, the weak Bruhat arrows and the removable/addable node conventions, in particular the bottom-to-top order of removable nodes, are those of The domination order on tableaux, Garnir tableaux and bricks; the shifted-degree and Garnir-exchange formulas are those of Shifted degrees and Garnir exchanges for standard tableaux.

[F4]

Over R=Z[u,u−1] the left Murphy cell has the free standard basis zT=TwTzμ and is compatible with every base change (The Murphy cellular basis, the cell law and the Murphy form, The generic type-A Hecke algebra, The standard basis of the generic type-A Hecke algebra). Over its fraction field K=Q(u) the cell-level JM eigenbasis has fT=zT+∑S⊲TbSzS. Its adjacent-generator coefficients are u on a row, −1 on a column, and on a standard swap are the two seminormal coefficients of Separated Hecke residues give seminormal idempotents and bases, clauses (2)–(4). These depend only on the two node contents and the relative tableau dominance. We use its individual-cell diagonalization and generator formulas, not a global JM label theorem or a finite-e simple classification. The right-cell formulas convert to left formulas by star, which fixes Tr and the additive JM elements.

Proof

technique · direct
1.1F3F4algebra

The ordered Murphy subspaces over the universal ring. First work with the ungraded level-one left Murphy cell SR(μ) at the universal Hecke parameter u, where R=Z[u,u−1]. List all removable corners as B1,…,Bb from bottom to top. Define WjR to be the span of standard zT with the maximal entry d in B1,…,Bj. Each is a free basis-coordinate subspace, with free quotient. If S⊴T in the tableau Bruhat order, its prefix of size d−1 dominates the corresponding prefix of T by [F3]. For corners of a fixed partition, μ∖B dominates μ∖A exactly when B is lower than or equal to A: subtracting a node from a lower row retains one extra node in every intervening upper-row prefix sum. Thus every standard tableau below T has d in the same or a lower corner. This is the direction needed for the bottom-to-top filtration.

2.1F4step 1.1algebra

Prove stability generically and descend exact coefficients. Extend scalars to K=Q(u) and use the cell-level triangular eigenbasis of [F4]. Step 1.1 implies WjK=span⁡K{fT:d in B1,…,Bj}: the triangular basis change and its inverse preserve each such set. For 1≤r<d−1, the seminormal formula for TrfT involves only fT and, when standard, fsrT. Both have d in the same node, so every WjK is an HK,u(Sd−1)-submodule. The action matrix of Tr on the universal z-basis has coefficients in R by [F4]. Every coefficient exiting WjR vanishes after the injective extension R↪K, hence is zero already in R. Therefore WjR is a submodule. This proves only stability of the ordered sums; it makes no claim that individual fixed-corner spans are stable after specialization.

3.1F3F4step 1.1step 2.1algebra

Identify the generic corner quotient on its standard vectors. Fix j, put A=Bj and ν=μ∖A, and let TA be the standard filling with d in A and the remaining entries row-filled in ν. For any standard T with d in A, deletion gives Tˉ of shape ν. On the eigenbasis quotient WjK/Wj−1K the map fT↦fTˉ is an Hd−1-isomorphism: for every generator Tr, r<d−1, the two contents, same-row/column alternatives, standardness of the swap and relative prefix dominance are unchanged by deleting d; hence the two displayed seminormal action matrices in [F4] are identical. The tableau TA is dominance-maximal among tableaux with d in A, since its deleted tableau is row-filled. Thus the triangular correction to fTA has only tableaux with d in lower corners, so fTA+Wj−1K=zTA+Wj−1K. The initial eigenvector of SK(ν) is ftν=zν. If the row-reading index of A in μ is k, the permutation wTA sends the initial entry k to d and shifts k+1,…,d down by one, and has length d−k. The factorization wT=wTˉwTA is length-additive: the d−k inversions involving d are fixed, and all other inversions are precisely those of wTˉ. Therefore zT=TwTˉzTA, and the generic isomorphism sends zT+Wj−1K exactly to zTˉ. This identifies the standardized quotient map, not just an unspecified generic module isomorphism.

4.1F4step 2.1step 3.1algebra

The integral and specialized deletion quotient. Define the R-linear basis map WjR/Wj−1R→SR(ν) by zT↦zTˉ. Both source and target are free with these corresponding bases. For each finite Hecke generator, both action matrices have entries in R, and step 3.1 makes their difference zero in K. Injectivity of R→K therefore makes that difference zero over R. This is an integral module isomorphism. Base change u↦ξ gives the exact Murphy restriction filtration and deletion quotients over the original field F, including singular finite-e parameters and positive characteristic. Because every inclusion was a basis-coordinate inclusion with free quotient, these scalar extensions preserve the entire filtration and its quotients; no flatness assumption on F is needed and no generic denominator is specialized.

5.1F1F2F3step 1.1step 4.1algebra

Pass to the selected homogeneous basis and establish the shift. Return to the fixed graded Hecke–KLR presentation. Its homogeneous theorem [F1] gives a triangular change vT=aTzT+∑S⊲TaSzS, aT≠0. Step 1.1 therefore identifies every specialized Wj with the span of the selected vT having d in B1,…,Bj, so Wj is a graded submodule. To verify that the deletion isomorphism of step 4.1 is homogeneous, choose compatible reduced words wT=wTˉwTA, which are reduced by step 3.1. The grading is independent of this selected-word change by [F1]. The triangular expansion of vTA has only lower-corner terms besides its nonzero leading term, so its image under the ungraded deletion quotient is aAzν for a fixed scalar aA≠0. The previous-rank generators have the same tower images under the transported KLR presentation: the inclusion keeps Xr,Tr for r<d; hence its weight idempotent e(i) becomes ∑je(i,j), since both project onto the generalized eigenspaces of those same first d−1 commuting X operators. The defining dot formula and fixed crossing normalizing series use only the same adjacent X operators, so yr for r≤d−1 and ψr for r<d−1 are unchanged. This is the tower transport in [F2], without assigning any simple-module shape from a JM tuple; consequently the deletion map sends vT+Wj−1=ψwTˉvTA+Wj−1 to aAvTˉ. Rescaling the quotient map by aA−1 gives the homogeneous-basis correspondence. The degree recursion [F1] gives deg⁡T=deg⁡Tˉ+dA(μ), so Wj/Wj−1≅S(ν){dA(μ)} as graded modules. Other preferred words preserve the same graded subspaces and graded isomorphism by [F1]; no word-independence of the individual vectors is asserted.

6.1F1F2step 5.1algebra∎

Select the removable-i-node filtration. The residue projector e(α−αi,αi) on restriction selects exactly the homogeneous basis vectors whose last residue is i by [F1, F2]. Apply this exact idempotent summand to the all-corner filtration of step 5.1. A quotient for a corner Bj of residue different from i becomes zero, while a quotient for an i-corner remains S(μ∖Bj){dBj(μ)}. Removing the repeated zero steps leaves precisely the bottom-to-top sequence A1,…,Ac of the Statement, with Vm spanned by the selected vT whose last node is among A1,…,Am. This proves the asserted filtration and all graded quotients. If there are no removable i-nodes the selected module is zero and the filtration is empty; rank zero has no restriction assertion. The entire argument uses finite bases, finite spectra and explicit scalar extension, so no choice principle or cellular head classification is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

50 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