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.

✓ 3 results · all verified · 2 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. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Finite Simple Group Classification Landscape — Examples

1 · Prerequisites

2 · Summary

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

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

Cyclic simple groups of prime order

Example

Cp is finite simple for every prime p.

Facts & Assumptions

Given: Let p be prime.

Verification

technique · direct
1.1givenalgebra

The group Cp has order p, so Lagrange's theorem leaves only subgroups of orders 1 and p. Thus it has no nontrivial proper normal subgroup.

2.1step 1.1∎

Hence Cp is finite and simple.

ExampleConstruction: Literature-sourcedVerification: AI-adaptedverified 2026-09-26 (gpt-6-sol)Open item page →

A5 as the smallest nonabelian simple group

Example

A5 is the smallest nonabelian finite simple group.

Facts & Assumptions

Given: The alternating group A5 and finite groups of order less than 60.

[L1]

An is simple for n≥5 (An is simple for every n≥5).

Verification

technique · direct
1.1L1L4algebra

By [L1], A5 is simple. Multiplication by a transposition pairs the even and odd permutations, so ∣A5∣=5!/2=60. The even permutations α=(0 1 2) and β=(2 3 4) do not commute: (αβ)(2)=3 whereas (βα)(2)=0. Thus A5 is nonabelian.

1.2L3L2givenalgebra

Suppose G is nonabelian simple and ∣G∣<60. Its order cannot be 1 or a prime power: in the latter case its nontrivial normal center from [L3] would be all of G, making G abelian. For every prime divisor p of its order, [L2] therefore gives np>1.

2.1L2step 1.2algebra

The non-prime-power integers between 2 and 59, apart from 12,24,30,36,48,56, are 6,10,14,15,18,20,21,22,26,28,33,34,35,38,39,40,42,44,45,46,50,51,52,54,55,57,58. For each integer in this list, take its largest prime divisor p. Inspection of the divisors of m=∣G∣/pa shows that 1 is the only divisor congruent to 1 modulo p. Thus [L2] gives np=1, excluding every order in the list.

2.2L2L4step 1.2algebra

A nontrivial conjugation action of a simple group on its np>1 Sylow subgroups is faithful: the kernel is normal and cannot be all of G, because the action is transitive. Thus G embeds in Snp. The sign of this action is trivial, since a nontrivial homomorphism from nonabelian simple G to the group of order two would be injective. Consequently G embeds in Anp. For orders 12,24,36, [L2] gives n3=4. Since ∣A4∣=12, [L4] rules out 24,36; at order 12 the image would be all of A4, which is not simple: its identity and three double transpositions form a proper nontrivial subgroup preserved by conjugation. For order 48, [L2] gives n2=3, contradicting an embedding of G into A3, of order 3.

2.3L2L4step 1.2algebra

For order 30, [L2] and step 1.2 force n5=6 and n3=10. Distinct subgroups of prime order intersect only in the identity by [L4], so these supply 6⋅4+10⋅2=44 distinct nonidentity elements, impossible. For order 56, the same rules give n7=8 and n2=7. The eight subgroups of order 7 supply 48 distinct nonidentity elements. Every Sylow 2-subgroup has order 8, and its seven nonidentity elements must be the seven remaining nonidentity elements of G. All Sylow 2-subgroups would therefore coincide, contradicting n2=7.

3.1step 1.1step 1.2step 2.1step 2.2step 2.3∎

Steps 1.2–2.2 exclude every order below 60, while step 1.1 supplies a nonabelian simple group of order 60. Hence A5 is the smallest nonabelian finite simple group. [step 1.1, step 1.2, step 2.1, step 2.2, step 2.3].

ExampleConstruction: Literature-sourcedVerification: AI-generatedverified 2026-09-26 (gpt-6-sol)Open item page →

PSL(2,7) and a low-rank family entry

Example

PSL⁡(2,7) is a sourced Lie-type entry under the table's low-rank convention.

Facts & Assumptions

Given: Use Smith's Lie-type family table and its rank-one notation cited above.

[L1]

Smith's table lists type An as the linear family Ln+1(q), and its rank-one discussion explicitly names L2(q) as Lie type. In standard notation L2(q)=PSL⁡(2,q).

Verification

technique · direct
1.1L1given

Specializing [L1] to n=1 and q=7 places L2(7)=PSL⁡(2,7) in the linear Lie-type family.

2.1step 1.1∎

This is precisely the claimed table-level Lie-type example; no structural construction is being inferred.

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

A Suzuki group family entry

Example

Suzuki groups occur in the source’s nonclassical twisted row.

Facts & Assumptions

Given: Use Smith's nonclassical twisted-family row cited above.

[L1]

Smith's nonclassical twisted-family row includes the Suzuki groups among the finite simple groups of Lie type.

Verification

technique · direct
1.1L1given

That row explicitly includes the Suzuki family among the finite simple groups of Lie type.

2.1step 1.1∎

Hence Suzuki groups furnish the asserted named-family entry.

CounterexampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-09-06Open item page →

Composition factors do not determine the extension

Statement refuted

C4 and C2×C2 share composition factors but are not isomorphic.

Counterexample

Given: Use the two groups in the statement.

1.1given

Their simple factors agree while their element orders differ.

2.1step 1.1algebra∎

Thus they provide the asserted counterexample.

Sources