Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

The Hecke Jucys-Murphy action is dominance triangular

Statement

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

Facts & Assumptions

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

[F1]

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

[F2]

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

[F3]

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

Proof

technique · direct
1.1givenF1algebra

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

1.2F2algebra

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

2.1F1F2F3step 1.1algebra

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

2.2F1F2step 1.1algebra

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

3.1F1step 1.1step 2.1step 2.2step 1.2inductionalgebra

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

4.1F1F2step 1.1step 2.2step 3.1algebra

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

5.1step 1.1step 2.2step 4.1F2algebra∎

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

Depends on

Used by

Dependency tree · two levels

40 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