Erdős·erdos:958
Erdős Problem 958
Machine-checked by Palomar.
Fidelity F3: The project checks its proof with Comparator against a statement from a corpus written separately from the proof, and held here.
distances, geometry·Source
AI activity
How grades workNew proof found (Lean)
Reasoning and sources
Autonomy
AI building on literature supplied to it
Details
literature: 🟢 Clemen, Dumitrescu, and Liu (2025)
Sources
Clemen, Dumitrescu, and Liu (2025)
Reasoning and sources
Autonomy
Secondary contribution: formalization
Details
proof to formalize: Clemen, Dumitrescu, and Liu (2025)
Sources
Fidelity
How fidelity is gradedF3 anchored. The project checks its proof with Comparator against a statement from a corpus written separately from the proof, and held here.
Checks
1-
verified·Palomar
Registered by Palomar at 08152671: Comparator confirmed 5 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel
Declared by the projects
1As each project's formalization.yaml states it.
Erdős 958: planar point sets with distance multiplicities {1, ..., n - 1}
- authors
- Linmiao Xu
- method
- agent
- review
- agent-reviewed
- axioms
- Classical.choice, Quot.sound, propext
- sorry
- 0 unproved goals declared
- results
- 5 main results named, checked with Comparator, with an alignment table
- sources
- On multiplicities of interpoint distances — formalizes, authors not-contacted; Erdős Problem 958: distance multiplicities {1, ..., n - 1} — background
- related
- google-deepmind/formal-conjectures/blob/0c92ca701538aba00014d1d6444df7954eea3f6d/FormalConjectures/ErdosProblems/958.lean — builds-on; plby/lean-proofs/blob/main/src/latest/ErdosProblems/Erdos958.lean — independent
- divergences
- None. The definitions of distanceSet, distanceMultiplicity, IsEquidistantOnLine, and IsEquidistantOnCircle, as well as the theorem erdos_958, match FormalConjectures/ErdosProblems/958.lean verbatim (with answer(False) elaborated as False).
- checked by
- Palomar
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themFormal material
Formal statements · 1
Recorded elsewhere
Compare the registries- palomar — Erdős 958: planar point sets with distance multiplicities {1, ..., n - 1}
Also known as · 3
- https://www.erdosproblems.com/958
- https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/958.lean
- FormalConjectures/ErdosProblems/958.lean
Cite this record
qed.bot, “Erdős Problem 958”, https://qed.bot/s/erdos-958, as of 20 Nov 2026.