The weak pinned planar distance theorem
For every fixed , all but points of any -point planar set determine at least distinct nonzero distances.
The deduction of the headline result from Theorem 1.1 in Corollary 1.2 is elementary and complete, and the proof of Theorem 1.1 across Sections 2–7 is rigorous.
“We prove the weak pinned Erdős distinct-distance conjecture. For every fixed ε > 0, all but o(n) points of any n-point planar set determine at least distinct nonzero distances.” · Show in paper