Splitting a Wierman--Ziff configuration into its two levels
ProvedBunkbedAux.wzProb_level_splitIn the Wierman--Ziff model on a hypergraph with edge set indexed by , a configuration assigns one of five states to each hyperedge on each of the two levels of the bunkbed. Formally it is a function on , and is defined as a sum over all such functions, weighted by the product of the state probabilities.
This lemma records the elementary but useful observation that a function on is the same thing as a pair of functions on — one describing the lower level, one the upper — and that the configuration weight factors correspondingly:
the sum running over all pairs of level configurations , where is the five-element state space.
The statement holds for an arbitrary index type, vertex type, hypergraph, transversal set, weight function and pair of endpoints; no hypothesis on is needed, and in particular need not be a probability distribution.
Mathematical role. This is the first step in any analysis of the Wierman--Ziff model that treats the two levels separately. The point is that the two levels are percolated independently, so once the sum is written this way the weight is a product of a level- factor and a level- factor, and only the connectivity indicator couples them. That is what makes it possible to group configurations by the partition of the vertex set that each level induces — the reduction underlying the evaluation of the difference of the two connection probabilities on Hollom's hypergraph.
Formalization note. The gluing map sends a pair to the configuration taking the value at and at ; it is a bijection, and the product over splits into the two level products.
import Definitions.Def_BunkbedHypergraph open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedAux
/-- **Splitting a Wierman-Ziff configuration into its two levels.** A WZ configuration assigns a
state to each hyperedge on each of the two levels, i.e. it is a function on `ι × Fin 2`. Such a
function is the same thing as a pair of functions on `ι`, one per level, and the configuration
weight factors accordingly. This rewrites `wzProb` as a double sum over the two level
configurations. -/
theorem wzProb_level_split {V : Type*} [Fintype V] [DecidableEq V]
{ι : Type*} [Fintype ι] [DecidableEq ι]
(t : ι → (V × V × V)) (T : Finset V) (P : WZ → ℚ) (x y : V × Fin 2) :
wzProb t T P x y
= ∑ c : (ι → WZ) × (ι → WZ),
(if (wzGraph t T (fun p => if p.2 = 0 then c.1 p.1 else c.2 p.1)).Reachable x y
then (1 : ℚ) else 0) * ((∏ i, P (c.1 i)) * (∏ i, P (c.2 i))) := by
sorry
end BunkbedAux