• Bustedknuckles@lemmy.world
    link
    fedilink
    English
    arrow-up
    17
    ·
    51 minutes ago

    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

    • TapedeckNinja@lemmy.worldOP
      link
      fedilink
      English
      arrow-up
      8
      arrow-down
      1
      ·
      38 minutes ago

      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.

    • Ledivin@lemmy.world
      link
      fedilink
      English
      arrow-up
      18
      ·
      45 minutes ago

      The short answer is “not much.”

      Us assuming that the Riemann hypothesis is true is the basis of much of our mathematics. If it was proven false, it could affect a ton of the math we’ve built on top of it for centuries, but it being proven true is just confirmation of what everyone was sure of but couldn’t quite prove.

      • ExcessShiv@lemmy.dbzer0.com
        link
        fedilink
        English
        arrow-up
        2
        ·
        17 minutes ago

        math we’ve built on top of it for centuries

        Well, almost centuries at least. The Riemann hypothesis is less than 200 years old (167)

    • theherk@lemmy.world
      link
      fedilink
      English
      arrow-up
      5
      ·
      37 minutes ago

      It’s counter proof would have been monumental. This is big. Perhaps the biggest of ours and a few generations surrounding, but not practically so.

      It changes little. It’s the result we’ve come to expect. Some other conjectures will use it, maybe Goldbach.

      But the disproof would have hurt a lot of number theory, maybe engineering, and probably crypto.

    • AppleTea@lemmy.zip
      link
      fedilink
      English
      arrow-up
      5
      ·
      37 minutes ago

      So there are prime numbers, that are only divisible by 1 and themselves. Here’s a set of all the prime numbers bellow 100:

      [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]

      As you start getting larger and larger numbers, primes show up less and less. The Riemann hypothesis is that there is some pattern, some formula to the distribution of prime numbers.

      So if there is a pattern and you had the formula, you could predict which arbitrarily large number is going to be prime. Otherwise, you just have to find a big number and check if its divisible.

      • gibmiser@lemmy.world
        link
        fedilink
        English
        arrow-up
        4
        ·
        30 minutes ago

        The other poster said a ton of math is built upon that idea? Like what and why?

        Sorry I know asking this is alot, im just curious.

        • AppleTea@lemmy.zip
          link
          fedilink
          English
          arrow-up
          1
          ·
          21 minutes ago

          I wish I knew for sure, but I don’t.

          Best guess, I can say that a lot of mathematical profs work by looking for the simplest description, then building up from there. Primes are as mathematically simple as it gets, so its kinda important to keep in mind there’s “simple” numbers hiding out there in the unthinkably large digits.

    • addie@feddit.uk
      link
      fedilink
      English
      arrow-up
      2
      ·
      7 minutes ago

      No more so than you could do before - we’ve been assuming that Reimann is true since forever, a lot of modern mathematics depends on it. And we already have ways to conjure up extremely large numbers that are almost certainly prime, such as Fermat’s primality test. RSA encryption depends on us being able to do that, in fact.

  • BillyClark@piefed.social
    link
    fedilink
    English
    arrow-up
    2
    ·
    20 minutes ago

    On Friday Anthropic mathematician Levent Alpöge claimed to have used the company’s Claude AI model to solve the Riemann problem, perhaps the most important open quandary in mathematics.

    “We have full confidence that Alpöge’s proof of the Riemann Hypothesis is correct, and we congratulate him on this achievement,” mathematicians wrote in a joint statement by the Lean and Mathlib communities

    Are we calling it “Alpöge’s proof” despite the fact that he didn’t come up with it?

  • Starblender@normals.me
    link
    fedilink
    arrow-up
    2
    arrow-down
    9
    ·
    edit-2
    35 minutes ago

    The nerds have had their run. Time to give the jocks another turn and see how things go.

    People who don’t need to put their dick everywhere because they already did… in high school.

    Or maybe the artists. Let’s have them run things.