feat: add Feit-Thompson odd-order theorem eval problem#297
Open
kim-em wants to merge 1 commit into
Open
Conversation
This PR adds the Feit-Thompson theorem (every finite group of odd order is solvable; Feit-Thompson 1963, 255 pages, Pacific J. Math. 13) as a new eval problem. Zero new definitions on top of mathlib (IsSolvable, Odd, Nat.card). One of two named honorable mentions on Freek Wiedijk's 'Formalizing 100 Theorems' page (alongside CFSG); Coq formalization by Gonthier et al. 2012 (~170 000 lines); no Lean port. Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This PR adds the Feit–Thompson odd-order theorem as a new lean-eval challenge problem: every finite group of odd order is solvable.
W. Feit and J. G. Thompson, Solvability of groups of odd order, Pacific J. Math. 13 (1963), 775–1029 — a 255-page paper that opened the path to the Classification of Finite Simple Groups; Thompson received the Fields Medal in 1970 in part for this work. A landmark Coq formalization was completed by Georges Gonthier's team in 2012 (~170 000 lines). There is no Lean port.
Zero new definitions — the statement uses only mathlib's existing
IsSolvable,Odd,Nat.card, andGroup/Finitetypeclasses. The challenge is the proof itself.Feit-Thompson is one of two named honorable mentions on Freek Wiedijk's Formalizing 100 Theorems page (alongside the Classification of Finite Simple Groups itself).
🤖 Prepared with Claude Code