OctoInformBeta

OpenAI preprint, September 2026 · §5. Relaying between neighboring cubes

Lemma 5.1: Finite-scale hypotheses control the probability of missing the next inner cube

Relaying an external cluster between neighboring cubes.

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

An open cluster in a finite part of ℤ3\mathbb Z^3 may reach the inner cube of one coarse cube while missing the inner cube of its neighbor. The relay estimate concerns this event when the source lies outside both larger cubes and their internal percolation variables have a common density.

The vertices of ℤ3\mathbb Z^3 are integer triples, with coordinates indexed by j=0,1,2j=0,1,2. Write eje_j for the jjth unit vector, so the positive coordinate step from xx is x+ejx+e_j.✦ Nearest-neighbor vertices differ by such a step in either order.✦ A lattice bond (x,j)(x,j) is the edge with endpoints xx and x+ejx+e_j; bond endpoint incidence allows these endpoints in either order.

Fix a model MM, either bond or site percolation.✦ A percolation variable is a lattice bond in the bond model and a vertex in the site model.✦ A configuration ω\omega assigns an open or closed state to each variable.✦ Open bond adjacency means nearest-neighbor adjacency across an open bond.✦ Open site adjacency means nearest-neighbor adjacency with both vertices open.✦ A vertex is available unconditionally in the bond model and precisely when it is open in the site model.✦

A finite lattice subgraph GG consists of a finite vertex set V(G)V(G) and a finite set of lattice bonds, each with both endpoints in V(G)V(G).✦ Its underlying simple graph joins the endpoints of its bonds.✦ Open bond connectivity in GG is connectivity by a finite path of its open bonds, allowing length zero.✦ Open site connectivity on a graph is connectivity by a finite path of open vertices; length zero also requires an open vertex.✦ In GG, the sites inherit their states from ω\omega, and successive vertices must be adjacent in its underlying graph. For a source vertex oo and a target set TT of lattice vertices, the source cluster and target connection event in this finite graph are given by (1): CG(o)={y∈V(G):o↔Gy},{o↔GT}={ω:CG(o)∩T≠⌀}.C_G(o)=\{y\in V(G):o\longleftrightarrow_G y\}, \qquad \{o\longleftrightarrow_G T\}=\{\omega:C_G(o)\cap T\ne\varnothing\}.(1)

For opening probabilities π(e)∈[0,1]\pi(e)\in[0,1], let ℙπ\mathbb P_\pi be the independent Bernoulli product measure with those probabilities; ℙq\mathbb P_q denotes the constant assignment qq.✦ An internal variable of a region D⊆ℤ3D\subseteq\mathbb Z^3 is a bond with both endpoints in DD in the bond model, or a site in DD in the site model.✦ An opening-probability assignment π\pi has uniform density qq on a region D⊆ℤ3D\subseteq\mathbb Z^3 when π(e)=q\pi(e)=q for every internal variable of DD.✦ The graph GG contains the induced lattice subgraph on DD when every vertex of DD and every lattice bond with both endpoints in DD belong to GG.✦

Cubes and Scale Parameters

A lattice box is the set of integer vertices between lower and upper corners ordered coordinatewise, including their boundary.✦ Its box variables are its internal percolation variables. The cube Λn(u)\Lambda_n(u) of coordinate radius n≥0n\ge0 centered at u∈ℤ3u\in\mathbb Z^3 is the set of lattice vertices in (2); the same formula defines Λs(u)\Lambda_s(u) for integer ss: Λn(u)={x∈ℤ3:|xj−uj|≤n for j=0,1,2}.\Lambda_n(u)=\{x\in\mathbb Z^3:|x_j-u_j|\le n\text{ for }j=0,1,2\}.(2) For a nonnegative integer radius mm, the seed variable count N=NM(m)N=N_M(m) is the number of box variables in Λm(0)\Lambda_m(0).

For a,s∈ℤa,s\in\mathbb Z and a sign σ∈{−1,1}\sigma\in\{-1,1\}, the directed lattice interval Ia,sσI^\sigma_{a,s} is the set of integers bb satisfying a≤b≤a+sa\le b\le a+s when σ=1\sigma=1, and a−s≤b≤aa-s\le b\le a when σ=−1\sigma=-1.✦ A quarter-face index (h,σ)(h,\sigma) is a pair consisting of a coordinate h∈{0,1,2}h\in\{0,1,2\} and a sign vector σ∈{−1,1}3\sigma\in\{-1,1\}^3.✦ The quarter-face F(u,s;h,σ)F(u,s;h,\sigma) with center u∈ℤ3u\in\mathbb Z^3, integer radius ss, and quarter-face index (h,σ)(h,\sigma) is the set in (3): F(u,s;h,σ)={x∈ℤ3:xh=uh+σhs,xj∈Iuj,sσj for j≠h}.F(u,s;h,\sigma)= \{x\in\mathbb Z^3:x_h=u_h+\sigma_h s,\quad x_j\in I^{\sigma_j}_{u_j,s}\text{ for }j\ne h\}.(3)✦ There are 2424 signed-coordinate quarter-faces, and their boundary overlaps are permitted.

