Claude-assisted Riemann proof passes Lean compiler, but full verification is still pending
An AI-assisted proof claiming to establish the Riemann hypothesis and its generalized form was published on November 20, with Lean formalization code totaling 14 files. MIT's Andrew Sutherland independently compiled the code and it passed, meaning no logical errors were found by the machine. However, compilation does not confirm that the formal statement faithfully matches the mathematical claim, that definitions were not altered, or that no extra assumptions were introduced. A separate comparator process, involving statement matching and re-checking across multiple kernels, is still needed and has not yet been published. Until it is completed, the result is described as a proof candidate rather than a confirmed proof.
This is an AI-generated summary. ShortSingh links to the original source for the complete article.
Discussion (0)
Log in to join the discussion and vote.
Log in