Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passaudited 2026-08-17
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.

False statement: finite nilpotent groups and finite solvable groups are the same

Statement

False claim: finite nilpotent groups and finite solvable groups are the same. See Nilpotent groups, and in particular finite p-groups, are solvable.

Facts & Assumptions

Given: The hypotheses and objects in the false claim.

[L1]

Every nilpotent group is solvable. Consequently every finite p-group is solvable. (Nilpotent groups, and in particular finite p-groups, are solvable).

[L2]

The derived series of a group G is defined recursively by G(0)=G,G(r+1)=[G(r),G(r)]. Each term is characteristic, hence normal, in the preceding term by thm-derived-subgroup-is-characteristic-and-abelianization-is-universal. (The derived series, solvable groups, and derived length).

[L3]

Let nN, so that n={0,1,,n1} (def-natural-numbers). The symmetric group on n letters is Sn:=Sym(n)=Sym({0,1,,n1}), the group of all bijections of n under composition (def-symmetric-group), with the composition convention. (The finite symmetric group Sn, one-line notation, and cycle notation).

[L4]

For a finite group G, the following are equivalent: G is nilpotent; every Sylow subgroup is normal; G is the internal direct product of its Sylow subgroups; and every maximal subgroup of G is normal. (Sylow and maximal-subgroup characterizations of finite nilpotence).

Refutation

technique · direct
1.1

One inclusion does hold: [L1] states that every nilpotent group is solvable, so every finite nilpotent group is solvable and only the converse can fail. Refuting the claim therefore requires a finite solvable group that is not nilpotent.

L1given
2.1

For the converse, take S3 of [L3] and compute its derived series of [L2]: S3=A3 and A3=1, so S3 is solvable. Its three Sylow 2-subgroups are the subgroups generated by the transpositions, which are not normal, so the maximal-subgroup and Sylow clauses of [L4] deny that S3 is nilpotent. A finite solvable group that is not nilpotent refutes the claim. This proves the stated claim.

step 1.1L2L3L4givenalgebra

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 78 results over 15 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources