Alphabeta Math
Pipeline-generated
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.

✓ 4 results · all verified · 4 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs; all 4 also cleared it.

The Finite Simple Group Classification Landscape

1 · Prerequisites

2 · Summary

This page develops the local finite-group theory of components, the layer and the generalized Fitting subgroup F∗(G). It proves that distinct components commute and that F∗(G) contains its centralizer, with the normal-subgroup arguments needed for those conclusions. Composition factors and elementary cyclic and alternating simple groups provide context. The examples C4 and C2×C2 show why a list of composition factors does not determine a finite group.

3 · Logical flowchart

4 · Definitions, theorems and proofs

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Simple groups as composition factors

Jordan–Hölder makes composition factors invariant but does not reconstruct extension data.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Quasisimple groups, components, and the layer

Definition

Quasisimple means perfect with simple central quotient; components are subnormal quasisimple subgroups and E(G) is generated by them.

LemmaStatement: AI-generatedProof: AI-generatedverified 2026-09-24 (gpt-6-sol)Open item page →

Quasisimple normal intersections and perfect central actions

Statement

If Q is quasisimple and M⊴Q is proper, then M≤Z(Q). If P is perfect, T normalizes P, and every commutator tpt−1p−1 with t∈T and p∈P lies in Z(P), then T centralizes P.

Facts & Assumptions

Given: Groups Q,P, subgroups M⊴Q and T as in the statement. A group is perfect when it equals its commutator subgroup.

[F1]

Quasisimple means Q=[Q,Q] and Q/Z(Q) is simple. (Quasisimple groups, components, and the layer)

[F2]

A simple group has only the trivial and whole normal subgroups. (Simple groups)

[F3]

The center Z(Q) commutes with every element of Q, and [x,y]=xyx−1y−1. (The center Z(G) of a group, Commutators [g,h]=ghg−1h−1 and the commutator subgroup [G,G])

Proof

1.1F1F2F3algebra

The image MZ(Q)/Z(Q) is normal in the simple group Q/Z(Q), so it is trivial or the whole quotient. In the trivial case M≤Z(Q). In the whole case Q=MZ(Q), and the quotient Q/M is generated by the image of the abelian group Z(Q); hence Q/M is abelian. But a quotient of the perfect group Q=[Q,Q] is perfect, and an abelian perfect group is trivial. Thus M=Q, contrary to properness. Only the first case remains.

2.1F3givenalgebra∎

Fix t∈T. Since t normalizes P, the formula ct(p)=tpt−1p−1 defines a function P→Z(P) by hypothesis. Its values are central, so t(pq)t−1=ct(p)p ct(q)q=ct(p)ct(q)pq and therefore ct(pq)=ct(p)ct(q). Thus ct is a homomorphism to the abelian group Z(P). It kills every commutator of P, and P=[P,P], so ct is trivial. Every t consequently commutes with every p, as claimed. The argument also covers a trivial center or a trivial T.

LemmaStatement: AI-generatedProof: AI-generatedverified 2026-09-24 (gpt-6-sol)Open item page →

A normal quasisimple subgroup and a subnormal subgroup

Statement

Let Q⊴G be quasisimple and let S be a subnormal subgroup of G. Then either Q≤S or [Q,S]=1.

Facts & Assumptions

Given: Q,S,G as in the statement.

[F1]

A subnormal subgroup has a finite chain S=S0⊴S1⊴⋯⊴Sd=G. (Subnormal and normal series, factors, refinements, and equivalence)

[F2]

If a normal subgroup of a quasisimple group is proper, it lies in the center. A perfect group is centralized by a subgroup whose conjugation commutators all lie in that center. (Quasisimple normal intersections and perfect central actions)

Proof

1.1F1given

Choose a subnormal chain from F1. If Q≤S0=S, the first alternative holds. Otherwise, because Q≤Sd=G, there is an index j<d such that Q≤Sj+1 but Q≰Sj. We only select an index from the given finite chain.

2.1F2step 1.1algebra∎

Both Q and Sj are normal in Sj+1, since Q⊴G and Sj⊴Sj+1. Thus Q∩Sj is a proper normal subgroup of Q, and F2 puts it in Z(Q). For q∈Q and s∈Sj, their commutator lies in both Q and Sj, hence in Z(Q). Since Sj normalizes the perfect group Q, the second clause of F2 gives [Q,Sj]=1. As S≤Sj, it follows that [Q,S]=1. No finiteness of G beyond the finite subnormal chain is needed.

LemmaStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-24 (gpt-6-sol)Open item page →

Distinct components commute

Statement

Distinct components of a finite group commute.

