qedbot

Erdős·erdos:958

Erdős Problem 958

problem formal record: solved source: disproved (Lean) F3 anchored

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 work
Aristotle

27 Dec 2025

New proof found (Lean)

full A2 V2
Reasoning and sources

Autonomy

AI building on literature supplied to it

Details

literature: 🟢 Clemen, Dumitrescu, and Liu (2025)

Seed Prover 1.5

19 Dec 2025·supporting task

Clemen, Dumitrescu, and Liu (2025)

full A1 V1
Reasoning and sources

Autonomy

Secondary contribution: formalization

Details

proof to formalize: Clemen, Dumitrescu, and Liu (2025)

F3 anchored. The project checks its proof with Comparator against a statement from a corpus written separately from the proof, and held here.

Anchored to google-deepmind/formal-conjectures/blob/0c92ca701538aba00014d1d6444df7954eea3f6d/FormalConjectures/ErdosProblems/958.lean

declares divergences from its source reviewed by an agent source authors not contacted

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

    project registered at a pinned commit·2026-10-05·commit 08152671ab39

    PALOMAR-2026-10-05-000004

Declared by the projects

1

As each project's formalization.yaml states it.

Erdős 958: planar point sets with distance multiplicities {1, ..., n - 1}linrock/math-proofs/erdos-958 · joined by anchor · Palomar

Read formalization.yaml

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
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 discussion

Discussion and bounties for this problem load here.

Something wrong or missing here? Request a correction or add a claim, with its sources.

Formal material

Formal statements · 1
Cited proofs · 1

Recorded elsewhere

Compare the registries
  • palomar — Erdős 958: planar point sets with distance multiplicities {1, ..., n - 1}

    checked·their labels: registered

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.

This record as plain text, with each claim, its grades and its sources.