Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 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.

Subgroups, quotients, and finite direct products of nilpotent groups are nilpotent

Statement

Every subgroup and every quotient of a nilpotent group is nilpotent. Every finite direct product of nilpotent groups is nilpotent; the class of a subgroup or quotient is at most the class of the original group, and the class of a nonempty finite product is at most the maximum of the factor classes. The empty product is the trivial group of class zero.

Facts & Assumptions

Given: A nilpotent group G, a subgroup H≤G, a normal subgroup N⊴G, and nilpotent groups G1,…,Gt.

[F1]

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

[L1]

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

Proof

technique · direct
1.1F1algebra

Induction on r gives γr(H)≤γr(G): it is clear at r=1, and subgroup commutators preserve an inclusion at the next term.

1.2F1algebra

For the quotient map q:G→G/N, induction on r gives q(γr(G))=γr(G/N), because q is surjective and sends commutators onto commutators.

1.3F1L2algebra

Coordinatewise commutators from [L2] give γr(K×L)=γr(K)×γr(L) for every r, by induction.

2.1step 1.1step 1.2F1L1

If G has class e≤c, then [L1] gives γe+1(G)=1, and [F1] keeps every later lower-central term trivial, so γc+1(G)=1. Steps 1.1 and 1.2 make γc+1(H) and γc+1(G/N) trivial; [L1] then makes both nilpotent of class at most c.

2.2step 1.3L1choose

For a nonempty finite product, choose the maximum c of the finitely many factor classes. Repeated use of step 1.3 makes its (c+1)-st lower-central term trivial, so [L1] gives class at most c; the empty product is the trivial group of class zero.

3.1step 2.1step 2.2∎

These arguments establish all three closure assertions and their stated class bounds.

Depends on

Dependency tree · 2 levels

Sources