The all-minus block reproduces Hollom's gap of one
ProvedBunkbedAux.alt_block_sumIn the involution argument for the robustness lemma, after the configurations meeting have cancelled, the dominant contribution comes from the configurations in which every hyperedge is fully present on one level and fully absent on the other. There are of these, one for each level assignment , and each carries weight where .
This theorem evaluates their net contribution. For each , consider the Wierman--Ziff configuration assigning the fully connecting state to hyperedge on level and the fully disconnecting state on the other level. Then
That is, across the level assignments the cross-level connection occurs exactly one more often than the same-level one.
The number is Hollom's . Indeed these configurations are precisely the alternative bunkbed hypergraph percolation model, in which each hyperedge independently picks a level and contributes a triangle there; and Hollom's computation gives against .
Mathematical role. This is where the refutation actually enters the Wierman--Ziff model. Everything else in the robustness lemma is either an exact cancellation or an error bound; the single unit of asymmetry that makes the final inequality strict is this , inherited from Hollom's hypergraph counterexample. Multiplied by the block weight it is the leading term of the difference of the two connection probabilities, which is why the hypothesis cannot be dropped: if the leading term vanishes and, with forced by Eq. [1], the two probabilities become exactly equal.
import Definitions.Def_BunkbedHypergraph open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedAux
/-- **The all-minus block reproduces Hollom's gap.** Summed over the 64 configurations in which
each hyperedge is fully present on one level and fully absent on the other, the net difference
between the cross-level and the same-level connection indicator is exactly `1`, namely Hollom's
`13 - 12`. -/
theorem alt_block_sum :
(∑ σ : Fin 6 → Fin 2,
((if (wzGraph hollomTriple hollomT
(fun p => if p.2 = σ p.1 then WZ.abc else WZ.a_b_c)).Reachable
((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (1 : Fin 2)) then (1 : ℚ) else 0)
- (if (wzGraph hollomTriple hollomT
(fun p => if p.2 = σ p.1 then WZ.abc else WZ.a_b_c)).Reachable
((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (0 : Fin 2)) then (1 : ℚ) else 0))) = 1 := by
sorry
end BunkbedAux