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

Finite Instructions and Solenoidal Shear Flows

For a fixed positive computable viscosity ν\nu on the unit flat torus T3\mathbb{T}^3, there is an algorithm taking a deterministic one-tape machine MM with head moves in {−1,0,1}\{-1,0,1\} and a finite input word ww to an effective smooth force fM,wf_{M,w} that is divergence free and mean zero, yields a unique global smooth classical solution (u,p)=(U,0)(u,p) = (U,0) to the Navier-Stokes equations (1) from zero initial velocity with globally bounded mixed derivatives and uniformly bounded kinetic energy, has period one for t≥1t \ge 1 (with the period-one mechanism depending on MM alone) and vanishes near every integer time, and causes the trajectory of the fixed label a∗=(1/8,3/8,1/2)a_* = (1/8, 3/8, 1/2) to enter the fixed open strip O={(x,y,z):1/2<x<1}O = \{(x,y,z) : 1/2 < x < 1\} at a finite time if and only if MM halts on ww (including an initially halted machine).

For any normalized deterministic one-tape machine, there is a finite partial one-head transition table whose destination controls have fixed incoming displacements and whose destination control and written complete symbol determine the preceding control and read complete symbol on its entire allowed domain; initialized with a finite input, head at 00, control SqS_q, frontier at r0≥2r_0 \ge 2, empty history elsewhere, and mark 00, it represents the original configuration at the nnth checkpoint with frontier r0+nr_0+n, reaches the next checkpoint in 2(r0+n−h′)+42(r_0+n-h')+4 local transitions, and reaches a halting checkpoint if and only if the original machine halts.

For λ,h>0\lambda, h > 0 and ∣r∣,∣s∣,∣λr∣,∣s/λ∣≤h|r|, |s|, |\lambda r|, |s/\lambda| \le h, the four shears Y(−λ),X(λ−1−1),Y(1),X(λ−1)Y(-\lambda), X(\lambda^{-1}-1), Y(1), X(\lambda-1) send (r,s)(r,s) to (λr,s/λ)(\lambda r, s/\lambda), and at every intermediate endpoint and throughout every partially completed shear, both coordinates have absolute value at most 2h2h.

Given NN pairs of closed axis-parallel rectangles Pi,QiP_i, Q_i with rational endpoints in the planar chart of TL3\mathbb{T}^3_L satisfying pairwise separation, half-width ≤h\le h, and chart containment assumptions, and a rational coding height z0z_0, there is an effectively constructed smooth velocity VV on R×TL3\mathbb{R} \times \mathbb{T}^3_L that is one-periodic, vanishes near integer times, satisfies div⁡V=0\operatorname{div} V = 0, ∫TL3V=0\int_{\mathbb{T}^3_L} V = 0, and (V⋅∇)V=0(V \cdot \nabla) V = 0, has period map (X,z)↦(Fi(X),z)(X,z) \mapsto (F_i(X), z) on an effectively specified positive neighborhood of each Pi×{z0}P_i \times \{z_0\}, stays within horizontal sup distance 2h2h of pip_i during the four scaling stages, and gives a unique classical solution (V,0)(V,0) to Equation (1) for f=∂tV−νΔVf = \partial_t V - \nu \Delta V.

Under Theorem 3.2, if a branch satisfies pi,1,qi,1≤ap_{i,1}, q_{i,1} \le a (respectively ≥a\ge a), every point starting in Pi×{z0}P_i \times \{z_0\} has first coordinate at most a+2ha+2h (respectively at least a−2ha-2h) throughout the period; if O⊆TL3O \subseteq \mathbb{T}^3_L is open and Qi×{z0}⊆OQ_i \times \{z_0\} \subseteq O, every point starting in Pi×{z0}P_i \times \{z_0\} reaches OO at the integer sample and remains there for a time interval.

The finite families (Pi)(P_i) and (Qi)(Q_i) of source and target rectangles for the recorder branches are separately pairwise positively separated, with gap at least κ/B2\kappa/B^2 in some coordinate for every pair, and have positive rational side lengths at most κ\kappa.

No algorithm decides the fixed-particle hitting event of Theorem 1.1 for every finite force prescription produced by its compiler.

Methods

Construct a finite reversible one-head transition table using a moving history frontier PP, instruction records [r][r], and a temporary return mark m∈{0,1}m \in \{0,1\} so that every destination control has a fixed incoming displacement and determines the preceding control and read symbol.

Source excerpts

“The history symbol E means empty; P is the frontier of the recorded instructions. A complete tape symbol is (a, ℓ, m) ∈ Σ × G × {0, 1}. The bit m marks the position to which the head must return. The symbol [r] plays the role of Bennett’s instruction record [1, Eqs. (9)–(11)]; the frontier and return mark implement the recording with one head.” · Show in paper

Encode two-sided tape configurations into filled closed rectangles in T3\mathbb{T}^3 using odd digits da∈{1,3,…,2m−1}d_a \in \{1, 3, \dots, 2m-1\} in base B=2m+1B = 2m+1 and state squares [cs,cs+κ]×[y0,y0+κ][c_s, c_s + \kappa] \times [y_0, y_0 + \kappa].

Source excerpts

“Let A = Σ × G × {0, 1} be the complete alphabet of Lemma 2.1, and let m = |A|. Give its symbols distinct odd digits da ∈ {1, 3, . . . , 2m − 1} and set B = 2m + 1. Define C(a0a1 · · ·) = X j≥0 dajB−j−1, Ta(v) = da + v B , Ia = Ta([0, 1]).” · Show in paper

Realize reciprocal planar affine maps by seven time-separated smooth velocity fields W1,…,W7W_1, \dots, W_7 using derivative-form cutoffs Ai±,ZiA_i^\pm, Z_i and private heights ziz_i so that div⁡V=0\operatorname{div} V = 0, ∫V=0\int V = 0, and (V⋅∇)V=0(V \cdot \nabla) V = 0.

Source excerpts

“Seven fields. With ex, ey, ez the coordinate unit vectors, define W1 = ez X i (zi − z0)A− i , W2 = ey X i (−λi)Zigxi , W3 = ex X i (λ−1 i − 1)Zigyi , W4 = ey X i Zigxi , W5 = ex X i (λi − 1)Zigyi , W6 = X i Zi (qi − pi, 0), W7 = ez X i (z0 − zi)A+ i .” · Show in paper

Use a smooth one-time loader UloadU_{\text{load}} on 0≤t≤10 \le t \le 1 to transport the fixed particle a∗=(1/8,3/8,1/2)a_* = (1/8, 3/8, 1/2) to the initial rational code Pin=(xin,yin,z0)P_{\text{in}} = (x_{\text{in}}, y_{\text{in}}, z_0) before starting the period-one mechanism VM(t−1)V_M(t-1).

Source excerpts

“Define on 0 ≤ t ≤ 1 Uload(t, x, y, z) = βx(t)(xin − 1/8)Z(z)ex + βy(t)(yin − 3/8)Z(z)ey. (11)” · Show in paper