The Setting
A connection from an origin to an intermediate set can stop short of a target. Corollary 2.3 compares the probability of this event with target connection probabilities from the vertices of the intermediate set.
A labelled hypergraph on a vertex set is a family of subsets , indexed by a set of hyperedge labels; empty hyperedges are permitted.✦ A hyperedge configuration is an assignment of an open state or a closed state to each hyperedge label. For a labelled hypergraph on , a configuration , and a forbidden set , open hyperedge adjacency is the relation between vertices that holds when they lie in a common open hyperedge disjoint from , as in (1): (1)✦ Open hyperedge connectivity in a labelled hypergraph on , with forbidden set , is the relation between vertices that holds when a finite chain of open hyperedge adjacencies avoiding joins to ; a chain of length zero is allowed.✦ A connection from a vertex to a target set in the labelled hypergraph , with forbidden set , is the event that is connected to some vertex of by open hyperedges avoiding , as in (2): (2)✦
The Bernoulli product law on hyperedge configurations is the probability measure under which the hyperedge labels have independent open states with probabilities .✦ For an event of hyperedge configurations, its real probability under the Bernoulli product law is the integral of its indicator, as in (3): (3) For site percolation the labels are vertices, with independent open probabilities .
Open site adjacency in a simple graph on and a configuration is the relation between vertices that holds when they are adjacent in and both open, as in (4): (4)✦ Open site connectivity in a simple graph is the relation between vertices of that holds when a finite path of open vertices in joins to .✦ A path of length zero requires its vertex to be open. A site connection from a vertex of a simple graph on to a set is the event that an open site path in joins to some vertex of , as in (5): (5)✦
Finite Lattice Subgraphs
The cubic lattice has vertex set .✦ For a coordinate direction , let be the corresponding unit vector; for a vertex , the positive coordinate step from is .✦ A lattice bond is a pair consisting of a vertex and a coordinate direction , joining to .✦ The bond space is the set of lattice bonds, and the endpoint set of a bond is the set of its two endpoints, as in (6); endpoint incidence is the relation that holds when two vertices are the endpoints of a bond in either order. (6) A finite lattice subgraph consists of finite sets and such that for every .✦ Its vertices are the elements of .✦ The underlying simple graph of a finite lattice subgraph is the graph on in which two vertices are adjacent when a bond of has those endpoints.✦
A lattice bond configuration is an assignment of a state to every lattice bond.✦ Open bond adjacency in a finite lattice subgraph is the relation between vertices of that holds when they are the endpoints of an open bond of .✦ Bond connectivity in a finite lattice subgraph is the relation between vertices that holds when a finite chain of open bond adjacencies in joins them, allowing a chain of length zero.✦ A lattice site configuration is an assignment of a state to every lattice vertex.✦ Site connectivity in a finite lattice subgraph is the relation between vertices that holds when an open site path in the underlying simple graph of joins them.✦
For either kind , a connection from a vertex of a finite lattice subgraph to a set is the event that is connected in to some vertex of , as in (7): (7) The lattice laws are independent Bernoulli product measures over all bonds or all vertices of , with the corresponding individual probabilities in .✦
The Claim
Theorem 1. Let be a labelled hypergraph on a finite vertex set , with independent hyperedge probabilities , an origin , and sets . Suppose satisfies for every . Then (8)✦ If also , then (9)✦
Let be a simple graph on a finite vertex set , with independent site probabilities , an origin , and sets . Suppose and for every . Then (10)✦
Let be a finite lattice subgraph, let and , and let . Under the lattice bond law with probabilities , suppose for every . Then (11)✦ Under the lattice site law with probabilities , suppose for every . Then (12)✦
In the paper, the result reads: for independent bond or site percolation on a finite undirected graph, with arbitrary individual probabilities in , an origin , vertex sets , and , the assumptions for every imply , where denotes connection in the chosen model, also after any deterministic collection of bits is fixed.
What Is Checked
The comparisons (8) and (9) are stated over finite vertex hypergraphs with independent hyperedge bits, (10) over finite simple graphs with independent site bits, and (11) and (12) over finite lattice subgraphs under the full lattice bond and site product laws, respectively.