The Setting
The coarse exploration on follows connections from the origin through finite subgraphs of the nearest-neighbor lattice . Its good vertices record successful coarse boxes. The question is whether this set can remain finite, and which lattice densities support an infinite origin cluster.
Fix a model , either bond or site. A lattice bond joins to , where and is the corresponding coordinate unit vector.✦ The variable set consists of these bonds in the bond model and of lattice vertices in the site model.✦ A configuration assigns an open or closed state to every variable.✦ Under the Bernoulli law , the variables are independent with opening probability .✦ The clipped density of a real parameter is , a value in .
Two lattice vertices are nearest neighbors when one is a positive coordinate step of the other.✦ In a configuration , open bond adjacency between lattice vertices and means that their joining bond is open, and open site adjacency means that and are nearest neighbors and both are open. An open connection in a configuration is a finite path of open bond adjacencies in the bond model or open site adjacencies in the site model. A bond path of length zero connects a vertex to itself, whereas a site path of length zero requires that vertex to be open. The cluster is the set of vertices connected to in the chosen model. Define the origin probability and the model’s critical parameter by (1): (1) For either model, the infinite-cluster event at a lattice vertex is the set of configurations in which is infinite.✦
A finite lattice graph consists of a finite vertex set and a finite set of bonds whose endpoints both belong to that set.✦ The underlying graph of a finite lattice graph is the graph on its vertex set in which two vertices are adjacent when a bond of has those endpoints, in either order.✦ Connections within use its bonds and vertices, with the same open path conventions. For a target set of lattice vertices, the notation means that some vertex of in is connected to the origin within .✦ For a finite lattice graph , the variable set is the set of its edge variables in the bond model and its vertex variables in the site model.✦
Finite Scale Parameters
A lattice box is a closed coordinate interval between ordered corners in .✦ Its vertices are the lattice points in that interval, and its bonds have both endpoints there. For a lattice box , the variable set consists of its bonds in the bond model and its vertices in the site model.✦ For a lattice center and a nonnegative integer radius , the cube is the box of points satisfying in each coordinate.✦ For a seed radius , the seed variable count is .✦
For a coarse vertex and integer scale , the center is a lattice vertex, and the relay cube and surrounding cube are lattice boxes, given by (2). (2)
A quarter-face index consists of a coordinate and signs .✦ For a lattice center and radius , the quarter-face is the set of lattice vertices satisfying and for .✦ There are 24 such signed-coordinate quarter-faces, with boundary overlaps permitted.
A vertex is available unconditionally in the bond model, and when it is open in the site model.✦ Let be the event that an available vertex in is joined to a vertex of by open steps whose endpoints belong to .✦
Finite scale parameters consist of densities , allowances , and integers satisfying (3). Here is the seed radius and is the trial count. (3) The contour error tolerance and the required error budgets are given in (4): (4) These parameters also satisfy the quarter-face requirement (5) for every center , every quarter-face index and each : (5)
The Exploration State
A finite observation history consists of a finite known set and a state assignment , whose values on record the observations.✦ For a finite observation history , the measure is the independent Bernoulli product measure whose opening probability is outside , one at an observed open variable, and zero at an observed closed variable. Pinned parameters retain unobserved opening probabilities and fix observed variables to their observed states. The history-conditioned Bernoulli parameters at density are the pinned parameters obtained from the constant family .
Let be the four coarse directions. For coarse vertices , let be the bonds with one endpoint in and the other in in the bond model, and the empty set in the site model.✦ For coarse vertices and a finite coarse set , define the root variables , the processed region variables , and the box and interface variables by (6). (6)
An exploration packet assigns a coarse vertex and its parent to a finite parent-chain graph . This graph contains the origin and contains as a subgraph, including all its vertices and bonds. The root connection event of an exploration packet is .✦
An exploration state consists of a finite observation history , finite sets of coarse vertices designated processed, good and bad, and an ordered queue of exploration packets.✦ The visited set of an exploration state is its processed set together with the vertices in its queue.✦ A colored exploration state has its processed set partitioned into its good set and its bad set . Closure of an exploration state means that every coarse neighbor of every vertex of its good set belongs to its visited set .✦ Coverage of an exploration state means that each vertex of its visited set is good or is a coarse neighbor of a good vertex.✦
An exploration state with history is valid at when the origin is processed, queued vertices are distinct and unprocessed, their parents are processed, its history satisfies , and every queued packet satisfies and .
Let be the state after successive exploration steps at , starting from and using the same configuration throughout; .✦ For an initial exploration state and a configuration , the eventual good set is the subset of given by (7). (7)✦
The Claim
Theorem 1. Fix either model and finite scale parameters satisfying (3), (4) and (5). Let be a valid, colored, closed and covered state at , with history and no bad vertices. The finite good set estimate is (8): (8)✦ The weighted trail series has the sum (9): (9)✦ For every choice of these finite scale parameters, (10) holds: (10)✦ For every density with , there is a density with the properties in (11): (11)✦
In the paper, the result reads: if is finite then all its outside neighbors have been processed bad, a deterministic contour union bound gives conditional probability less than one for its finiteness, and infinitely many good coarse boxes give infinitely many vertices of at a density , a contradiction.
What Is Checked
The statements concern the Bernoulli bond and site laws on , the finite scale parameters, and the history-conditioned exploration states with the stated closure, coverage and validity conditions. The underlying adjacency of a finite lattice graph is loopless.