OctoInformBeta

OpenAI preprint, September 2026 · §2. A graph of large distance classes · §2

§2 (setting): Θ, the critical exponent and the fixed parameters: FnF_n and Θ\Theta are nonincreasing, Fn(s)=0F_n(s)=0 for s≥1s\ge 1, and a counterexample to the weak pinned distance theorem gives c<γ<s<s*c<\gamma<s<s_*

Rich pair fractions never increase, and a counterexample fixes exponents.

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. The pinned distance problem of Erdős asks for a point xx of PP from which the other points lie at many distinct distances; a point with few distances is one about which some circles carry many points of PP. The weak form of the question fixes an exponent s>0s>0 and looks at the ordered pairs (x,y)(x,y) of distinct points of PP for which the circle about xx through yy carries at least nsn^s points of PP other than xx. Can such pairs make up a positive share of all n(n−1)n(n-1) ordered pairs, in some nn-point configuration, for arbitrarily large nn?

The library defines the largest share of such pairs over nn-point configurations, the upper limit of this share as n→∞n\to\infty, and the critical exponent, the supremum of the positive exponents at which this upper limit is positive; it states how the share and its upper limit change with the exponent, and which exponents arise when the share does not tend to zero.

Rich Pairs and the Critical Exponent

For a finite set PP in the plane and points xx, yy of the plane, the pinned distance multiplicity kP(x,y)k_P(x,y) is the number of points of PP other than xx on the circle about xx through yy: 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)✦

Let PP be a set of nn points in the plane and ss a real number. An ordered pair (x,y)(x,y) of distinct points of PP is rich at exponent ss when kP(x,y)≥nsk_P(x,y)\ge n^s.✦ The rich pair fraction of PP at exponent ss is the number of its rich ordered pairs divided by n(n−1)n(n-1), the number of ordered pairs of distinct points of PP.✦

Let nn be a natural number and ss a real number. The maximal rich pair fraction Fn(s)F_n(s) is the supremum of the rich pair fraction at exponent ss over all sets of nn points in the plane when n≥2n\ge 2, and 00 when n<2n<2: Fn(s)=sup|P|=n|{(x,y)∈P×P:x≠y,kP(x,y)≥ns}|n(n−1)(n≥2),Fn(s)=0(n<2).F_n(s)=\sup_{|P|=n}\frac{\bigl|\{(x,y)\in P\times P : x\ne y,\ k_P(x,y)\ge n^s\}\bigr|} {n(n-1)}\quad(n\ge 2),\qquad F_n(s)=0\quad(n<2).(2)✦

The function Θ\Theta on the real line assigns to an exponent tt the upper limit of the maximal rich pair fractions at tt: Θ(t)=limsupn→∞Fn(t).\Theta(t)=\limsup_{n\to\infty}F_n(t).(3)✦ The critical exponent s*s_* is the supremum of the positive exponents at which Θ\Theta is positive: s*=sup⁡{t>0:Θ(t)>0}.s_*=\sup\{t>0 : \Theta(t)>0\}.(4)✦

The weak pinned distance theorem is the statement that, for every real number s>0s>0, Fn(s)→0(n→∞).F_n(s)\to 0\qquad(n\to\infty).(5)✦

The Claim

Theorem 1. For every natural number nn, the maximal rich pair fraction FnF_n is nonincreasing, Fn(t)≤Fn(s)for all real s≤t,F_n(t)\le F_n(s)\qquad\text{for all real } s\le t,(6)✦ and it vanishes from exponent one on, Fn(s)=0for all real s≥1.F_n(s)=0\qquad\text{for all real } s\ge 1.(7)✦ The function Θ\Theta is nonincreasing, Θ(t)≤Θ(s)for all real s≤t.\Theta(t)\le\Theta(s)\qquad\text{for all real } s\le t.(8)✦ Suppose there is a real number s0>0s_0>0 at which the weak pinned distance theorem (5) fails, the sequence Fn(s0)F_n(s_0) not tending to 00. Then there are real numbers cc, ss and γ\gamma with 0<c<s*3,max⁡{c,(1−c)s*}<s<s*,c<γ<s,θ=Θ(s)>0,0<c<\frac{s_*}{3},\quad \max\{c,(1-c)s_*\}<s<s_*,\quad c<\gamma<s,\quad \theta=\Theta(s)>0,(9)✦ such that Θ\Theta is continuous at ss.

What Is Checked

The claim is stated over the Euclidean plane ℝ2\mathbb{R}^2, the multiplicity kPk_P of (1), the rich ordered pairs and the maximal rich pair fraction FnF_n of (2), the function Θ\Theta of (3), the critical exponent s*s_* of (4) and the weak pinned distance theorem (5), whose failure is the hypothesis of (9).