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

Exponential decay in two-dimensional classical O(n) models

For every integer n≥3n \ge 3 and every finite β>0\beta > 0, there are constants A=A(n,β)<∞A = A(n, \beta) < \infty and m=m(n,β)>0m = m(n, \beta) > 0 such that, for every finite nearest-neighbor square-lattice subgraph G=(V,E)G = (V, E), every strength array b∈[0,β]Eb \in [0, \beta]^E, and all x,y∈Vx, y \in V, the two-point correlation under the free-boundary O(n)O(n) model satisfies 0≤⟨σx⋅σy⟩G,b(n)≤Aexp⁡(−m∥x−y∥2)0 \le \langle \sigma_x \cdot \sigma_y \rangle_{G,b}^{(n)} \le A \exp(-m\|x - y\|_2).

For ΛL=[−L,L]2∩Z2\Lambda_L = [-L, L]^2 \cap \mathbb{Z}^2 with all nearest-neighbor edges, free boundary conditions, and constant strength β>0\beta > 0, every n≥3n \ge 3 and x∈Z2x \in \mathbb{Z}^2 satisfies lim sup⁡L→∞∣⟨σ0⋅σx⟩ΛL,β(n)∣≤Ae−m∥x∥2\limsup_{L \to \infty} |\langle \sigma_0 \cdot \sigma_x \rangle_{\Lambda_L, \beta}^{(n)}| \le A e^{-m\|x\|_2} with the constants of Theorem 1.1, and every subsequential local weak limit of these laws satisfies the same two-point bound.

For a finite family (fi)i∈I(f_i)_{i \in I} of complex vertex functions vanishing on PP, with ui=dfiu_i = df_i, Tel=∑i∈Iui(e)ui(l)‾T_{el} = \sum_{i \in I} u_i(e)\overline{u_i(l)}, and Q=∑i∈IS(fi,fˉi)Q = \sum_{i \in I} S(f_i, \bar{f}_i), the bilinear form R(Q,Qˉ)R(Q, \bar{Q}) satisfies R(Q,Qˉ)≤Krot(β)∥T∥HS2+β∑i,j∈Imin⁡{∥fi∥∞2∥dfj∥22,∥fj∥∞2∥dfi∥22}R(Q, \bar{Q}) \le K_{\mathrm{rot}}(\beta)\|T\|_{\mathrm{HS}}^2 + \beta \sum_{i,j \in I} \min\{\|f_i\|_\infty^2 \|df_j\|_2^2, \|f_j\|_\infty^2 \|df_i\|_2^2\} where Krot(β)=6β2+4β3/2+βK_{\mathrm{rot}}(\beta) = 6\beta^2 + 4\beta^{3/2} + \beta, with constants independent of the graph, family size, and fixed spins.

For every finite β>0\beta > 0 there is a finite constant CβC_\beta such that, for all N≥2N \ge 2 and all subgraphs G=(V,E)G = (V, E) of the nearest-neighbor graph on the annulus DN={x∈Z2:N≤∥x∥∞≤2N}D_N = \{x \in \mathbb{Z}^2 : N \le \|x\|_\infty \le 2N\} with edge strengths 0≤be≤β0 \le b_e \le \beta and boundary spins sx=exp⁡(tc)s∗s_x = \exp(tc)s_* on ∥x∥∞=N\|x\|_\infty = N and sx=s∗s_x = s_* on ∥x∥∞=2N\|x\|_\infty = 2N, the partition function Z(t)Z(t) satisfies min⁡t∈RZ(t)max⁡t∈RZ(t)≥1−Cβlog⁡N\frac{\min_{t \in \mathbb{R}} Z(t)}{\max_{t \in \mathbb{R}} Z(t)} \ge 1 - \frac{C_\beta}{\log N} and in particular Z(π)Z(0)≥1−Cβlog⁡N\frac{Z(\pi)}{Z(0)} \ge 1 - \frac{C_\beta}{\log N}.

For the three-component free spin law on any finite graph with nonnegative strengths, and bonds sampled by pe=1−e−2Kep_e = 1 - e^{-2K_e}, P(ηe=1∣s)=pe1{τx=τy}\mathbb{P}(\eta_e = 1 \mid s) = p_e \mathbf{1}_{\{\tau_x = \tau_y\}}, pinning any set of spins to s∗=(1,0,0)s_* = (1, 0, 0) cannot decrease the probability of any increasing bond event AA.

