Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Separated Hecke residues give seminormal idempotents and bases

Statement

Let F be a field, q∈F×, let e=e(F,q) and assume e>n (with e=∞ allowed); let λ⊢n, H=HF,q(Sn), and let SMλ be the Murphy cell module with Murphy basis (mt)t∈Std(λ) (The type-A Hecke Specht module and its cell form).

  1. (Separation) If s,t are standard λ-tableaux with [content⁡s(k)]q=[content⁡t(k)]q for all 1≤k≤n then s=t. More precisely, if the q-content values agree for all k∉{i,i+1} for some i, then s=t or t=s(i i+1). 2. (Idempotents) Let Rk be the set of distinct q-content values of the entry k over standard tableaux of all partitions of n. For a standard λ-tableau t define Ft:=∏k=1n ∏c∈Rkc≠[content⁡t(k)]qLk−c[content⁡t(k)]q−c∈F[L1,…,Ln]. These are orthogonal idempotents of H; their actions on SMλ project onto the corresponding simultaneous eigenlines. Put ft=mtFt. Then ftLk=[content⁡t(k)]qft and ft=mt+∑s⊳tasms. The global content sets are essential for the asserted idempotency in H, rather than only the induced same-shape endomorphisms. 3. (Orthogonal seminormal basis) {ft:t∈Std(λ)} is a basis of SMλ satisfying ftFs=δtsft and ⟨fs,ft⟩λ=δst⟨ft,ft⟩λ; it is the seminormal basis of the Murphy cell module. 4. (Generator action) Let s be a standard λ-tableau, 1≤i<n and t:=s(i i+1), and put ρ:=content⁡s(i)−content⁡s(i+1)∈Z. If i and i+1 lie in the same row of s then fsTi=q fs; if they lie in the same column then fsTi=−fs; otherwise t is standard and fsTi=αi(s) ft−1[ρ]qfs,αi(s):={1,s⊳t,[1+ρ]q[1−ρ]q[ρ]q[−ρ]q,t⊳s, where [−ρ]q is the extended quantum integer of Hecke Jucys-Murphy elements and q-contents and for the swapped tableau content⁡t(i)−content⁡t(i+1)=−ρ. No semisimplicity of H is assumed and no choice principle is used.

Facts & Assumptions

Given: A field F, q∈F× with quantum characteristic e>n, a partition λ⊢n, the Murphy cell module SMλ with Murphy basis (mt) and cell form (The type-A Hecke Specht module and its cell form), and the q-content values of Hecke Jucys-Murphy elements and q-contents.

[F1]

(The Hecke Jucys-Murphy action is dominance triangular) mtLk=[content⁡t(k)]q mt+∑v⊳tavmv in SMλ; the Lk commute pairwise and every symmetric polynomial in them is central.

[F2]

(The quantum characteristic of an invertible Hecke parameter) For e>n no m with 1≤m≤n has [m]q=0; more precisely, if two integer contents c,c′ with ∣c−c′∣≤n satisfy [c]q=[c′]q then c=c′.

[F3]

(The type-A Hecke Specht module and its cell form) The cell form on SMλ is symmetric and associative, and the star anti-involution fixes each Lk; the Murphy basis is triangular along the dominance order on tableaux.

[F4]

Source results: separation of q-content sequences for e>n and the seminormal spectral construction are Mathas, Lemma 3.32, Proposition 3.33 and Theorem 3.34 (printed pp. 30-34); the coefficient system of part 4 as displayed is that of Hu-Mathas, Example 3.11 with the axial distance (3.8), Lemma 3.12 and Proposition 3.17, the 1998 manuscript's t⊳s branch being inconsistent with the Hecke relations. The abstract form of the spectral construction under the separation condition is Mathas, Proposition 4.13 with the appendix.

Proof

technique · direct
1.1givenF1F2

Reconstruct a tableau from its residue tuple. At a prefix of size k−1, two different addable corners have integer content difference of absolute value at most k. Since [a]q−[b]q=qb[a−b]q and e>n, their q-contents differ. Starting with the empty diagram, the tuple thus recovers each added node and the final shape. For two tableaux of a fixed shape with identical entries' residues outside i,i+1, first reconstruct the common prefix through i−1, and reconstruct the common suffix by successively deleting the unique appropriate removable corner from the fixed final shape. The intervening skew diagram has two boxes; its only possible orders are the original order and its swap. This proves both separation assertions.

2.1F1step 1.1

Diagonalize the commuting JM operators on a cell. Their triangular basis gives a filtration with one-dimensional joint characters indexed by standard tableaux. Those characters are distinct by step 1.1. For commuting triangular operators, the simultaneous generalized eigenspaces split along their distinct joint characters: the corresponding maximal ideals of the polynomial algebra are pairwise comaximal. Each joint character occurs once in this cell, so each generalized eigenspace is one-dimensional and hence an actual joint eigenline. This finite Chinese-remainder argument works over any field and needs no choice of a generic scalar or algebraic closure. The Lagrange product of the Statement is 1 on its target tuple and 0 on every other tuple. Applied to mt, its triangular diagonal coefficient is 1, and the other possible terms are strictly more dominant. Thus it gives the asserted ft.

2.2F1F2step 1.1

Compute the diagonal coefficient using the correctly ordered JM relation TiLi=Li+1Ti−(q−1)Li+1−1. For k≠i,i+1, Ti commutes with Lk. Consequently separation restricts fsTi to the span of fs and ft if the swap is standard, or to fs alone otherwise. Write its coefficient of fs as cs. The displayed relation gives cs([content⁡s(i)]q−[content⁡s(i+1)]q)=−(q−1)[content⁡s(i+1)]q−1. Its denominator is qcontent⁡s(i+1)[ρ]q, while the numerator is −qcontent⁡s(i+1), so cs=−1/[ρ]q. This does not claim that Ti commutes with Li.

3.1step 2.1

At this stage step 2.1 establishes the projector identities on each individual cell module. The global identities in H will follow below after proving that the sum of the cell modules is faithful. No finite-e classification is a premise.

3.2F3step 1.1step 2.1

The transition from mt to ft is unitriangular, so these vectors form a basis. For s≠t, choose k at which their q-contents differ. Self-adjointness Lk∗=Lk and associativity give ([content⁡s(k)]q−[content⁡t(k)]q)⟨fs,ft⟩=0. The scalar is nonzero, proving orthogonality. The Lagrange action also gives ftFs=δtsft.

3.3step 2.2

If the swap is not standard, the consecutive entries lie adjacently in one row or one column. Then ρ=−1 or ρ=1, respectively, and step 2.2 gives cs=q or cs=−1. These are the stated row and column cases; the row action is q, not the scalar 1 at a general parameter.

4.1step 3.2step 2.2

Suppose the swap is standard. In the branch s⊳t, the length-additive Murphy action has leading term msTi=mt; the unitriangular eigenbasis change then gives the off-diagonal coefficient αi(s)=1. Higher-dominance terms cannot alter the coefficient at t in this two-dimensional eigenline span. This is the leading-term argument in Mathas's source theorem on the seminormal basis. In both branches the quadratic relation gives αi(s)αi(t)=q+(q−1)cs−cs2=[1+ρ]q[1−ρ]q[ρ]q[−ρ]q. The last equality follows directly from [−ρ]q=−q−ρ[ρ]q and the quantum-integer addition identities. Thus the opposite branch has exactly the displayed coefficient. This proves the generator formula without accepting the inconsistent branch in the 1998 manuscript.

5.1F2F3step 3.2step 4.1algebra

Prove nondegeneracy in the separated range locally. The canonical Murphy basis vector has form value [λ]!q=∏a[λa]!q, because xλ2=[λ]!qxλ; its seminormal image has the same value since the canonical tableau is dominance-maximal. This scalar is nonzero when e>n. If s⊳t=s(i,i+1) is a standard swap, put a=1/[ρ]q. Step 4.1 gives ft=fs(Ti+a). Associativity, orthogonality and the quadratic relation give ⟨ft,ft⟩=(q+a)(1−a)⟨fs,fs⟩=q[ρ+1]q[ρ−1]q[ρ]q−2⟨fs,fs⟩. Indeed expansion of (Ti+a)2 and its fs coefficient −a gives q−a(q−1)−a2=(q+a)(1−a). The swapped incomparable boxes have 2≤∣ρ∣≤n−1: their row and column separations plus one are at most the size of the diagram. Thus all three quantum integers here are nonzero. Every standard tableau is connected to the canonical one by length-increasing swaps of adjacent incomparable entries: bubble-sort its linear extension of the box-order poset into the canonical row-order extension, then reverse the swaps. Induction gives nonzero diagonal norm at every ft, so each cell form is nonsingular.

6.1step 5.1step 2.1step 1.1algebra

Each cell is now its nonzero simple form quotient, absolutely simple, and all these cells are pairwise distinct and exhaust the simple modules by Nonzero cell heads classify the simple modules of a cellular algebra. Thus the split semisimple quotient H/J(H) has dimension ∑λ∣Std⁡(λ)∣2. This equals dim⁡H because the Murphy cellular basis has exactly one element for each pair of standard tableaux of the same shape (The Murphy tableau elements form a cellular basis). Hence J(H)=0, H is split semisimple, and the direct sum of all its simple cell modules is faithful. On that faithful module the global Lagrange products of the Statement are the orthogonal projectors from step 2.1, with different shapes having disjoint tuples by step 1.1. Therefore FsFt=δstFt holds in H itself, proving the global idempotents. This argument proves only the separated range and does not assert a finite-e nonzero-label criterion when e≤n.

7.1step 1.1step 3.2step 4.1step 6.1∎

Steps 1.1-6.1 prove all four claims. No semisimplicity was imposed as a hypothesis: it was derived locally from nondegenerate cells and their complete finite-cell classification. The calculation concerns the intrinsic Murphy cell and keeps the signed ordinary-module dictionary separate. All products and basis changes are finite, and no choice principle is used.

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