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

The graded Specht module by homogeneous standard tableaux

Definition

Work in the regime of The nondegenerate root-of-unity level-one Hecke regime. Fix a partition μ, put d=∣μ∣, α=cont⁡(μ), and let K(μ) be the F-span of the Murphy elements mS,T of Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules with S,T standard tableaux of a multipartition strictly dominating μ; by The arbitrary-level cyclotomic Hecke Murphy basis is cellular K(μ) is a two-sided ideal of HdΛ and zμ:=mtμtμ+K(μ) is defined. Define the (level-one) cell/Specht module S(μ):=HdΛ zμ⊆HdΛ/K(μ), a LEFT HdΛ-module lying in the block HαΛ.

For every standard μ-tableau T (Tableaux and standard tableaux) fix a reduced decomposition wT=sr1⋯srm of the associated permutation and put zT:=TwTzμ, vT:=ψwTzμ in the Khovanov--Lauda presentation of def-type-a-cyclotomic-specialization-of-the-qg-klr-algebras. For a removable i-node A of a partition λ (Removable and addable nodes) define dA(λ):=#{addable i-nodes strictly below A}−#{removable i-nodes strictly below A} (equivalently in the level-one symmetric residue convention of the regime) and define the degree of a standard tableau inductively by deg⁡(∅):=0 and, for d>0, deg⁡(T):=deg⁡(T≤d−1)+dA(μ) where A is the node of T containing d.

The definition asserts, and thm-graded-specht-module-has-homogeneous-tableau-basis on this page proves, that {vT:T∈Std⁡(μ)} is a homogeneous F-basis of S(μ) making it a graded RαΛ-module whose q-character is ch⁡qS(μ)=∑Tqdeg⁡TiT; forgetting the grading recovers the ungraded cell module. Convention. This is the LEFT Murphy cell module, obtained from the right cellular datum by h⋅m=mh∗. Forgetting its grading, thm-dj-bridge-murphy-cell-is-the-same-shape-specht-dual identifies it with the star-contragredient dual of the same-shape independently defined ordinary Dipper--James Specht module P(μ). Separately, thm-dj-bridge-ordinary-specht-is-the-signed-conjugate-murphy-cell gives S(μ)≅P(μ′)θ after the same left-module conversion. These are two proved module comparisons, not the identification of an untwisted conjugate module. The sign pullback may change ordinary residue content from −α to α; these ungraded comparisons do not assert homogeneity of the ordinary form or of a raw Hecke sign automorphism in the fixed transported grading. The labelling of simples by e-restricted or e-regular partitions is NOT asserted here; it is determined by the head-classification theorem later on this page.

No choice is used in the definition.

Facts & Assumptions

Given: The nondegenerate level-one regime with its partition parameters μ, d=∣μ∣ and content α, the Murphy cellular basis of the finite type-A Hecke algebra, and the KLR presentation of the block.

[F1]

The regime supplies the field F, the parameter ξ, the level-one weight, the Hecke and KLR towers, the blocks HαΛ, the symmetric residue convention and the independent grading variable q (The nondegenerate root-of-unity level-one Hecke regime).

[F2]

The Murphy elements mS,T and the cell/Specht modules of the cyclotomic Hecke algebra are those of Arbitrary-level cyclotomic Hecke, Murphy cell and multipartition Schur modules; the left module structure is obtained from the right cellular datum through the star anti-involution.

[F3]

Standard tableaux, their shapes, the row-reading initial tableau tμ, removable and addable nodes, and the associated permutations wT are as declared in Tableaux and standard tableaux, Partitions, English diagrams, and conjugation and Removable and addable nodes.

[F4]

The sign automorphism θ is the involution of The Hecke sign automorphism, pullback and contragredient dual, and θ commutes with the star anti-involution.

[F6]

The initial JM eigenidentity is the dominance-maximal case of The Hecke Jucys-Murphy action is dominance triangular with the additive JM elements of Hecke Jucys-Murphy elements and q-contents.

[F5]

The KLR generators, their grading and the degrees deg⁡e(i)=0, deg⁡yr=2, deg⁡ψre(i)=−airir+1 are those of The KLR grading and the diagrammatic multiplication.

Proof

technique · direct
1.1F2

The ideal and the cyclic generator. The span K(μ) of the Murphy elements indexed by standard pairs of shape strictly dominating μ is a two-sided ideal by the cellularity theorem thm-arbitrary-level-cyclotomic-hecke-murphy-basis-is-cellular, and the class zμ=mtμtμ+K(μ) is the canonical generator of the cell module [F2]. The left action is obtained from the right cellular datum by h⋅m=mh∗, so S(μ)=HdΛzμ is a left module; no right module is identified with a left module without this conversion [F2].

1.2F1F2F5F6algebra

The initial weight vector and block. The row-filled tableau tμ dominates every standard tableau of its shape at every prefix. Thus the triangular JM formula of The Hecke Jucys-Murphy action is dominance triangular has no off-diagonal terms at this vector. Star fixes Lr, so conversion to the left cell module gives Lrzμ=[c−r]ξzμ for the node (r,c) containing that entry. The multiplicative JM recurrence Xa+1=ξ−1TaXaTa and the quadratic relation give Xa=1+(ξ−1)La: its inductive step is La+1=ξ−1TaLaTa+ξ−1Ta. Hence Xazμ=ξiazμ by 1+(ξ−1)[m]ξ=ξm, valid also for negative content. The weight idempotents and ya=(1−ξ−iaXa)e(i) now give e(itμ)zμ=zμ and yazμ=0. Since the vectors generated from zμ have sequences obtained by permuting its residues, the whole cyclic module lies in content block α=cont⁡(μ).

1.3F4F5

The vectors. For each standard μ-tableau T fix a reduced decomposition wT=sr1⋯srm; the elements zT=TwTzμ and vT=ψwTzμ are defined by left multiplication in the Hecke and KLR presentations, and TwT is independent of its Hecke reduced expression, whereas ψwTzμ can depend on the chosen reduced word: the KLR braid relation has correction terms [F5]. The resulting family is defined for the selected reduced words, and the discharge theorem proves that every selected family gives the same graded subspaces; it does not assert that the individual vectors are word-independent [F5].

1.4F1F3

The degree recursion is well defined. For a standard tableau T of size d>0, T≤d−1 is a standard tableau of the smaller shape and the node A of T containing d is removable in that shape, so the recursion deg⁡(T)=deg⁡(T≤d−1)+dA(μ) is a finite induction on d with values in Z depending only on T and μ; the declared boundary count is evaluated in the same residue convention at every stage [F1, F3].

2.1F2F4given∎

The ungraded comparisons and Choice. Forgetting the grading, the star-contragredient duality of thm-dj-bridge-murphy-cell-is-the-same-shape-specht-dual identifies the left cell module with the same-shape Specht dual, and the signed-conjugate comparison of thm-dj-bridge-ordinary-specht-is-the-signed-conjugate-murphy-cell gives S(μ)≅P(μ′)θ after conversion; since θ commutes with star by [F4], both comparisons keep their stated positions and neither asserts untwisted conjugate identification [F4]. Every construction selects finite sets of reduced decompositions and finite basis data, so no choice principle is used.

Depends on

Used by

Dependency tree · two levels

58 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