OctoInformBeta

OpenAI preprint, September 2026 · Section 1. Introduction

Section 1.1: the vertex-deleted, separately contracted FK comparator: The zero-field Fortuin-Kasteleyn comparator with separate terminal identifications

Terminal connections after deleting pinned vertices.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

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 II, the prescribed source spin set is JJ, and the common pinned set is FF.

A finite ferromagnetic weighted multigraph GG has a finite vertex set VV, a finite labelled edge list EE, distinct endpoints ue,ve∈Vu_e,v_e\in V for each e∈Ee\in E, and nonnegative real couplings KeK_e.✦ Parallel edges are retained as distinct entries of EE. For a pinned set F⊆VF\subseteq V in the finite multigraph GG, the undeleted vertex set VF⊆VV_F\subseteq V and undeleted edge set EF⊆EE_F\subseteq E are the sets in (1). VF=V\F,EF={e∈E:ue∉F,ve∉F}.V_F=V\setminus F, \qquad E_F=\{e\in E:u_e\notin F,\ v_e\notin F\}.(1)

For an open edge set ω⊆EF\omega\subseteq E_F, wired open-edge adjacency RωR_\omega on VFV_F is the relation that joins two vertices belonging to II, two belonging to JJ, or the endpoints of an edge in ω\omega.✦ The wired cluster equivalence ∼ω\sim_\omega on VFV_F is the smallest equivalence relation containing RωR_\omega.✦ The contracted cluster count c(ω)c(\omega) is the number of equivalence classes of the wired cluster equivalence ∼ω\sim_\omega on VFV_F, as in (2). c(ω)=|VF/∼ω|.c(\omega)=\bigl|V_F/{\sim_\omega}\bigr|.(2)✦

The FK edge parameter pep_e associated with the coupling KeK_e of an edge e∈Ee\in E is the real number given by (3). pe=1−exp⁡(−2Ke).p_e=1-\exp(-2K_e).(3) The zero-field FK weight w0(ω)w_0(\omega) of an open edge set ω⊆EF\omega\subseteq E_F is the product of the cluster and edge factors in (4), with cluster weight 22. w0(ω)=2c(ω)∏e∈ωpe∏e∈EF\ω(1−pe).w_0(\omega) =2^{c(\omega)} \prod_{e\in\omega}p_e \prod_{e\in E_F\setminus\omega}(1-p_e).(4)✦

The Claim

Definition 1. Let GG be a finite ferromagnetic weighted multigraph, let I,J,F⊆VI,J,F\subseteq V, and let i,j∈VFi,j\in V_F. The zero-field FK terminal connection probability q0(G;I,J,F;i,j)q_0(G;I,J,F;i,j) is the normalized weighted connection sum in (5). q0(G;I,J,F;i,j)=∑ω⊆EFi∼ωjw0(ω)∑ω⊆EFw0(ω).q_0(G;I,J,F;i,j) =\frac{\displaystyle \sum_{\substack{\omega\subseteq E_F\\i\sim_\omega j}}w_0(\omega)} {\displaystyle\sum_{\omega\subseteq E_F}w_0(\omega)}.(5)✦ For surviving representatives i,i′∈I\Fi,i'\in I\setminus F and j,j′∈J\Fj,j'\in J\setminus F, the probability in (5) satisfies (6). q0(G;I,J,F;i,j)=q0(G;I,J,F;i′,j′).q_0(G;I,J,F;i,j)=q_0(G;I,J,F;i',j').(6)✦ If II and JJ are disjoint and i∈I\Fi\in I\setminus F, j∈J\Fj\in J\setminus F, then (7) holds. 0≤q0(G;I,J,F;i,j)<1.0\le q_0(G;I,J,F;i,j)<1.(7)✦

In the paper, the result reads: q0q_0 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 i∈Ii\in I and j∈Jj\in J express terminal nonemptiness and their choice does not change q0q_0; under terminal disjointness and membership, 0≤q0<10\le q_0<1, making the inverse hyperbolic tangent artanh⁡q0\operatorname{artanh}q_0 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 I,J,FI,J,F with surviving vertices i,ji,j; the terminal membership hypotheses apply to (6), and terminal disjointness is also required for (7).