Erdős Problem #846

Partial progress by DeepMind prover agent; OpenAI internal model (independently) (21 Feb 2026): full solution (Lean); 🟢 Full solution.

Problem
Erdős problem #846 (geometry); current status: disproved (Lean)
Credit
DeepMind prover agent; OpenAI internal model (independently) · AI on its own; related literature found afterwards
Checked
Lean formalizationListed in Tao's wiki
Timeline
First AI contribution 2026-02-21 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PARTIALPer Tao's AI-contributions wiki

The problem

Let A⊂R2A\subset \mathbb{R}^2 be an infinite set for which there exists some ϵ>0\epsilon>0 such that in any subset of AA of size nn there are always at least ϵn\epsilon n with no three on a line.

Is it true that AA is the union of a finite number of sets where no three are on a line?

Statement quoted from erdosproblems.com/846, maintained by Thomas Bloom. Original source: [Er92b]. Current status there: disproved (Lean).

AI contributions

As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.

Date Kind AI systems Outcome Literature
21-25 Feb, 2026 AI on its own; related literature found afterwards DeepMind prover agent; OpenAI internal model (independently) 🟢 Full solution (Lean); 🟢 Full solution 🟡 Reiher, Rödl, and Sales (2024)

Caveats

The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.

∎