as a sum over pair configurations
ProvedBunkbedAux.wzProb_pair_sumBy definition is a sum over Wierman--Ziff configurations, that is over functions on assigning a state to each hyperedge on each level, weighted by .
This lemma re-presents that sum with each hyperedge's two states packaged together. A function on is the same thing as a function on taking values in — the pair — and the weight factors accordingly:
the connectivity being evaluated in the graph realised by the configuration or according to the level .
The statement holds for an arbitrary index type, vertex type, hypergraph, transversal set, weight function and pair of endpoints, with no hypothesis on .
Mathematical role. Gladkov--Pak--Zimin remark that a configuration may be viewed "not as a function , but as a function from to ", and this is that change of view made precise. It is the step that makes the refinement of the state space possible: the refinement splits two elements of , so it can only be applied once the configuration space has been presented as functions into rather than as functions on a product index set. Everything in the involution argument then takes place over this indexing.
import Definitions.Def_BunkbedHypergraph open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedAux
/-- **`wzProb` as a sum over pair configurations.** A Wierman-Ziff configuration, a function on
`ι × Fin 2`, is the same thing as a function assigning to each hyperedge the *pair* of its states
on the two levels, and the configuration weight factors as a product of per-hyperedge pair
weights. -/
theorem wzProb_pair_sum {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
= ∑ φ : ι → WZ × WZ, (∏ i, P (φ i).1 * P (φ i).2) *
(if (wzGraph t T (fun p => if p.2 = 0 then (φ p.1).1 else (φ p.1).2)).Reachable x y
then (1 : ℚ) else 0) := by
sorry
end BunkbedAux