{"id":"palomar/PALOMAR-2026-11-09-000002","url":"https://github.com/zblore/fc-anning-erdos/tree/5b3e4ae17a1a7d37faf639f0ef194f1ef42af3a4","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-11-09-000002-v1.json","repo":"https://github.com/zblore/fc-anning-erdos","tags":["math.MG","math.CO","msc:52C10","msc:51K05"],"score":0,"title":"The Anning-Erdős theorem: an infinite set of points in the plane with integer distances lies on a line","trust":"high","domain":"math.MG","source":"palomar","authors":["Zayn Blore"],"reviews":0,"subject":"math.MG","summary":"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…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-11-09","reactions":{},"formalized":true,"formalizes":[{"title":"Integral distances","identifier":"https://doi.org/10.1090/S0002-9904-1945-08490-0","relationship":"adapts"}]}