Erdős Problem #501

A claim by Sungchul Lee with GPT-5.5 Pro (1 Jun 2026) that has not yet been verified: candidate conditional partial result (conditional solution to first part).

Problem
Erdős problem #501 (combinatorics, set theory); current status: not disprovable
Credit
Sungchul Lee with GPT-5.5 Pro · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-06-01 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
UN-
VERIFIED
Per Tao's AI-contributions wiki

The problem

For every x∈Rx\in\mathbb{R} let Ax⊂RA_x\subset \mathbb{R} be a bounded set with outer measure <1<1.

Must there exist an infinite independent set, that is, some infinite X⊆RX\subseteq \mathbb{R} such that x∉Ayx\not\in A_y for all x≠y∈Xx\neq y\in X?

If the sets AxA_x are closed and have measure <1<1, then must there exist an independent set of size 33?

Statement quoted from erdosproblems.com/501, maintained by Thomas Bloom. Original source: [Er61][ErHa71]. Current status there: not disprovable.

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 Humans Outcome
29 May-1 Jun, 2026 AI working with humans GPT-5.5 Pro Sungchul Lee ⚪ Candidate conditional partial result (conditional solution to first part)

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.

∎