Restricted open adjacency in a region DD requires open lattice adjacency and both endpoints in DD.✦ The confined seed connection event E(u,a,b;T)E(u,a,b;T) for a center u∈ℤ3u\in\mathbb Z^3, nonnegative integer radii a,ba,b, and a target set TT of lattice vertices is the set of configurations with an available x∈Λa(u)x\in\Lambda_a(u) and a y∈Ty\in T joined by a finite path, possibly of length zero, of open lattice adjacency restricted to Λb(u)\Lambda_b(u).✦

Renormalization scale data for MM consist of densities 0<p<10<p<1 and p/2<q<pp/2<q<p, error allowances δ,η,τ,γ∈(0,1)\delta,\eta,\tau,\gamma\in(0,1), positive integers m,Km,K, and nonnegative integers R,rR,r, satisfying the budgets and separation conditions in (4): m<R,100(R+1)<r,ε=12(1100)7,δ+52ηδ<ε,τ<η4,γ<δ,2γτ<η4,4K(p/2)N+1<η4,1(1−p)K(8m+5)3(R−m)<η4.\begin{gathered} m<R,\qquad 100(R+1)<r,\qquad \varepsilon=\tfrac12(\tfrac1{100})^7,\qquad \delta+\frac{52\eta}{\delta}<\varepsilon,\\ \tau<\frac\eta4,\qquad \gamma<\delta,\qquad \frac{2\gamma}{\tau}<\frac\eta4,\qquad \frac{4}{K(p/2)^{N+1}}<\frac\eta4,\\ \frac{1}{(1-p)^{K(8m+5)^3}(R-m)}<\frac\eta4. \end{gathered}(4) Here ε\varepsilon is the contour error tolerance. The quarter-face requirement on these data is (5), for every center uu, every quarter-face index (h,σ)(h,\sigma), and each indicated radius: ℙq(E(u,m,n;F(u,n;h,σ)))>1−γ,n∈{2r,2r+1,10r}.\mathbb P_q\bigl(E(u,m,n;F(u,n;h,\sigma))\bigr)>1-\gamma, \qquad n\in\{2r,2r+1,10r\}.(5)

The Coarse Cubes and Relay Route

The coarse lattice is ℤ2\mathbb Z^2. Its four directions d=0,1,2,3d=0,1,2,3 have outward steps ad=(0,−1),(1,0),(0,1),(−1,0)a_d=(0,-1),(1,0),(0,1),(-1,0), respectively. For coarse vertices v,w∈ℤ2v,w\in\mathbb Z^2, the coarse embedding, inner cubes, surrounding cubes, and pair regions are defined by (6): cv=((20r+1)v1,(20r+1)v2,0),v=(v1,v2)∈ℤ2,Bv=Λ4r(cv),Qv=Λ10r(cv),Hv,w=Qv∪Qw.\begin{gathered} c_v=((20r+1)v_1,(20r+1)v_2,0),\qquad v=(v_1,v_2)\in\mathbb Z^2,\\ B_v=\Lambda_{4r}(c_v),\qquad Q_v=\Lambda_{10r}(c_v),\qquad H_{v,w}=Q_v\cup Q_w. \end{gathered}(6)

For integer vectors c,wc,w, the rectangular region ℬ(c,w)\mathcal B(c,w) and its RR-expansion are the sets in (7): ℬ(c,w)={x∈ℤ3:|xj−cj|≤wj for all j},ℬ(c,w)(R)=ℬ(c,w+R(1,1,1)).\mathcal B(c,w)=\{x\in\mathbb Z^3:|x_j-c_j|\le w_j\text{ for all }j\}, \qquad \mathcal B(c,w)^{(R)}=\mathcal B(c,w+R(1,1,1)).(7) The relay prism DrD_r is the lattice region in (8): Dr={x∈ℤ3:−10r≤x0≤30r+1,|x1|,|x2|≤10r}.D_r=\{x\in\mathbb Z^3:-10r\le x_0\le30r+1,\quad |x_1|,|x_2|\le10r\}.(8)✦ A signed lattice symmetry SS of ℤ3\mathbb Z^3 is a bijection obtained from a coordinate permutation ρ\rho, signs ϵj∈{−1,1}\epsilon_j\in\{-1,1\}, and a translation tt, acting by (Sx)j=tj+ϵjxρ(j)(Sx)_j=t_j+\epsilon_jx_{\rho(j)}.

