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.

Type-A Hecke permutation modules: semistandard Murphy bases and Specht filtrations

Statement

For every commutative ring R with invertible parameter z, the ordinary finite type-A Hecke algebra Hn and a composition ρ of n, the permutation module xρHn has R-basis m(S,t)=∑s: ρ(s)=Smst, where S ranges over the semistandard tableaux of partition shape and type ρ and t over the standard tableaux of the same shape. It has a Specht filtration with multiplicity #SStd⁡ρ(λ) of the ordinary Specht module Sλ (Semistandard tableaux and Kostka numbers, Tableaux and standard tableaux). The row-double-coset membership uses each coset word once and no quantum-factorial division. Over the generic field this number equals the trivial-character multiplicity of the ρ-row parabolic in Sλ. Moreover the explicit ordinary Garnir row-coset identity, the additive nonstandard-tableau factorization and the same-column generator refinement Tamst≡−mst+∑u⊳scumut(modhigher shapes) hold when a,a+1 are in one column of the standard tableau s; row-standard straightening has no smaller-shape terms and its same-shape terms increase tableau-prefix dominance. Shape support uses the already proved ordinary Murphy dominance ideals (The Murphy tableau elements form a cellular basis, Murphy elements and Murphy tableau elements); the finite Garnir algorithm terminates in lexicographic shape/tableau order before that dominance refinement.

Facts & Assumptions

Given: A commutative ring R with invertible z, the ordinary finite type-A Hecke algebra Hn with standard basis Tw and Murphy elements mst, a composition ρ of n with row symmetrizer xρ, and the semistandard/standard tableaux of shape λ⊢n.

[F1]

The Murphy elements mst form a cellular basis of Hn with the fixed-first-index cell law, and the dominance ideals are the higher-cell ideals of the cellular structure; the standard basis Tw exists over R and right multiplication by Ta has the two-term rule TwTa=zTwsa+(z−1)Tw for ℓ(wsa)<ℓ(w) (The Murphy tableau elements form a cellular basis, The standard basis of the generic type-A Hecke algebra, Murphy elements and Murphy tableau elements).

[F2]

Over the generic field, the Jucys–Murphy action is dominance triangular and its word-character separates tableaux of different shapes; every simple module of the cellular algebra is a nonzero cellular head and the cell modules of the ordinary Hecke algebra form a complete set of standard modules (The Hecke Jucys-Murphy action is dominance triangular, Nonzero-form cellular heads, cell purity and shared-factor linkage).

[F3]

The dominance order on partitions is Dominance order on partitions. The length-additive support lemma, Garnir identity, nonstandard-tableau factorization, finite increasing straightening and dominance ideals are proved in steps 2.1–5.1 and 8.1–9.1 of The Murphy cellular basis, the cell law and the Murphy form. The same-column refinement below is deduced from these rules, rather than assumed as part of cellularity.

[F4]

The independent same-shape perfect pairing identifies CM(λ)≅P(λ)∘ over every commutative ring with unit parameter; finite-free biduality gives CM(λ)∘≅P(λ). Star dual has action (fh)(m)=f(mh∗) (Murphy cells are the same-shape contragredient Specht duals, The Hecke sign automorphism, pullback and contragredient dual).

Proof

technique · direct

Given: The data and suppliers of [F1]–[F3]; work first over the universal

domain Z[z,z−1], where all coefficient statements are polynomial

identities, and specialize at the end.

1.1F1algebra

The row-double-coset identity and membership. For a semistandard tableau S of shape λ and type ρ and a standard t of shape λ, every row-standard refinement s of the column-strict tableau S is standard, and ∑sTd(s)∗xλ is the sum of Tw over the double coset Sρd(s0)−1Sλ, each w occurring exactly once; its left Sρ-coset expansion writes it as xρh0, and appending Td(t) gives m(S,t)=xρh for some h∈Hn. Hence each m(S,t) lies in xρHn, and no row-intersection quantum factorial is introduced.

1.2F1F3algebra

Independence and the Garnir coefficient rules. The sums m(S,t) are R-independent because their Murphy fibres (the index sets {s:ρ(s)=S}) are disjoint and every coefficient in the expansion of m(S,t) in the mst basis is 1; they therefore have disjoint unit pivots. For the coefficient rules, consider a violation at adjacent rows i,i+1 and column j and the composition ν=(λ1,…,λi−1,j−1,λi+1,λi+1−j,λi+2,… ); the two length-additive coset sums of SνSλ give ∑w∈Sν∩DλxλTw=∑v∈Sλ∩DνTv∗xν, whose distinguished Garnir term occurs with coefficient 1. Every other term in the original shape has strictly more dominant row tableaux, the reordered ν has strictly higher lexicographic shape, and the ordinary Murphy dominance refinement places these shape errors in higher-cell ideals; a nonstandard tableau factors as that Garnir tableau followed by an additive-length word (removing inversions while keeping the column violation), and Bruhat subword support preserves the strict tableau-prefix inequality. In the isolated relation for consecutive a,a+1 in one column, sorting the Garnir belt has a unique standard term whose single adjacent swap produces the distinguished Garnir term, with coefficient −1, and every other same-shape term is strictly more dominant. This yields the displayed congruence of the Statement, and the right analogue follows by the cellular involutions ∗.

