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.

The relative centralizer is generated by the previous centre and the last Jucys-Murphy element

Statement

Let n≥2 and let Z(C[Sn],C[Sn−1])={z∈C[Sn]:zh=hz for every h∈Sn−1} be the centralizer of C[Sn−1] in C[Sn]. Then Z(C[Sn],C[Sn−1])=⟨Z(C[Sn−1]),Xn⟩, the subalgebra generated by the centre of C[Sn−1] and the element Xn. Consequently Z(C[Sn])⊆⟨Z(C[Sn−1]),Xn⟩, because the centre of C[Sn] is contained in the centralizer.

Facts & Assumptions

Given: The chain S1⊂⋯⊂Sn, the subalgebra C[Sn−1]⊆C[Sn], the centre Z(C[Sn−1]) (The center Z(k[G]) of the group algebra) and Xn=∑j<n(j n) (The Jucys-Murphy elements of the symmetric group algebra).

[F1]

For every finite-dimensional representation V of a finite group G over an algebraically closed field of characteristic zero the centre Z(C[G]) acts by a scalar on each irreducible constituent, the scalar being constant on isomorphic constituents; the algebra itself decomposes as ∏λ⊢mEnd⁡(Vλ) for G=Sm, and endomorphisms of an irreducible are scalars (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).

[F2]

The complex Specht modules Vμ=SCμ, μ⊢m, are a complete list of pairwise inequivalent irreducible complex Sm-modules, and for λ⊢n the restriction Res⁡Sn−1SnVλ≅⨁x∈Rem⁡(λ)Vλ−x is multiplicity-free (Specht modules classify the complex irreducibles of Sn, The complex Specht restriction branching rule).

[F3]

siXn=Xnsi for 1≤i≤n−2, hence Xn commutes with every element of C[Sn−1] (Local relations between the Jucys-Murphy elements and adjacent transpositions).

[F4]

For a partition μ, distinct addable nodes have distinct contents, so the map sending λ=μ+x to the content c(x) is injective on the set of λ⊢n containing μ (Distinct addable nodes of a partition have distinct contents).

[F5]

XnvT=cT(n)vT for every standard tableau T of size n, the eigenvalue being the content of the node carrying n; the eigenvalue of Xn on the Sn−1-irreducible copy Vμ⊆Vμ+x is therefore the content c(x), independent of T (The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors).

Proof

technique · direct
1.1F3givenalgebra

By [F3] the element Xn commutes with C[Sn−1]; every z∈Z(C[Sn−1]) commutes with every element of C[Sn−1] by definition of the centre. Hence Xn and all of Z(C[Sn−1]) lie in Z(C[Sn],C[Sn−1]), and since that set is a subalgebra, ⟨Z(C[Sn−1]),Xn⟩⊆Z(C[Sn],C[Sn−1]).

1.2F2given

Write E for the set of pairs (μ,λ) with μ⊢n−1, λ⊢n and μ⊆λ; equivalently E={(μ,μ+x):x∈Add⁡(μ)}. For μ⊢n−1 let Wμ denote the μ-isotypic component of the multiplicity-free sum W:=⨁λ⊢nVλ restricted to Sn−1; by [F2] it is the direct sum of the copies Vμ⊆Vλ over the pairs (μ,λ)∈E.

2.1F1F2step 1.2algebra

