I can write Lean that certifies that 2 + 2 = 5 is correct, by redefining every axiom about natural numbers on the way. Or abusing bugs in Lean. Stop believing Lean is the response to everything.
> I can write Lean that certifies that 2 + 2 = 5 is correct, by redefining every axiom about natural numbers on the way.
Which you would catch using comparator?
> Or abusing bugs in Lean.
And just like all the other ones, people check with multiple independent kernels, so you need to abuse bug(s) in all of them.
> Stop believing Lean is the response to everything.
Stop believing Lean is so flawed.
[1]: https://google-deepmind.github.io/formal-conjectures/
[2]: https://google-deepmind.github.io/formal-conjectures/theorem...
Given that the proof is provided by Levent Alpöge, who is known to be more than familiar with Lean, is it not unlikely he made up his own definition of the problem?
https://leanprover-community.github.io/mathlib4_docs/Mathlib...
Do you... think that there might be existing definitions for one of the most famous math problems of all time and that maybe they used that?
Or do you think that they just vibe coded up a different definition, for kicks?
This kinda feels.... easily provable either way.
And don't reduce "is not the answer to everything" to "is the answer to nothig", there is tremendous value in automated verification, especially in the AI age where the moat to it going mainstream is shrinking by the day.
For a discussion of how to check that the untrusted proof isn't playing fast-and-loose with the axioms of mathematics, see Kevin Buzzard's recent post "...and the proof is checked in Lean" at https://xenaproject.wordpress.com/2026/11/12/and-the-proof-i....