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.

Symmetric polynomials in the Jucys-Murphy elements give exactly the centre

Statement

Let n≥1 and let f∈C[y1,…,yn] be a symmetric polynomial. Then (i) f(X1,…,Xn)∈Z(C[Sn]); and (ii) conversely, for every central element z∈Z(C[Sn]) there is a symmetric polynomial f with z=f(X1,…,Xn). 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 X1,…,Xn, and for each standard tableau T of size n the Young line CvT with XkvT=cT(k)vT (The Jucys-Murphy elements of the symmetric group algebra, The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors).

[F1]

Hence for every polynomial f∈C[y1,…,yn] the element f(X1,…,Xn) acts on CvT by the scalar f(cT(1),…,cT(n)) (The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors).

[F2]

C[Sn]≅∏λ⊢nEnd⁡(Vλ), the factors being indexed by the irreducible modules Vλ, and an element is central if and only if it acts by a scalar on each irreducible; the central elements form the centre Z(C[Sn]) (If k is algebraically closed and char⁡k∤∣G∣, then k[G]≅∏i=1rMni(k), Over an algebraically closed field, every endomorphism of an irreducible representation is scalar, The center Z(k[G]) of the group algebra).

[F3]

The multiset of entries of Cont⁡(T) is the multiset of contents of the shape of T; if λ,μ⊢n 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).

[F4]

Over C the substitution Pk↦pk, k=1,…,n, is an isomorphism from the polynomial ring in n variables onto the symmetric polynomials, so every symmetric polynomial in the variables is a polynomial in the first n power sums; the power sums of a multiset are determined by its elementary symmetric polynomials through Newton's identities with k ek=∑i=1k(−1)i−1ek−ipi (If n! is invertible, then p1,…,pn freely generate the symmetric-polynomial ring, Newton's identities: kek=∑i=1k(−1)i−1ek−ipi, Power sums pk and complete homogeneous symmetric polynomials hk, Symmetric polynomials as the invariants of variable permutations).

Proof

technique · direct
1.1F1F2F3algebra

Part (i). Let f be symmetric and let T,T′ be standard tableaux of the same shape λ. By [F3] the vectors Cont⁡(T) and Cont⁡(T′) are permutations of the same multiset, so symmetry of f gives f(Cont⁡(T))=f(Cont⁡(T′)); by [F1] the element f(X) acts on every Young line of shape λ by the same scalar, hence on the whole irreducible Vλ by that scalar. By [F2] an element acting by scalars on every irreducible is central, so f(X1,…,Xn)∈Z(C[Sn]).

1.2F3F4algebra

Part (ii), coordinates and their distinctness. For a partition λ⊢n put qλ:=(p1(λ),…,pn(λ))∈Cn, where pk(λ):=∑x∈[λ]c(x)k is the k-th power sum of the multiset of node contents. If qλ=qμ, then pk(λ)=pk(μ) for k≤n, and Newton's identities of [F4] recursively express ek in terms of p1,…,pk over C, so ek(λ)=ek(μ) for k≤n; the monic polynomial ∏x∈[λ](t−c(x))=tn−e1(λ)tn−1+⋯+(−1)nen(λ) then equals ∏x∈[μ](t−c(x)), so the two content multisets coincide and λ=μ by [F3]. Hence the p(n) points qλ are pairwise distinct.

2.1step 1.2F2algebra

Lagrange interpolation. Let z∈Z(C[Sn]) act on Vλ by ζλ, as in [F2]. For each ordered pair λ≠μ, let j(λ,μ) be the least index with qλ,j≠qμ,j; it exists by step 1.2. Define F(y1,…,yn):=∑λ⊢nζλ∏μ≠λyj(λ,μ)−qμ,j(λ,μ)qλ,j(λ,μ)−qμ,j(λ,μ). Every denominator is nonzero by its selection. The product indexed by λ is 1 at qλ and 0 at every qν with ν≠λ, because its factor indexed by μ=ν vanishes there. Thus F(qλ)=ζλ for every partition, including n=1, when the product is empty.

3.1F1F3F4step 2.1algebra

Substitution. By [F4] the power sums p1,…,pn in the variables X1,…,Xn generate the symmetric polynomials; define f to be the symmetric polynomial F(p1,…,pn) obtained by substituting Pk↦pk in the polynomial F(P1,…,Pn). Then f is symmetric and f(X1,…,Xn) acts on CvT by F(p1(λ),…,pn(λ))=F(qλ)=ζλ, where λ=shape⁡(T) and pk(λ)=∑jcT(j)k by [F3].

4.1step 1.1step 3.1F2algebra∎

The difference f(X1,…,Xn)−z acts by ζλ−ζλ=0 on every Vλ, hence is zero by [F2]; therefore z=f(X1,…,Xn) with f symmetric. With step 1.1 this proves both directions.

Remarks

  • The finite coordinates. Only the p(n) points qλ of the partitions of n are used; the interpolation degree can be bounded by p(n)−1 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 qλ 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 C; the power sums are used because the substitution theorem for them is recorded in the library.

Depends on

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