Alphabeta Math
CorollaryStatement: 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 adjoint action yields a central series

Statement

If every ad⁡x is nilpotent on a finite-dimensional Lie algebra g, then there is a finite filtration

g=A0⊃A1⊃⋯⊃Am=0

such that [g,Ai]⊆Ai+1 for every i<m. Consequently the upper central series reaches g.

Facts & Assumptions

Given: A finite-dimensional Lie algebra g for which every ad⁡x is nilpotent.

[L1]

Engel triangularization gives a flag lowered by a nil representation (Engel triangularization theorem).

[L2]

Engel's theorem identifies the hypothesis with nilpotence of g (Engel's theorem).

[L3]

The upper central series has Z0=0, and [g,B]⊆Zr implies B⊆Zr+1 (Upper central series of a Lie algebra).

Proof

technique · direct
1.1givenL1L2algebra

Apply [L1] to the adjoint representation. If 0=V0⊂⋯⊂Vm=g is its lowered flag, put Ai=Vm−i. Then A0=g, Am=0, and [g,Ai]⊆Ai+1. In particular [L2] also confirms that g is nilpotent.

2.1L3step 1.1algebra∎

We prove Am−r⊆Zr for 0≤r≤m. At r=0 this is Am=0=Z0. If it holds at r, then [g,Am−r−1]⊆Am−r⊆Zr, so [L3] gives Am−r−1⊆Zr+1. At r=m this yields g=A0⊆Zm, hence equality. For g=0, take m=0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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