OctoInformBeta

OpenAI preprint, September 2026 · Section 2. Pointwise comparison through buffers

Remark 2.3: symmetric terminals: Zero-field connections with separately wired terminal sets and deleted pinned sites

Terminal exchange preserves the connection probability.

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 observed spin set II and prescribed source spin set JJ enter the zero-field Fortuin-Kasteleyn (FK) measure as two sets of wired sites. Let GG be a finite ferromagnetic weighted multigraph with vertex set VV and separately indexed edge set EE. Each edge ee has distinct endpoints ℓ(e),r(e)\ell(e),r(e) and a real coupling Ke≥0K_e\geq 0; parallel edges are allowed. Fix subsets I,J,F⊆VI,J,F\subseteq V, where FF is the set of pinned sites.

An undeleted vertex vv of GG is a vertex outside FF, and an undeleted edge ee of GG is an edge whose two endpoints lie outside FF. The set VFV_F of undeleted vertices of GG consists of the vertices outside FF, and the set EFE_F of undeleted edges of GG consists of the edges whose two endpoints lie outside FF, as in (1): VF=V\F,EF={e∈E:ℓ(e)∉F,r(e)∉F}.V_F=V\setminus F, \qquad E_F=\{e\in E:\ell(e)\notin F,\ r(e)\notin F\}.(1)

For an open edge set ω⊆EF\omega\subseteq E_F, wired open-edge adjacency is the relation ℛω\mathcal R_\omega on VFV_F defined by (2): uℛωv⇔(u,v∈I)or(u,v∈J)or ∃e∈ω:(ℓ(e),r(e))=(u,v)or (v,u).\begin{split} u\mathrel{\mathcal R_\omega}v \quad\Longleftrightarrow\quad & (u,v\in I)\ \text{or}\ (u,v\in J)\\ &\text{or }\exists e\in\omega:\ (\ell(e),r(e))=(u,v)\ \text{or }(v,u). \end{split}(2)✦ The wired cluster equivalence ∼ω\sim_\omega on VFV_F is the equivalence closure of ℛω\mathcal R_\omega.✦ The contracted cluster count kI,J,F(ω)k_{I,J,F}(\omega) is the number of equivalence classes of ∼ω\sim_\omega on VFV_F, as in (3): kI,J,F(ω)=|VF/∼ω|.k_{I,J,F}(\omega)=\bigl|V_F/{\sim_\omega}\bigr|.(3)✦

The zero-field FK weight WI,J,F(ω)W_{I,J,F}(\omega) is the random-cluster weight with cluster weight 22 and edge probabilities pe=1−exp⁡(−2Ke)p_e=1-\exp(-2K_e), given in (4): WI,J,F(ω)=2kI,J,F(ω)∏e∈ωpe∏e∈EF\ω(1−pe).W_{I,J,F}(\omega) =2^{k_{I,J,F}(\omega)} \prod_{e\in\omega}p_e \prod_{e\in E_F\setminus\omega}(1-p_e).(4)✦ Parallel edges have separate factors. Loops created by contraction contribute constants that cancel from terminal connection probabilities.

For undeleted vertices i,ji,j, the FK terminal connection probability q0G(I,J;F;i,j)q_0^G(I,J;F;i,j) is the probability that ii and jj belong to the same wired open cluster, defined by (5): q0G(I,J;F;i,j)=∑ω⊆EFWI,J,F(ω)𝟏{i∼ωj}∑ω⊆EFWI,J,F(ω).q_0^G(I,J;F;i,j) =\frac{\displaystyle\sum_{\omega\subseteq E_F} W_{I,J,F}(\omega)\,\mathbf 1_{\{i\sim_\omega j\}}} {\displaystyle\sum_{\omega\subseteq E_F}W_{I,J,F}(\omega)}.(5)✦

The Claim

Theorem 1 (Terminal exchange symmetry). Let GG be a finite ferromagnetic weighted multigraph, let I,J,FI,J,F be arbitrary subsets of its vertex set, and let i,j∈VFi,j\in V_F. Then the connection probabilities in (5) satisfy q0G(I,J;F;i,j)=q0G(J,I;F;j,i).q_0^G(I,J;F;i,j)=q_0^G(J,I;F;j,i).(6)✦

In the paper, the result reads: the connection probability and wired open-edge adjacency have explicit swap identities, the reversed likelihood comparison follows by reapplying the comparison theorem with II and JJ exchanged, and no separately named theorem states symmetry of the extreme log odds.

What Is Checked

The statement (6) is over finite ferromagnetic weighted multigraphs, arbitrary terminal and pinned sets, and arbitrary undeleted representatives, with the connection probability defined by the zero-field FK weights in (4). When i∈I\Fi\in I\setminus F and j∈J\Fj\in J\setminus F, the probability q0G(I,J;F;i,j)q_0^G(I,J;F;i,j) is independent of the representatives chosen within these respective sets.