Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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 Gelfand-Tsetlin algebra of the symmetric group chain

Definition

For n≥1 and 1≤m≤n let Z(C[Sm]) be the centre of the complex group algebra C[Sm] (The center Z(k[G]) of the group algebra, The group ring R[G] of finitely supported formal R-linear combinations of group elements). We use the standard chain of symmetric groups S1⊂S2⊂⋯⊂Sn,Sm=Sym⁡({1,…,m}), in which Sm is the subgroup of Sn fixing every element of {m+1,…,n} pointwise; thus C[Sm] is the subalgebra of C[Sn] spanned by Sm, and Z(C[S1])=C⋅1. Each centre Z(C[Sm]) is thereby regarded as a subalgebra of C[Sn].

The Gelfand-Tsetlin algebra of the chain is GZ(n):=⟨Z(C[S1]),Z(C[S2]),…,Z(C[Sn])⟩⊆C[Sn], the unital subalgebra of C[Sn] generated by all these centres.

Remarks

  • Well-definedness. Each Z(C[Sm]) is a C-subalgebra of C[Sm], hence, via the inclusion C[Sm]⊆C[Sn], a subset of C[Sn] closed under addition, multiplication and scalar multiplication; the generated subalgebra is therefore a unital subalgebra of C[Sn]. It is finite-dimensional because C[Sn] is: each C[Sm] is a finite-dimensional semisimple algebra (If char⁡k∤∣G∣, then k[G] is a semisimple ring), so its centre is finite-dimensional as well.

  • Commutativity. Every element of Z(C[Sm]) is central in C[Sm]. If m≤k and z∈Z(C[Sm]), w∈Z(C[Sk]), then C[Sm]⊆C[Sk] and w commutes with every element of C[Sk], in particular with z; hence zw=wz. Thus all the generating centres commute with one another, and GZ(n) is a commutative subalgebra of C[Sn]. Only this centrality, not semisimplicity, is used.

  • The top centre is included. The term m=n shows Z(C[Sn])⊆GZ(n); in fact the centre of C[Sn] is the algebra generated by its class sums, and the other centres are generated by the class sums of the subgroups, so GZ(n) is generated by class sums of the chain together with C[S1]=C.

  • The algebra used below. GZ(n) is the diagonal algebra of the Young basis: The Gelfand-Tsetlin algebra is the diagonal algebra of the Young basis identifies it with ⨁TCPT over the standard tableaux T of size n, and The Jucys-Murphy elements generate the Gelfand-Tsetlin algebra shows that it is also the algebra generated by the Jucys-Murphy elements.

Depends on

Used by

Dependency tree · two levels

13 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