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

Arbitrary-level Murphy Jucys–Murphy action is content triangular

Statement

On the Specht module Sλ of Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules, Xr acts dominance-triangularly with diagonal Uazj−i at the node (i,j,a) carrying r. Over a field with z=qH of finite order e≥2 and Ua=qHca, every simultaneous generalized eigenword of Sλ is among the standard-tableau residue words ca+j−i modulo e; every such word has the fixed node-residue multiplicities of λ. The universal triangularity also specializes to the LM deformation DVR and the generic fibre, with no semisimplicity or affine-center premise.

Facts & Assumptions

Given: The arbitrary-level Murphy basis and higher ideals of The arbitrary-level cyclotomic Hecke Murphy basis is cellular, and the ordinary Jucys–Murphy triangularity (The Hecke Jucys-Murphy action is dominance triangular).

[F1]

The Murphy elements mst form a dominance-cellular basis with higher two-sided ideals N>λ, and mλ(Xa+1−Qk)=xλub∈N>λ for a=ak and λ(k)≠∅ (The arbitrary-level cyclotomic Hecke Murphy basis is cellular); the generators satisfy TiXi=Xi+1Ti−(qH−1)Xi+1 and TiXi+1=XiTi+(qH−1)Xi+1, with distant commutation (Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules).

[F2]

The ordinary multiplicative Jucys–Murphy elements Mi=qH1−iTi−1⋯T12⋯Ti−1=1+(qH−1)Li act on ordinary standard tableaux with diagonal qHcontent (The Hecke Jucys-Murphy action is dominance triangular).

[F3]

Bruhat order on permutations has both the prefix-rank and reduced-subword characterizations, is invariant under inversion, and strictly lowers length on strict intervals (Basic properties of the Bruhat order on Sn). Shift the zero-based convention by one to use labels 1,…,n.

Proof

technique · direct

Given: The multipartition λ, the Murphy module Sλ with its

basis mt, and the data of [F1]–[F2].

1.1F1F2algebra

Initial-row eigenvalues. Consider only a nonempty component k and put a=ak; empty components contribute no nodes or JM eigenvalues. Then [F1] gives mλ(Xa+1−Qk)=xλub∈N>λ. The internal finite Hecke submodule generated by mλ modulo higher global shapes is spanned by standard internal component permutations; each such permutation fixes the smallest internal label a+1 (that label occupies the first node of its component), so its Hecke element has a reduced word in the internal generators with indices at least a+2 and commutes with Xa+1. Hence Xa+1 acts as the scalar Qk on that whole submodule, with errors in the two-sided ideal N>λ. The X-recurrence then identifies Xa+i on this submodule with Qk times the ordinary multiplicative Jucys–Murphy element Mi of [F2], by induction from the finite quadratic relation and the additive-JM recurrence (a polynomial identity also at qH=1). Ordinary JM triangularity gives diagonal QkqHc−r at the node (r,c,k) occupied by local entry i: the internal label i is not a row index, and no extra subtraction of i−1 occurs. For the initial component tableau, which is maximal in tableau dominance, there are no strictly more dominant same-shape terms. Thus for the node (r,c,k) carrying global entry t, mλXt≡QkqHc−rmλ(modN>λ).

2.1F1F3step 1.1algebra

JM triangularity for every standard multitableau. Inducting through a reduced word of w, the relations [F1] give TwXr=Xw(r)Tw+∑v<w∑ba(v,b)XbTv, where the corrections are supported on proper Bruhat subwords (at the first correction a generator is deleted, moving its linear X-coefficient through preceding generators deletes further generators, and finite quadratic multiplication preserves Bruhat support). Applying this with w=d(t) and multiplying by mλ on the left, step 1.1 evaluates every surviving X coefficient modulo higher shapes; a correction mλTv reduces first to a row-standard representative d(u) of its Young-subgroup coset, the removed row subgroup contributing its row eigenvalue, with d(u)≤v<d(t); the Bruhat/tableau-prefix relation on the ordered rows of all components then makes u strictly dominate t, and componentwise straightening of u keeps the shape or produces same-shape tableaux at least u in prefix dominance, hence strictly dominating t. The leading eigenvalue is QkqHj−i at the node carrying r, because w(r) is its initial-row label under t=tλ⋅w=w−1⋅tλ. Therefore m(tλ,t)Xr≡QkqHj−im(tλ,t)+∑v⊲tavm(tλ,v)(modN>λ), the exact arbitrary-level JM content statement, independent of an affine center theorem, semisimplicity or block classification.

3.1step 2.1algebra∎

Residue words and boundary cases. On the resulting Specht module a total ordering extending tableau dominance triangularizes all the Xr simultaneously; the one-dimensional successive quotients have exactly the content characters of step 2.1, so every simultaneous generalized eigenword is among the standard-tableau residue words ca+j−i(mode) (The Hecke Jucys-Murphy action is dominance triangular for the ordinary part); the residue multiplicities of every such word equal the node-residue multiplicities of λ, since permuting the labels of a standard tableau does not change the multiset of node residues. For rank zero, H=F, the sole shape and tableau are empty and all assertions have their one-dimensional interpretation. The triangularity is polynomial in the parameters, so it specializes to the LM deformation DVR and to the generic fibre.

Remarks

The lemma supplies the content-triangularity input of the Jantzen and core-reduction theory over the original parameters, with no semisimplicity or affine-center hypothesis; the diagonal is the node content and the corrections are strictly dominant standard tableaux.

Depends on

Used by

Dependency tree · two levels

29 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