Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-13
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.

A central extension of a class-c nilpotent group is nilpotent of class at most c+1

Statement

Let N⊴G with N≤Z(G). If G/N is nilpotent of class at most c, then G is nilpotent of class at most c+1.

Facts & Assumptions

Given: A central normal subgroup N⊴G and an integer c≥0 such that G/N has class at most c.

[F1]

γ1(H)=H and γr+1(H)=[H,γr(H)] (Subgroup commutators and the lower central series).

[L1]

For every group H and natural number d, the conditions that H has a central series of length d, that Zd(H)=H, and that γd+1(H)=1 are equivalent; the least such d is the nilpotency class (Nilpotence via central series, the upper central series, and the lower central series).

Proof

technique · direct
1.1

For the quotient map q:G→G/N, induction from [F1] gives q(γr(G))=γr(G/N) for every r, because q is surjective and sends commutators onto commutators.

F1algebra
2.1

If G/N has class e≤c, then [L1] gives γe+1(G/N)=1, and [F1] keeps all later lower-central terms trivial; hence γc+1(G/N)=1. Step 1.1 therefore gives γc+1(G)≤N.

givenstep 1.1F1L1
3.1

Centrality of N gives [G,N]=1, so γc+2(G)=[G,γc+1(G)]≤[G,N]=1.

step 2.1F1algebra
4.1

By [L1], G is nilpotent of class at most c+1. The case c=0 is included: then G/N=1, so G=N≤Z(G) and G has class at most one.

step 3.1L1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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