Primary evidence
- A Machine-Checked Proof of the Odd Order TheoremS1 · Primary research · Paper · 2013-07-22
The project formalized the theorem together with a substantial mathematical library spanning group theory, linear algebra, Galois theory and real/complex algebraic numbers.
The ITP 2013 paper reports a complete constructive formalization of the Feit–Thompson Odd Order Theorem in Coq, relying only on the axioms and rules of Coq's foundational framework.
It raised the demonstrated scale and depth of machine-checked research mathematics and strengthened the library infrastructure later available to automation and AI systems.
Significance rationale: The six-year Coq formalization of the Feit–Thompson Odd Order Theorem demonstrated that proof assistants could sustain a deep research-level argument while simultaneously building reusable libraries across finite group theory, algebra and number systems.
—
—
—
The peer-reviewed ITP paper documents the complete Coq formalization; machine checking reflects Coq verification and does not mean Chronicle independently replayed the full development.
No corrections recorded.