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.
Symmetric polynomials in the Jucys-Murphy elements give exactly the centre
Statement
Let and let be a symmetric polynomial. Then (i) ; and (ii) conversely, for every central element there is a symmetric polynomial with . In other words, the symmetric polynomial evaluations of the Jucys-Murphy elements are exactly the central elements of the symmetric group algebra.
Facts & Assumptions
Given: The Jucys-Murphy elements , and for each standard tableau of size the Young line with (The Jucys-Murphy elements of the symmetric group algebra, The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors).
Hence for every polynomial the element acts on by the scalar (The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors).
, the factors being indexed by the irreducible modules , and an element is central if and only if it acts by a scalar on each irreducible; the central elements form the centre (If is algebraically closed and , then , Over an algebraically closed field, every endomorphism of an irreducible representation is scalar, The center of the group algebra).
The multiset of entries of is the multiset of contents of the shape of ; if have the same multiset of node contents, then (The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors, A partition is determined by the multiset of its node contents).
Over the substitution , , is an isomorphism from the polynomial ring in variables onto the symmetric polynomials, so every symmetric polynomial in the variables is a polynomial in the first power sums; the power sums of a multiset are determined by its elementary symmetric polynomials through Newton's identities with (If is invertible, then freely generate the symmetric-polynomial ring, Newton's identities: , Power sums and complete homogeneous symmetric polynomials , Symmetric polynomials as the invariants of variable permutations).
Proof
Part (i). Let be symmetric and let be standard tableaux of the same shape . By [F3] the vectors and are permutations of the same multiset, so symmetry of gives ; by [F1] the element acts on every Young line of shape by the same scalar, hence on the whole irreducible by that scalar. By [F2] an element acting by scalars on every irreducible is central, so .
Part (ii), coordinates and their distinctness. For a partition put , where is the -th power sum of the multiset of node contents. If , then for , and Newton's identities of [F4] recursively express in terms of over , so for ; the monic polynomial then equals , so the two content multisets coincide and by [F3]. Hence the points are pairwise distinct.
Lagrange interpolation. Let act on by , as in [F2]. For each ordered pair , let be the least index with ; it exists by step 1.2. Define Every denominator is nonzero by its selection. The product indexed by is at and at every with , because its factor indexed by vanishes there. Thus for every partition, including , when the product is empty.
Substitution. By [F4] the power sums in the variables generate the symmetric polynomials; define to be the symmetric polynomial obtained by substituting in the polynomial . Then is symmetric and acts on by , where and by [F3].
The difference acts by on every , hence is zero by [F2]; therefore with symmetric. With step 1.1 this proves both directions.
Remarks
-
The finite coordinates. Only the points of the partitions of are used; the interpolation degree can be bounded by in each variable, and the construction is the converse of Garsia's Theorem 5.1 in the form recorded by the source.
-
Where the content lemma enters. The distinctness of the points uses that the content multiset determines the partition; this is the only place where the shape is recovered, and it fails for nothing: the lemma is exactly a partition-level statement.
-
Elementary symmetric coordinates. The same argument works with the elementary symmetric polynomials of the contents in place of the power sums, since the two coordinate systems determine each other over ; the power sums are used because the substitution theorem for them is recorded in the library.
Depends on
- The Jucys-Murphy elements generate the Gelfand-Tsetlin algebra
- The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors
- A partition is determined by the multiset of its node contents
- For a finite group, the class sums form a basis of $Z(k[G])$
- If $k$ is algebraically closed and $\operatorname{char} k \nmid |G|$, then $k[G]\cong\prod_{i=1}^r M_{n_i}(k)$
- Over an algebraically closed field, every endomorphism of an irreducible representation is scalar
- The elementary symmetric polynomials $e_0,e_1,\ldots,e_n$
- Symmetric polynomials as the invariants of variable permutations
- Power sums $p_k$ and complete homogeneous symmetric polynomials $h_k$
- If $n!$ is invertible, then $p_1,\ldots,p_n$ freely generate the symmetric-polynomial ring
- Newton's identities: $k e_k=\sum_{i=1}^k(-1)^{i-1}e_{k-i}p_i$
- The Jucys-Murphy elements of the symmetric group algebra
- The center $Z(k[G])$ of the group algebra
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
45 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
- Garsia, Young Seminormal Representation, Murphy Elements and Content Evaluations, UCSD lecture notes (2003), Theorem 5.1 with the converse discussion, printed pp. 32-36 and 51-52 (standard reference, not scraped)
- 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, Corollary 2.6 and section 5, printed pp. 11 and 17-22 (standard reference, not scraped)