• TapedeckNinja@lemmy.worldOP
    link
    fedilink
    English
    arrow-up
    80
    arrow-down
    5
    ·
    edit-2
    1 day 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.

    • Telorand@reddthat.com
      link
      fedilink
      English
      arrow-up
      24
      arrow-down
      2
      ·
      edit-2
      20 hours ago

      The next step is humans actually understanding it.

      So what we got here is “42.”

      • Lettuce eat lettuce@lemmy.ml
        link
        fedilink
        English
        arrow-up
        10
        arrow-down
        1
        ·
        17 hours ago

        “Claude, explain this proof to me in a way that I can perfectly comprehend in totality without requiring me to understand any mathematics beyond high school. Make no mistakes.”

        • brianary@piefed.zip
          link
          fedilink
          English
          arrow-up
          3
          ·
          3 hours ago

          I’d settle for a human mathematician understanding it. What good is a proof that only other software understands? Am I missing something? Does it give us some sort of useful or more widely applicable formula or constant?