For each β<∞\beta < \infty there are numbers pN=pN(β)>0p_N = p_N(\beta) > 0 tending to zero as N→∞N \to \infty such that, for every finite lattice subgraph, every strength array in [0,β][0, \beta], and every list of centers whose closed boxes of sup radius 2N2N are pairwise disjoint, the free probability that all the corresponding annuli are crossed is at most pNp_N to the number of annuli.

For every finite β>0\beta > 0 there are constants A0<∞A_0 < \infty and m0>0m_0 > 0, depending only on β\beta, such that the three-component free bond law on every finite square-lattice subgraph with strengths in [0,β][0, \beta] satisfies P(x↔y)≤A0exp⁡(−m0∥x−y∥2)\mathbb{P}(x \leftrightarrow y) \le A_0 \exp(-m_0\|x - y\|_2) for all x,y∈Vx, y \in V.

Methods

Fourth-order rotation inequality using a noncommuting gauge transformation sxold=exp⁡(−Fx)sxnews_x^{\mathrm{old}} = \exp(-F_x) s_x^{\mathrm{new}} in so(3)\mathfrak{so}(3) and fourth-order cancellation D1234Be=0D_{1234}B_e = 0 for generator pattern (a,b,a,b)(a,b,a,b).

Source excerpts

“Proposition 2.2 (Fourth-order rotation inequality). Let (fi)i∈I be a finite family of complex vertex functions vanishing on P, and put ui = dfi , Tel = ∑ i∈I ui(e)ui(l), Q = ∑ i∈I S(fi , ¯fi).” · Show in paper

“D1234Be = 0 for the generator pattern (a, b, a, b). (2.12)” · Show in paper

Multiscale signed frequency family on a square annulus to bound the boundary twist cost Z(π)/Z(0)Z(\pi)/Z(0) by 1−Oβ(1/log⁡N)1 - O_\beta(1/\log N).

Source excerpts

“fm,±,p(x) = r−3/2 p ϕm,±(x/N) exp ( 2πi p · x 16N ) , 1 ≤ rp ≤ N, ±pm > 0. (3.6)” · Show in paper

Embedded Ising / Wolff reflection cluster representation coupled to Edwards-Sokal bonds, combined with joint FKG association in amplitudes and bond indicators.

Source excerpts

“We now use the embedded Ising representation underlying Wolff’s reflection clusters [19], coupled to bonds as in Edwards–Sokal [6].” · Show in paper

“Lemma 4.4. The joint free law of r and η is associated, with both amplitudes and bond indicators ordered coordinatewise.” · Show in paper

Simultaneous pinning comparison for increasing bond events and coarse-graining / loop-erasure on NN-boxes to deduce exponential decay of connectivity.

Source excerpts

“Proposition 4.5 (Pinning comparison). For the three-component free spin law on any finite graph with nonnegative strengths, and bonds sampled by (4.4), pinning any set of spins to s∗ cannot decrease the probability of any increasing bond event A.” · Show in paper

“Partition Z2 into boxes z + {0, . . . , N − 1}2, with coarse vertices z ∈ NZ2. Suppose 0 and y are joined by an open path and d := ∥y∥∞ > 4N. Recording the visited boxes and erasing loops” · Show in paper

Spherical disintegration / conditioning on n−3n - 3 spin coordinates to reduce O(n)O(n) models (n>3n > 3) to O(3)O(3) models with weakened couplings bxyρxρy∈[0,β]b_{xy}\rho_x\rho_y \in [0, \beta].

Source excerpts

“Lemma 4.8 (Three-component conditional law). Let n > 3, and let σx ∈ Sn−1 have the free Gibbs law (1.1) on a finite graph. Write σx = (ρxsx, vx), with vx ∈ Rn−3, ρx = √ 1 − |vx|2, and sx ∈ S2 whenever ρx > 0. Conditional on (vx)x∈V , the directions (sx)x∈V have exactly the free three-component Gibbs law with strengths bxyρxρy ∈ [0, β].” · Show in paper