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 Finite Simple Group Classification Landscape — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Roots, Rational Powers, and Classical Inequalities
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Finite Simple Group Classification Landscape
- The ZFC Axioms and the Basic Set Constructions
2 · Summary
These witnesses illustrate the named classification families and the extension-data warning; they do not construct a sporadic group or prove CFSG.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Cyclic simple groups of prime order
Example
is finite simple for every prime .
Facts & Assumptions
Given: Let be prime.
Verification
The group has order , so Lagrange's theorem leaves only subgroups of orders and . Thus it has no nontrivial proper normal subgroup.
Hence is finite and simple.
A5 as the smallest nonabelian simple group
Example
is the smallest nonabelian finite simple group.
Facts & Assumptions
Given: Use is simple for every and the cited CFSG introductory table.
Smith's introductory table identifies as the least-order nonabelian finite simple group.
Verification
The dependency makes simple, and ; it is nonabelian. The cited source identifies it as the least-order nonabelian simple group.
Therefore is the smallest nonabelian finite simple group.
PSL(2,7) and a low-rank family entry
Example
is a sourced Lie-type entry under the table's low-rank convention.
Facts & Assumptions
Given: Use Smith's Lie-type family table cited above.
Smith's table places in the projective special linear family under its stated low-rank conventions.
Verification
In that table occurs in the projective special linear family, with the source's stated low-rank naming conventions.
This is precisely the claimed table-level Lie-type example; no structural construction is being inferred.
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.
Smith's nonclassical twisted-family row includes the Suzuki groups among the finite simple groups of Lie type.
Verification
That row explicitly includes the Suzuki family among the finite simple groups of Lie type.
Hence Suzuki groups furnish the asserted named-family entry.
The Mathieu groups among the sporadics
Example
, , , , and are Mathieu entries in the sporadic list.
Facts & Assumptions
Given: Use the sporadic list recorded in The twenty-six sporadic simple groups.
Verification
The cited list names as the five Mathieu sporadic simple groups.
These are therefore exactly the claimed Mathieu entries.
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.
Their simple factors agree while their element orders differ.
Thus they provide the asserted counterexample.