I haven't seen people talk about this at all, so thought I'd share this article about it. For those depressed that no one will actually understand the RH Proof: we have another, entirely human proof which means there are humans who understand it. It might have been overshadowed, but assuming it ends up working out (I have heard there have been some problems found, hopefully they are surmountable) then I think it will be the far more impactful result.

you are viewing a single comment's thread
view the rest of the comments
[–] 27 points 5 hours ago (10 children)

As someone who knows nothing about this, can anyone ELI5 what the hypothesis is and what writing a proof in LEAN means? I understand these words from wikipedia but I can’t wrap my head around it as a whole.

The Riemann hypothesis asserts that the Riemann zeta function has its zeros only at the negative even integers and at complex numbers with real part 1/2. First posed in 1859 by Bernhard Riemann, it is considered by pure mathematicians to be one of the most important problems in the field. The result has importance in number theory because it implies bounds on the distribution of prime numbers.

  • source
  • hideshow 10 child comments
  • [–] 44 points 5 hours ago

    LEAN is a "programming" language for mathematical proofs. In that language, you write out explicitly every step of the proof.

    If the proof is correct and it follows logical reasoning, LEAN validates it. Therefore, the proof you wrote in LEAN is correct.

    However, it is VERY important to notice that LEAN only validates what you write in LEAN. It cannot prove that your paper is correct. For example, you may put out a paper saying "1+1=3!! Confirmed by LEAN!!!" But then in LEAN you write "1+1=2". Yes, what you wrote in LEAN is correct. However, what you wrote in LEAN is not the same as what you wrote in your paper.

    This happened for example with navier stokes. The paper put out by OpenAI did not say the same thing as their LEAN proof.

  • source
  • parent
  • [–] 26 points 5 hours ago (8 children)
    1. LEAN is a math programming language with automatic checking
    2. The hypothesis is an algorithm which predicts prime numbers out to infinity
    3. It is not guaranteed that the algorithm works until infinity
    4. This has been unsolved for 138 years
  • source
  • parent
  • hideshow 8 child comments
  • [–] 6 points 4 hours ago (5 children)

    Thanks! For #3, how can you prove that it works until infinity if infinity doesn’t end?

  • source
  • parent
  • hideshow 5 child comments
  • [–] 10 points 3 hours ago* (1 child)

    Do you believe that n+1>n no matter how big n is?

    You'd prove this above using induction, and I don't know how the openai proof was written, just giving you an idea of how one goes around writing something like that

  • source
  • parent
  • hideshow 1 child comment
  • [–] 1 point 2 hours ago* (last edited 2 hours ago)

    I don't think #3 is correct. There's no such thing as "until infinity".

    But there are many ways to prove properties of infinite sets. For example I immediately think of proof by induction. And there are other options. You can generalize over all elements using common properties. "Prove that every nonzero real number x has a multiplicative inverse." (Bad example but you get the point.)

  • source
  • parent
  • [–] 1 point 2 hours ago (1 child)

    The hypothesis is an algorithm which predicts prime numbers out to infinity

    It's not really predicting primes... Copying from a google search: "primes appear with minimal irregular fluctuations around their smooth average trend."

  • source
  • parent
  • hideshow 1 child comment
  • It can predict primes in an incredibly inefficient way.. The zeta function would require more compute to predict primes than a sieve that was discovered 2300 years ago. What it is useful for is to show statistically how the primes are distributed.

  • source
  • parent