The Setting
The event of interest is that a source connects to an inner rectangle while having no connection to a prescribed target. The surrounding region has a constant opening density, although opening probabilities elsewhere may vary.
The cubic lattice consists of integer triples.✦ Write for the th coordinate unit vector, so that the positive coordinate step from is .✦ Two vertices are nearest neighbors when their difference is or for some .✦ A lattice bond is the edge with endpoints and ✦; incidence with two vertices means that they are these endpoints, in either order.✦
A finite lattice subgraph has finite vertex and bond sets and , with both endpoints of every bond in .✦ The underlying graph of a finite lattice subgraph is the graph with vertex set in which two vertices are adjacent when they are incident with a bond in .✦ A graph contains a region , including a lattice box, when it contains every vertex of and every lattice bond with both endpoints in .✦
Fix a model , either bond or site percolation.✦ The variables of a percolation model are lattice bonds in the bond model and lattice vertices in the site model.✦ A configuration of the model is an assignment of an open or closed state to each variable of .✦ For an assignment of opening probabilities in , let be the independent Bernoulli product measure with opening probability at variable ; write when is constantly .✦ An internal variable of a region is a lattice bond with both endpoints in in the bond model, or a lattice site belonging to in the site model.✦ The assignment has uniform density on when for every internal variable of .✦
Open bond adjacency means incidence with an open bond.✦ On a graph, open site adjacency means adjacency with both vertices open.✦ Open lattice adjacency uses these relations on the nearest-neighbor lattice✦; within , bond adjacency uses only bonds of and site adjacency uses its underlying graph. The notation means that a finite open path within joins the two vertices.✦ A bond path of length zero connects a vertex to itself; a site path, including one of length zero, requires all its vertices to be open. For and , the target connection event is (1)✦
Seeds and Scales
A lattice box is a rectangle with integer lower and upper corners satisfying in each coordinate.✦ The vertices of a lattice box with lower and upper corners are all lattice points between and , and the bonds of are all lattice bonds with both endpoints among these vertices. For nonnegative integers , the expansion and the cube of coordinate radius centered at are the boxes in (2). (2)
For a nonnegative integer , the seed variable count is the number of internal variables of .✦ For a model and a nonnegative integer , the seed success exponent is the integer specified in (3), where denotes the internal variables of a region . (3)
An available vertex of the cubic lattice is a vertex that is open in the site model, with every lattice vertex available in the bond model. Adjacency restricted to a region requires both endpoints to belong to that region.✦ For a nonnegative integer , the confined seed connection event consists of configurations with an available vertex and a vertex joined by a finite path of open lattice adjacencies restricted to , with a path of length zero allowed.✦
A quarter-face index consists of a coordinate direction and signs .✦ The quarter-face of is the set in (4). There are such signed-coordinate quarter-faces, and their boundary overlaps are permitted. (4)✦
A signed lattice symmetry of is a map determined by a coordinate permutation , a choice of signs , and a translation , acting as in (5).✦ (5)✦
Renormalization scale data for consist of densities , error allowances , and nonnegative integers satisfying (6) and (7).✦ Here is the seed radius, the trial count, the intermediate radius, and the large radius. The contour error tolerance is .✦ (6) The quarter-face requirement in (7) concerns every center and quarter-face index at each of the three indicated radii. (7)
The Claim
Theorem 1. Let be a finite lattice subgraph, an opening probability assignment, and . Take nonnegative integers with and , a lattice box , a source , and a target . Suppose contains , , and has uniform density on . Let and . Suppose every admits an integer such that contains and . Then the extension failure bound is (8). (8)✦
For renormalization scale data satisfying (6) and (7), suppose contains a region and has uniform density on . Take and a box with . Suppose every admits , a signed lattice symmetry , a center , and a quarter-face index such that , , and . Then the scale-specialized bound is (9). (9)✦
In the paper, the result reads: with the scales and fixed by Lemma 3.3, let be a finite subgraph of containing a rectangle and every lattice edge internal to , give the variables independent laws with parameter on all variables internal to and arbitrary parameters, including zero and one, elsewhere, and take and ; if a rectangle satisfies and , and for every some has and a quarter-face , then .
What Is Checked
The claims (8) and (9) are stated over independent Bernoulli bond or site configurations on finite lattice subgraphs, with uniform density on the specified regions and the stated seed or quarter-face hypotheses. The underlying graph adjacency is symmetric and loopless, and each signed lattice action in (5) is a bijection of .