Alphabeta Math
LemmaStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedaudited 2026-09-24
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 nonabelian supersolvable group has a noncentral normal abelian subgroup

Statement

Every nonabelian finite supersolvable group has an abelian normal subgroup that is not central.

Facts & Assumptions

[F1]

A finite supersolvable group has a normal series with prime-order factors (Supersolvable groups and monomial characters).

[F3]

Every term of a normal series is normal in the whole group (Subnormal and normal series, factors, refinements, and equivalence).

Proof

Given: 1=G0◃⋯◃Gr=G is a supersolvable series.

1.1F1F2given

Let i be maximal with Gi abelian; such an i exists since G0=1. If i=r, then G is abelian, contrary to the hypothesis, so i<r. Suppose Gi≤Z(G). By [F1] and [F2], Gi+1/Gi is cyclic of prime order; choose x∈Gi+1 whose coset generates it. Then every element of Gi+1 has the form axk with a∈Gi. All such elements commute because Gi≤Z(G) and powers of x commute, so Gi+1 is abelian, contradicting maximality of i. Thus Gi≰Z(G), and there are a∈Gi and g∈G with ag≠ga.

2.1F3step 1.1∎

By [F3], Gi⊴G. It is abelian by construction and not central by step 1.1, so it is the required abelian normal subgroup.

Depends on

Used by

Dependency tree · two levels

20 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