qedbot

Erdős·erdos:956

Erdős 956

problem formal record: unclassified source: open F2 declared

No independent check recorded yet. A formal artifact, declaration or published object is attached, but no rebuild of it is recorded here.

A Palomar registration names this problem. It is shown below but not counted as a check of the claim.

Fidelity F2: The correspondence is declared through a Comparator challenge, an alignment table and written divergences.

geometry, distances, convex·Source

AI activity

How grades work
Aristotle, GPT-5.5 Pro

27 Apr 2026·with Przemek Chojecki

Candidate full solution

candidate A1 V0 F0
Reasoning and sources

Autonomy

AI collaborating with humans

F2 declared. The correspondence is declared through a Comparator challenge, an alignment table and written divergences.

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

Checks

1
  • verified·Palomar

    Registered by Palomar at 2afe25fe: Comparator confirmed 5 theorems prove the recorded statement within Palomar's axiom policy, replayed through Lean's kernel and the independent nanoda kernel. The project names this problem, which does not establish that it proves the result claimed here, so it is not counted as a check of it

    project registered at a pinned commit·2026-10-04·commit 2afe25fe500b

    PALOMAR-2026-10-04-000008 — names this problem; not counted as a check of the claim

Declared by the projects

1

As each project's formalization.yaml states it.

Erdős 956: unit distances between disjoint convex translateslinrock/math-proofs/erdos-956 · joined by names · 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
Variations on the theme of repeated distances — background, authors not-contacted; The unit-distance problem for convex sets — background, authors not-contacted; Erdős Problem 956 — adapts, authors not-contacted
divergences
None on the formalized statements. The definitions of Plane, translateDistance, IsConfiguration, unitPairs, and h, as well as the superlinear theorem erdos_956, match FormalConjectures/ErdosProblems/956.lean verbatim (with answer(True) elaborated as True). The published 1990 Erdős–Pach O(n^(4/3)) upper bound is not claimed here.
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 · 0

No formal statement located.

Cited proofs · 0

No proof artifact cited by the formal record.

Recorded elsewhere

Compare the registries
  • palomar — Erdős 956: unit distances between disjoint convex translates

    checked·their labels: registered

Also known as · 1
  • https://www.erdosproblems.com/956

Cite this record

qed.bot, “Erdős 956”, https://qed.bot/s/erdos-956, as of 20 Nov 2026.

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