Few distinct distances force a thin annulus about the centroid
ProvedEsgk.thin_annulus_sq_of_noFourCocircularLet and let be an injective configuration of points in the plane, with image . Assume that no four points of lie on a common circle. Let be the set of distances with and , and let be the number of distinct distances determined by . Put
If is a real number with , then every index satisfies
A circle about a point of contains at most three other points of , so . The theorem is a stability statement for this bound: when is at most , all points lie in an annulus about the centroid of relative squared width . No hypothesis on collinear points is used.
Formalization Note Here is configCentroid p, is centroidSquaredMass p, is distanceAnnulusRadiusSq p, and is OrderedDistanceValues p, the set of values with , which is the distance set of because is injective. is NumDistances p. "On a common circle" is Mathlib's Cospherical in the Euclidean plane, applied to four-element subsets of .
/- 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_ConfigurationCentroid import Definitions.Def_Esgk_ThinAnnulus open EuclideanGeometry Esgk
namespace Esgk
theorem thin_annulus_sq_of_noFourCocircular {n : ℕ} {p : Config n}
(hp : Function.Injective p)
(hgp4 : ∀ T ⊆ Config.toFinset p, T.card = 4 → ¬Cospherical (SetLike.coe T))
(hn : 0 < n) {δ : ℝ}
(hD : (NumDistances p : ℝ) ≤ (1 / 3 + δ) * (n : ℝ)) :
∀ i, distanceAnnulusRadiusSq p * (1 - 12 * δ - 4 / (n : ℝ)) ≤
dist (p i) (configCentroid p) ^ 2 ∧
dist (p i) (configCentroid p) ^ 2 ≤ distanceAnnulusRadiusSq p := by sorry
end Esgk