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

Upper triangular matrices are solvable but not nilpotent

Example

For every n≥2, the Lie algebra bn(k) of upper triangular n×n matrices is solvable but not nilpotent.

Facts & Assumptions

Given: A field k, an integer n≥2, and the standard matrix units.

[L1]

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

[L2]

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

Verification

technique · direct
1.1givenL1algebra

The diagonal entry of a commutator of two upper triangular matrices is zero, so bn(1) lies in the strictly upper triangular subspace F1. More generally, if Fp is spanned by Eij with j−i≥p, matrix-unit multiplication gives [Fp,Fq]⊆Fp+q and Fn=0. Induction yields bn(r)⊆F2r−1 for r≥1, so a derived term vanishes once 2r−1≥n. Thus bn is solvable by [L1].

1.2givenL2algebra

Let H=E11 and X=E12. Then [H,X]=X, so X∈γ2(bn). If X∈γr, the same bracket puts X in [bn,γr]=γr+1. Hence X belongs to every γr for r≥2, and none of these terms is zero. Therefore bn is not nilpotent by [L2].

2.1step 1.1step 1.2∎

Steps 1.1 and 1.2 prove the two promised properties over every field. The restriction n≥2 is sharp for this conclusion: b1=kE11 is one-dimensional abelian and therefore nilpotent. All witnesses are explicit and no choice is used.

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