Facts & Assumptions

Given: Let K and L be distinct components of G.

[F1]

A component is a subnormal quasisimple subgroup. Quasisimple means perfect with simple central quotient. (Quasisimple groups, components, and the layer)

[F2]

In a quasisimple group every proper normal subgroup is central. A perfect group's central conjugation action is trivial. (Quasisimple normal intersections and perfect central actions)

[F3]

If Q⊴G is quasisimple and S is subnormal in G, then Q≤S or [Q,S]=1. (A normal quasisimple subgroup and a subnormal subgroup)

[F4]

Subnormality is witnessed by a finite chain of normal inclusions. (Subnormal and normal series, factors, refinements, and equivalence)

Proof

technique · simultaneous strong induction on $|G|$
1.1F1F4induction

We prove two assertions simultaneously for each finite group G: (A) if Q is a component and N⊴G, then either Q≤N or [Q,N]=1; (B) distinct components commute. Assume both assertions have been proved for every group of order smaller than ∣G∣. Each induction call below takes place in a proper normal subgroup H<G, so its order is strictly smaller. A subnormal chain for a component in H remains a valid chain there, and conjugation by an element of G preserves the chain inside H because H⊴G.

1.2F1F2given

First prove (A). If Q≤N there is nothing to show. Suppose Q≰N. If Q⊴G, then Q∩N is a proper normal subgroup of Q, so F2 gives Q∩N≤Z(Q). Since both Q and N are normal in G, their commutator lies in Q∩N. The central-action clause of F2, applied to the perfect group Q, gives [Q,N]=1.

2.1F1F4step 1.1induction

Suppose instead that Q is not normal in G. A subnormal chain from Q to G then has a proper term H⊴G containing Q; take its penultimate term after deleting repeated terms. Put M=N∩H⊴H. The subgroup Q is a component of H and is not contained in M. By the induction hypothesis (A) for H, [Q,M]=1.

3.1F1step 1.1step 2.1inductionalgebra

For n∈N, conjugation sends Q to another component Qn=nQn−1 of H. Indeed H⊴G keeps the conjugated subnormal chain inside H. For each q∈Q write nqn−1=cqq, where cq=nqn−1q−1∈N∩H=M; the two normalities give this inclusion. By step 2.1, cq centralizes Q. The induction hypothesis (B) for H says that either Qn=Q or Qn centralizes Q. In the latter case, for every q,x∈Q the equality [cqq,x]=[q,x] would force [q,x]=1. This would make the perfect quasisimple group Q abelian, hence trivial, contrary to its nontrivial simple central quotient. Thus Qn=Q for every n∈N.

4.1F2step 3.1

It follows that N normalizes Q and [N,Q]≤N∩Q. This is a proper normal subgroup of Q, so F2 puts it in Z(Q). The perfect central-action clause of F2 now yields [N,Q]=1. This proves (A) for G without invoking (B) for G itself.

5.1F1F2F3step 4.1

Now prove (B), after assertion (A) has been established for this G. If K⊴G, apply F3 to K and the subnormal subgroup L. It gives [K,L]=1 unless K≤L. In that exceptional case K⊴L; because K≠L, F2 gives K≤Z(L). But K is nontrivial and perfect, so it cannot be abelian or lie in a center. The exceptional case is impossible.

6.1F1F4step 1.1step 4.1induction∎

If K is not normal in G, take a proper normal subgroup H⊴G containing K from its subnormal chain. Apply assertion (A), already proved for this same G in steps 1.2–4.1, to L and H. If L≰H, it centralizes H and hence K. If L≤H, both K and L are distinct components of the smaller group H, so the induction hypothesis (B) for H gives [K,L]=1. Thus (B) holds for G in every case, completing the strong induction and the stated result.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The generalized Fitting subgroup

Definition

For finite G, F*(G)=F(G)E(G).

TheoremStatement: Literature-sourcedProof: AI-generatedverified 2026-09-24 (gpt-6-sol)Open item page →

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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

p-local subgroup

Definition

A p-local subgroup is N_G(P) for a nontrivial p-subgroup P of G.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Cyclic and alternating simple families

The elementary finite-simple entries are cyclic groups of prime order and A_n for n≥5.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Finite simple groups of Lie type as named families

Use the source table’s classical, exceptional, twisted, and Suzuki–Ree names without developing Lie algebras.

RemarkRemark: Literature-sourcedProof: Not applicableaudited 2026-09-06Open item page →

Low-rank coincidences and duplicate names

Low-rank isomorphisms and exceptional parameter values are governed by the source table.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

History of the first-generation classification

