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.

Series of a standard filiform Lie algebra

Example

Let n3. On the vector space with basis e1,,en, prescribe

[e1,ei]=ei+1(2i<n)

and let every other bracket of basis vectors be zero, apart from the values forced by skew-symmetry. This defines a Lie algebra fn. Its lower central series is

γr(fn)=span(er+1,,en)(2rn1),

so fn has nilpotency class n1. Its derived length is two.

Facts & Assumptions

Given: A field k, an integer n3, and the displayed alternating bilinear bracket on the k-space with basis e1,,en.

[L1]

The derived series and solvability convention are those of Derived series and solvable Lie algebras.

[L2]

The lower central series is defined recursively by γr+1=[fn,γr] (Lower central series and nilpotent Lie algebras).

[L3]

Nilpotency class is the least c for which γc+1=0 (Nilpotency class of a Lie algebra).

Verification

technique · direct
1.1

Put U=span(e2,,en). Then [U,U]=0 and [e1,U]U. For a Jacobi triple entirely in U every term is zero. For a triple containing exactly one copy of e1, each possibly nonzero inner bracket lies in U and is then bracketed with an element of U, so every term is zero. If a triple contains at least two copies of e1, the two possibly nonzero terms cancel by bilinearity and the alternating law. Thus Jacobi holds, including in characteristic two, and the displayed rule defines a Lie algebra.

givenalgebra
2.1

Every nonzero basis bracket is one of e3,,en, and all of these occur. Hence fn(1)=span(e3,,en). This subspace lies in the abelian space U, so fn(2)=0. Since e30 for n3, the least vanishing derived index is two by [L1].

L1step 1.1algebra
2.2

The first bracket span gives γ2=span(e3,,en). If 2rn2 and γr=span(er+1,,en), then only bracketing with e1 contributes, and the displayed rule gives γr+1=span(er+2,,en). Induction proves the promised formula through γn1=ken0; finally [fn,ken]=0, so γn=0. By [L2] and [L3], the class is exactly n1.

L2L3step 1.1induction
3.1

When n=3, the calculation reads γ2=ke30 and γ3=0, so the smallest permitted dimension has class two and derived length two. For every n3, steps 2.1 and 2.2 establish both exact endpoints using only the displayed finite basis; no choice principle is used.

step 2.1step 2.2

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

5 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