Delphi.science

The Anning-Erdős theorem: an infinite set of points in the plane with integer distances lies on a line

Source: github.com/zblore/fc-anning-erdos/tree/5b3e4ae17a1a7d37faf6…

Zayn Blore

Palomar Registrypalomar/PALOMAR-2026-11-09-000002Nov 9, 2026math.MGscore 0

A machine-checked proof that an infinite set of points in the Euclidean plane whose pairwise distances are all integers is contained in a line (Anning and Erdős, 1945). Formal Conjectures states it next to the Erdős-Ulam problem on dense rational-distance sets, which is open; its audience is distance problems in discrete geometry. It is the statement erdos_ulam_problem.variants.anning_erdos of Formal Conjectures (ErdosUlamProblem.lean), which marks it research solved. The result is classical and no priority is claimed. The proof follows Erdős's short argument: for three points A, B, C not on…

RepositoryJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-11-09-000002
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-09-000002/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-09-000002/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'