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.

The plane Euclidean-motion Lie algebra is solvable

Example

The Lie algebra of orientation-preserving Euclidean motions of the plane is

e(2)=so(2)⋉R2.

It has derived length two and is not nilpotent.

Facts & Assumptions

Given: A basis R,P,Q in which R is infinitesimal rotation and P,Q are translations.

[L1]

The semidirect-product bracket combines the acting algebra, its action, and the ideal bracket (Semidirect products of Lie algebras).

[L2]

The derived series tests solvability (Derived series and solvable Lie algebras), and its least vanishing index is the derived length (Solvable length of a Lie algebra).

[L3]

The lower central series tests nilpotence (Lower central series and nilpotent Lie algebras).

Verification

technique · direct
1.1givenL1L2algebra

The standard rotation action gives [R,P]=Q, [R,Q]=−P, and [P,Q]=0 via [L1]. Therefore every bracket lies in the translation ideal T=RP⊕RQ, while the first two displayed brackets span T. Hence e(2)(1)=T. Since T is abelian, e(2)(2)=0. The first derived term is nonzero, so [L2] gives derived length exactly two.

2.1L3step 1.1algebra

The same calculation gives γ2(e(2))=T. Moreover [e(2),T]=T, because bracketing R with P,Q again yields Q,−P. Induction gives γr(e(2))=T≠0 for every r≥2, so the algebra is not nilpotent by [L3].

3.1step 1.1step 2.1∎

Thus the abelian translation ideal is responsible for solvability, while the nontrivial rotation action prevents lower-central termination. Both endpoint computations are exact, and the finite explicit example uses no choice.

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