Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedverified 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.

Kostant harmonic decomposition of the symmetric algebra

Statement

Assume the Axiom of Choice. For a finite-dimensional complex semisimple Lie algebra g, set S=S(g), R=Sg, and let H be its Kostant harmonic subspace. Multiplication is an isomorphism R⊗CH⟶S of graded g-modules, where R carries the trivial action. The assertion includes g=0.

Facts & Assumptions

Given: The Axiom of Choice and the indicated finite-dimensional semisimple Lie algebra and symmetric algebra.

[A1]

The Axiom of Choice is The Axiom of Choice; both Cartan restriction [F2] for an arbitrary Cartan subalgebra and the finite-Weyl invariant freeness supplier [F3] require it.

[F1]

With I=SR+, the homogeneous harmonic spaces give Sd=Id⊕Hd, and both summands are g-stable, by Kostant harmonics give an invariant polynomial complement.

[F2]

Under [A1], Cartan restriction, equivalently the symmetric-algebra map induced by the Killing-orthogonal projection onto a Cartan h, identifies R with S(h)W, by Local Chevalley restriction for Kostant freeness. Its Cartan/root decomposition gives the complementary sum n of root spaces.

[F3]

Under [A1], the algebra S(h)W has homogeneous independent generators q1,…,qr of positive degrees di, and S(h) has a finite homogeneous free basis b1,…,bm over it, by Chevalley shephard todd for finite weyl groups.

Proof

1.1F2F3givenalgebra

Fix finite bases of h and n. Polynomial monomials identify S with S(h)⊗S(n). Give a Cartan generator weight two and a root-space generator weight one; filter by total weight. This is an increasing filtration indexed by nonnegative integers and every polynomial has finite weight. A homogeneous polynomial of ordinary degree d has weights between d and 2d, and its weight-2d part is exactly its projection onto Sd(h). By F2 each qi has a unique homogeneous inverse image pi∈R of degree di. Its leading weighted part is qi, since qi≠0. F2 also gives R=C[p1,…,pr] with algebraically independent generators.

2.1F3step 1.1algebra

Let za range over the monomials in the fixed root-space basis, and set ej,a=bjza. In the polynomial algebra with its weight grading these form a free basis over C[q1,…,qr]: expand first in the independent root monomials, then use F3 for each coefficient. Their ordinary degrees are deg⁡bj+∣a∣ and their weights are 2deg⁡bj+∣a∣. We prove that exactly the same polynomials form a graded free R-basis of S.

3.1step 1.1step 2.1algebra

For spanning, take an ordinary homogeneous s∈Sd of weight N. Express its leading weighted part uniquely in the basis from step 2.1. Since that basis and the qi are homogeneous for both degrees, only monomials qkej,a having ordinary degree d and weight N occur. Replace qk by pk and subtract this finite sum from s. Step 1.1 makes its leading part identical, so the remainder has strictly smaller weight and the same ordinary degree. Repeat; after at most N+1 decreases the remainder is zero. This proves spanning by finite expressions. For independence, suppose a nonzero finite expression ∑cj,a(p)ej,a vanishes. Give the variables in each coefficient weight 2di and take the largest total weight among its nonzero monomials, including the weight of ej,a. The leading part of the expression is the corresponding sum of q-coefficient terms in the free basis of step 2.1. Algebraic independence of the qi and that free basis show this sum is nonzero, a contradiction. Thus we have the stated free decomposition; ordinary degrees were preserved throughout.

4.1F1step 1.1step 3.1algebra

Quotienting this free decomposition by (p1,…,pr)S=I shows that the classes of the ej,a form a homogeneous complex basis of S/I. In each ordinary degree only finitely many of them occur: j has finitely many possibilities and root monomials of bounded degree in finitely many variables form a finite set. F1 identifies H with S/I by the quotient map, degree by degree. Consequently, in every degree d, the spaces (R⊗H)d and Sd have equal finite dimensions, by replacing each basis class of S/I in the free decomposition with its degree-preserving harmonic representative. This argument uses the canonical inverse of F1's quotient isomorphism, and makes no infinite sequence of basis choices.

5.1F1step 1.1step 4.1algebra

Multiplication R⊗H→S is surjective by induction on ordinary degree. For homogeneous s∈Sd, F1 writes s=h+i with h∈Hd and i∈Id. The ideal I is generated by the finitely many pi, so its degree-d part consists of sums ∑ipisi with si∈Sd−di; obtain these homogeneous coefficients by taking components of any ideal expression. Each di>0, so the induction expresses every si as a sum of invariant multiples of harmonics. Multiplying those expressions by pi proves the step. At degree zero the assertion follows from I0=0. Equal finite dimensions from step 4.1 now make this surjection injective degreewise, hence an isomorphism on the algebraic graded direct sums.

6.1A1F1F2F3step 5.1givenalgebra∎

The adjoint action is a derivation, annihilates R and preserves H by F1. Therefore x⋅(rh)=r(x⋅h), exactly the tensor-product action, so the isomorphism is g-equivariant. For g=0 all polynomial algebras are C and the map is scalar multiplication. The proof selected only finite bases and finitely many generators; all infinite monomial collections are explicitly indexed by finite tuples of nonnegative integers, and all reductions terminate. The AC premise is inherited through [F2] and [F3], not from these finite reductions.

Depends on

Used by

Dependency tree · two levels

15 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