Isn’t this “Independent mathematicians who also used Lean software to check the proof that the author wrote/checked with Lean”?
It could still be valid of course, but I thought the proof was like 250000 pages and has only been looked at by the same automated framework.
This is out of my wheelhouse and I don’t have a dog in the fight, but I’d still like some expert human eyes on it
They used 2 checkers that are maintained and developed independently of the Lean kernel. But they did use Lean formats/syntax. They’ve also done some manual verification, though there might be more to do. The proof did use the statement if RH directly from the well established Mathlib.
I’ve also seen claims that the proof has some weird things in it that might be hints that it is finding holes in the theory Lean models.
Honestly, even if it ends up not being a proof of RH, it will tell us something about computable / constructive maths.
There are a bunch of ways that a proof written in Lean can be invalid.
The most obvious is that the problem statement is invalid or incomplete. This was not really a concern here as the proof used Mathlib’s built-in definitions rather than restating the problem, but nonetheless it has been verified.
Beyond that Lean proofs can contain custom axioms/assumptions, shortcuts, tricks, exploits. And there’s the possibility that the Lean compiler used in the proof had a bug.
Anyway all that has been tested and verified. The problem statement is valid. The proof doesn’t contain any tricks or assumptions. It compiles on every major Lean kernel.
Basically: it is almost certainly mathematically true. The next step is humans actually understanding it.
Isn’t this “Independent mathematicians who also used Lean software to check the proof that the author wrote/checked with Lean”?
It could still be valid of course, but I thought the proof was like 250000 pages and has only been looked at by the same automated framework. This is out of my wheelhouse and I don’t have a dog in the fight, but I’d still like some expert human eyes on it
They used 2 checkers that are maintained and developed independently of the Lean kernel. But they did use Lean formats/syntax. They’ve also done some manual verification, though there might be more to do. The proof did use the statement if RH directly from the well established Mathlib.
I’ve also seen claims that the proof has some weird things in it that might be hints that it is finding holes in the theory Lean models.
Honestly, even if it ends up not being a proof of RH, it will tell us something about computable / constructive maths.
It’s 250,000 pages of explanation for 17 million (I think) lines of lean code.
It’s incomprehensible, and therefore probably of little value.
There are a bunch of ways that a proof written in Lean can be invalid.
The most obvious is that the problem statement is invalid or incomplete. This was not really a concern here as the proof used Mathlib’s built-in definitions rather than restating the problem, but nonetheless it has been verified.
Beyond that Lean proofs can contain custom axioms/assumptions, shortcuts, tricks, exploits. And there’s the possibility that the Lean compiler used in the proof had a bug.
Anyway all that has been tested and verified. The problem statement is valid. The proof doesn’t contain any tricks or assumptions. It compiles on every major Lean kernel.
Basically: it is almost certainly mathematically true. The next step is humans actually understanding it.