The Wierman--Ziff difference polynomial for Hollom's hypergraph
ProvedBunkbedFalse.wz_diff_polyConsider the Wierman--Ziff five-state percolation model on Hollom's -uniform hypergraph , with transversal set . Each of the six hyperedges of independently takes one of five states on each of the two levels of the bunkbed, the state recording which of its three vertices the hyperedge connects; a state occurs with probability . Since there are six hyperedges and two levels, each connection probability is a sum over configurations, and is therefore a polynomial of degree in the five state probabilities.
This theorem evaluates that polynomial. Assume the model is symmetric in the two ways of joining the transversal vertex to one other vertex, , and write
Then the difference between the cross-level and the same-level connection probability of the two endpoints and is given exactly by
where is the explicit polynomial of the definition: homogeneous of degree , with monomials when expanded, presented in the graded form
Note that no hypothesis beyond the symmetry is needed: this is an identity between polynomials, valid for every , and in particular it does not require to be a probability distribution.
Mathematical role. This is the combinatorial half of the robustness lemma (Lemma 3.3) of Gladkov--Pak--Zimin, isolated from the arithmetic half. Once the difference is known as an explicit polynomial, the strict inequality of Lemma 3.3 becomes a question of real algebra on a region of the simplex, which is the companion statement BunkbedFalse.wzDiffPoly_pos. The leading term is exactly the contribution of the configurations in which every hyperedge lies wholly on one level -- that is, of the alternative model -- and its coefficient is Hollom's from Lemma 3.1.
import Definitions.Def_BunkbedWZPoly open Bunkbed Bunkbed.Hyper
namespace BunkbedFalse
/-- **The Wierman-Ziff difference polynomial** (Section 3 of Gladkov-Pak-Zimin). In the
symmetric case `P_ab|c = P_ac|b`, the difference between the cross-level and the same-level
connection probability on Hollom's hypergraph is the explicit degree-12 polynomial
`wzDiffPoly`. This is the combinatorial content of Lemma 3.3, separated from the arithmetic. -/
theorem wz_diff_poly (P : WZ → ℚ) (hsym : P .ab_c = P .ac_b) :
wzProb hollomTriple hollomT P ((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (1 : Fin 2))
- wzProb hollomTriple hollomT P ((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (0 : Fin 2))
= wzDiffPoly (P .abc) (P .a_b_c) (P .a_bc) (P .ab_c) := by
sorry
end BunkbedFalse