OctoInformBeta

OpenAI preprint, September 2026 · §1. Introduction

Theorem 1.2: Uniform constants for generic planar configurations of every positive size

A power saving across all ranks.

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

A rank switch counts a point pair according to the number of configuration points strictly below its line. Let P:{0,…,n−1}→ℝ2P:\{0,\ldots,n-1\}\to\mathbb R^2 be an indexed nn-point configuration, with P(i)=pi=(xi,yi)P(i)=p_i=(x_i,y_i). Unordered point pairs are indexed by i<ji<j.

For points p=(xp,yp)p=(x_p,y_p), q=(xq,yq)q=(x_q,y_q) and r=(xr,yr)r=(x_r,y_r) in ℝ2\mathbb R^2, the orientation determinant orient⁡(p,q,r)\operatorname{orient}(p,q,r) is the real number given by (1): orient⁡(p,q,r)=(xq−xp)(yr−yp)−(yq−yp)(xr−xp).\operatorname{orient}(p,q,r) =(x_q-x_p)(y_r-y_p)-(y_q-y_p)(x_r-x_p).(1)✦ A configuration PP is in general position if its points are pairwise distinct and orient⁡(pi,pj,pℓ)≠0\operatorname{orient}(p_i,p_j,p_\ell)\ne0 whenever i,j,ℓi,j,\ell are distinct.✦

The slope s(p,q)s(p,q) of points p=(xp,yp)p=(x_p,y_p) and q=(xq,yq)q=(x_q,y_q) in ℝ2\mathbb R^2 is the real number given by (2): s(p,q)=yq−ypxq−xp.s(p,q)=\frac{y_q-y_p}{x_q-x_p}.(2)✦ A generic configuration PP is a configuration in general position whose first coordinates are pairwise distinct, whose unordered point pairs have pairwise distinct slopes, and which satisfies the following segment condition. If the open segments of two distinct point pairs meet at a point zz, then no closed segment of a third point pair contains zz.

For an indexed configuration PP and indices i,j∈{0,…,n−1}i,j\in\{0,\ldots,n-1\}, the below-line count bP(i,j)b_P(i,j) is the number of indices ℓ\ell satisfying the strict inequality in (3): bP(i,j)=#{ℓ∈{0,…,n−1}:yℓ−s(pi,pj)xℓ<yi−s(pi,pj)xi}.b_P(i,j)=\#\bigl\{\ell\in\{0,\ldots,n-1\}: y_\ell-s(p_i,p_j)x_\ell<y_i-s(p_i,p_j)x_i\bigr\}.(3)✦ For an indexed nn-point configuration PP and a nonnegative integer rank kk, the rank-switch count Sk(P)S_k(P) is the point-pair count defined by (4), including zero counts at ranks 00 and nn: Sk(P)={#{(i,j):0≤i<j<n,bP(i,j)=k−1},0<k<n,0,otherwise.S_k(P)= \begin{cases} \#\{(i,j):0\le i<j<n,\ b_P(i,j)=k-1\},&0<k<n,\\ 0,&\text{otherwise}. \end{cases}(4)✦

The Claim

Theorem 1. There exist absolute real constants ε>0\varepsilon>0 and CC with the following property. For every integer n≥1n\ge1, every generic nn-point configuration PP and every integer rank 0≤k≤n0\le k\le n, the bound (5) holds: Sk(P)≤Cn4/3−ε.S_k(P)\le C n^{4/3-\varepsilon}.(5)✦

What Is Checked

The claim is stated over generic indexed configurations in ℝ2\mathbb R^2 with n≥1n\ge1 and integer ranks 0≤k≤n0\le k\le n, using the strict below-line counts in (3) to define Sk(P)S_k(P).