Direct discovery · Mathematics · Computer science
Rethlas generates expert-checked proofs for eight open algebra problems
Self-contained proofs and counterexamples for eight questions from published open-problem lists in commutative algebra and Boij-Söderberg theory.
Summary
Jiang and colleagues report eight open questions in commutative algebra and related areas resolved by Rethlas through autonomously generated proofs. The paper presents self-contained arguments that the authors say were checked by human experts; one central counterexample, answering Anderson's 2014 quasi-completeness question, also has a public Lean 4 formalization produced by Archon.
AI role
The Rethlas reasoning system generated the proofs without human intervention; human experts checked the arguments, and Archon later autoformalized the Anderson-problem counterexample in Lean 4.
Narrative role
This broadens the research-mathematics timeline beyond frontier-company models: an academic, open-tooling effort produced a multi-problem portfolio with human checking and a machine-verifiable exemplar.
Caveat
The collection is a preprint from researchers involved with the Rethlas project, not an independently peer-reviewed survey. The eight questions differ in age and significance, and only the Anderson result is identified as having a complete public Lean formalization.