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 and let be the centralizer of in . Then the subalgebra generated by the centre of and the element . Consequently , because the centre of is contained in the centralizer.
Facts & Assumptions
Given: The chain , the subalgebra , the centre (The center of the group algebra) and (The Jucys-Murphy elements of the symmetric group algebra).
For every finite-dimensional representation of a finite group over an algebraically closed field of characteristic zero the centre acts by a scalar on each irreducible constituent, the scalar being constant on isomorphic constituents; the algebra itself decomposes as for , and endomorphisms of an irreducible are scalars (If is algebraically closed and , then , Over an algebraically closed field, every endomorphism of an irreducible representation is scalar).
The complex Specht modules , , are a complete list of pairwise inequivalent irreducible complex -modules, and for the restriction is multiplicity-free (Specht modules classify the complex irreducibles of , The complex Specht restriction branching rule).
for , hence commutes with every element of (Local relations between the Jucys-Murphy elements and adjacent transpositions).
For a partition , distinct addable nodes have distinct contents, so the map sending to the content is injective on the set of containing (Distinct addable nodes of a partition have distinct contents).
for every standard tableau of size , the eigenvalue being the content of the node carrying ; the eigenvalue of on the -irreducible copy is therefore the content , independent of (The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors).
Proof
By [F3] the element commutes with ; every commutes with every element of by definition of the centre. Hence and all of lie in , and since that set is a subalgebra, .
Write for the set of pairs with , and ; equivalently . For let denote the -isotypic component of the multiplicity-free sum restricted to ; by [F2] it is the direct sum of the copies over the pairs .
Structure of the centralizer. By [F1] applied to , an element corresponds to a tuple with , and lies in exactly when each commutes with the -action on . By [F2] and [F1] the commutant of in is : 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 -endomorphism of each irreducible summand is a scalar. Hence evaluation on the copies induces an algebra isomorphism , , where is the scalar by which acts on the copy of inside ; it is injective because zero scalars on every restriction summand make every operator zero, and the Wedderburn product isomorphism in [F1] then gives , and surjective by [F1] because the scalars on the finitely many copies may be prescribed independently.
The image of under the isomorphism of step 2.1 is the unital subalgebra of generated by the evaluations of the two generating pieces: an element acts on every copy by the central character value of the irreducible ; and acts on the copy by the scalar by [F5].
Separation of edges with distinct predecessor. Let with . The central idempotent of the Wedderburn factor acts as on and as on , since and the irreducible modules are inequivalent; by step 3.1 the element therefore separates the two edges.
Separation of edges with the same predecessor. Let with ; write , with distinct addable nodes of . By [F4] their contents differ, , so by step 3.1 the element assumes the distinct values on the two edges and separates them.
A unital subalgebra of that separates the points of the finite set is all of : indeed, for each and each separation gives with , and then lies in , satisfies and for , and is therefore a nonzero multiple of the standard basis idempotent ; hence every and .
By steps 4.1 and 4.2 the subalgebra of step 3.1 separates every pair of distinct edges, so step 5.1 gives . Since the evaluation map of step 2.1 is an isomorphism, the preimage of is the whole centralizer; hence .
Every central element of commutes with , so by step 6.1.
Remarks
-
The dimension count. The isomorphism of step 2.1 gives , the number of edges of the Young graph between levels and . At this is , matching the direct commutant computation in .
-
Commutativity. The centralizer is the algebra of functions on the finite set , hence commutative; this is the content of The centralizer of in is commutative, and the isomorphism of step 2.1 makes it transparent.
-
Generators and the top centre. The centres of the subgroup chain generate (The Gelfand-Tsetlin algebra of the symmetric group chain). The theorem identifies the relative centralizer with the algebra generated by the previous centre and , and puts the top centre inside that algebra; the proof uses no symmetric-function input.
Depends on
- The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors
- Distinct addable nodes of a partition have distinct contents
- The complex Specht restriction branching rule
- Specht modules classify the complex irreducibles of $S_n$
- 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
- Local relations between the Jucys-Murphy elements and adjacent transpositions
- The Jucys-Murphy elements of the symmetric group algebra
- The center $Z(k[G])$ of the group algebra
- The Gelfand-Tsetlin algebra of the symmetric group chain
- The centralizer of $\mathbb C[S_{n-1}]$ in $\mathbb C[S_n]$ is commutative
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
- 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, Theorem 2.8 and section 2, printed pp. 10-12 (standard reference, not scraped)
- Alexander Kleshchev, Essen Lectures: Representation Theory of Symmetric Groups, Proposition 1.2.2 (Olshanskii's lemma), case m=1, printed p. 12 (standard reference, not scraped)