Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Murphy elements and Murphy tableau elements

Definition

Let R be a commutative ring, q∈R×, and H=HR,q(Sn) with standard basis {Tw} and star anti-automorphism ∗ (The generic type-A Hecke algebra, The standard basis of the generic type-A Hecke algebra, The star anti-automorphism of the type-A Hecke algebra). For a composition (in particular a partition) μ of n put mμ:=∑w∈SμTw∈H, the row symmetrizer of the standard Young subgroup Sμ (Young subgroups, tabloids, and permutation modules); the sum has ∣Sμ∣=∏iμi! terms.

A tableau is row standard when its entries increase along each row. Use the right tableau action t⋅w:=w−1⋅t, where the left action applies w to the entries. For a row-standard μ-tableau s, let d(s) be the unique permutation with s=tμ⋅d(s), where tμ is filled by 1,2,…,n in row-major order. Explicitly, if s carries entry a in the p-th node in that order, then d(s)(a)=p: d(s) is the inverse of the row-reading permutation. The action on tableaux is free; the stabilizer of the row tabloid of tμ is Sμ (Row and column stabilizers).

Write Dμ for these distinguished permutations. Row-standardness says that d−1 is increasing on each canonical row block. The coset Sμd consists exactly of the tableaux with the same row sets, so sorting each row produces its unique representative in Dμ. Moreover, ℓ(wd)=ℓ(w)+ℓ(d)(w∈Sμ, d∈Dμ). To verify this, count inversions of (wd)−1=d−1w−1. Pairs of labels within one canonical block contribute exactly the inversions of w−1, since d−1 is increasing there. For labels in different blocks, w−1 permutes the labels within their respective blocks, so the total number of cross-block inversions equals that of d−1. The two contributions give the displayed equality, using inversion invariance of length. It also proves minimality and uniqueness in Sμd. These conventions extend to compositions by using their consecutive row blocks. For row-standard μ-tableaux s,t define the Murphy element mst:=Td(s)∗ mμ Td(t)∈H, and for a standard λ-tableau t write the diagonal element as mtt=Td(t)∗mλTd(t); the notation mt is reserved for a cell-module vector, rather than an element of H. Then mst∗=mts for all row-standard s,t of the same shape: applying the anti-automorphism, which fixes mμ because mμ∗=∑w∈SμTw−1=mμ, gives mst∗=(Td(s)∗mμTd(t))∗=Td(t)∗mμ∗Td(s)∗∗=Td(t)∗mμTd(s)=mts. Finally, mμTw=qℓ(w)mμ for every w∈Sμ: it suffices to prove this for w=si a simple transposition with i,i+1 in the same block of μ, since any w∈Sμ∖{1} has a reduced expression w=w′si with ℓ(w)=ℓ(w′)+1 and the claim follows by induction, mμTw=mμTw′Ti=qℓ(w′)mμTi=qℓ(w)mμ. For such i the right multiplication v↦vsi is an involution of the finite group Sμ, and pairing the summands of mμTi=∑v∈SμTvTi in twos gives, in the two cases of the standard-basis multiplication rule TvTi=Tvsi if ℓ(vsi)=ℓ(v)+1 and TvTi=(q−1)Tv+qTvsi if ℓ(vsi)=ℓ(v)−1, TvTi+TvsiTi=q (Tv+Tvsi), so summing over the 12∣Sμ∣ pairs yields mμTi=qmμ.

Depends on

Used by

Dependency tree · two levels

27 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