OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction · §1

Theorem 1.1 [Uniform vanishing of large distance fibers]: For s>0s>0, the largest fraction of ordered pairs with at least nsn^s points on their circle tends to 00 as n→∞n\to\infty

Rich pinned distance pairs are rare in large planar sets.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Let PP be a set of nn points in the Euclidean plane ℝ2\mathbb{R}^2, with the Euclidean distance ∥y−x∥\|y-x\|. Erdős’s pinned distance problem looks for a point xx of PP that determines many distinct distances to the other points; a point that determines few has circles centered at it that carry many points of PP. Fix an exponent s>0s>0. How many of the n(n−1)n(n-1) ordered pairs (x,y)(x,y) of distinct points of PP can be rich, that is, have at least nsn^s points of PP other than xx on the circle centered at xx through yy, once nn is large? The set PP is arbitrary: its points need not be in general position or separated from one another.

Rich Pairs and Their Fraction

Fix a finite set PP of points of the plane and write n=|P|n=|P|. The distance fiber of an ordered pair (x,y)(x,y) of points of the plane in PP is the set of points of PP other than xx whose distance from xx is ∥y−x∥\|y-x\|.✦ The pinned distance multiplicity kP(x,y)k_P(x,y) of (x,y)(x,y) in PP is the number of points in the distance fiber of (x,y)(x,y) in PP: kP(x,y)=|{z∈P\{x}:∥z−x∥=∥y−x∥}|.k_P(x,y) = \bigl|\{\, z \in P\setminus\{x\} : \|z-x\| = \|y-x\| \,\}\bigr|.(1)✦

For a real number ss, the set Rs(P)R_s(P) of ss-rich ordered pairs of PP is the set of ordered pairs of distinct points of PP whose multiplicity is at least nsn^s: Rs(P)={(x,y)∈P×P:x≠y,kP(x,y)≥ns}.R_s(P) = \{\, (x,y) \in P\times P : x\neq y,\ k_P(x,y) \ge n^s \,\}.(2)✦

The rich pair fraction fs(P)f_s(P) of PP at exponent ss is the share of ss-rich pairs among the n(n−1)n(n-1) ordered pairs of distinct points of PP: fs(P)=|Rs(P)|n(n−1).f_s(P) = \frac{|R_s(P)|}{n(n-1)}.(3)✦

For a natural number nn and a real number ss, the maximal rich pair fraction Fn(s)F_n(s) is the supremum of fs(P)f_s(P) over the sets PP of nn points of the plane when n≥2n\ge 2, and 00 when n<2n<2: Fn(s)={sup⁡{fs(P):P⊂ℝ2,|P|=n}if n≥2,0if n<2.F_n(s) = \begin{cases} \sup\{\, f_s(P) : P\subset\mathbb{R}^2,\ |P| = n \,\} & \text{if } n\ge 2,\\ 0 & \text{if } n<2. \end{cases}(4)✦

The Claim

Theorem 1 (Weak pinned distance theorem). Let ss be a positive real number and let ε>0\varepsilon>0. Then there is a natural number NN such that every set PP of n≥Nn\ge N points of the plane has rich pair fraction at most ε\varepsilon: fs(P)≤ε.f_s(P) \le \varepsilon.(5)✦ Equivalently, the maximal rich pair fraction at exponent ss tends to zero as the number of points grows: limn→∞Fn(s)=0.\lim_{n\to\infty} F_n(s) = 0.(6)✦

What Is Checked

The claim is stated over finite sets of points of the Euclidean plane ℝ2\mathbb{R}^2, through the pinned distance multiplicity kP(x,y)k_P(x,y) of (1), the ss-rich ordered pairs of (2), the rich pair fraction of (3) and its supremum Fn(s)F_n(s) over sets of nn points, (4).