Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-22
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.

Generalized weight spaces of a nilpotent subalgebra

Statement

Let g be a finite-dimensional complex Lie algebra and let h⊆g be a nilpotent Lie subalgebra (Lower central series and nilpotent Lie algebras, Lie subalgebras, ideals, and center). For α∈h∗ put

gα={X∈g:for each H∈h there is n=n(H,X) with (ad⁡H−α(H))nX=0},

with ad⁡H(X)=[H,X] as in Derivations of Lie algebras. Then:

(i) each gα is a linear subspace of g stable under ad⁡H for every H∈h, and gα=0 for all but finitely many α; (ii) g=⨁α∈h∗gα; (iii) h⊆g0; (iv) [gα,gβ]⊆gα+β for all α,β.

Facts & Assumptions

Given: A finite-dimensional complex Lie algebra g and a nilpotent Lie subalgebra h⊆g.

[L1]

A finite-dimensional Lie algebra is nilpotent if and only if every adjoint operator of it is nilpotent (Engel's theorem); applied to h, the endomorphism ad⁡H∣h is nilpotent for every H∈h.

[L2]

A nilpotent Lie algebra is solvable (Nilpotent Lie algebras are solvable), and every nonzero finite-dimensional module of a solvable complex Lie algebra has a flag lowered by every represented operator, by Lie's theorem (Lie's theorem).

[L3]

For an endomorphism T of a finite-dimensional complex vector space V and N=dim⁡V, the generalized eigenspaces ker⁡(T−λ)N are T-invariant and V=⨁λker⁡(T−λ)N (Primary decomposition: the irreducible-power factors of μT split V into their invariant kernels).

Proof

technique · simultaneous generalized eigenspace refinement
1.1L1L3algebra

Let H∈h and N=dim⁡g. By [L3] applied to ad⁡H, the spaces Vλ,H=ker⁡(ad⁡H−λ)N are ad⁡H-invariant and g=⨁λVλ,H. Moreover h⊆g0: for H′∈h, [L1] gives (ad⁡H)nH′=0 for some n, so H′∈g0 because the condition defining g0 is vacuous at α=0. This is (iii).

1.2L1L3algebra

We claim each Vλ,H is stable under ad⁡Y for every Y∈h. By [L1] the operator ad⁡H is nilpotent on h, so there is m≥0 with (ad⁡H)mY=0; put N=dim⁡g, so that (ad⁡H−λ)NX=0 for X∈Vλ,H by the definition of Vλ,H and [L3]. The operator identity (ad⁡H−λ)n[Y,X]=∑k=0n(nk)[(ad⁡H)n−kY,(ad⁡H−λ)kX] holds for every n≥0 by induction on n, because ad⁡H is a derivation: the case n=0 is trivial and the induction step applies ad⁡H−λ to both sides and uses Pascal's rule. Taking n=m+N, every summand vanishes, since either n−k≥m, so (ad⁡H)n−kY=0, or k≥N, so (ad⁡H−λ)kX=0. Hence (ad⁡H−λ)m+N[Y,X]=0 and [Y,X]∈Vλ,H. As Y∈h was arbitrary, every Vλ,H is stable under ad⁡h.

2.1L2step 1.2algebra

Fix a basis H1,…,Hr of h; iterating step 1.2 over the pairwise compatible decompositions g=⨁λVλ,Hj refines the direct sum decomposition to g=⨁(λ1,…,λr)(Vλ1,H1∩⋯∩Vλr,Hr), and each summand is stable under ad⁡H for every H∈h. For a tuple (λ1,…,λr) with nonzero summand W let α∈h∗ be the linear functional with α(Hj)=λj. By [L2], the solvable algebra h acts triangularly on W in a suitable basis v1,…,vs; the diagonal entries of such a triangular form are eigenvalues of ad⁡Hj on W for each j, and since W⊆Vλj,Hj the only eigenvalue of ad⁡Hj there is λj, so every diagonal entry equals α. Hence each vi satisfies (ad⁡H−α(H))ivi=0 for all H∈h, and therefore W⊆gα. In particular only finitely many gα are nonzero.

3.1step 1.2step 2.1algebra

Since each gα is a linear subspace by definition and stable under every ad⁡H by step 1.2, and since an element of gα satisfies the generalized eigenvalue condition for each Hj with value α(Hj), we have gα⊆Vα(H1),H1∩⋯∩Vα(Hr),Hr; combined with step 2.1 and the injectivity of the map (λ1,…,λr)↦∑jλjej on the dual basis, this gives gα=Vα(H1),H1∩⋯∩Vα(Hr),Hr and the direct sum decomposition (ii), with only finitely many nonzero terms. This proves (i) and (ii).

4.1step 3.1algebra∎

For X∈gα, Y∈gβ and H∈h, the binomial expansion gives (ad⁡H−(α+β)(H))n[X,Y]=∑k=0n(nk)[(ad⁡H−α(H))kX,(ad⁡H−β(H))n−kY]; choosing n≥2P where P bounds the two vanishing exponents for X and Y, so that for every k either k≥P or n−k≥P, every summand is zero, hence [X,Y]∈gα+β, which is (iv). If g=0 all spaces are zero and every assertion is vacuous.

Depends on

Used by

Dependency tree · two levels

20 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