Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedverified 2026-09-24 (gpt-6-sol)
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 generalized Fitting subgroup contains its centralizer

Statement

For a finite group G, CG(F∗(G))≤F∗(G).

Facts & Assumptions

Given: A finite group G. Write F=F(G), E=E(G), H=F∗(G)=FE, and C=CG(H).

[L1]

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

[L2]

A component is a subnormal quasisimple subgroup, and E(G) is generated by all components. Quasisimple means perfect with a simple central quotient (Quasisimple groups, components, and the layer). Conjugation permutes components, so E(G), and hence H=FE, is normal in G.

[L3]

A minimal normal subgroup of a finite group is characteristically simple (Minimal normal subgroups of finite groups are characteristically simple), and a nontrivial finite characteristically simple group is an internal direct product of isomorphic simple groups (Finite characteristically simple groups are direct products of isomorphic simple groups).

[L4]

A characteristic subgroup of a normal subgroup is normal (If K is characteristic in N and N is normal in G, then K is normal in G), and the centralizer of a normal subgroup is normal (The centralizer of a normal subgroup is normal).

Proof

technique · induction on $|G|$
1.1base

The result is immediate for G=1, since F∗(1)=1.

1.2IHL2L4

Assume the result for all finite groups of order smaller than ∣G∣. By [L2], H⊴G, so C⊴G by [L4].

2.1L1L2L4step 1.2algebra

The subgroup F(C) is characteristic in C: an automorphism of C permutes its p-cores. Thus F(C)⊴G because C⊴G; it is nilpotent by [L1], so F(C)≤F(G). Every component of C is subnormal in G, by appending C⊴G to its subnormal chain in C. Hence E(C)≤E(G) and F∗(C)=F(C)E(C)≤H∩C.

3.1givenstep 2.1

Every element of C centralizes every element of H. Consequently H∩C≤Z(C) and F∗(C)≤Z(C).

4.1step 1.2step 2.1step 3.1

If C<G, step 1.2 applied to C gives CC(F∗(C))≤F∗(C). But step 3.1 makes the left side equal to C. Therefore C≤F∗(C)≤H, as required.

4.2givenL2step 3.1choose

It remains to consider C=G. Then H≤Z(G), in particular F≤Z(G) and E≤Z(G). Suppose G/F≠1. Choose a minimal nontrivial normal subgroup A of the finite group G/F, and let N be its inverse image in G. Such an A exists by choosing a subgroup of least positive order among the nontrivial normal subgroups of G/F. Thus F<N⊴G and N/F=A.

5.1L1step 4.2

If A is abelian, then [N,N]≤F≤Z(G). Hence the lower central series of N ends after at most two commutator steps, so N is nilpotent. As N⊴G, [L1] gives N≤F, contradicting F<N.

5.2L2L3step 4.2algebra

If A is nonabelian, [L3] writes it as a direct product of isomorphic nonabelian simple groups. Choose a simple direct factor T⊴A, and let NT be its inverse image under N→N/F=A. Then NT⊴N⊴G, F≤Z(G), and NT/F≅T. Put K=[NT,NT]. The image of K in T is [T,T]=T, since a nonabelian simple group is perfect. Thus NT=KF. Because F is central, K=[NT,NT]=[KF,KF]=[K,K], so K is perfect. Also K/(K∩F)≅T. Since K∩F is central in K and T has trivial center, Z(K)=K∩F; hence K/Z(K)≅T is simple. Finally K⊴NT⊴N⊴G, so K is a component of G.

6.1step 4.2step 5.1step 5.2

Step 5.2 gives K≤E≤H≤Z(G), whereas K/Z(K)≅T is nonabelian. This contradiction rules out the nonabelian case. Together with step 5.1, it follows that G/F=1. Hence C=G=F≤H.

7.1discharge-inductionstep 4.1step 6.1∎

Steps 4.1 and 6.1 cover both possibilities for C, proving CG(F∗(G))≤F∗(G) for all finite G.

Depends on

Used by

Dependency tree · two levels

24 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