AI Theorem Proving

Cluster focuses on debates about using AI, LLMs, and formal tools like Lean/Coq for generating, verifying, and automating mathematical proofs, including challenges, feasibility, and implications for human intuition.

➡️ Stable 1.0x AI & Machine Learning
3,489
Comments
20
Years Active
5
Top Authors
#9710
Topic ID

Activity Over Time

2007
2
2008
12
2009
54
2010
22
2011
27
2012
67
2013
100
2014
121
2015
138
2016
154
2017
161
2018
160
2019
225
2020
231
2021
231
2022
279
2023
379
2024
484
2025
548
2026
94

Keywords

e.g MetaMath AI ZFC LLM AlphaProof NP reddit.com wikipedia.org proofs proof formal theorem mathematics lean mathematicians coq mathematical ai

Sample Comments

kevinventullo Jul 21, 2025 View on HN

This year, our advanced Gemini model operated end-to-end in natural language, producing rigorous mathematical proofs directly from the official problem descriptionsI think I have a minority opinion here, but I’m a bit disappointed they seem to be moving away from formal techniques. I think if you ever want to truly “automate” math or do it at machine scale, e.g. creating proofs that would amount to thousands of pages of writing, there is simply no way forward but to formalize. Otherwis

vbezhenar Sep 20, 2018 View on HN

I don't really understand why the entire known mathematics is not automatically proven yet. We, people, understand very formal proofs. Mathematics is very strict science with axioms and following theorems. It should be a perfect application for computing. I'm not talking about computer prooving theorem himself, but mathematician should write proof using some formal language and computer should be able to follow that proof.

andrepd Sep 20, 2018 View on HN

You don't understand because you haven't looked into it very much :) You'll find that automated theorem proving and proof verification is far from trivial. State of the art tools are still very cumbersome and verbose to use and are infeasible to use in those problems where you need them the most.

thrance Nov 18, 2024 View on HN

You can, in principle, formalize any correct mathematical proof and verify its validity procedurally with a "simple" algorithm, that actually exists (See Coq, Lean...). Coming up with the proof is much harder, and deciding what to attempt to prove even harder, though.

BigFish12 May 5, 2019 View on HN

To be rigorous you would need to prove that the machine verified it correctly. Good luck doing that. Also theorem proving is only good for basic rudimentary maths, and not abstract state of the art math research.

esafak Jan 11, 2026 View on HN

Why can't you use LLMs with formal methods? Mathematicians are using LLMs to develop complex proofs. How is that any different?

Tainnor Jul 19, 2025 View on HN

Mathematics cannot be "solved", that's a consequence of Gödel's First Incompleteness Theorem.It can already be "cheaply verified" in the sense that if you write a proof in, say, Lean, the compiler will tell if you if it's valid. The hard part is coming up with the proof.It may be possible that some sort of AI at some stage becomes as good, or even better than, research mathematicians in coming up with novel proofs. But so far it doesn't look like it

aoeusnth1 Apr 30, 2025 View on HN

In principle, Math proofs are another relatively easy to verify problem. In the extreme case, you can express any math proof as a computer-verifiable formalism — no intelligence necessary. Step back one step, and you could have a relatively weak model translate a proof into verifiable formalism and then use a tool call to run the verification. Coming up with the proof is an expensive search process, while verifying it is more mechanical. Even if it is not completely trivial to make the proof com

mehdi1964 Jan 11, 2026 View on HN

If AI can rewrite and formalize proofs this way, do we risk losing the human intuition behind the arguments? Or is it just a tool to explore math faster?

imranq Jun 18, 2019 View on HN

What’s the purpose of automated theorem provers? Seems to take the fun out of proofs