Write a(t)=(t,0,0)a(t)=(t,0,0) for an axial lattice point.✦ For integers r,Rr,R, the contracting half-widths ktk_t, route centers cic_i, route half-widths wiw_i, and route boxes PiP_i, with t,it,i nonnegative integers, are defined by (9): kt(j)={2r+tR,j<t,4r+tR,j≥t,ci={0,i≤3,a(2r(i−3)),4≤i≤12,a(20r+1),i≥13,wi={ki,i≤3,(2r+iR)(1,1,1),i>3,Pi=ℬ(ci,wi).\begin{gathered} k_t(j)= \begin{cases}2r+tR,&j<t,\\4r+tR,&j\ge t,\end{cases} \qquad c_i= \begin{cases} 0,&i\le3,\\ a(2r(i-3)),&4\le i\le12,\\ a(20r+1),&i\ge13, \end{cases}\\ w_i= \begin{cases}k_i,&i\le3,\\(2r+iR)(1,1,1),&i>3,\end{cases} \qquad P_i=\mathcal B(c_i,w_i). \end{gathered}(9) A rectangle ℬ(c,w)\mathcal B(c,w) has a quarter-face interface with a target set TT in DrD_r, denoted ℐr,R(c,w;T)\mathcal I_{r,R}(c,w;T), when the condition in (10) holds: ℐr,R(c,w;T)⇔for every u∈ℬ(c,w)(R) there exist s,h,σ withs∈{2r,2r+1,10r},Λs(u)⊆Dr,F(u,s;h,σ)⊆T.\begin{split} \mathcal I_{r,R}(c,w;T)\quad\Longleftrightarrow\quad &\text{for every }u\in\mathcal B(c,w)^{(R)}\text{ there exist }s,h,\sigma\text{ with}\\ &s\in\{2r,2r+1,10r\},\qquad \Lambda_s(u)\subseteq D_r,\qquad F(u,s;h,\sigma)\subseteq T. \end{split}(10)✦

The Claim

Theorem 1 (Neighboring cube relay). Fix either model and renormalization scale data as above. Let GG be a finite lattice subgraph, let π\pi assign opening probabilities to the percolation variables of MM, and take v∈ℤ2v\in\mathbb Z^2 and a direction dd. Suppose GG contains the induced lattice subgraph on Hv,v+adH_{v,v+a_d}, that π\pi has uniform density qq there, and that o∈V(G)o\in V(G) lies outside this pair region. The neighboring relay bound is (11): ℙπ(CG(o)∩Bv≠⌀,CG(o)∩Bv+ad=⌀)≤13η.\mathbb P_\pi\bigl(C_G(o)\cap B_v\ne\varnothing,\quad C_G(o)\cap B_{v+a_d}=\varnothing\bigr)\le13\eta.(11)✦

Let SS be a signed lattice symmetry. Suppose instead that GG contains the induced lattice subgraph on S(Dr)S(D_r), that π\pi has uniform density qq there, and that o∈V(G)\S(Dr)o\in V(G)\setminus S(D_r). The framed relay bound is (12): ℙπ(CG(o)∩Λ4r(S0)≠⌀,CG(o)∩Λ4r(S(a(20r+1)))=⌀)≤13η.\mathbb P_\pi\bigl(C_G(o)\cap\Lambda_{4r}(S0)\ne\varnothing,\quad C_G(o)\cap\Lambda_{4r}(S(a(20r+1)))=\varnothing\bigr)\le13\eta.(12)✦

For integers r,Rr,R with R>0R>0 and 100(R+1)<r100(R+1)<r, the thirteen route interface conditions are (13): ℐr,R(ci,wi;Pi+1),0≤i<13.\mathcal I_{r,R}(c_i,w_i;P_{i+1}),\qquad 0\le i<13.(13)✦

What Is Checked

The relay bounds are stated over finite lattice subgraphs under independent Bernoulli product measures with uniform internal density and the stated scale data; the interface assertion concerns the integer-coordinate route rectangles and their expansions inside the relay prism.