Eventually more than distinct distances in general position for every
ProvedEsgk.eventually_numDistances_gt_linear_of_le_refineddiscrete-geometrydistinct-distanceserdos-problem-98
Let be a real number with . Then there is a threshold such that the following holds for every . Let be an injective configuration of points in the plane whose image has no three collinear points and no four points on a common circle, and let be the number of distinct distances between distinct points of . Then
The threshold may depend on , and the conclusion holds for every qualifying configuration of size . This is the eventual, fixed-coefficient form of the bound for . Erdős Problem 98 asks for this conclusion for every real ; the statement here covers the coefficients only.
Formalization Note The threshold is expressed with Filter.atTop on the natural numbers, and is NumDistances p.
Preamble
/- Copyright (c) 2026 Adam McKenna. All rights reserved. Released under Apache 2.0 license as described in the file LICENSE. Authors: Adam McKenna -/ import Definitions.Def_Esgk_Energy import Definitions.Def_Esgk_Foundation import Definitions.Def_Esgk_PlanarGeneralPosition open EuclideanGeometry Esgk
Formal statement
namespace Esgk
theorem eventually_numDistances_gt_linear_of_le_refined
(A : ℝ) (hA : A ≤ 1 / 3 + 1 / 130) :
∀ᶠ n in Filter.atTop,
∀ p : Config n,
Function.Injective p →
InGeneralPosition (Config.toFinset p) →
A * (n : ℝ) < (NumDistances p : ℝ) := by sorry
end EsgkSource
Context: Erdős Problem 98, https://www.erdosproblems.com/98. Lean formalization by Adam McKenna (2026), declaration Esgk.eventually_numDistances_gt_linear_of_le_refined.