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.

All papers

Claims

Findings

The dyadic case of the Erdős similarity conjecture

For every η∈(0,1)\eta \in (0, 1), there is a compact set Eη⊆[0,1]E_\eta \subseteq [0, 1] with m(Eη)>1−ηm(E_\eta) > 1 - \eta such that for every x∈Rx \in \mathbb{R} and every s∈R∖{0}s \in \mathbb{R} \setminus \{0\}, x+sD⊈Eηx + sD \not\subseteq E_\eta, where D={2−n:n∈N,n≥1}D = \{2^{-n} : n \in \mathbb{N}, n \ge 1\}; thus DD is not measure universal.

For every p∈(0,1)p \in (0, 1), there exists an open 11-periodic set H⊆RH \subseteq \mathbb{R} such that ρ(H)≤6p\rho(H) \le 6p and ∀x∈R ∀t∈[1,2] ∃n∈Z≥1:x+t2−n∈H\forall x \in \mathbb{R} \, \forall t \in [1, 2] \, \exists n \in \mathbb{Z}_{\ge 1} : x + t2^{-n} \in H.

The set GG of stable centers is measurable and 11-periodic, ρ(Gc)<p\rho(G^c) < p, and for every x∈Gx \in G, every window WeW_e, every n∈Wen \in W_e, every t∈[1,2]t \in [1, 2], and every window WfW_f earlier than WeW_e, Jbf(x+t2−n)=Jbf(x)J_{b_f}(x + t2^{-n}) = J_{b_f}(x).

For every fixed x∈Rx \in \mathbb{R}, P(the path of x never chooses child M)=(1−21−M)d<p\mathbb{P}(\text{the path of } x \text{ never chooses child } M) = (1 - 2^{1-M})^d < p.

For every outcome in ξ\xi, every i<Mi < M, every n∈Wein \in W_{e_i}, and every t∈[1,2]t \in [1, 2], the actual root path of yn(t)y_n(t) reaches UU and rejects children 1,…,i−11, \dots, i-1 there; in particular, Qi(yn(t))=1  ⟹  yn(t)∈BQ_i(y_n(t)) = 1 \implies y_n(t) \in B.

For a fixed stable center xx, an atom ξ\xi of Fx\mathcal{F}_x on which the first default node UU exists, and every fixed t∈[1,2]t \in [1, 2], P(Qi(yn(t))=0 for all 1≤i<M,n∈Wei∣ξ)=(1−p/2)(M−1)r\mathbb{P}(Q_i(y_n(t)) = 0 \text{ for all } 1 \le i < M, n \in W_{e_i} \mid \xi) = (1 - p/2)^{(M-1)r}.

For a fixed stable center xx and atom ξ\xi of Fx\mathcal{F}_x on which UU exists, there is a finite set R(x,U)⊂[1,2]\mathcal{R}(x, U) \subset [1, 2] depending only on x,Ux, U and the deterministic windows, with ∣R(x,U)∣≤20Mr(1+22r+2)|\mathcal{R}(x, U)| \le 20Mr(1 + 2^{2r+2}), such that for every realization of the tables consistent with ξ\xi and each t∈[1,2]t \in [1, 2], some t′∈R(x,U)t' \in \mathcal{R}(x, U) satisfies Qi(x+t2−n)=Qi(x+t′2−n)Q_i(x + t2^{-n}) = Q_i(x + t'2^{-n}) for all 1≤i<M1 \le i < M and n∈Wein \in W_{e_i}.

For every fixed stable center xx, P(∃t∈[1,2] ∀n∈N:x+t2−n∉B)≤2p\mathbb{P}(\exists t \in [1, 2] \, \forall n \in \mathcal{N} : x + t2^{-n} \notin B) \le 2p.

Methods

Separated dyadic index windows assigned in preorder to edges of a complete ordered tree of height d and branching factor M, with gaps g between consecutive windows and bottom-up window lengths r_h = max{r_*, g + σh−1σ_{h-1}}.

Source excerpts

“Starting with σ0 = 0, define successively for h = 1, . . . , d rh = max{r∗, g + σh−1}, σh = Mr1 + (M − 1)g if h = 1, M(rh + g + σh−1) + (M − 1)g if h ≥ 2. (4)” · Show in paper

Random routing tree with independent Bernoulli(1/2) selector tables on non-default edges and independent Bernoulli(p) terminal tables on leaves, evaluated on nested periodic dyadic cell keys J_b(z) = ⌊2^{b+2}{z}⌋.

Source excerpts

“At an internal node P, choose the first child Pi, i < M, for which S(P,i)(Jb(P,i)(z)) = 1. If all M − 1 values are zero, choose the default child PM. Continue until reaching a leaf, denoted by L(z), and define B = {z ∈ R : TL(z)(Jb(L(z))(z)) = 1}. (10)” · Show in paper

Two-stage conditioning: first on the center-exposure sigma-field F_x to fix the first default node U, and then on all selector tables S to establish independence of terminal bits.

Source excerpts

“For a fixed center x ∈ R, expose one entry from every selector table, including those in subtrees not visited by its path. The resulting sigma-field is Fx = σ(Se(Jbe(x)) : e = (P, i), i < M) ⊆ S. (12)” · Show in paper

Scale discretization at a fixed center and first-default node by collecting all grid-boundary crossings Di,nD_{i,n}(x) of Jbi∗J_{b_i^*} for t ∈ [1, 2] together with interval midpoints.

Source excerpts

“For each tested pair (i, n), let Di,n(x) = {2n(j2−(b∗i +2) − x) : j ∈ Z} ∩ [1, 2].” · Show in paper

Open-neighborhood repair of the closed exceptional-center set R using the dyadic tail, followed by dyadic rescaling and reflection of periodic hitting sets with summable densities.

Source excerpts

“Continuity of finite measure from above lets us choose ε > 0 so that the open periodic lift V = π−1(VTε ) satisfies R ⊆ V, ρ(V ) ≤ ρ(R) + p. Set H = B+ ∪ V .” · Show in paper

“Define C = ⋃_{j≥1} (2−jHj ∪ (−2−jHj)), E = [0, 1] \ C.” · Show in paper