Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

The Gelfand-Tsetlin algebra is the diagonal algebra of the Young basis

Statement

For m≥1 and λ⊢m let eλ(m)∈Z(C[Sm]) be the central idempotent of the Wedderburn factor End⁡(SCλ) of C[Sm], so that 1=∑λ⊢meλ(m) with pairwise orthogonal central idempotents and eλ(m) acts as the identity on SCλ and as 0 on SCμ for μ≠λ. For a path T=(λ(1),…,λ(n)) in the Young graph (a standard tableau of size n) put PT:=eλ(1)(1)eλ(2)(2)⋯eλ(n)(n), the factors commuting pairwise. Then:

(i) every PT is a nonzero idempotent of rank one; (ii) PTPT′=0 for T≠T′ and ∑TPT=1; (iii) GZ(n)=⨁TC PT, the algebra diagonal in the basis of the lines CvT:=im⁡PT (the Young basis); (iv) the elements X1,…,Xn act diagonally in the Young basis, and GZ(n) is a maximal commutative subalgebra of C[Sn].

Facts & Assumptions

Given: The chain S1⊂⋯⊂Sn and the Gelfand-Tsetlin algebra GZ(n)=⟨Z(C[S1]),…,Z(C[Sn])⟩ (The Gelfand-Tsetlin algebra of the symmetric group chain); for each m≥1 the complex Specht modules Vλ:=SCλ, λ⊢m, which are the irreducible C[Sm]-modules up to isomorphism, pairwise inequivalent for distinct λ (Specht modules classify the complex irreducibles of Sn).

[F1]

For every m≥1 the group algebra is a product of matrix algebras indexed by its simple modules; by the classification this reads C[Sm]≅∏λ⊢mEnd⁡(Vλ), and the identity of the factor End⁡(Vλ) is a central idempotent eλ(m) in C[Sm] such that 1=∑λ⊢meλ(m), eλ(m)eμ(m)=δλμeλ(m) for all λ,μ⊢m, and for every C[Sm]-module W the element eλ(m) acts as the projection onto the sum of the irreducible summands of W isomorphic to Vλ; in particular eλ(m) acts as the identity on Vλ and as 0 on Vμ for μ≠λ (If k is algebraically closed and char⁡k∤∣G∣, then k[G]≅∏i=1rMni(k), Simple modules over a product of matrix rings over division rings, If char⁡k∤∣G∣, then k[G] is a semisimple ring).

[F2]

For m≥2 and λ⊢m the restriction of Vλ to Sm−1 is Res⁡Sm−1SmVλ≅⨁x∈Rem⁡(λ)Vλ−x, the summands being irreducible with pairwise distinct shapes and each occurring exactly once; for m=1 one has V(1)=C with S0 acting trivially (The complex Specht restriction branching rule).

Proof

technique · direct
1.1F1given

The idempotents eλ(m) of [F1] are central in C[Sm], pairwise orthogonal, sum to 1, and project each C[Sm]-module onto its λ-isotypic part.

1.2F1givenalgebra

The idempotents attached to different levels commute: if m≤k, then C[Sm]⊆C[Sk] and eμ(k) is central in C[Sk], hence commutes with every element of C[Sm], in particular with eλ(m).

2.1step 1.1F2algebra

Let m≥2 and λ⊢m. The restriction of Vλ to Sm−1 is the direct sum of the distinct irreducible modules Vλ−x over the removable nodes x∈Rem⁡(λ); consequently eμ(m−1) acts on Vλ as the projection onto the summand Vμ when μ=λ−x for some x∈Rem⁡(λ), and as 0 otherwise.

2.2step 1.1step 1.2F1algebra

For every standard tableau T of size n the product PT=eλ(1)(1)⋯eλ(n)(n) is an idempotent, and PTPT′=0 whenever T≠T′: distinct standard tableaux of size n differ at some level m≤n, where their entries are distinct partitions, and the corresponding factors are orthogonal by [F1] after all factors are commuted past one another using step 1.2.

2.3step 1.1F1algebra

Every central element of C[Sm] is a linear combination of the eλ(m): under the isomorphism C[Sm]≅∏λEnd⁡(Vλ) of [F1] the centre corresponds to the product of the centres of the factors, and the centre of the matrix algebra End⁡(Vλ) consists of the scalars, that is, of Ceλ(m). Hence z=∑λ⊢mωλ(z)eλ(m) for every z∈Z(C[Sm]), where ωλ(z) is the scalar by which z acts on Vλ.

3.1step 1.1step 2.1F1F2algebra