2.1F1algebra

The row eigenspace test. For a fixed a the left z-eigenspace of Ta in Hn is (1+Ta)Hn: in the Tw basis pair w with saw of larger length, and coefficient comparison in Tah=zh gives equality of the two coefficients, whose sum is (1+Ta)Tw. This argument uses only that z is a unit. Over the universal domain, no element of this space has a nonzero Murphy coefficient at a tableau with a,a+1 in one column: choose a least shape and then a least left tableau in a dominance-compatible support order; higher-cell terms cannot contribute to its shape, and a column correction from another tableau can contribute only from a strictly less dominant left tableau, absent by minimality. If a,a+1 are in a column, its coefficient in Tah is the negative of its coefficient in h by step 1.2, contradicting the eigenvalue equation since z+1≠0 in the domain; if they share a row, the basis element is already a z-eigenvector and is subtracted; if their swap is standard, the exact two-tableau rules make the two coefficients equal and their sum is a z-eigenvector, which is subtracted. Each subtraction stays in the row ideal and removes the chosen support term without creating new ones, so induction on the finite support proves the column exclusion; specializing the resulting coordinate-zero identities gives it over every base ring, with no division by z+1 at a singular parameter.

3.1F1step 1.2step 2.1algebra

The basis theorem. Let h∈xρHn. It is a z-eigenvector for every generator inside every ρ-row interval, so step 2.1 excludes any supported tableau with a consecutive pair inside one column; for an adjacent standard swap, comparison of the exact two-tableau equations makes the two coefficients equal (no column-state correction can interfere, since every such state has coefficient 0). The standard refinements of a fixed row-label tableau are the linear extensions of the finite node posets of its repeated-label classes, and any two are connected by swaps of adjacent incomparable elements; finite induction on the inversion distance shows that if a repeated label occupies one column, a consecutive vertical cover realises an excluded state and forces the whole fibre coefficient to be 0, while otherwise the row-label tableau is column-strict and every fibre coefficient equals one common value. Hence h has zero coefficients off semistandard fibres and constant coefficients on each semistandard fibre, i.e. h lies in the span of the m(S,t); with step 1.2 this proves that the m(S,t) form an R-basis of xρHn.

4.1F1F4step 3.1algebra

The two filtrations, keeping the ordinary dictionary explicit. The higher-shape Murphy-cell filtration obtained from [F1] has one quotient CM(λ) for every semistandard tableau S of shape λ and type ρ: its second-index action is the fixed-first-index Murphy cell action. These quotients are free over R, so every short exact sequence of this filtration splits as a sequence of R-modules. Star duality is therefore exact on this filtration. On the distinguished coset basis bd=xρTd of xρHn, define β(bd,bc)=δdczℓ(d). The row-permutation generator cases prove contravariance: a same-row generator acts by z; a length-increasing adjacent coset pair acts by bdTi=bc, bcTi=zbd+(z−1)bc, with ℓ(c)=ℓ(d)+1, and the diagonal weights give β(bdTi,bc)=zℓ(c)=zβ(bd,bd). All other entries are zero or the corresponding diagonal equality. Thus β gives an Hn-isomorphism xρHn≅(xρHn)∘, since every diagonal zℓ(d) is a unit. The independently proved same-shape bridge gives CM(λ)∘≅P(λ), the ordinary Dipper–James Specht module, by finite-free biduality. Dualize the split Murphy filtration and transport it through this permutation self-duality. The resulting reversed filtration is an ordinary Specht filtration with exactly the same multiplicities. The original Murphy filtration is not called the ordinary one. This preserves the full every-ring/unit-parameter existence Statement without generic semisimplicity or form nondegeneracy on a Specht module.

5.1F2step 4.1algebra

The generic multiplicity interpretation. Over the generic field the finite Hecke algebra is split semisimple: by [F2] every simple is a nonzero cellular head, a simple factor of an ordinary cell module has a word character from that module and from the head's own cell shape, and disjoint word sets force the shapes to agree; existence of a factor forces its own head to be nonzero, diagonal multiplicity 1 forces the cell module to be simple, and the sum of squared dimensions equals the Hecke rank, so the algebra and each parabolic are split semisimple. Consequently the filtration multiplicity #SStd⁡ρ(λ) equals the multiplicity of the trivial character of the ρ-row parabolic in Sλ, by induction/restriction adjunction in the semisimple category.

6.1step 3.1step 4.1step 5.1∎

Conclusion. Steps 1.1, 1.2, 2.1 and 3.1 prove the semistandard Murphy basis of xρHn, step 1.2 gives the explicit Garnir and same-column generator rules with their termination, step 4.1 gives the Specht filtration with multiplicity #SStd⁡ρ(λ), and step 5.1 gives the generic parabolic-multiplicity interpretation. Everything is proved universally over Z[z,z−1] and specializes; the row-double-coset membership uses each coset word once and introduces no quantum-factorial division.

Remarks

This is the narrow ordinary type-A supplier consumed by the finite Mackey count of the higher-level theory: the basis and filtration are proved here rather than imported from a definition of the ordinary Schur algebra. No choice principle is used; all tableaux and quotient spaces are finite.

Depends on

Used by

Dependency tree · two levels

36 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