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

The Jucys-Murphy elements of the symmetric group algebra

Definition

Let n≥1 and let R be a commutative ring. In the group ring R[Sn] of the symmetric group on {1,…,n} (Partitions, English diagrams, and conjugation, The symmetric group Sym⁡(X): the bijections of a set X under composition, The group ring R[G] of finitely supported formal R-linear combinations of group elements), where (j k) denotes the transposition of the distinct entries j,k∈{1,…,n} (The symmetric group Sym⁡(X): the bijections of a set X under composition), the Jucys-Murphy elements are X1:=0,Xk:=∑j=1k−1(j k)∈R[Sn](2≤k≤n). Each Xk is a finite sum of group elements with coefficient 1, so the formula already defines an element of the integral group ring Z[Sn], and its image under the base change Z[Sn]→R[Sn] is the displayed element (Restriction of scalars and extension of scalars S⊗RM along a ring homomorphism R→S); for 1≤k≤m≤n the element Xk of R[Sm], computed in the subgroup Sm=Sym⁡({1,…,m})⊆Sn of permutations fixing m+1,…,n, maps to Xk under the inclusion Sm↪Sn. Equivalently Xk=Tk−Tk−1, where Tk=∑1≤i<j≤k(i j) is the sum of all transpositions in Sk.

Remarks

  • Well-definedness. The sum defining Xk has the k−1 terms (1 k),…,(k−1 k), each of which is an element of the subgroup Sk⊆Sn, hence a basis element of the free R-module R[Sn]; a finite sum of basis elements is an element of R[Sn] independent of any ordering of the summands. The formula uses only the labels 1,…,k, so it is preserved by the inclusion Sm↪Sn for k≤m≤n and by the base change Z[Sn]→R[Sn]. The group-ring multiplication is bilinear and sends basis elements g,h to gh (The group ring R[G] is a unital R-algebra with basis G, and each g∈G is a unit of R[G]). Thus the subgroup inclusions and the coefficient map ∑gagg↦∑g(ag1R)g preserve products and the identity.

  • The identity Xk=Tk−Tk−1. The transpositions of Sk are (i j) with 1≤i<j≤k; those with j<k are exactly the transpositions of Sk−1, and the remaining ones are (i k) with i<k. Hence Tk−Tk−1=∑j=1k−1(j k)=Xk. For k=2 this reads X2=(1 2)=T2−T1, where T1=0. Since each Tk is a sum of all transpositions of the subgroup Sk, it is a sum of full conjugacy classes of Sk.

  • Integral normalization. Every coefficient in Xk is 1, not ±1 or a fraction; no characteristic is inverted, so Xk is defined over Z and over every commutative ring. This is the normalization used throughout this page; the spectral statements below specialize the coefficient ring to C, but no integral identity of this page uses division.

  • Centrality. The elements Xk need not be central in R[Sn]. The element X1=0 is always central, and for n=2 the algebra R[S2] is commutative, so X2 is central as well. For n≥3 and R≠0, conjugation by (2 3) sends X2=(1 2) to (1 3)≠X2: these are distinct basis elements and 1R≠0. Thus X2 is not central in this case. Pairwise commutativity of the Xk is proved in The Jucys-Murphy elements commute pairwise.

Depends on

Used by

Dependency tree · two levels

16 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