Alphabeta Math
TheoremStatement: AI-adaptedProof: Literature-sourcedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-sonnet-5)audited 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.

Philip Hall: in a finite solvable group the Fitting subgroup contains its own centralizer

Statement

Let G be a finite solvable group. Then CG(F(G))F(G).

Facts & Assumptions

Given: A finite solvable group G. Write F:=F(G) and C:=CG(F).

[L1]

For a finite group G the Fitting subgroup is F(G)=pGOp(G); and if A,BG, then AB is a subgroup, is normal, and satisfies AB=BA (The Fitting subgroup F(G)=pOp(G) of a finite group).

[L2]

For every finite group G, F(G) is nilpotent and normal, and every normal nilpotent subgroup of G is contained in F(G) (The Fitting subgroup is nilpotent and is the largest normal nilpotent subgroup of a finite group).

[L3]

CG(H)={gG:gh=hg for every hH}, a subgroup of G (The centralizer CG(H) of a subgroup).

[L4]

If NG, then CG(N)G (The centralizer of a normal subgroup is normal).

[L5]

Every subgroup and every quotient of a solvable group is solvable; no finiteness hypothesis is required (Subgroups and quotients of solvable groups are solvable).

[L6]

For NG, the maps HH/N and Kπ1(K) are inverse inclusion-preserving bijections between the subgroups H with NHG and the subgroups KG/N; they preserve normality (Correspondence theorem: subgroups of G/N correspond to subgroups of G containing N, with normality preserved).

[L7]

Let Q be a solvable group and let NQ with N1. Then N contains a subgroup A1 that is abelian and normal in Q (A nontrivial normal subgroup of a solvable group contains a nontrivial abelian subgroup normal in the whole group).

[L8]

Let A,B,CG with AC. If AB is a subgroup of G, then A(BC)=ABC (Dedekind's modular law for subgroup products).

[L9]

Let NG. Then G/N is abelian if and only if [G,G]N (G/N is abelian if and only if [G,G]N).

[L10]

Let G be a group and let N be a nonempty family of normal subgroups of G. Then NNN is a normal subgroup of G (The intersection of a nonempty family of normal subgroups is normal).

[L11]

A group G is nilpotent if Zc(G)=G for some cN, where (Zr(G)) is its upper central series (Nilpotent groups and nilpotency class).

[L12]

The upper central series begins with Z0(G)=1 and satisfies Zr+1(G)/Zr(G)=Z(G/Zr(G)); in particular Z1(G)=Z(G) (The upper central series).

[L13]

Z(G)={zG:zg=gz for every gG} (The center Z(G) of a group).

[L14]

For every group G, the center Z(G) is a normal subgroup of G (The center of a group is a normal subgroup).

Proof

technique · contradiction
1.1

By [L2], FG and every normal nilpotent subgroup of G is contained in F.

L2given
1.2

Assume towards a contradiction that C≰F.

assume-contragiven
2.1

F is normal in G, so C=CG(F)G by [L4].

L4step 1.1
3.1

C and F are both normal in G, so by [L1] the product CF is a subgroup of G, is normal in G, and satisfies CF=FC. Since the identity lies in C, also FCF.

L1step 1.1step 2.1
4.1

G is solvable, so its quotient G/F is solvable by [L5]; and CFG with FCF, so CF/FG/F by [L6]. By step 1.2 some cC lies outside F, so cFF and CF/F1.

L5L6givenstep 1.2step 3.1
5.1

Apply [L7] to the solvable group G/F and its nontrivial normal subgroup CF/F: there is a subgroup Aˉ1 of CF/F that is abelian and normal in G/F. Let A be its preimage under GG/F. By [L6], FACF, AG, and A/F=Aˉ is nontrivial and abelian.

L6L7step 4.1
6.1

FA and A/F is abelian, so [A,A]F by [L9].

L9step 5.1
6.2

Put D:=CA. Both C and A are normal in G, so DG by [L10].

L10step 2.1step 5.1
7.1

Apply [L8] with its A:=F, its B:=C and its C:=A. Its hypotheses hold: FA by step 5.1, and FC=CF is a subgroup by step 3.1. Hence F(CA)=FCA, and ACF=FC makes the right-hand side equal to A. Therefore A=FD.

L8step 3.1step 5.1step 6.2
7.2

DA, so [D,D][A,A]F by step 6.1. Also DC=CG(F), so by [L3] every element of D commutes with every element of F, in particular with every element of [D,D]. Since [D,D]D, this says [D,D]Z(D) by [L13].

L3L13step 6.1step 6.2
8.1

Z(D)D by [L14], and [D,D]Z(D), so D/Z(D) is abelian by [L9].

L9L14step 7.2
9.1

By [L12], Z1(D)=Z(D) and Z2(D)/Z1(D)=Z ⁣(D/Z1(D)). Step 8.1 makes D/Z1(D) abelian, and the center of an abelian group is the whole group by [L13], so Z2(D)/Z1(D)=D/Z1(D) and hence Z2(D)=D. By [L11], D is nilpotent.

L11L12L13step 8.1
10.1

D is a normal nilpotent subgroup of G by steps 6.2 and 9.1, so DF by step 1.1.

step 1.1step 6.2step 9.1
11.1

Substituting into step 7.1 gives A=FDF, so A/F is trivial, contradicting step 5.1. The assumption of step 1.2 is therefore untenable, and CG(F(G))F(G). This proves the stated claim.

discharge-contradiction: step 1.2step 5.1step 7.1step 10.1

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: 88 results over 21 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