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 and let be the central idempotent of the Wedderburn factor of , so that with pairwise orthogonal central idempotents and acts as the identity on and as on for . For a path in the Young graph (a standard tableau of size ) put the factors commuting pairwise. Then:
(i) every is a nonzero idempotent of rank one; (ii) for and ; (iii) , the algebra diagonal in the basis of the lines (the Young basis); (iv) the elements act diagonally in the Young basis, and is a maximal commutative subalgebra of .
Facts & Assumptions
Given: The chain and the Gelfand-Tsetlin algebra (The Gelfand-Tsetlin algebra of the symmetric group chain); for each the complex Specht modules , , which are the irreducible -modules up to isomorphism, pairwise inequivalent for distinct (Specht modules classify the complex irreducibles of ).
For every the group algebra is a product of matrix algebras indexed by its simple modules; by the classification this reads , and the identity of the factor is a central idempotent in such that , for all , and for every -module the element acts as the projection onto the sum of the irreducible summands of isomorphic to ; in particular acts as the identity on and as on for (If is algebraically closed and , then , Simple modules over a product of matrix rings over division rings, If , then is a semisimple ring).
For and the restriction of to is , the summands being irreducible with pairwise distinct shapes and each occurring exactly once; for one has with acting trivially (The complex Specht restriction branching rule).
Proof
The idempotents of [F1] are central in , pairwise orthogonal, sum to , and project each -module onto its -isotypic part.
The idempotents attached to different levels commute: if , then and is central in , hence commutes with every element of , in particular with .
Let and . The restriction of to is the direct sum of the distinct irreducible modules over the removable nodes ; consequently acts on as the projection onto the summand when for some , and as otherwise.
For every standard tableau of size the product is an idempotent, and whenever : distinct standard tableaux of size differ at some level , 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.
Every central element of is a linear combination of the : under the isomorphism of [F1] the centre corresponds to the product of the centres of the factors, and the centre of the matrix algebra consists of the scalars, that is, of . Hence for every , where is the scalar by which acts on .
Rank one and the sum over paths, by induction on : for every and every path of length ending at , the product acts on as a rank-one idempotent with image a line , kills every with , , and acts as the identity on , that is, in . For the unique path gives acting as the identity on by [F2], which is the rank-one projection onto the whole line. For the induction step write and ; by [F2] and step 2.1 the operator projects onto the summand , on which acts as the rank-one projection onto by the induction hypothesis, while the remaining summands of the restriction are killed; multiplying by , which is the identity on and kills the other , gives the claim for . Summing over all paths ending at and using the induction hypothesis at level together with [F1] gives . 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.
The algebra equals . For the inclusion : each factor of lies in , so . For the inclusion : step 2.3 writes every element of every generating centre as , and step 3.1 writes ; substituting gives a linear combination of the for paths of length , so every generating element lies in the span, and the span is a subalgebra because by step 2.2; hence . The are linearly independent because they are nonzero and pairwise orthogonal, so the sum is direct and is commutative.
The idempotents add up to : summing the identity of step 3.1 over all and using [F1] gives .
The Jucys-Murphy elements lie in and act diagonally. For one has , where is the sum of the transpositions of (The Jucys-Murphy elements of the symmetric group algebra); any two transpositions are conjugate, since for transpositions and a permutation with , satisfies by Conjugating a cycle relabels each entry: , so is a class sum and hence central in by For a finite group, the class sums form a basis of for , while . Thus each lies in and each lies in ; also . By step 4.1 we may write , and then acts on the line by the scalar , because is the identity on its own image. Hence act diagonally in the Young basis.
Maximal commutativity. Under the isomorphism of [F1], step 3.1 shows that corresponds to the tuple whose entry in the factor , , is the rank-one projection onto the line , and whose other entries are ; since the lines for of shape are independent and number , they form a basis of . Therefore corresponds to the tuples with in the algebra of all operators on diagonal in that basis. An element commutes with every if and only if each commutes with the full diagonal algebra ; and the commutant of in is itself, because a matrix commuting with every diagonal matrix is diagonal. Hence the commutant of in is , and if is any commutative subalgebra containing , then commutes with , so and . Thus is a maximal commutative subalgebra, and with steps 4.1-5.1 all four assertions are proved.
Remarks
-
The Young basis. The lines are the simultaneous eigenspaces of the Gelfand-Tsetlin algebra; choosing a nonzero vector 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 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 . Nothing here uses the Axiom of Choice: all sums and products are finite and the idempotents are constructed from the fixed chain.
Depends on
- The Gelfand-Tsetlin algebra of the symmetric group chain
- Specht modules classify the complex irreducibles of $S_n$
- The complex Specht restriction branching rule
- If $k$ is algebraically closed and $\operatorname{char} k \nmid |G|$, then $k[G]\cong\prod_{i=1}^r M_{n_i}(k)$
- If $\operatorname{char} k \nmid |G|$, then $k[G]$ is a semisimple ring
- Simple modules over a product of matrix rings over division rings
- For a finite group, the class sums form a basis of $Z(k[G])$
- The Jucys-Murphy elements of the symmetric group algebra
- Conjugating a cycle relabels each entry: $g(a_1\,\ldots\,a_k)g^{-1}=(g(a_1)\,\ldots\,g(a_k))$
Used by
- The Jucys-Murphy spectrum and projectors for S₃ Example
- Primitive tableau idempotents by Jucys-Murphy interpolation Theorem
- The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors Theorem
- The Jucys-Murphy elements generate the Gelfand-Tsetlin algebra Theorem
- Young's seminormal form from the Jucys-Murphy eigenlines Theorem
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
- Okounkov-Vershik, A New Approach to the Representation Theory of the Symmetric Groups, Selecta Math. (N.S.) 2 (1996) 581-605; complete arXiv repost math/0503040, Proposition 1.1, Theorem 2.8 and section 3, printed pp. 7-16 (standard reference, not scraped)
- Garsia, Young Seminormal Representation, Murphy Elements and Content Evaluations, UCSD lecture notes (2003), section 2, printed pp. 12-18 (standard reference, not scraped)