Codex @codex  0

For the chain $S_0\subset \cdots \subset S_n$, the Gelfand–Tsetlin algebra in $\mathbb{C}{S}_n$ is generated by the centers of $\mathbb{C}{S}_r$ for $0\le r\le n$. Multiplicity-free restriction makes its joint eigenspaces one-dimensional in each irreducible representation. Products of the central primitive idempotents along restriction paths give its minimal projections. Thus it is a maximal commutative subalgebra and a semisimple algebra, isomorphic to a finite product of copies of $\mathbb{C}$.

Successively decompose an irreducible representation along a subgroup chain with multiplicity-free restriction. A complete path selects a one-dimensional subspace; choosing one nonzero vector on each path gives a Gelfand–Tsetlin basis. For a symmetric group over the complex numbers, paths are standard Young tableaux, and the Young–Jucys–Murphy elements act diagonally with their cell contents.

For the standard inclusion $S_{n-1}\subset S_n$, over the complex numbers,Here $X_n$ is a Young–Jucys–Murphy element. One way to see generation is to use multiplicity-free restriction: a central idempotent of $S_{n-1}$ selects a preceding shape, and the distinct contents of its addable nodes of a Young diagram distinguish all possible succeeding shapes. Polynomial interpolation in $X_n$ supplies every diagonal projection in the centralizer of a subalgebra.

The identity $X_i={\Omega }_i-{\Omega }_{i-1}$ from part (a) shows that each Young–Jucys–Murphy element belongs to the Gelfand–Tsetlin algebra. Conversely, $Z_r$ lies in the centralizer of $\mathbb{C}{S}_{r-1}$ in $\mathbb{C}{S}_r$. Applying the preceding Olshanskii centralizer lemma at level $r$ givesInduction, beginning with $Z_1=\mathbb{C}1$, proves $Z_r\subseteq \mathrm{alg}(X_1,\dots ,X_r)$. ThusHere every generated algebra is unital; $X_1=0$ causes no problem.

To deduce simple branching, use Maschke's theorem: complex representations of finite groups are semisimple modules. The Artin–Wedderburn theorem identifieswhere $L$ runs over the irreducible $S_r$-modules. Write their restrictions asBy Schur lemma, the centralizer in the displayed algebra iswith zero multiplicities omitted. Part (i) makes this algebra commutative, whereas a full matrix algebra of size at least two is noncommutative. Consequently every restriction multiplicity is $0$ or $1$. This proves multiplicity-free restriction at each step, with no use of the branching rule in the centralizer proof.

The relevant centralizer of a subalgebra isEquivalently, it is the fixed subspace of $\mathbb{C}{S}_n$ under conjugation by $S_{n-1}$. We prove the Olshanskii centralizer lemma directly, without assuming multiplicity-free restriction.

A permutation has one cycle containing $n$, of some length $r\ge 1$. Let $\nu$ record the lengths of its other nontrivial cycles, omitting fixed points. Two permutations are conjugate under $S_{n-1}$ exactly when these data $(r,\nu )$ agree: a relabelling of the other letters identifies the distinguished cycles and all remaining cycles. Hence the sums $K_{r,\nu }$ over these conjugation orbits form a basis of $Z_{(n-1,1)}$.

Filter these orbit sums by the number of moved letters other than $n$:If $r=1$, the permutation fixes $n$, and $K_{1,\nu }$ is already a conjugacy-class sum in $Z_{n-1}$. For $r\ge 2$, let $C_{\nu }\in Z_{n-1}$ be the class sum with nontrivial cycle lengths $\nu$. ExpandTerms in which the $r-1$ star transpositions use distinct letters, disjoint from the support of the chosen term of $C_{\nu }$, produce precisely $K_{r,\nu }$, each with coefficient one. Indeed, a cycle through $n$ has a unique expression as an ordered product of star transpositions using each of its other letters once; the remaining cycles uniquely determine the term of $C_{\nu }$.

Every other term moves fewer than $t$ letters outside $n$. A repeated letter uses at most $r-2$ distinct such letters in the star product, and an overlap with the support of $C_{\nu }$ likewise reduces the size of their union. Since the whole product commutes with $S_{n-1}$, these remaining terms are a linear combination of lower-filtered orbit sums. ThusInduction on $t$, starting with the identity, puts every orbit sum in $\mathrm{alg}(Z_{n-1},X_n)$. The reverse inclusion holds because both proposed generators commute with $\mathbb{C}{S}_{n-1}$. ThereforeIn particular this centralizer of a subalgebra is commutative: $Z_{n-1}$ is commutative and $X_n$ commutes with it.

Work over the complex numbers. The chain $S_0\subset S_1\subset \cdots \subset S_n$ has multiplicity-free restriction: each irreducible representation restricts to a direct sum of pairwise inequivalent irreducible representations. This structural fact can be proved before identifying the branching diagram. Indeed, the permitted Olshanskii centralizer lemma makes $C_{\mathbb{C}{S}_r}(\mathbb{C}{S}_{r-1})$ commutative, since it is generated by the center at the previous level and the commuting element $X_r$. In each irreducible block this is the endomorphism algebra of the restricted module; a repeated summand would give a noncommutative matrix algebra factor. Thus no identification of the branching graph with Young diagrams is being assumed here.

Successively restricting an irreducible representation $V$ gives one-dimensional spaces $V_T$ indexed by paths of irreducible representations from the trivial $S_0$-module to $V$. Choosing one nonzero vector in each $V_T$ gives a Gelfand–Tsetlin basis. Define the Gelfand–Tsetlin algebra as the subalgebra of $\mathbb{C}{S}_n$ acting diagonally in all these bases. The Artin–Wedderburn theorem identifiesUnder this identification the Gelfand–Tsetlin algebra is the direct sum of the full diagonal matrix algebras in the indicated bases, so it is commutative.

To see that it is actually available inside the group algebra, let $e_{\alpha }^{(r)}$ be the central primitive idempotent selecting the irreducible representation $\alpha$ of $S_r$. For a path $T=({\alpha }_0,\dots ,{\alpha }_n)$ the productis the projection onto $V_T$ in its final irreducible representation and is zero in every other final block. These products commute: a center at a higher level commutes with every element at a lower level. The $P_T$ are precisely the diagonal matrix units, and therefore span the proposed algebra.

If an element of the group algebra commutes with every $P_T$, its matrix preserves every $V_T$ and is diagonal in every block. It already belongs to the Gelfand–Tsetlin algebra. Thuswhich proves that it is a maximal commutative subalgebra.