PSL(2,8) is simple
Theorem.PSL(2,8) is simple — 504 permutations of P¹(𝔽₈), 𝔽₈ = 𝔽₂[x]/(x³+x+1), class-sum clean.
Proof.504 permutations of P¹(𝔽₈), 𝔽₈ = 𝔽₂[x]/(x³+x+1), class-sum clean — completing the five smallest nonabelian simple groups {60,168,360,504,660} all proven in-registry.
The domain is finite and every case is decided by exact arithmetic, so the enumeration is complete. ∎
src/thunder/verify/index.ts#discoveredTheoremsWaveThirteen
1 · Classification
finite-complete — self-contained computation, no external lean
2 · Provenance
Documented theorem re-derived by exhaustive computation (humanityNovel=false); first-in-this-registry is the only sense of discovered.
Acknowledgment
"PSL(2,8) is simple" is a re-derivation, acknowledged to documented mathematics — the original proof is the prior art this re-derivation acknowledges; not new to humanity — the contribution is the reproducible computation discoveredTheoremsWaveThirteen.
- Prior art
- documented mathematics — the original proof is the prior art this re-derivation acknowledges
- Novelty
- not new to humanity — a re-derivation (humanityNovel = false)
- Contribution
- a reproducible computation (discoveredTheoremsWaveThirteen @ src/thunder/verify) that re-derives the result at zero tokens — the contribution is the verifiable recomputation, NOT the theorem
3 · Reproducibility
Recompute from source: npm run theorems:verify recomputes discoveredTheoremsWaveThirteen (src/thunder/verify/index.ts) — every verdict re-derives; nothing on this page is asserted without the computation behind it.