HN Debrief

Why Erdős Problems Are Falling to AI

  • AI
  • Mathematics
  • Research
  • Science

Quanta’s piece argues that AI is starting to crack the kind of combinatorics and pure math problems associated with Paul Erdős, helped by broad exposure to many subfields, formal proof systems like Lean, and search methods that can grind through huge spaces of possibilities. The comments mostly accepted the core claim that this is real progress, not hype, but pushed on what kind of progress it is. The sharpest distinction was between solving a problem and advancing mathematics. A counterexample or formal proof can settle a conjecture, yet still leave the field without the concepts, intuition, and reusable techniques that make a result valuable to other humans. That is why the strongest reaction was not "AI is faking it" but "we now have answers that still need to be digested into mathematics."

If you work with AI on technical discovery, separate "got a valid answer" from "produced reusable understanding." The competitive edge is shifting toward verification, exposition, and turning opaque machine output into forms humans can build on.

Discussion mood

Impressed but unsettled. Most people accepted that AI is genuinely solving some hard math, especially in machine-checkable settings, but they were frustrated that the output often lacks the exposition and conceptual clarity mathematicians need to turn a result into usable knowledge.

Key insights

  1. 01

    Proof search is ahead of explanation

    Formal success is arriving faster than human understanding. The key contribution here is the claim that turning an opaque result into an intuitive, well-connected account is not cleanup work. It is part of mathematics itself. The comparison to large AI-built codebases makes the point concrete. Getting something that typechecks or runs is not the same as getting something other people can maintain, reason about, and reuse. The same gap now exists in math.

    Treat verification and exposition as separate product layers. If you build AI systems for discovery, invest in tools and workflows for translation, not just generation.

      Attribution:
    • twotwotwo #1
  2. 02

    Math already has a playbook for unreadable proofs

    Huge or highly formal proofs are not a new crisis for mathematics. The useful framing here is that a proof can still matter before it is elegant, because it can settle dependencies and redirect work, but its long-term value rises when it gets rewritten into multiple styles that different researchers can use. A result stated in Lean, algebraic language, or geometric language reaches different people and unlocks different follow-on work.

    Do not stop at a verified artifact. Plan for refactoring results into the forms your actual users can work with, whether those users are researchers, engineers, or domain experts.

      Attribution:
    • goodmythical #1
  3. 03

    AI may turn conjecture making into a search loop

    The interesting step beyond proving known problems is an automated pipeline that proposes many conjectures, proves or disproves them, and feeds the survivors back into training. The valuable twist is not that models can generate conjectures at all. That is easy. It is that scale plus filtering may produce worthwhile novelty even if most candidates are junk. In other words, brute-force idea generation becomes more credible when formal checking can cheaply kill bad ideas.

    Watch for discovery systems that combine generation with ruthless automated filtering. In research-heavy businesses, the winning setup may be a loop that cheaply proposes, tests, and ranks ideas rather than a model that looks brilliant one shot at a time.

      Attribution:
    • pfdietz #1 #2
  4. 04

    Some results come from cross-domain reuse, not alien math

    Not every AI result seems to depend on impossibly exotic machinery. One commenter noted that at least one recent proof used elementary results, with the novelty coming from applying a technique from outside the usual problem area. That matters because it suggests part of AI’s edge may be broad retrieval and recombination across specialties, plus stamina in working through details, rather than wholly mysterious new mathematical objects.

    A practical near-term use case is cross-silo problem solving. AI may create value first by importing methods between subfields that humans keep socially or cognitively separate.

      Attribution:
    • operation_moose #1
    • LPisGood #1
  5. 05

    Counterexamples are a likely first wave

    A recurring claim was that AI is especially well positioned to find false conjectures by producing counterexamples that are hard to discover but easy to verify once found. That shifts how to read the current breakthrough narrative. The early harvest may tell us more about where verification is cheap than about general mathematical mastery. Settling false statements is still valuable. It clears dead ends fast and sharpens the map of what remains plausibly true or undecidable.

    Expect narrow but compounding wins wherever outputs can be checked cheaply after generation. Counterexample-heavy progress is still real progress and can reshape research roadmaps quickly.

      Attribution:
    • yzydserd #1
    • kadoban #1
  6. 06

    Math is the easiest science target

    The reason this is moving faster in mathematics is structural, not just a temporary lead. Math gives AI crisp reward signals, no experimental bottleneck, and many reusable reasoning steps that transfer once the formal context is learned. Physics, chemistry, and biology do not offer that same closed loop. Even strong candidate theories still need expensive experiments, messy data, and real-world validation. That makes direct extrapolation from math breakthroughs to all of science look sloppy.

    Do not forecast lab science timelines from math results. The best near-term bets are domains with formal verification, simulators, or other tight feedback loops.

      Attribution:
    • bsaul #1
    • HarHarVeryFunny #1
    • numbers_guy #1

Against the grain

  1. 01

    Solving famous problems can hurt the field

    Closing a conjecture with an opaque machine proof may reduce the human struggle that often generates the most valuable mathematics. The argument is that Erdős problems matter not just because of their answers, but because they are carefully chosen pressure points that provoke new concepts and techniques. If AI settles them cheaply with existing machinery, the field may lose a source of creative development rather than gain one.

    Do not assume faster solution throughput automatically maximizes innovation. In research organizations, preserve room for human-led exploration even when automation can close questions quickly.

      Attribution:
    • HarHarVeryFunny #1 #2
  2. 02

    These may be retrieval wins, not discovery

    One skeptical reading is that the model is mostly surfacing latent combinations already present in the literature rather than creating genuinely new mathematics. That does not make the achievement trivial, because finding the right bridge across a vast corpus is still hard, but it does change the interpretation from creativity to extremely capable synthesis.

    Be precise about what kind of novelty your AI systems deliver. If the value is synthesis across buried prior art, design incentives and evaluation around retrieval depth and recombination quality.

      Attribution:
    • glitchc #1
  3. 03

    AI may also take over exposition

    The comforting idea that humans will remain the explainers may not hold for long. If models keep improving, they could become better not just at finding proofs but at writing the cleaner, more intuitive versions too. That would erase the proposed refuge in "human interpretation" and push mathematicians toward even narrower roles in validation or taste-making.

    Do not build strategy on the assumption that explanation is a permanently human moat. Track whether AI-generated exposition starts becoming genuinely preferred by domain experts.

      Attribution:
    • aesthesia #1

In plain english

conjecture
A mathematical statement believed to be true or false but not yet proven.
counterexample
A specific example that shows a general mathematical claim is false.
Erdős problems
Open mathematical problems associated with Paul Erdős, a famous mathematician who proposed many influential conjectures and questions.
Lean
A proof assistant, which is software used to write mathematical proofs in a fully formal way so a computer can check every step.
typechecks
Passes a software check that verifies code follows the rules of a type system, often used as an analogy for mechanically verified proofs.
undecidable
A statement that cannot be proven true or false within a given formal system.

Reference links

Mathematician reactions and explainers

Formal proofs and historical precedents

Books and essays on mathematical culture

  • A Mathematician's Apology
    Quoted in a discussion about whether mathematics has overvalued proving new theorems relative to explanation and exposition.
  • Gian-Carlo Rota on nLab
    Shared for Rota's distinction between problem solvers and theory builders, which commenters used to frame AI's impact on math careers.

Background references