Rank one and the sum over paths, by induction on m: for every μ⊢m and every path T of length m ending at μ, the product ET:=eλ(1)(1)⋯eμ(m) acts on Vμ as a rank-one idempotent with image a line LT≠0, kills every Vν with ν⊢m, ν≠μ, and ∑T ending at μET acts as the identity on Vμ, that is, ∑T ending at μET=eμ(m) in C[Sm]. For m=1 the unique path gives E=e(1)(1)=1 acting as the identity on V(1)=C by [F2], which is the rank-one projection onto the whole line. For the induction step write T′=T↓[m−1] and μ=λ(m−1)+x; by [F2] and step 2.1 the operator eλ(m−1)(m−1) projects Vμ onto the summand Vλ(m−1), on which ET′ acts as the rank-one projection onto LT′ by the induction hypothesis, while the remaining summands of the restriction are killed; multiplying by eμ(m), which is the identity on Vμ and kills the other Vν, gives the claim for ET. Summing over all paths ending at μ and using the induction hypothesis at level m−1 together with [F1] gives ∑T ending at μET=∑ν⊢m−1∑T′ ending at νET′eμ(m)=(∑ν⊢m−1eν(m−1))eμ(m)=eμ(m). Distinct paths give distinct lines: if two paths end at μ through different removable nodes their lines lie in different summands of the restriction, and if they end through the same node the induction hypothesis separates their prefixes.

4.1step 2.2step 2.3step 3.1algebra

The algebra GZ(n) equals ⨁TCPT. For the inclusion ⊇: each factor eλ(m)(m) of PT lies in Z(C[Sm]), so PT∈GZ(n). For the inclusion ⊆: step 2.3 writes every element of every generating centre as ∑λωλeλ(m), and step 3.1 writes eλ(m)=∑T ending at λET; substituting gives a linear combination of the PT=eλ(1)(1)⋯eλ(n)(n) for paths of length n, so every generating element lies in the span, and the span is a subalgebra because PTPT′=δTT′PT by step 2.2; hence GZ(n)⊆⨁TCPT. The PT are linearly independent because they are nonzero and pairwise orthogonal, so the sum is direct and GZ(n) is commutative.

4.2step 3.1F1algebra

The idempotents add up to 1: summing the identity of step 3.1 over all λ⊢n and using [F1] gives ∑TPT=∑λ⊢neλ(n)=1.

5.1step 4.1givenalgebra

The Jucys-Murphy elements lie in GZ(n) and act diagonally. For k≥2 one has Xk=Tk−Tk−1, where Tm=∑1≤i<j≤m(i j) is the sum of the transpositions of Sm (The Jucys-Murphy elements of the symmetric group algebra); any two transpositions are conjugate, since for transpositions (a b) and (c d) a permutation g with g(a)=c, g(b)=d satisfies g(a b)g−1=(c d) by Conjugating a cycle relabels each entry: g(a1 … ak)g−1=(g(a1) … g(ak)), so Tm is a class sum and hence central in C[Sm] by For a finite group, the class sums form a basis of Z(k[G]) for m≥2, while T1=0. Thus each Tm lies in Z(C[Sm])⊆GZ(n) and each Xk lies in GZ(n); also X1=0. By step 4.1 we may write Xk=∑TcT,kPT, and then Xk acts on the line CvT=im⁡PT by the scalar cT,k, because PT is the identity on its own image. Hence X1,…,Xn act diagonally in the Young basis.

6.1step 4.1step 5.1F1algebra∎

Maximal commutativity. Under the isomorphism C[Sn]≅∏λ⊢nEnd⁡(Vλ) of [F1], step 3.1 shows that PT corresponds to the tuple whose entry in the factor End⁡(Vλ), λ=λ(n), is the rank-one projection pT onto the line LT⊆Vλ, and whose other entries are 0; since the lines LT for T of shape λ are independent and number dim⁡CVλ, they form a basis of Vλ. Therefore GZ(n)=⨁TCPT corresponds to the tuples (aλ) with aλ in the algebra Dλ of all operators on Vλ diagonal in that basis. An element b=(bλ) commutes with every PT if and only if each bλ commutes with the full diagonal algebra Dλ; and the commutant of Dλ in End⁡(Vλ) is Dλ itself, because a matrix commuting with every diagonal matrix is diagonal. Hence the commutant of GZ(n) in C[Sn] is GZ(n), and if B⊆C[Sn] is any commutative subalgebra containing GZ(n), then B commutes with GZ(n), so B⊆GZ(n) and B=GZ(n). Thus GZ(n) is a maximal commutative subalgebra, and with steps 4.1-5.1 all four assertions are proved.

Remarks

  • The Young basis. The lines CvT=im⁡PT are the simultaneous eigenspaces of the Gelfand-Tsetlin algebra; choosing a nonzero vector vT in each gives the Young basis. The eigenvalues of the Jucys-Murphy elements in this basis are computed in The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors, and the idempotents PT are reproduced by interpolation in Primitive tableau idempotents by Jucys-Murphy interpolation.

  • Where the hypotheses are used. The argument uses characteristic zero only through the semisimplicity and the classification of the complex irreducibles; the branching rule and the centre are used to build and count the PT. Nothing here uses the Axiom of Choice: all sums and products are finite and the idempotents are constructed from the fixed chain.

Depends on

Used by

Dependency tree · two levels

54 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