Alphabeta Math
TheoremStatement: 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.

Engel's theorem

Statement

A finite-dimensional Lie algebra g over any field is nilpotent if and only if adx is a nilpotent endomorphism of g for every xg.

Facts & Assumptions

Given: A finite-dimensional Lie algebra g.

[L1]

Nilpotence is termination of the lower central series (Lower central series and nilpotent Lie algebras).

[L2]

A nil finite-dimensional representation has a flag lowered by every represented operator (Engel triangularization theorem).

[L3]

Inner derivations form the adjoint representation, with adx(y)=[x,y] (Derivations form a Lie algebra and inner derivations an ideal).

Proof

technique · direct
1.1

Suppose γc+1(g)=0. For x,yg, the vector (adx)c(y) is a left-nested bracket with c copies of x, hence lies in γc+1=0 by [L1] and [L3]. Thus every adx is nilpotent. This also covers g=0.

givenL1L3algebra
2.1

Conversely suppose every adx is nilpotent. The adjoint representation in [L3] is nil, so [L2] gives 0=V0V1Vn=g with [g,Vi]Vi1. Induction then gives γr+1(g)Vnr for 0rn, and in particular γn+1V0=0. Hence g is nilpotent by [L1].

givenL1L2L3algebra

Depends on

Used by

Dependency tree · two levels

9 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