OctoInformBeta

OpenAI preprint, September 2026 · §4. An extension estimate

§4 (setting): Bond and site paths with a common Bernoulli parameter on the variables internal to a chosen region

Connections inside a finite lattice graph.

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

Finite graph connections are considered under Bernoulli product laws on all lattice variables. The graph that contains a connection and the region on which the opening parameter is prescribed are specified separately.

The cubic lattice ℤ3\mathbb Z^3 consists of integer triples with coordinate indices i∈{0,1,2}i\in\{0,1,2\}.✦ Write 𝒆i\mathbf e_i for the unit vector in direction ii; for a lattice vertex x∈ℤ3x\in\mathbb Z^3, the positive coordinate step in that direction is x+𝒆ix+\mathbf e_i.✦ A lattice bond is a pair e=(z,i)e=(z,i) in ℬ=ℤ3×{0,1,2}\mathcal B=\mathbb Z^3\times\{0,1,2\}, with endpoints e−=ze^-=z and e+=z+𝒆ie^+=z+\mathbf e_i.✦ A bond is incident with lattice vertices x,y∈ℤ3x,y\in\mathbb Z^3 when they are its two endpoints, in either order.✦

A percolation model M∈{b,s}M\in\{\mathrm b,\mathrm s\} is either the bond model or the site model.✦ The sets of variables of the bond and site models are ℐb=ℬ\mathcal I_{\mathrm b}=\mathcal B and ℐs=ℤ3\mathcal I_{\mathrm s}=\mathbb Z^3, respectively.✦ A percolation configuration ω\omega for the model MM is a map from ℐM\mathcal I_M to {0,1}\{0,1\}, called a bond configuration for M=bM=\mathrm b and a site configuration for M=sM=\mathrm s; state 11 is open and state 00 is closed.✦ A parameter field p:ℐM→[0,1]p:\mathcal I_M\to[0,1] specifies the opening probabilities of the Bernoulli product law.

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 vertex of DD in the site model.✦ The corresponding sets of variables are given by (1): ℐM(D)={{e∈ℬ:e−∈D,e+∈D},M=b,D,M=s.\mathcal I_M(D)= \begin{cases} \{e\in\mathcal B:e^-\in D,\ e^+\in D\},&M=\mathrm b,\\ D,&M=\mathrm s. \end{cases}(1)✦

For a graph HH with vertex set WW and a site configuration η:W→{0,1}\eta:W\to\{0,1\}, open site adjacency is adjacency in HH with both vertices open.✦ Open site connectivity in HH is the relation on WW that holds when two vertices are connected by a finite path of open vertices; a path of length zero requires its vertex to be open.✦

The Definition

Definition 1. A finite lattice subgraph G=(V,E)G=(V,E) consists of a finite vertex set and finitely many lattice bonds whose endpoints belong to that set, as in (2): V⊆ℤ3,E⊆ℬ,|V|,|E|<∞,{e−,e+}⊆V(e∈E).V\subseteq\mathbb Z^3,\qquad E\subseteq\mathcal B,\qquad |V|,|E|<\infty,\qquad \{e^-,e^+\}\subseteq V\quad(e\in E).(2)✦ A vertex of GG is an element of VV.✦ The underlying graph of GG has vertex set VV, with xx and yy adjacent when some e∈Ee\in E is incident with them.✦

For a bond configuration ω\omega, open bond adjacency x∼G,ωbyx\sim_{G,\omega}^{\mathrm b}y in GG is the relation that holds when some e∈Ee\in E is incident with x,yx,y and satisfies ω(e)=1\omega(e)=1.✦ Finite open bond connectivity x↔G,ωbyx\leftrightarrow_{G,\omega}^{\mathrm b}y in GG is the relation on VV that holds when xx and yy are connected by a finite path of open bond adjacencies in the configuration ω\omega, possibly of length zero.✦ For a site configuration ω\omega, finite open site connectivity x↔G,ωsyx\leftrightarrow_{G,\omega}^{\mathrm s}y is open site connectivity in the underlying graph of GG, with state ω(z)\omega(z) at each z∈Vz\in V.✦

For a chosen model MM and vertices x,y∈Vx,y\in V, open percolation connectivity x↔G,ωMyx\leftrightarrow_{G,\omega}^{M}y in GG is the relation specified by (3): x↔G,ωMy⇔{x↔G,ωby,M=b,x↔G,ωsy,M=s.x\leftrightarrow_{G,\omega}^{M}y \quad\Longleftrightarrow\quad \begin{cases} x\leftrightarrow_{G,\omega}^{\mathrm b}y,&M=\mathrm b,\\ x\leftrightarrow_{G,\omega}^{\mathrm s}y,&M=\mathrm s. \end{cases}(3)✦

The target connection event {o↔GMT}\{o\leftrightarrow_G^M T\}, for an origin o∈Vo\in V and a target set T⊆ℤ3T\subseteq\mathbb Z^3, is the set of configurations in (4): {o↔GMT}={ω∈{0,1}ℐM:∃y∈V∩T,o↔G,ωMy}.\{o\leftrightarrow_G^M T\} =\bigl\{\omega\in\{0,1\}^{\mathcal I_M}: \exists y\in V\cap T,\quad o\leftrightarrow_{G,\omega}^{M}y\bigr\}.(4)✦

A parameter field p:ℐM→[0,1]p:\mathcal I_M\to[0,1] is uniform on a region D⊆ℤ3D\subseteq\mathbb Z^3 with parameter q∈[0,1]q\in[0,1] when (5) holds: p|ℐM(D)≡q.\left.p\right|_{\mathcal I_M(D)}\equiv q.(5)✦

What Is Checked

The definitions concern finite lattice subgraphs under full lattice configurations, with a designated region DD and parameter fields valued in [0,1][0,1]. The underlying graph has symmetric, loopless adjacency.