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

Lower and upper central series characterize nilpotence

Statement

A Lie algebra g is nilpotent if and only if its upper central series reaches g: equivalently, for some c≥0,

γc+1(g)=0⟺Zc(g)=g.

Facts & Assumptions

Given: A Lie algebra g and an integer c≥0.

[L1]

The lower central series satisfies γ1=g and γr+1=[g,γr] (Lower central series and nilpotent Lie algebras).

[L2]

The upper central series satisfies Z0=0 and x∈Zr+1 exactly when [g,x]⊆Zr (Upper central series of a Lie algebra).

[L3]

The quotient-center formulation of Zr+1/Zr uses the quotient Lie bracket (Quotient Lie algebras).

Proof

technique · direct
1.1givenL1L2L3algebra

Assume γc+1=0. We prove γc+1−r⊆Zr for 0≤r≤c. At r=0 this is the assumed containment in Z0=0. If it holds at r, then x∈γc−r implies [g,x]⊆γc+1−r⊆Zr, so [L2] gives x∈Zr+1. At r=c we obtain g=γ1⊆Zc, hence equality.

2.1givenL1L2step 1.1∎

Conversely assume Zc=g. Starting from γ1=g=Zc, induction gives γr+1⊆Zc−r for 0≤r≤c: if γr+1⊆Zc−r, then [L1] and [L2] give γr+2=[g,γr+1]⊆Zc−r−1. At r=c this yields γc+1⊆Z0=0, so g is nilpotent. The argument also covers c=0, when both conditions say g=0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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