By OpenAISourceGitHub

Manuscripts from openai/math

Fork
Clone
git clone https://openversions.com/git/index/openai-math.git
Cite
Version link
https://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2f
Version identifier (commit hash)
dfd8c46870b48511e697cbb43a3c8c91d375fa2f

Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.

Latest version

Checks complete

Sync OpenAI Math manuscripts from 4eaee87548250b2682affda7d05d947c05554bae

Committed

All papers

Claims

Findings

The weak pinned planar distance theorem

For every fixed ε>0\varepsilon > 0, all but o(n)o(n) points of any nn-point planar set determine at least n1−εn^{1-\varepsilon} distinct nonzero distances.

For every fixed s>0s > 0, Fn(s)→0F_n(s) \to 0 as n→∞n \to \infty, uniformly over all nn-point planar configurations P⊂R2P \subset \mathbb{R}^2.

Assuming Theorem 1.1 fails, there exists a sequence of finite sets P⊂R2P \subset \mathbb{R}^2 of real algebraic points with n=∣P∣→∞n = |P| \to \infty and nonempty directed graphs EE on PP with edge densities dn→θd_n \to \theta, fiber sizes ke≥ns−o(1)k_e \ge n^{s-o(1)}, marginal bounds q≤B0πq \le B_0 \pi, qX,qY≤B0αq_X, q_Y \le B_0 \alpha, (qX+qY)/2≥(1−o(1))α(q_X + q_Y)/2 \ge (1-o(1))\alpha, small-indegree bound qY{y:d−(y)<nγ}=O(nγ−1)=o(1)q_Y\{y : d^-(y) < n^\gamma\} = O(n^{\gamma-1}) = o(1), and the subset overlap bound (2.4).

For distinct points x≠yx \ne y in PP, the expected total overlap after giant-cell removal satisfies the exact additive identity L∗(x,y)=b∗+S∗(x)+S∗(y)L^*(x,y) = b_* + S^*(x) + S^*(y), where b∗=2κ−⟨M1+M2⟩b_* = 2\kappa - \langle M_1 + M_2 \rangle.

The contribution of small cells of size at most n1−cn^{1-c} to the off-diagonal overlap scale satisfies W2,sm=o(W+1)W_{2,\mathrm{sm}} = o(W + 1).

For any finite family F\mathcal{F} of uniform probability measures ν\nu on subsets B⊂PB \subset P of size k≥nγk \ge n^\gamma with EFν≤Mα\mathbb{E}_{\mathcal{F}} \nu \le M\alpha, the integrated variance satisfies I(EF[(p−a)21{m>n1−c}+p21{m≤n1−c, p≥2/k}])≤CM(nc−γW2+W2,sm)=o(W+1)\mathcal{I}(\mathbb{E}_{\mathcal{F}}[(p-a)^2 \mathbf{1}_{\{m > n^{1-c}\}} + p^2 \mathbf{1}_{\{m \le n^{1-c},\, p \ge 2/k\}}]) \le C_M (n^{c-\gamma} W_2 + W_{2,\mathrm{sm}}) = o(W + 1).

No subsequence of the counterexample configurations can have W→∞W \to \infty.

No subsequence of the counterexample configurations can have WW bounded.

Methods

Transfer for real closed fields to replace an arbitrary finite planar configuration by one with real algebraic coordinates while preserving all distance equalities and disequalities.

Source excerpts

“Their existential sentence holds over R and therefore over the real algebraic numbers, by transfer for real closed fields [9, Theorems 3.1 and 4.1]. The resulting points are distinct and retain the exact distance equality pattern.” · Show in paper

Factorization of squared Euclidean distance into two linear coordinate maps Z1(x)=u+ibZ_1(x) = u + ib and Z2(x)=u−ibZ_2(x) = u - ib combined with the normalized product formula across all places of a number field.

Source excerpts

“For distinct x, y the squared distance factors in K as t(x, y) = (Z1(y) − Z1(x))(Z2(y) − Z2(x)). (3.1)” · Show in paper

Randomly shifted and rotated nested square grids at archimedean places with pair-independent mean additive depth error, combined with giant-cell complementation to obtain an exact additive overlap identity.

Source excerpts

“Independently of all vertex and fiber sampling, choose independently a uniformly random orientation and ξ uniform on [0, log 2). The grid side lengths are lm = eξ2m, m ∈ Z.” · Show in paper

“Call a cell a giant if its size exceeds n/2, and denote the unique such cell, when it exists, by Gj(r). Replace that cell by its complement and keep all other cells.” · Show in paper

Off-diagonal signed pair-measure comparison PB−2RB+πP_B - 2R_B + \pi integrated against the additive overlap kernel L∗L^* to bound cell-mass variance without singleton-tail divergence.

Source excerpts

“Thus the signed measure PB − 2RB + π has total mass zero. Its first and second marginals are α − ν and ν − α, respectively, so their sum is zero. The additive overlap identity (3.6) gives I(PB(C2) − 2RB(C2) + π(C2)) = 0. (5.3)” · Show in paper

Finite-tree optimal transport formula for cut distances induced by nested partitions to replace fiber-conditioned vertices with independent uniform vertices.

Source excerpts

“The tree transport formula is Tj(ρ, α) = ∑ B̸=P lj(B)|ρ(B) − α(B)| = ∫ R ∑ B∈Πj(r) w(α(B))|ρ(B) − α(B)| dr. (6.12)” · Show in paper