Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedprecheck passaudited 2026-08-02
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 commutator subgroup is normal

Statement

For every group G, its commutator subgroup [G,G] is normal in G.

Facts & Assumptions

Given: A group G, its commutator subgroup D=[G,G], and an element x∈G.

[F1]

The subgroup D is generated by all elements [g,h]=ghg−1h−1 with g,h∈G (Commutators [g,h]=ghg−1h−1 and the commutator subgroup [G,G]).

[L1]

The subgroup generated by a set is contained in every subgroup that contains that set (The subgroup ⟨S⟩ generated by a subset, the cyclic subgroup ⟨g⟩, and cyclic groups).

[F2]

Conjugating a subgroup by a fixed group element produces a subgroup (Subgroup).

[L2]

A subgroup D≤G is normal if xDx−1⊆D for every x∈G (Equivalent characterisations of a normal subgroup by conjugates and left and right cosets).

Proof

technique · direct
1.1

Direct multiplication gives x[g,h]x−1=[xgx−1,xhx−1] for all g,h∈G.

F1algebra
1.2

The conjugate x−1Dx={x−1dx:d∈D} is a subgroup of G.

F2algebra
2.1

For every commutator c=[g,h], step 1.1 gives xcx−1∈D, so c∈x−1Dx. Thus the subgroup x−1Dx contains every generator of D, and [L1] gives D⊆x−1Dx.

step 1.1step 1.2F1L1
3.1

Conjugating the containment in step 2.1 by x gives xDx−1⊆D. Since x was arbitrary, [L2] gives D⊴G.

step 2.1L2algebra∎

Depends on

Used by

Dependency tree · two levels

11 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