Source · Project

Unit-distance counterexample in Lean

Project documentationPublication date Jun 27, 2026
View project ↗

Reading source record 2062b0e6c9770c81e397bfe41148e90b92ca0567. View default cited record →

Overview

The pinned submission proves a positive exponent gain for arbitrarily large finite Euclidean planar point sets.

Public formal source; execution and statement correspondence are separate checks.

Passages

The exact passages cited in OpenMath. Each passage identifies how its wording was recorded.

Passage 1 · OpenMath paraphrasePermalink

src/submission/Submission.lean; ChallengeDeps.lean pair-count definition

The pinned submission proves a positive exponent gain for arbitrarily large finite Euclidean planar point sets.

Replaces an earlier passage. View versioned records →

Passage details

Passage ID: erdos-unit-distances:entry:lean:v2

Source item: lean

Source record: erdos-unit-distances:source:lean:v2

Replaces passage: erdos-unit-distances:entry:lean:v1

Used in

Explicit citations in versioned problem publications. A citation records a use; it does not confer proof or independent verification.

Erdős unit-distance problem →

Problem publication v6

A fixed power gain for infinitely many sizes →

Source assessment

Proved

Formal exponent-gain endpoint reported complete

Exact Euclidean norm and unordered counting; external proof execution.

Source date Jun 27, 2026 · Observed Oct 13, 2026

Problem context · 3 citations

Further reading

Inspect the formal statement, assumptions and reported checks.

Files

Linked manuscripts, code and data. External proof reports, statement correspondence and OpenMath execution are separate checks.

Formal code

Unit-distance Lean submission ↗

No OpenMath execution recorded

Exact proof source inspected. This digest identifies this file only, not a project build, theorem correspondence or independent reproduction.

Resource revision: 2062b0e6c9770c81e397bfe41148e90b92ca0567

File checksum

SHA-256 for this linked file. A matching checksum identifies the same bytes; it does not assess the mathematics.

51e80f264d618539a8ce31fae79ad95814678d081cc7fc952d74e7904b243ab8

Formal declarations

Lean: positive exponent in the Euclidean plane ↗

Complete formal proof reported externally

The finite-set definition counts ordered off-diagonal distance-one pairs and divides by two. The formal theorem uses EuclideanSpace ℝ (Fin 2), not the product sup norm, and proves arbitrarily large sizes. It does not specify δ = 0.014.

Statement match: Linked by OpenMath · independent review separate · checked Oct 13, 2026

Declaration & revision
Submission.erdos_unit_distance_conjecture_false

Commit 2062b0e6c9770c81e397bfe41148e90b92ca0567

Credits

Recorded authorship

plby/Erdos90 project

AI involvement not reported

No specific AI contribution is attributed by this source record.

Versions

OpenMath source records preserve exact citations. Observation dates order these records; they do not establish the latest upstream paper or proof.

  1. 2062b0e6c9770c81e397bfe41148e90b92ca0567 · selectedObserved Oct 13, 2026 · used in current publications

    Unit-distance counterexample in Lean

  2. Unit-distance counterexample in Lean

Record details
Source ID
erdos-unit-distances-lean
Record ID
erdos-unit-distances:source:lean:v2
Recorded title
Unit-distance counterexample in Lean
Revision
2062b0e6c9770c81e397bfe41148e90b92ca0567
Observed
Oct 13, 2026
Source updated
Not recorded
Content SHA-256
Not recorded
Update method
Compare the exact source and publish a new immutable curation revision.
Identifier policy
Stable source identity with exact versioned passages.
Check interval
90 days
Rights
metadata-link
License
Original source license and document rights apply.

OpenMath supplies its own mathematical paraphrases and links; proof text is not republished.

Source terms ↗