The first-generation classification was a multi-decade programme distributed across the literature.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The quasithin gap and its repair

The original programme required the Aschbacher–Smith quasithin classification to close a documented gap.

RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Status of the second-generation proof

At the task's 2026-08-14 design check, the GLS revision remained ongoing. The 2025 Oberwolfach report, organized in part by GLS collaborator Inna Capdeboscq, describes the GLS project as ongoing and nearing completion. The current AMS catalog meanwhile lists Number 10 as the tenth volume in a series whose aim is to provide a complete proof, and says that this volume completes only the bicharacteristic-type identification begun in Number 9.

RemarkRemark: Literature-sourcedProof: Not applicableverified 2026-09-24 (gpt-6-sol)Open item page →

What the library proves and does not prove about CFSG

The library proves elementary family results and gives a local proof of The generalized Fitting subgroup contains its centralizer. It does not prove the classification of finite simple groups, recognition and order formulae for all its families, their character tables, or the constructions of all sporadic groups.

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

CFSG says every finite group is simple

Statement

The classification of finite simple groups says that every finite group is simple.

Facts & Assumptions

Given: Take the cyclic group C4.

Refutation

technique · direct
1.1givenalgebra

Its subgroup of order two is nontrivial and proper, so C4 is not simple.

2.1step 1.1contradiction∎

Thus a finite group need not be simple; CFSG classifies the finite groups that are simple and does not assert otherwise.

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Composition factors determine the finite group

Statement

Two finite groups with the same multiset of composition factors are isomorphic.

Facts & Assumptions

Given: Compare C4 and C2×C2.

Refutation

technique · direct
1.1givenalgebra

Each has a composition series with two factors isomorphic to C2. However, C4 contains an element of order four and C2×C2 does not.

2.1step 1.1contradiction∎

The groups are therefore nonisomorphic despite having the same multiset of composition factors.

False statementConstruction: Literature-sourcedVerification: AI-generatedOpen item page →

All finite simple groups are alternating or cyclic

Statement

Every finite simple group is cyclic or alternating.

Facts & Assumptions

Given: The explicitly constructed finite group G=PSL⁡(2,7) of PSL(2,7) is a nonabelian simple group of order 168.

[L1]

G is simple, nonabelian, and has order 168, by the elementary local proof in PSL(2,7) is a nonabelian simple group of order 168.

[L2]

For n≥2, ∣An∣=n!/2, and A0,A1 are trivial (An is normal in Sn; for n≥2, 2 ∣An∣=n!, while An=Sn for n=0,1).

Refutation

technique · direct
1.1L1L2algebra

By L1, G is finite simple and is not cyclic, since every cyclic group is abelian: powers of one generator commute. By L2 the orders of An for 0≤n≤5 are 1,1,1,3,12,60. For n≥6 they are at least 6!/2=360, since each further factorial factor is positive and at least one. None equals 168, so G is not isomorphic to any alternating group.

2.1step 1.1contradiction∎

Thus G is a finite simple group that is neither cyclic nor alternating, refuting the statement with a fully local construction and simplicity proof.

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

The second-generation CFSG proof is complete as of 2026

Statement

The second-generation proof of the classification of finite simple groups is complete as of 2026.

Facts & Assumptions

Given: Use the official AMS Number 10 record cited above, as checked on 2026-08-14.

[L1]

The 2025 Oberwolfach report, organized in part by GLS collaborator Inna Capdeboscq, describes the GLS project as ongoing and nearing completion.

[L2]

The current AMS catalog describes Number 10 as the tenth volume in a series whose aim is to provide a complete proof and says that Number 10 completes only the bicharacteristic-type identification begun in Number 9.

Refutation

technique · direct
1.1L1L2given

The Oberwolfach report explicitly records an ongoing project, and the current AMS catalog records only the more limited completion accomplished by Number 10.

2.1step 1.1contradiction∎

Thus the cited status evidence supports an ongoing programme, contradicting the claimed completion as of the design check.

False statementConstruction: Literature-sourcedVerification: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06Open item page →

Lie type is developed here through Lie algebras

Statement

This page develops the finite simple groups of Lie type through their Lie-algebra structure.

Facts & Assumptions

Given: Inspect the named-family carrier Finite simple groups of Lie type as named families.

Refutation

technique · direct
1.1given

It records only the source table's family names and conventions. It does not define root data, Chevalley groups, or the Lie-algebra constructions from which the families arise.

2.1step 1.1contradiction∎

The claim that this page develops the groups through Lie-algebra structure is therefore false.

5 · Examples, counterexamples and false statements

None yet.

Sources