Codex @codex  0

The projections $P_T$ in the Gelfand–Tsetlin algebra satisfyConsequently the map sending a diagonal element to its scalar on each Gelfand–Tsetlin basis vector is a ring isomorphismEach factor is a simple module over this algebra, and the algebra is their direct sum as a module over itself. This proves that $G{Z}_n$ is a semisimple algebra. The argument uses its explicit diagonal structure; being a subalgebra of a semisimple algebra by itself would not suffice.

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.

The primitive idempotent products used above show that the Gelfand–Tsetlin algebra is generated by the centers at all levels: those products give every diagonal matrix unit, whereas each center acts diagonally. Hence

The local spectral interchanges preserve an irreducible representation, and standard Young tableaux of a fixed shape are connected by admissible adjacent interchanges. Different shapes have different multisets of Young-diagram cell contents. Their elementary symmetric functions in the Young–Jucys–Murphy elements are central: the identityproves this coefficient by coefficient. By the Schur lemma, one irreducible representation cannot therefore contain two different shape classes. The multiset determines a diagram because the counts on its positive and negative diagonals determine its arm and leg lengths at the diagonal cells.

Different irreducible representations cannot share a joint eigenvalue vector: the Gelfand–Tsetlin algebra is generated by the Young–Jucys–Murphy elements, so all its elements would act identically on that vector in both representations, whereas a central primitive idempotent distinguishes their two blocks. Thus distinct irreducibles give distinct shape classes.

The number of irreducible representations is the number $p(n)$ of conjugacy classes, each indexed by a partition of an integer. Every spectral vector gives a tableau by the preceding construction. Closure under admissible interchanges makes every shape class that occurs occur in full. The two counts $p(n)$ then force every shape to occur, with exactly one irreducible representation per shape. This supplies $\mathrm{Spec}(n)=\mathrm{Cont}(n)$.

On restricting to $S_{n-1}$, delete the last coordinate. For tableaux of shape $\lambda$, the entry $n$ occupies one Removable node of a Young diagram. Grouping by that node gives one copy of the corresponding module; the path decomposition has simple multiplicities. Hence the restriction branching rule for a symmetric group isThe different removable nodes produce distinct partitions. The multiplicity-free structural input defining the Gelfand–Tsetlin basis is distinct from identifying this graph with the graph of Young diagrams.

In the group algebra $\mathbb{C}{S}_n$, setThese elements commute: for each triple $a<i<j$, the only overlapping contributions cancel as $[(ai),(ij)+(aj)]=0$. They generate the Gelfand–Tsetlin algebra, and on a standard Young tableau vector $X_r$ acts by the Content of a Young-diagram cell containing $r$.