Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-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.

Weyl-invariant polynomials on the Cartan extend to invariant polynomials on g

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let g be a finite-dimensional complex semisimple Lie algebra and let h be any Cartan subalgebra in the nilpotent self-normalizing sense. Form its root system and Weyl group as in The root set is a reduced crystallographic root system and Root reflections and the Weyl group action.

Then every Weyl-invariant polynomial on h extends uniquely to an adjoint-invariant polynomial on g.

Facts & Assumptions

Given: the Axiom of Choice, an arbitrary Cartan subalgebra h of g, and a Weyl-invariant polynomial p∈S(h)W. Choice is used to identify the arbitrary Cartan with a maximal toral subalgebra in the root-system supplier.

[F0]

Under Choice, the root system of an arbitrary Cartan is finite, reduced and crystallographic, so the Weyl action and fundamental weights used below are available (The root set is a reduced crystallographic root system, Root reflections and the Weyl group action, Fundamental weights for a chosen simple root system).

[F1]

For a finite group in characteristic 0, averaging over the group is a projection from a representation onto its invariant subspace.

[F2]

For each dominant integral weight λ, the weights of L(λ) give a finite unitriangular character expansion in Weyl-orbit sums, with leading orbit Wλ having coefficient 1, and a finite inverse expansion (Highest-weight characters are unitriangular in Weyl orbit sums).

Proof

technique · direct
1.1F0givenconstructalgebra

By [F0] under the stated Choice assumption, fix a positive system for the root system of the supplied Cartan. Fix a degree n. For each dominant integral weight λ, let L(λ) be supplied by Finite-dimensional simple modules are classified by dominant highest weights and define Fλ,n(x):=tr⁡L(λ)(ρλ(x)n). Conjugation of ρλ(x) does not change its trace, so Fλ,n∈Sn(g)g. On h∈h its value is the sum of μ(h)n over the weights μ of L(λ), with multiplicity.

2.1F2step 1.1algebra

Let Mλ,n(h):=∑μ∈Wλμ(h)n. Apply the finite inverse expansion in [F2] to the linear map eμ↦μ(h)n. Step 1.1 then makes every Mλ,n a finite linear combination of restrictions of the Fν,n.

3.1F1step 2.1algebra

The pure powers ℓn with ℓ∈h∗ span Sn(h) by polarization. Dominant integral weights still suffice: in fundamental-weight coordinates they contain N0r, and a polynomial vanishing on this grid is zero by induction on r, using the one-variable fact that a nonzero polynomial has finitely many roots. Thus the powers of dominant weights span, since any linear functional annihilating them gives a homogeneous polynomial vanishing on the grid. Averaging over the finite Weyl group [F1] shows that the orbit averages Mλ,n/∣Wλ∣ span Sn(h)W. Together with step 2.1, this proves that every homogeneous Weyl invariant of degree n is the restriction of an element of Sn(g)g.

4.1step 3.1∎

Apply step 3.1 to every homogeneous component of p and sum the resulting invariant extensions to obtain P∈S(g)g with P∣h=p. If P′ is another extension, then P−P′ restricts to zero, so An invariant polynomial is determined by its restriction to a Cartan subalgebra gives P=P′. Thus the extension is unique.

Depends on

Used by

Dependency tree · two levels

16 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