The Setting
The comparator is a zero-field Fortuin-Kasteleyn (FK) connection probability after removing the common pinned vertices and identifying each terminal set separately. The observed spin set is , the prescribed source spin set is , and the common pinned set is .
A finite ferromagnetic weighted multigraph has a finite vertex set , a finite labelled edge list , distinct endpoints for each , and nonnegative real couplings .✦ Parallel edges are retained as distinct entries of . For a pinned set in the finite multigraph , the undeleted vertex set and undeleted edge set are the sets in (1). (1)
For an open edge set , wired open-edge adjacency on is the relation that joins two vertices belonging to , two belonging to , or the endpoints of an edge in .✦ The wired cluster equivalence on is the smallest equivalence relation containing .✦ The contracted cluster count is the number of equivalence classes of the wired cluster equivalence on , as in (2). (2)✦
The FK edge parameter associated with the coupling of an edge is the real number given by (3). (3) The zero-field FK weight of an open edge set is the product of the cluster and edge factors in (4), with cluster weight . (4)✦
The Claim
Definition 1. Let be a finite ferromagnetic weighted multigraph, let , and let . The zero-field FK terminal connection probability is the normalized weighted connection sum in (5). (5)✦ For surviving representatives and , the probability in (5) satisfies (6). (6)✦ If and are disjoint and , , then (7) holds. (7)✦
In the paper, the result reads: is an explicit finite sum over subsets of the retained edge list; the equivalence closure of open-edge adjacency and separate terminal identifications supplies the components; surviving representatives and express terminal nonemptiness and their choice does not change ; under terminal disjointness and membership, , making the inverse hyperbolic tangent finite; contraction loops remain in the FK sums and cancel from connection probabilities.
What Is Checked
The definition is stated over finite loopless ferromagnetic multigraphs and arbitrary sets with surviving vertices ; the terminal membership hypotheses apply to (6), and terminal disjointness is also required for (7).