How to Verify AI-Generated Math Proofs

To verify an AI-generated math proof, check whether a proof assistant accepts the specific formal theorem, then compare that theorem with the claim in the paper. A successful check establishes a derivation within the formal setup. It does not show that the setup captures the paper’s intended result or that mathematicians have independently reviewed it.

What does a proof checker actually verify?

A proof assistant can check a formal proof against a stated setup. Its kernel accepts a proof that follows from the definitions, theorems, and axioms declared in the formal development and its imports.

Acceptance does not, by itself, show that a formal statement accurately expresses a paper’s claim. Nor does it establish that the result is novel, significant, or independently peer-reviewed. Formal checking and mathematical review answer different questions: one checks a derivation within a formal system; the other assesses its meaning and place in mathematics. ^[1]

How can you verify an AI-generated math proof claim?

Use this checklist for Lean or another formal system. The questions apply broadly, though commands and build steps depend on the project and proof assistant.

1. Locate the exact theorem. Start from the paper’s entry in the project repository or documentation, then follow its link or file path to the formalization. In Lean, find the documented declaration or search the source files for the theorem or lemma name. Record its full name, including any namespace, and confirm that it is the result you want to check—not a supporting lemma. A manuscript’s presence in a collection does not mean every claim in it has been formalized. ^[2]
2. Reproduce the check in the project’s environment. Read the setup instructions and use the specified toolchain and dependency versions. Run the documented build or test command from the project root. In a Lean project, this is often lake build, but follow the project’s instructions. Record the commit or release you checked, and avoid silently updating dependencies because that can change the environment.
3. Compare the formal statement with the paper. Read both statements side by side. Compare definitions, hypotheses, quantifiers, and conclusions—not just the theorem’s name or abstract. For example, a paper might claim that every real number squared is nonnegative, while a formal theorem proves only that every nonzero real number squared is positive. The formal theorem may be correct, but it does not cover the case of zero. Check whether extra assumptions, omitted cases, or narrower definitions change the result’s scope.
4. Inspect the transitive axiom list. A clean build is necessary evidence that the checked-out project compiles in its environment, but it is not sufficient evidence of a fully justified proof. In Lean, a declaration can compile while relying on sorry, which introduces the axiom sorryAx, or on other explicitly added axioms. Use #print axioms theoremName or the project’s documented inspection tools to examine the theorem’s transitive axiom list. Check specifically for sorryAx and for any other unexpected assumptions. Investigate whether each remaining axiom is intended and appropriate for the claim.
5. Review dependencies and version history. Trace important transitive dependencies through imports and referenced theorems, using the project’s source or dependency tools. Check whether the theorem relies on an earlier result or assumption that affects the paper’s claim. Compare the checked source with the current manuscript and review its revision history. If the paper or a dependency has changed, reassess the result.
6. Ask what the formal result means in context. Look for an explanation from a mathematician who can assess how the formal theorem relates to the paper’s argument and existing work. A checker can confirm a formal derivation; it cannot supply that interpretation.

These checks separate several questions: Does the project build? Is the theorem fully justified by its declared assumptions? Does it prove the paper’s intended claim? Is the version current, and how should the result be interpreted?

Using a mathematics repository as a case study

An AI mathematics repository is a useful starting point for tracing a claim from a manuscript to its formalization. The repository entry and source files can help you identify what has been formalized and where to inspect it. ^[2]

Do not treat a collection-level description or summary as verification of a particular theorem. Follow the entry to the exact declaration, reproduce the project’s build, inspect its transitive axioms and dependencies, and compare its statement with the manuscript. If no formal theorem corresponds to the claim, the repository does not provide formal verification of that claim.

Repository status is version-specific. Save the version you checked and consult the current entry and history before relying on an older result or summary. This workflow applies to any project, not only AI-produced mathematics.

What still requires human mathematical judgment?

Formal checking does not decide whether the statement matches the intended result, whether its assumptions are appropriate, or how it fits with existing work. Those questions require mathematical interpretation beyond confirming that a proof follows from a formal setup. ^[1]

Keep the conclusion proportional to the evidence. You can report that a specific formal theorem builds in a specified environment and list the assumptions it uses. Do not turn that into a broader claim that the paper has been peer-reviewed, that every result in it is correct, or that the result is new.

Frequently asked questions

Can a formal proof be valid if its theorem does not match the paper’s claim?

Yes. A proof can be valid for the theorem the checker accepts while that theorem fails to capture the paper’s intended claim. Compare the formal and informal statements to assess the match. ^[1]

Does a successful Lean build prove that there are no placeholders?

No. A project can build while a declaration relies on sorryAx or another axiom. Inspect the theorem’s transitive axiom list and investigate assumptions you do not expect.

Does formalization show that a result is novel?

No. Formalization checks a proof against a formal statement and its dependencies. Novelty requires comparison with existing mathematical work.

Sources for citation markers

• ^[2] OpenAI mathematics repository, including its collection description and manuscript entries.