HN Debrief

What sort of maths are LLMs good at?

  • AI
  • Mathematics
  • Research
  • Developer Tools

Timothy Gowers’ post tries to separate different kinds of mathematical work instead of asking whether LLMs are simply “good at math.” His core claim is that models already look strong on areas where they can generate many candidates, recognize useful patterns from past work, and get fast feedback on whether something works. They look much weaker on the part mathematicians most prize, namely proofs that introduce a genuinely new method that later feels inevitable and elegant. He also notes a structural asymmetry between finding examples or counterexamples and proving universal statements. The comments largely agreed with that framing and made it more concrete. The recurring line was that current AI math wins look like test-time scaling and guided search, not autonomous theory creation. People kept coming back to a simple recipe: let the model produce lots of plausible objects, then use an external checker like Lean, a SAT solver, or numerical tests to kill bad branches cheaply. That explains why coding contests, counterexample hunting, and formal proof completion are moving faster than open-ended theory building. Several mathematically informed comments argued this is not “just brute force” in the old GOFAI sense, because proof spaces are too large for naive search and the models are clearly steering toward promising regions. Still, even the more bullish takes landed on the same practical point. The model is valuable because it proposes plausible next steps in human mathematical language, while the real reliability comes from verifiers and decomposition into lemmas. Skepticism focused less on whether AI can produce publishable fragments and more on whether that adds up to the kind of conceptual invention people mean by mathematical insight. Recent Anthropic claims around the zeta-function lower bound were read through that lens. The interesting part was not “AGI did math,” but that a non-mathematician could drive a large multi-agent search process and get a result that specialists then had to interpret and verify. That led to a broader concern that AI may flood mathematics with candidate results faster than experts can check them. The strongest bottom line was narrow but solid: current systems are good at exploration in spaces where correctness can be checked cheaply, and much less convincing at creating the theories, definitions, and long proof architectures that tell mathematicians what is worth proving in the first place.

Treat current AI math systems as high-powered search tools that become useful when you can verify outputs mechanically with Lean, SAT solvers, or numerical checks. If your problem depends on new conceptual framing, long-range proof structure, or trust without external validation, assume humans and formal tooling still carry the load.

Discussion mood

Interested but unsentimental. People think LLMs are genuinely useful for certain mathematical workflows, especially search-heavy tasks with external verification, but they reject the idea that recent results prove broad mathematical intelligence or AGI.

Key insights

  1. 01

    Math gains come from search plus checking

    The useful picture is not “the model reasons like a mathematician.” It is that the model can cheaply spray out promising candidates, while formal systems like Lean or other scaffolding decide what survives. That framing explains why examples, code, and bounded proof subproblems move first, and why longer proofs still need decomposition into lemmas and external structure management.

    Use LLMs where you can build a tight generate-verify loop. If your workflow lacks a checker or a way to break long arguments into validated subproblems, expect reliability to collapse fast.

      Attribution:
    • h_mirin #1
    • TuringTest #1 #2
    • black_knight #1
  2. 02

    ABC conjecture shows why verification matters

    The Inter-universal Teichmüller theory saga came up as a reminder that even human mathematics can get stuck for years on whether a proof is actually valid. Commenters pointed to the ongoing LANA effort to formalize the claimed proof in Lean, with the implicit view that a successful formalization would settle more than another round of expert disagreement. That makes formal proof systems look less like a convenience and more like a way to resolve disputes in areas where social consensus breaks down.

    If you work near frontier math or verification-heavy domains, invest in formalization early. It is not just about automating proof steps. It creates an audit trail that scales better than expert reputation.

      Attribution:
    • steinwinde #1
    • brazzy #1
  3. 03

    Theory building is the missing capability

    A sharp distinction emerged between solving famous, well-posed problems and doing the upstream work of mathematics, which includes inventing definitions, framing worthwhile questions, and building theories that make later theorems possible. Commenters said current AI efforts cluster around benchmark-friendly targets because they are constrained and testable, not because that is all mathematics is. People are trying broader “theory distillation” ideas, but nobody pointed to major wins there yet.

    Do not mistake progress on crisp benchmark problems for progress on open-ended research leadership. If your business depends on problem selection, abstraction, and model-building, current systems are still assistants, not principals.

      Attribution:
    • steinwinde #1
    • zmgsabst #1
  4. 04

    Counterexamples are a natural fit

    Firsthand use suggested that models are strong at grinding through cases and turning infinite-looking spaces into a stream of concrete tests. That often fails to close a universal proof, but it is exactly the right shape for finding counterexamples or for discovering the obstruction that tells you how to reformulate the theorem. The practical catch is cost. Long exploratory runs can burn through very expensive compute even when the final useful insight is small.

    Aim models at falsification, boundary cases, and obstruction finding before asking for elegant general proofs. Budget for many dead ends, because exploratory math with frontier models is still a compute-heavy research tool.

      Attribution:
    • empath75 #1 #2
  5. 05

    LLMs bridge human math and formal systems

    One of the more grounded pro-LLM arguments was that they help at the translation layer between informal mathematics and machine-checkable representations. Specialized solvers can often do the real proving or refuting once the problem is encoded correctly, but expressing a human theorem as Lean, SAT, or another formal object is a lot of work. Models are useful because they can operate in ordinary mathematical language and help turn that into something a verifier can consume.

    Pair LLMs with domain-specific solvers instead of expecting one model to do everything. The highest leverage may be in formalization and glue work, not in replacing theorem provers.

      Attribution:
    • lg5689 #1
    • YeGoblynQueenne #1
    • yorwba #1

