Alphabeta Math
False statementConstruction: Literature-sourcedVerification: 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.

Every solvable Lie algebra is nilpotent

Statement

Every solvable Lie algebra is nilpotent.

Facts & Assumptions

Given: A field k and the two-dimensional k-vector space a=kx⊕ky with bracket [x,y]=y.

[L1]

Solvability means termination of the derived series (Derived series and solvable Lie algebras).

[L2]

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

Refutation

technique · direct
1.1givenL1algebra

Alternation and bilinearity determine all brackets from [x,y]=y, and Jacobi holds because it is enough to check basis triples, where either two entries coincide or the inner bracket is a scalar multiple of y. Thus a is a Lie algebra. Its derived algebra is a(1)=ky, and a(2)=[ky,ky]=0, so it is solvable by [L1].

2.1L2step 1.1algebra∎

Its lower central series satisfies γ2(a)=[a,a]=ky and, whenever r≥2 and γr=ky, γr+1=[a,ky]=ky because [x,y]=y≠0. Hence every term from γ2 onward is ky, so the series never reaches zero and a is not nilpotent by [L2]. This explicit solvable nonnilpotent witness refutes the statement over every field and uses no choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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