Anderson's 2014 commutative algebra problem resolved by Rethlas and Archon
An informal reasoning agent (Rethlas) and a formal verification agent (Archon) resolve an open problem in commutative algebra posed by D. D. Anderson in 2014, as a counterexample. The Lean 4 formalization has about 19,450 lines and was produced in roughly 80 agent hours, with the code public on GitHub. Caveat: arXiv preprint; the Lean check covers the formal statement as written.
Technology: Rethlas (informal agent) with Archon (formal Lean agent)
Publication: Preprint · Test context: prospective or independent check. Catalog categories, not an evidence grade.
Result, AI contribution and limits
Evidence context (descriptions follow the cited sources; test type is a catalog classification):
- Publication status: Preprint
- Test type: prospective or independent check
- Tested: The informal proof was formalized and machine-checked in Lean 4 for the formal statement as written.
- Still unknown: The page describes the case studies as illustrations of capabilities rather than broad evaluations.
- AI role: Rethlas, an informal reasoning agent, built candidate proofs; Archon, a formal verification agent, translated arguments into Lean 4 projects.
Evidence sources: https://arxiv.org/abs/2604.03789
Source checked · editorial details
The source page was checked against this entry. Independent confirmation is not assessed by this label.
Source type: paper. Paper: not linked in this catalog; this does not mean no paper exists.
Review scope and date are not recorded; source checked does not establish full-text review.
Editorial assessment: Impact 3/5 · Validation 4/5 · Novelty 4/5. Impact and novelty are editorial judgments; validation follows the annotated test type where one exists. Not an evidence grade. Scoring criteria.
Follow-up and relationships
No follow-up recorded; this is not a claim that no follow-up exists.
Follow-up review scope and date are not recorded.
No source-supported relationships recorded.