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 with invertible parameter , the ordinary finite type-A Hecke algebra and a composition of , the permutation module has -basis where ranges over the semistandard tableaux of partition shape and type and over the standard tableaux of the same shape. It has a Specht filtration with multiplicity of the ordinary Specht module (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 . Moreover the explicit ordinary Garnir row-coset identity, the additive nonstandard-tableau factorization and the same-column generator refinement hold when are in one column of the standard tableau ; 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 with invertible , the ordinary finite type-A Hecke algebra with standard basis and Murphy elements , a composition of with row symmetrizer , and the semistandard/standard tableaux of shape .
The Murphy elements form a cellular basis of with the fixed-first-index cell law, and the dominance ideals are the higher-cell ideals of the cellular structure; the standard basis exists over and right multiplication by has the two-term rule for (The Murphy tableau elements form a cellular basis, The standard basis of the generic type-A Hecke algebra, Murphy elements and Murphy tableau elements).
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).
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.
The independent same-shape perfect pairing identifies over every commutative ring with unit parameter; finite-free biduality gives . Star dual has action (Murphy cells are the same-shape contragredient Specht duals, The Hecke sign automorphism, pullback and contragredient dual).
Proof
Given: The data and suppliers of [F1]–[F3]; work first over the universal
domain , where all coefficient statements are polynomial
identities, and specialize at the end.
The row-double-coset identity and membership. For a semistandard tableau of shape and type and a standard of shape , every row-standard refinement of the column-strict tableau is standard, and is the sum of over the double coset , each occurring exactly once; its left -coset expansion writes it as , and appending gives for some . Hence each lies in , and no row-intersection quantum factorial is introduced.
Independence and the Garnir coefficient rules. The sums are -independent because their Murphy fibres (the index sets ) are disjoint and every coefficient in the expansion of in the basis is ; they therefore have disjoint unit pivots. For the coefficient rules, consider a violation at adjacent rows and column and the composition ; the two length-additive coset sums of give whose distinguished Garnir term occurs with coefficient . 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 in one column, sorting the Garnir belt has a unique standard term whose single adjacent swap produces the distinguished Garnir term, with coefficient , 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 .
The row eigenspace test. For a fixed the left -eigenspace of in is : in the basis pair with of larger length, and coefficient comparison in gives equality of the two coefficients, whose sum is . This argument uses only that is a unit. Over the universal domain, no element of this space has a nonzero Murphy coefficient at a tableau with 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 are in a column, its coefficient in is the negative of its coefficient in by step 1.2, contradicting the eigenvalue equation since in the domain; if they share a row, the basis element is already a -eigenvector and is subtracted; if their swap is standard, the exact two-tableau rules make the two coefficients equal and their sum is a -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 at a singular parameter.
The basis theorem. Let . It is a -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 ). 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 , while otherwise the row-label tableau is column-strict and every fibre coefficient equals one common value. Hence has zero coefficients off semistandard fibres and constant coefficients on each semistandard fibre, i.e. lies in the span of the ; with step 1.2 this proves that the form an -basis of .
The two filtrations, keeping the ordinary dictionary explicit. The higher-shape Murphy-cell filtration obtained from [F1] has one quotient for every semistandard tableau of shape and type : its second-index action is the fixed-first-index Murphy cell action. These quotients are free over , so every short exact sequence of this filtration splits as a sequence of -modules. Star duality is therefore exact on this filtration. On the distinguished coset basis of , define . The row-permutation generator cases prove contravariance: a same-row generator acts by ; a length-increasing adjacent coset pair acts by , , with , and the diagonal weights give . All other entries are zero or the corresponding diagonal equality. Thus gives an -isomorphism , since every diagonal is a unit. The independently proved same-shape bridge gives , 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.
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 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 equals the multiplicity of the trivial character of the -row parabolic in , by induction/restriction adjunction in the semisimple category.
Conclusion. Steps 1.1, 1.2, 2.1 and 3.1 prove the semistandard Murphy basis of , step 1.2 gives the explicit Garnir and same-column generator rules with their termination, step 4.1 gives the Specht filtration with multiplicity , and step 5.1 gives the generic parabolic-multiplicity interpretation. Everything is proved universally over 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
- The Murphy tableau elements form a cellular basis
- The Murphy cellular basis, the cell law and the Murphy form
- The standard basis of the generic type-A Hecke algebra
- Murphy elements and Murphy tableau elements
- Semistandard tableaux and Kostka numbers
- Tableaux and standard tableaux
- Dominance order on partitions
- Nonzero-form cellular heads, cell purity and shared-factor linkage
- The Hecke Jucys-Murphy action is dominance triangular
- Murphy cells are the same-shape contragredient Specht duals
- The Hecke sign automorphism, pullback and contragredient dual
Used by
- The type-A q-Schur algebra and its Weyl modules Definition
- Cyclotomic semistandard row-type sums give permutation-module bases Lemma
- The arbitrary-level cyclotomic Hecke Murphy basis is cellular Theorem
- The q-Schur Weyl weight-space Gram determinant is a hook product Theorem
- The simple type-A Hecke modules are indexed by e-regular partitions Theorem
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
- Mathas, Hecke algebras and Schur algebras of the symmetric group, complete 79-page manuscript (standard reference, not scraped)