OpenAI once claimed AI solved famous unmet math problems — that collapsed under scrutiny. Does its newest math claim hold up any better?
What pattern does this follow from OpenAI's earlier Erdős problem claim?
This reads 'this' as OpenAI's counterexample to Erdős's unit distance conjecture, and asks how it compares with OpenAI's earlier, retracted claim that GPT-5 had solved open Erdős problems: is it the same story again, or something different?
This reads the question as asking how OpenAI's unit-distance counterexample compares with the company's earlier Erdős announcement, which fell apart. The short answer from the corpus is that the shape of the story repeats but what's inside it has changed. Both times there was a big public claim, then outside mathematicians examined it, then the headline shrank to something narrower. The difference is how much was left after the examination. The first time, almost nothing was. This time, a real result was.
Start with the earlier episode. OpenAI researchers said GPT-5 had solved several open Erdős problems. Thomas Bloom, who maintains the Erdős problems database, pointed out that 'open' on his site only meant he didn't know of a solution, not that mathematics had none. The problems already had published solutions, and GPT-5 had found those papers. What GPT-5 actually did was a strong literature search, not new proofs Did GPT-5 really solve previously unsolved math problems?. That's worth knowing because the mistake wasn't about whether the model reasoned well. It was about how the claim was labeled, and that kind of mistake is easy to make again.
The unit-distance result holds up better. The counterexample is checkable, and it rests on classical number theory: Golod–Shafarevich towers and number-field methods. The new step is to let the degree of the number field grow without limit. That lets a single fixed prime keep two key quantities (the class number and the discriminant) small enough to build sets of points in the plane with more unit distances than the conjecture allowed What made OpenAI's unit distance counterexample succeed?. Notice the structure: well-known tools, combined in a way nobody had tried. That's close to the earlier 'retrieval' story, but this time the combination produced something new. Read the two episodes together and the line between finding existing work and discovering something is blurrier than either announcement suggested.
What repeats across both episodes, and across the wider wave of AI-on-Erdős claims, is a gap between 'the proof checks out' and 'someone understands it.' Erdős problems became a popular AI test because they cover many areas of math at very different difficulty levels. But formal verification by software and human understanding are tracked as separate outcomes, and understanding usually comes later Why did Erdős problems become a popular AI testing ground?. The Erdős Problem 728 case shows the same split. The Lean proof (a proof checked line by line by the Lean software) is beyond dispute. Whether the AI really worked 'autonomously,' and whether readers can follow the argument, are both still open Did an AI system truly solve Erdős Problem 728 autonomously?. Formal verification also hides more than it seems to. A proof of one theorem leans on a large prebuilt library of definitions and lemmas (Mathlib), so 'verified' can hide how much existing structure the result depends on Can autoformalization work on individual statements alone?.
Here's the part you might not expect: the field's response is starting to look like a pattern too. Terence Tao argues that a model's opacity matters less if its output goes through a reliable checker Can opaque machine learning models help prove new mathematics?. That's what separates the unit-distance result from the GPT-5 episode, where the checking happened in public and after the announcement. Nature uses the unit-distance proof, verified but opaque about how it was found, as its main example of why mathematics' Leiden Declaration on AI disclosure should become a model for other sciences Can AI governance models from mathematics work across scientific fields?. So the pattern runs from claim, to dissolution, to a verified but opaque result, to new rules about disclosure. One limit: the corpus doesn't document how OpenAI itself presented the unit-distance announcement. Whether the company changed its own framing between the two claims isn't something this collection can answer.
Sources 7 notes
OpenAI's announcement conflated 'open to one maintainer' with 'unsolved in mathematics.' Thomas Bloom confirmed the problems had existing solutions GPT-5 surfaced; the actual contribution was literature retrieval, not proof discovery.
OpenAI's counterexample to Erdős's unit distance conjecture builds on classical Golod–Shafarevich towers and number-field methods, but achieves its breakthrough by letting the degree [K : Q] → ∞. This allows a fixed split prime to suppress the class number and discriminant, enabling the construction of planar point sets with superlinear unit distances.
Erdős problems became an AI test bed because they span accessible mathematical domains with varying difficulty. However, formal logical certification and human comprehension are reported as separate outcomes, with comprehension lagging behind automated verification.
An AI system generated a formal Lean proof of a logarithmic-gap factorial divisibility result, which researchers then made accessible through informal writeup. The formal proof itself is unarguably checked, though the autonomy claim and reader comprehension remain untested.
Real formalization requires theory-level work: even one theorem needs a coherent web of axioms, definitions, and lemmas. Statement-level approaches only succeed by borrowing from prebuilt libraries like Mathlib, hiding the actual complexity involved.
Show all 7 sources
Tao argues ML tools' opacity matters less than pairing them with reliable validators like proof assistants or numerical methods. He cites finite-time blowup for Boussinesq equations, where a neural network suggested solutions later verified through perturbation arguments.
Nature's editorial endorses the Leiden Declaration as a successor to the 2014 Leiden Manifesto, arguing its disclosure principles should guide AI adoption in other sciences. OpenAI's verified but methodologically opaque unit-distance proof exemplifies why such governance is urgent.
Papers this line draws on 8
The research behind the notes this line reads — ranked by how closely each paper relates.
- Verification abundance, adjudication scarcity: what happens to mathematical knowledge when proof checking becomes free
- From Solvers to Research: Large Language Model-Driven Formal Mathematics at the Research Frontier
- The crisis of AI-generated mathematics
- Remarks on the disproof of the unit distance conjecture
- Why the Legendary Erdős Problems Are Falling to AI
- Machine-Assisted Proof
- Mathematicians are developing rules for AI use — other fields should follow
- Mathematical methods and human thought in the age of AI