Erdős problem 655
Let be such that no circle whose centre is one of the contains three other points. Are there at least distinct distances determined between the , for some constant and all sufficiently large?
Sources
FormalConjectures/ErdosProblems/
655.lean
Let be such that no circle whose centre is one of the contains three other points. Are there at least distinct distances determined between the , for some constant and all sufficiently large?
The answer is no: as Zach Hunter observed, the regular n-gon (n points equally spaced on a circle) is valid and determines only ⌊n/2⌋ < (1+c)n/2 distinct distances, for every c > 0. (In the spirit of related conjectures of Erdős and others, presumably some kind of assumption that the points are in general position was intended; see erdos_655.variants.general_position.)
The disproof — the regular n-gon construction together with its supporting lemmas — is formalised at the linked commit.
False ↔ ∃ c > 0, ∀ᶠ (n : ℕ) in Filter.atTop, ∀ (X : Finset (EuclideanSpace ℝ (Fin 2))), X.card = n → Erdos655.IsValid X → (1 + c) * ↑n / 2 ≤ ↑(EuclideanGeometry.distinctDistances X)