The Setting
The observable is the probability of a prescribed spin configuration on an observed set, when spins on a disjoint source set are sampled from a probability mixture and a third set is pinned in common.
A finite ferromagnetic multigraph has a finite vertex set and a finite edge list , with distinct endpoints and a finite coupling for each edge ; parallel edges are retained.✦ A spin configuration is a function assigning a physical spin to each vertex of .✦ For finite real fields , the interaction exponent and Boltzmann weight are given by (1). (1) The constrained partition sum of a set is the sum of its Boltzmann weights, as in (2).✦ (2)✦
Let be the observed, source and pinned sets, respectively. Two configurations agree on a set when for every .✦ For configurations , the conditional spin probability is the ratio in (3); the signs prescribe the common pins. (3)✦ A probability mixing weight on is a nonnegative function with . For configurations and any real-valued weight on , the mixture spin probability is the weighted sum of conditional spin probabilities in (4).✦ (4)✦
The Comparison Probability
The undeleted vertices form ✦, and the undeleted edge set consists of edges with both endpoints in .✦ For an open edge set , wired adjacency on relates two vertices when both belong to , both belong to , or an edge of joins them.✦ Wired cluster equivalence for an open edge set is the equivalence relation on generated by wired adjacency; its classes are the clusters after identifying and separately.✦ The wired cluster count of an open edge set is the number of wired clusters in , including isolated vertices.✦
The zero-field Fortuin-Kasteleyn (FK) weight has cluster weight and edge parameters , as in (5).✦ (5)✦ Choose representatives and . For any two undeleted vertices , the terminal connection probability is the normalized zero-field FK weight of configurations in which and belong to the same wired cluster, as in (6).✦ Loops created by contraction contribute constants that cancel from this probability. (6)✦
The Claim
Theorem 1. Let be a finite loopless multigraph with nonnegative finite couplings and arbitrary finite real fields . Suppose that are pairwise disjoint, and choose and . Fix and two probability mixing weights on . The finite graph comparison is (7). (7)✦
In the paper, the result reads: for a finite ferromagnetic graph with pairwise disjoint , surviving representatives and , arbitrary real fields and common signs , both inequalities in (7) hold for any two nonnegative mixing weights on of total mass one, with Dirac weights, each placing all mass on one source configuration, recovering individual conditional laws and no criticality, lattice geometry, field-sign or free-neighborhood hypothesis.
What Is Checked
The claim is stated over the conditional Gibbs sums and zero-field FK terminal connection probability on finite loopless ferromagnetic multigraphs, with arbitrary real fields, pairwise disjoint , surviving representatives and , fixed configurations , and two probability mixing weights on . The zero-field FK terminal connection probability is independent of the choice of representatives within the observed and source sets.