Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

Hecke Jucys-Murphy elements and q-contents

Definition

Let R be a commutative ring, q∈R×, and H=HR,q(Sn) (The generic type-A Hecke algebra). For 1≤k≤n define L1:=0,Lk:=q−1T(k−1,k)+q−2T(k−2,k)+⋯+q1−kT(1,k)∈H(k≥2), where T(i,k) is the standard basis element indexed by the transposition (i k) (The standard basis of the generic type-A Hecke algebra). The Lk are the Hecke Jucys-Murphy elements. They are fixed by the star anti-automorphism Tw∗=Tw−1 (The star anti-automorphism of the type-A Hecke algebra): each transposition (i k) is its own inverse, so T(i,k)∗=T(i,k), and the coefficients qi−k are central, whence Lk∗=∑i<kqi−kT(i,k)=Lk. They commute pairwise and every symmetric polynomial in L1,…,Ln with coefficients in R is central in H (The Hecke Jucys-Murphy action is dominance triangular).

q-contents. The quantum integers [m]q for m≥0 are those of The q-integer, q-factorial and q-multinomial coefficients; extend the definition to negative indices by [−m]q:=−q−m[m]q for m>0, so that (q−1)[m]q=qm−1 for all m∈Z. When q−1 is a unit this may be written [m]q=(qm−1)/(q−1); the polynomial definition requires no such division. Also [m]1=m for all m∈Z, since [−r]1=−[r]1=−r. For a standard λ-tableau t and 1≤k≤n let content⁡t(k)=c−r be the content of the node carrying k (The content of a node and the content vector of a standard tableau) and define the q-content value [content⁡t(k)]q. If e=e(F,q)<∞ for a field F then [m+e]q=[m]q for every m∈Z (The quantum characteristic of an invertible Hecke parameter), so the q-content value depends only on the residue of the content modulo e. At q=1 the identification HR,1(Sn)≅R[Sn] with Tw↦w — the isomorphism given by the Coxeter presentation and the standard bases (The symmetric group has the Coxeter presentation, The standard basis of the generic type-A Hecke algebra) — sends Lk to the ordinary Jucys-Murphy element Xk=∑j<k(j k) (The Jucys-Murphy elements of the symmetric group algebra), because each coefficient qj−k specializes to 1, and [content⁡t(k)]1=content⁡t(k).

Depends on

Used by

Dependency tree · two levels

31 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