Against the grain

  1. 01

    Math competence does not imply AGI

    Several comments pushed back on treating mathematical performance as evidence of general intelligence. ARC-AGI-3 was cited as a case where humans still dominate, though others disputed whether that benchmark mainly measures action efficiency or vision-heavy interaction. The useful corrective is that success on theorem-like tasks says a lot about structured search and verification, but little on its own about broad competence across messy environments.

    Avoid letting strong performance in formal domains anchor your overall AI capability assessment. For product planning, keep separate scorecards for narrow verified tasks and general real-world autonomy.

      Attribution:
    • root-parent #1
    • gowld #1 #2
    • georgeven #1
  2. 02

    Generate-and-test is not monkey typing

    The strongest rebuttal to the “just brute force” framing was that iterative search with heuristics and memory is qualitatively different from random enumeration. The model is not sampling uniformly from nonsense. It is biasing search toward regions that look promising and updating based on prior failures. That does not settle whether the system has deep insight, but it does explain why the old monkeys-with-typewriters analogy misses the mechanism that actually makes these systems useful.

    When you evaluate AI systems, focus on search efficiency and the quality of the feedback loop, not on whether the outer pattern resembles brute force. Better priors can turn impossible search spaces into workable ones.

      Attribution:
    • ozgung #1
    • famouswaffles #1
  3. 03

    Weak agents can still excel in formal niches

    Some commenters resisted pulling broad conclusions from failed job-search agents or geography mistakes. Their point was that messy web tasks mix scraping quality, ambiguous prompts, stale indexes, and unverifiable judgments, while closed mathematical problems often provide complete logical information and much cleaner feedback. The fact that LLM agents still stumble in ordinary clerical work does not erase genuine progress in narrowly structured formal domains.

    Do not benchmark every AI use case against consumer-style agent failures. Match expectations to task structure and observability before deciding whether a capability is real or fake.

      Attribution:
    • CodeCompost #1
    • root-parent #1
    • hansvm #1

In plain english

ARC-AGI-3
A benchmark intended to test broad problem-solving ability using tasks that humans can solve but current frontier AI systems often cannot.
formalization
The process of rewriting mathematics in a precise symbolic language that a computer can verify.
GOFAI
Good Old-Fashioned Artificial Intelligence, a label for earlier symbolic AI approaches based on explicit rules and search rather than modern neural networks.
Inter-universal Teichmüller theory
A highly technical mathematical framework proposed by Shinichi Mochizuki and tied to a disputed claimed proof of the ABC conjecture.
LANA
A project to formalize parts of the claimed ABC conjecture proof in Lean so the argument can be checked mechanically.
Lean
A formal proof assistant that lets people and machines write mathematical proofs in a form a computer can check exactly.
LLM
Large language model, a machine learning system trained on huge amounts of text and code that can generate plausible responses and software.
SAT solver
A program that determines whether a logical formula can be satisfied and is often used to solve hard combinatorial problems.
test-time scaling
A way to get better results from a trained model by spending more computation during use, such as longer reasoning or more candidate generation.

Reference links

AI and mathematics examples

Formal verification and disputed proofs

Benchmarks and capability debates

Older and complementary automated reasoning work