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.
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.