The Setting
The event that a vertex reaches both of two target sets concerns the same open hyperedges for both connections.
A labelled hypergraph on a finite vertex set , with a set of hyperedge labels, is an assignment ; empty hyperedges are permitted.✦ A configuration declares a label open when .
The Bernoulli hyperedge measure , for probabilities , is the product law in (1), where is unit mass at : (1)✦ The real event probability of an event is the integral in (2); denotes its extended measure, with values in . (2)
For a forbidden vertex set , open hyperedge adjacency on is the relation in (3). (3)✦ An open connection in is a finite chain of open hyperedge adjacencies from to , with a chain of length zero permitted.✦ For a vertex and a target set , the connection event is the event defined by (4). (4)✦ When , write .
The Claim
Theorem 1. Let be a labelled hypergraph on a finite vertex set , with independent hyperedge probabilities , a vertex and sets . Suppose is a lower bound for for every . Then (5)✦ If is nonempty and is a lower bound for for every , then (6)✦
In the paper, the result reads: in independent percolation on a finite hypergraph with arbitrary hyperedge probabilities in , a vertex and vertex sets with satisfy .
What Is Checked
The bounds (5) and (6) are stated over labelled hypergraphs with finitely many vertices under the Bernoulli product law, using connections with no forbidden vertices and real event probabilities or extended measures, respectively.