Structure of the centralizer. By [F1] applied to Sn, an element z∈C[Sn] corresponds to a tuple (zλ)λ⊢n with zλ∈End⁡(Vλ), and z lies in Z(C[Sn],C[Sn−1]) exactly when each zλ commutes with the Sn−1-action on Vλ. By [F2] and [F1] the commutant of Sn−1 in End⁡(Vλ) is ∏x∈Rem⁡(λ)C idVλ−x: restriction is multiplicity-free; any nonzero map between two irreducible summands would be an isomorphism (its kernel and image are invariant), contrary to their distinct shapes, so off-diagonal maps vanish; by Schur's lemma an Sn−1-endomorphism of each irreducible summand Vλ−x is a scalar. Hence evaluation on the copies induces an algebra isomorphism Z(C[Sn],C[Sn−1])→CE, z↦(z(μ,λ))(μ,λ)∈E, where z(μ,λ) is the scalar by which z acts on the copy of Vμ inside Vλ; it is injective because zero scalars on every restriction summand make every operator zλ zero, and the Wedderburn product isomorphism in [F1] then gives z=0, and surjective by [F1] because the scalars on the finitely many copies may be prescribed independently.

3.1F5step 2.1algebra

The image A of ⟨Z(C[Sn−1]),Xn⟩ under the isomorphism of step 2.1 is the unital subalgebra of CE generated by the evaluations of the two generating pieces: an element z∈Z(C[Sn−1]) acts on every copy Vμ by the central character value ωμ(z) of the irreducible Vμ; and Xn acts on the copy (μ,λ)=(μ,μ+x) by the scalar c(x) by [F5].

4.1F1F2step 3.1algebra

Separation of edges with distinct predecessor. Let (μ,λ),(μ′,λ′)∈E with μ≠μ′. The central idempotent eμ∈Z(C[Sn−1]) of the Wedderburn factor End⁡(Vμ) acts as 1 on Vμ and as 0 on Vμ′, since μ≠μ′ and the irreducible modules are inequivalent; by step 3.1 the element eμ therefore separates the two edges.

4.2F4F5step 3.1algebra

Separation of edges with the same predecessor. Let (μ,λ),(μ,λ′)∈E with λ≠λ′; write λ=μ+x, λ′=μ+x′ with distinct addable nodes x≠x′ of μ. By [F4] their contents differ, c(x)≠c(x′), so by step 3.1 the element Xn assumes the distinct values c(x),c(x′) on the two edges and separates them.

5.1step 4.1step 4.2algebra

A unital subalgebra of CE that separates the points of the finite set E is all of CE: indeed, for each e∈E and each e′≠e separation gives ae′∈A with ae′(e)≠ae′(e′), and then be:=∏e′≠e(ae′−ae′(e′)⋅1) lies in A, satisfies be(e)≠0 and be(e′′)=0 for e′′≠e, and is therefore a nonzero multiple of the standard basis idempotent δe; hence every δe∈A and A=CE.

6.1step 5.1step 2.1algebra

By steps 4.1 and 4.2 the subalgebra A of step 3.1 separates every pair of distinct edges, so step 5.1 gives A=CE. Since the evaluation map of step 2.1 is an isomorphism, the preimage of CE is the whole centralizer; hence ⟨Z(C[Sn−1]),Xn⟩=Z(C[Sn],C[Sn−1]).

7.1step 6.1givenalgebra∎

Every central element of C[Sn] commutes with C[Sn−1], so Z(C[Sn])⊆Z(C[Sn],C[Sn−1])=⟨Z(C[Sn−1]),Xn⟩ by step 6.1.

Remarks

  • The dimension count. The isomorphism of step 2.1 gives dim⁡Z(C[Sn],C[Sn−1])=#E=∑μ⊢n−1#Add⁡(μ)=∑λ⊢n#Rem⁡(λ), the number of edges of the Young graph between levels n−1 and n. At n=3 this is 4, matching the direct commutant computation in C[S3].

  • Commutativity. The centralizer is the algebra of functions on the finite set E, hence commutative; this is the content of The centralizer of C[Sn−1] in C[Sn] is commutative, and the isomorphism of step 2.1 makes it transparent.

  • Generators and the top centre. The centres of the subgroup chain generate GZ(m) (The Gelfand-Tsetlin algebra of the symmetric group chain). The theorem identifies the relative centralizer with the algebra generated by the previous centre and Xn, and puts the top centre inside that algebra; the proof uses no symmetric-function input.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

59 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