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

Nilpotent Lie algebras are solvable

Statement

For every Lie algebra g and every r≥0,

g(r)⊆γ2r(g).

Consequently every nilpotent Lie algebra is solvable.

Facts & Assumptions

Given: A Lie algebra g.

[L1]

The derived series satisfies g(r+1)=[g(r),g(r)] (Derived series and solvable Lie algebras).

[L2]

The lower central series satisfies γq+1=[g,γq], and nilpotence means that a lower term vanishes (Lower central series and nilpotent Lie algebras).

Proof

technique · direct
1.1L2algebra

We first prove [γp,γq]⊆γp+q for all p,q≥1. For p=1 this is [L2]. If it holds for p−1 and every second index, Jacobi gives [[g,γp−1],γq]⊆[g,[γp−1,γq]]+[γp−1,[g,γq]]⊆[g,γp+q−1]+[γp−1,γq+1]⊆γp+q.

2.1L1L2step 1.1algebra

At r=0, g(0)=g=γ1. If g(r)⊆γ2r, then [L1] and step 1.1 imply g(r+1)⊆[γ2r,γ2r]⊆γ2r+1. Thus the displayed containment holds for every r.

3.1L1L2step 2.1∎

If g is nilpotent, choose a given bound c with γc+1=0 as in [L2]. Taking r=c+1 gives 2r≥c+1, so descent of the lower series and step 2.1 yield g(r)⊆γ2r⊆γc+1=0. Hence g is solvable by [L1]. This includes g=0 and uses only the supplied finite bound.

Depends on

Dependency tree · 2 levels

Sources