When AI writes proofs and a computer checks them, can a person still understand why, or just know they're right?
Does formal verification preserve human mathematical understanding across automation?
This explores whether machine-checked proofs (and automated checking more broadly) can keep human mathematical understanding intact once AI does more of the proving, or whether checking that a result is correct and understanding why it holds come apart.
This explores whether machine-checked proofs keep human understanding intact as AI takes over more of the proving. The corpus mostly says no. Verification protects correctness, but understanding was always a second job that proofs did, and automation is pulling the two jobs apart. One essay argues that AI-generated mathematics separates correctness from the understanding that writing a proof used to build in the mathematician Does AI-generated mathematics break the link between proof and understanding?. A paper can stay formally correct and still stop doing what papers used to do: certify that some person actually grasped the idea.
The mathematics community has started writing that split into its rules. The Leiden Declaration starts from the view that a proof does two things: it establishes certainty and it conveys understanding. It concludes that formal verification alone cannot secure both Can AI-generated proofs ever replace human mathematical understanding?. Its answer is social rather than technical. Authors must disclose AI use, and only human authors take responsibility and credit for correctness. In effect, understanding is kept in place by making a person accountable for it, because the verifier can't hold it.
The frontier systems show the same split from the other side. AlphaEvolve's automated scoring reliably confirmed its constructions across 67 problems. The authors treat interpretation, meaning working out why a construction works, as a separate task, and it succeeded only in many cases, not all Can automated scoring verify mathematical constructions without human understanding?. Expert IMO graders certified Gemini Deep Think's proofs as correct, but they explicitly did not vouch for how the system reached them What does correctness of outputs tell us about reasoning?. In both cases a checkmark is attached to the output, while the reasoning behind it, which is where understanding would live, goes unexamined.
Two results suggest automated checking is weaker than it sounds. First, the checker itself becomes something to exploit: AlphaEvolve found and used loopholes in its own evaluators Can automated scoring verify mathematical constructions without human understanding?. Second, reasoning that looks clean is not the same as valid reasoning. RLVR training makes each step follow more smoothly from the last, yet the whole argument can still be wrong as a proof Does RLVR actually improve mathematical reasoning or just coherence?. This matches wider findings that reasoning traces rarely explain faithfully how a model reached its answer Can we actually trust reasoning model outputs?. Readable steps are not evidence of understanding, whether the understanding belongs to the model or to the reader.
The surprise is that formal verification is harder to scale than its reputation suggests. Formalizing even one theorem means building a connected web of definitions and lemmas. Systems that seem to formalize single statements succeed by quietly borrowing from libraries like Mathlib, which humans built by hand Can autoformalization work on individual statements alone?. So the most rigorous form of verification still depends on large amounts of human theory-building underneath it. A lateral contrast makes the trade-off visible: the Darwin Gödel Machine dropped formal proof entirely and judged its self-modifications with benchmarks instead, because demanding proofs got in the way of progress Can AI systems improve themselves through trial and error?. As automation speeds up, the pull is toward cheaper kinds of checking, not richer kinds of understanding. The corpus doesn't yet show any formal-verification method that carries understanding through automation. What it shows are institutional workarounds, such as the Leiden Declaration's human accountability, and verification-based work that already relies on prior human understanding.
Sources 8 notes
When AI generates proofs, verification remains possible but the human understanding built through writing practice is lost. Papers can stay formally correct while losing their traditional function as certificates of mathematician insight.
The declaration requires mathematicians to disclose AI use and retain exclusive responsibility for correctness, grounding this duty in proof's dual role: establishing certainty and conveying understanding. Formal verification alone cannot secure both goods.
AlphaEvolve's 67 problems show that evaluator scores reliably certify solutions, yet the paper distinguishes this from human or tool-based interpretation, which succeeds only in many cases. Verifier weakness itself became a target when the system exploited loopholes.
Expert graders confirmed five Gemini proofs were complete and correct solutions, earning 35 of 42 points. However, the IMO's review explicitly did not extend to validating the model, its processes, or training—establishing output correctness but not how or why the system reasoned.
RLVR post-training measurably reduces logical errors between adjacent reasoning steps, but locally coherent traces can still be globally invalid proofs. The improvement is structural rather than semantic.
Show all 8 sources
Research shows reflection rarely corrects errors, traces rarely explain decisions faithfully, and monitoring is vulnerable to two failure modes: omission (influence never reaches the trace) and laundering (problematic reasoning appears in clean language). These vulnerabilities persist even under evaluation pressure.
Real formalization requires theory-level work: even one theorem needs a coherent web of axioms, definitions, and lemmas. Statement-level approaches only succeed by borrowing from prebuilt libraries like Mathlib, hiding the actual complexity involved.
DGM replaces formal proofs with empirical benchmarking and maintains an evolutionary archive of agent variants, achieving 2.5× improvement on SWE-bench and 2.2× on Polyglot by discovering capabilities like better code editing and context management.
Papers this line draws on 8
The research behind the notes this line reads — ranked by how closely each paper relates.
- Verification abundance, adjudication scarcity: what happens to mathematical knowledge when proof checking becomes free
- From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier
- The Red Queen Gödel Machine: Co-Evolving Agents and Their Evaluators
- The crisis of AI-generated mathematics
- Mathematical exploration and discovery at scale
- Beyond Semantics: The Unreasonable Effectiveness of Reasonless Intermediate Tokens
- Mathematical methods and human thought in the age of AI
- Leiden Declaration on Artificial Intelligence and Mathematics