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

Local relations between the Jucys-Murphy elements and adjacent transpositions

Statement

Let n≥2 and put si:=(i i+1) for 1≤i≤n−1, the Coxeter generators of Sn. Then in Z[Sn], hence in R[Sn] for every commutative ring R: (a) siXj=Xjsi whenever j∉{i,i+1}; (b) siXi+1=Xi+1si; equivalently siXisi+si=Xi+1 and siXi+1=Xisi+1. In particular the subalgebra generated by si,Xi,Xi+1 satisfies the local H(2) relations si2=1, XiXi+1=Xi+1Xi, siXi+1=Xi+1si.

Facts & Assumptions

Given: An integer n≥2, an index 1≤i≤n−1, the adjacent transposition si=(i i+1), the transposition sums Tk=∑1≤p<q≤k(p q), and the Jucys-Murphy elements Xk=∑j<k(j k)=Tk−Tk−1 (The Jucys-Murphy elements of the symmetric group algebra).

[F1]

For 1≤k≤m≤n the element Xk of Z[Sm] maps to Xk under the inclusion Z[Sm]↪Z[Sn], and each base change Z[Sn]→R[Sn] is a unital ring homomorphism carrying Xk to Xk for 1≤k≤n: the coefficient map ∑gagg↦∑g(ag1R)g preserves the group-basis product and the identity (The Jucys-Murphy elements of the symmetric group algebra).

[F2]

The elements s1,…,sn−1 generate Sn subject to the Coxeter relations; in particular si2=1 and si−1=si (The symmetric group has the Coxeter presentation).

[F3]

For h∈Sn and distinct a,b∈{1,…,n} one has h (a b) h−1=(h(a) h(b)) (Conjugating a cycle relabels each entry: g(a1 … ak)g−1=(g(a1) … g(ak))).

Proof

technique · direct computation in the group basis
1.1F1F2F3algebra

Case j<i of (a). For such j one has Xj=∑l<j(l j) with l<j<i, and si fixes both letters l and j; [F3] and [F2] give si(l j)si=(si(l) si(j))=(l j), hence si(l j)=(l j)si. Summing over l<j gives siXj=Xjsi.

1.2F1F2F3algebra

Case j>i+1 of (a). Here si fixes j, and [F3] gives siXjsi=∑l<j(si(l) si(j))=∑l<j(si(l) j). The map l↦si(l) is a bijection of {1,…,j−1} onto itself, because it interchanges the two elements i,i+1 of that set and fixes all others; hence ∑l<j(si(l) j)=∑l<j(l j)=Xj and siXj=Xjsi.

1.3F1F2algebra

Part (b). For j<i the two permutations (i i+1)(j i) and (j i+1)(i i+1) agree on j, on i and on i+1 and fix every other letter, hence are equal; and Xi+1=∑j<i(j i+1)+(i i+1). Using Xi=∑j<i(j i) and si=(i i+1) we therefore get siXi=∑j<i(i i+1)(j i)=∑j<i(j i+1)(i i+1)=(∑j<i(j i+1))si=(Xi+1−si)si=Xi+1si−si2=Xi+1si−1 by [F2]. Hence siXi+1=Xi+1si.

1.4F1F3algebra

The product XiXi+1. The element Tk is central in Z[Sk] for every k: by [F3] conjugation by h∈Sk sends each transposition (p q) to the transposition (h(p) h(q)), and {p,q}↦{h(p),h(q)} is a bijection of the two-element subsets of {1,…,k}, so hTkh−1=Tk. Since Ti+1=Ti+Xi+1 and Xi∈Z[Si], centrality of Ti+1∈Z[Si+1] and of Ti∈Z[Si] gives XiXi+1=Xi(Ti+1−Ti)=XiTi+1−XiTi=Ti+1Xi−TiXi=(Ti+1−Ti)Xi=Xi+1Xi.

2.1step 1.3F2algebra

Equivalent forms. Multiplying siXi+1=Xi+1si on the right by si and using si2=1 from [F2] gives siXisi+si=Xi+1; multiplying that identity on the left by si gives Xisi+1=siXi+1. Thus all three displayed forms of (b) hold.

3.1step 1.1step 1.2step 1.3step 2.1step 1.4F1F2∎

Collecting steps 1.1 and 1.2 covers every j∉{i,i+1}, since j<i and j>i+1 are the only possibilities for 1≤j≤n; step 1.3 and step 2.1 give the three listed forms of (b); step 1.4 and [F2] give XiXi+1=Xi+1Xi and si2=1. All these identities are equalities in Z[Sn], and by [F1] the base change Z[Sn]→R[Sn] carries them to the corresponding identities in R[Sn]. Hence (a) and (b) hold, and the subalgebra generated by si,Xi,Xi+1 satisfies the three listed H(2) relations.

Remarks

  • Local meaning of the relations. The identity (b) says that Xi+1 is obtained from Xi by conjugating with si and adding si, so the pair Xi,Xi+1 together with si generates a local subalgebra satisfying the H(2) relations: on a joint eigenline of the Xk on which Xi acts by a and si by ±1, the relation forces Xi+1 to act by a±1. This is the computation behind the weight-transposition analysis of The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors.

  • What is not claimed. The statement records that the three listed relations hold in the subalgebra generated by si,Xi,Xi+1; no claim is made that this subalgebra has a presentation with exactly these generators and relations, and no dimension count for it is used on this page.

Depends on

Used by

Dependency tree · two levels

13 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