qedbot

Erdős·erdos:1083

Erdős Problem 1083

conjecture formal record: open source: open F3 anchored

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

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

geometry, distances·Source

AI activity

How grades work

No AI contribution recorded against this statement.

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/660712921cf75e22b926536e8430cb613517e3ff/FormalConjectures/ErdosProblems/1083.lean

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

Declared by the projects

1

As each project's formalization.yaml states it.

A Lean 4 formalization of the higher-dimensional Erdős distinct-distances boundcadamcat/distinct-distances-lean4 · joined by anchor · no independent check

Read formalization.yaml

authors
Yao Xu
method
agent
review
agent-reviewed
axioms
Classical.choice, Quot.sound, propext
sorry
0 unproved goals declared
results
1 main results named, checked with Comparator, with an alignment table
sources
The higher-dimensional Erdős distinct-distances conjecture — formalizes, authors not-contacted
divergences
None in the meaning of the statement. Challenge.lean copies Formal Conjectures' definitions verbatim, except that it drops the module-system wrappers. The target strengthens Formal Conjectures' erdos_1083 (an n^(2/d - o(1)) lower bound) to the exact-order two-sided bound with n^(2/d) proved in the paper: a lower bound for every point set and a matching upper bound by grid subsets. The distance count is the cardinality of the off-diagonal distance image; ordered pairs contribute one distance per unordered pair by symmetry of dist, checked in Audit/TargetProbes.lean. A copy of the count written without the definitions is proved equivalent to the target in Audit/IndependentRestatement.lean.
checked by
nobody independent of its authors yet

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 · 0

No proof artifact cited by the formal record.

Also known as · 3
  • https://www.erdosproblems.com/1083
  • https://github.com/google-deepmind/formal-conjectures/blob/main/FormalConjectures/ErdosProblems/1083.lean
  • FormalConjectures/ErdosProblems/1083.lean

Cite this record

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

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