OctoInformBeta

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

§1 (setting): distance sets, fiber sizes and F_n(s): Fiber sizes kP(x,y)k_P(x,y) and distance sets Dx(P)D_x(P), with suprema Fn(s)F_n(s) and Bn(ε)B_n(\varepsilon) of rich pair and bad pin fractions over nn-point sets

Rich pairs and bad pins of planar point 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

Take nn points in the plane and pin one of them, xx. The other points sit on circles centered at xx, one circle for each distance that xx sees. Erdős’s pinned distance problem asks whether every configuration has a pin that sees nearly nn distinct distances.

Two shares of a configuration bear on this: the share of ordered pairs (x,y)(x,y) for which the circle about xx through yy carries many points, and the share of pins that see few distances. The library defines both, with “many” and “few” measured against powers of nn, and takes the supremum of each over all nn-point configurations.

The Definition

Definition 1. The plane ℝ2\mathbb{R}^2 is the space of pairs x=(x1,x2)x = (x_1, x_2) of real numbers with the Euclidean distance ∥y−x∥=(y1−x1)2+(y2−x2)2,x,y∈ℝ2.\|y - x\| = \sqrt{(y_1 - x_1)^2 + (y_2 - x_2)^2}, \qquad x, y \in \mathbb{R}^2.(1)✦ A configuration is a finite set P⊂ℝ2P \subset \mathbb{R}^2, and n=|P|n = |P| throughout.

For points xx and yy of the plane, the distance fiber CP(x,y)C_P(x,y) of yy about xx in PP is the set of points of PP other than xx whose distance from xx is ∥y−x∥\|y - x\|: CP(x,y)={z∈P\{x}:∥z−x∥=∥y−x∥}.C_P(x,y) = \{\, z \in P \setminus \{x\} : \|z - x\| = \|y - x\| \,\}.(2)✦ The fiber size kP(x,y)k_P(x,y) is the number of points of CP(x,y)C_P(x,y): kP(x,y)=|CP(x,y)|.k_P(x,y) = |C_P(x,y)|.(3)✦

For a real number ss, the set RP(s)R_P(s) of rich pairs of PP is the set of ordered pairs of distinct points of PP whose distance fiber has at least nsn^s points: RP(s)={(x,y)∈P×P:x≠y,kP(x,y)≥ns}.R_P(s) = \{\, (x,y) \in P \times P : x \neq y,\ k_P(x,y) \ge n^s \,\}.(4)✦ The rich pair fraction fP(s)f_P(s) of PP is the number of rich pairs divided by the number n(n−1)n(n-1) of ordered pairs of distinct points: fP(s)=|RP(s)|n(n−1).f_P(s) = \frac{|R_P(s)|}{n(n-1)}.(5)✦ For a natural number nn and a real number ss, the maximal rich pair fraction Fn(s)F_n(s) is the supremum of fP(s)f_P(s) over the nn-point configurations when n≥2n \ge 2, and 00 when n<2n < 2: Fn(s)={sup⁡{fP(s):P⊂ℝ2,|P|=n},n≥2,0,n<2.F_n(s) = \begin{cases} \sup\{\, f_P(s) : P \subset \mathbb{R}^2,\ |P| = n \,\}, & n \ge 2,\\ 0, & n < 2. \end{cases}(6)✦

For a point xx of the plane, the distance set Dx(P)D_x(P) is the set of distances from xx to the points of PP other than xx: Dx(P)={∥y−x∥:y∈P\{x}}.D_x(P) = \{\, \|y - x\| : y \in P \setminus \{x\} \,\}.(7)✦ For a real number ε\varepsilon, the set BadP(ε)\mathrm{Bad}_P(\varepsilon) of bad pins of PP is the set of points x∈Px \in P whose distance set has fewer than n1−εn^{1-\varepsilon} elements: BadP(ε)={x∈P:|Dx(P)|<n1−ε}.\mathrm{Bad}_P(\varepsilon) = \{\, x \in P : |D_x(P)| < n^{1-\varepsilon} \,\}.(8)✦ The bad pin fraction bP(ε)b_P(\varepsilon) of PP is the number of bad pins divided by the number nn of points: bP(ε)=|BadP(ε)|n.b_P(\varepsilon) = \frac{|\mathrm{Bad}_P(\varepsilon)|}{n}.(9)✦ For a natural number nn and a real number ε\varepsilon, the maximal bad pin fraction Bn(ε)B_n(\varepsilon) is the supremum of bP(ε)b_P(\varepsilon) over the nn-point configurations when n≥1n \ge 1, and 00 when n=0n = 0: Bn(ε)={sup⁡{bP(ε):P⊂ℝ2,|P|=n},n≥1,0,n=0.B_n(\varepsilon) = \begin{cases} \sup\{\, b_P(\varepsilon) : P \subset \mathbb{R}^2,\ |P| = n \,\}, & n \ge 1,\\ 0, & n = 0. \end{cases}(10)✦

In the paper, the definitions read: for a finite set P⊂ℝ2P \subset \mathbb{R}^2 and x∈Px \in P, Dx(P)={∥y−x∥:y∈P\{x}}D_x(P) = \{\|y - x\| : y \in P \setminus \{x\}\}; for distinct x,y∈Px, y \in P, kP(x,y)=|{z∈P\{x}:∥z−x∥=∥y−x∥}|k_P(x,y) = |\{z \in P \setminus \{x\} : \|z - x\| = \|y - x\|\}|; and for n≥2n \ge 2 and s>0s > 0, Fn(s)F_n(s) is the supremum over nn-point sets PP of |{(x,y):x≠y,kP(x,y)≥ns}|/(n(n−1))|\{(x,y) : x \neq y,\ k_P(x,y) \ge n^s\}| / (n(n-1)).

What Is Checked

The definitions are stated over finite sets PP of points of the Euclidean plane (1), over arbitrary points xx and yy of the plane for the distance fiber and the distance set, and over every natural number nn and all real ss and ε\varepsilon for Fn(s)F_n(s) and Bn(ε)B_n(\varepsilon).