The all-minus block contributes exactly
ProvedBunkbedAux.A_block_valueIn the involution argument, after the configurations meeting have cancelled, the leading contribution comes from the configurations in which every hyperedge is in a state, that is, fully present on one level and fully absent on the other. This theorem evaluates that contribution exactly.
Writing , the claim is
where is the set of configurations all of whose hyperedges are in a state.
Two things combine to give this. Each of the configurations in carries weight exactly , since each variant has weight . And is in bijection with the level assignments , under which the realised graph is exactly the alternative-model graph at ; so the net indicator difference summed over is the alternative model's surplus, which by Hollom's computation is .
Mathematical role. This is the term that makes the robustness lemma true. Everything else in the argument is either an exact cancellation or an error bound: the configurations meeting contribute zero, and the remaining ones are controlled in absolute value by their total weight. The single positive term is this , and it is positive precisely under the hypothesis — which is why that hypothesis cannot be dropped. Under Eq. [1] the error is at most with , and dominates it because .
import Definitions.Def_BunkbedWZSurgery open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedAux
/-- **The all-minus block contributes exactly `W ^ 6`.** Summed over the refined configurations
in which every hyperedge is in a `-` state, the weight times the net indicator difference is
`W ^ 6`, where `W = P_abc * P_a|b|c - P_ab|c * P_ac|b`. -/
theorem A_block_value (P : WZ → ℚ) :
∑ Ψ ∈ Finset.univ.filter (fun Ψ : Fin 6 → WZExt =>
∀ h, Ψ h ∈ ({Sum.inr 1, Sum.inr 3} : Finset WZExt)),
(∏ h, WZExt.wt P (Ψ h)) *
((if (wzGraph hollomTriple hollomT (wzOfExt Ψ)).Reachable
((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (1 : Fin 2)) then (1 : ℚ) else 0)
- (if (wzGraph hollomTriple hollomT (wzOfExt Ψ)).Reachable
((0 : Fin 10), (0 : Fin 2)) ((9 : Fin 10), (0 : Fin 2)) then (1 : ℚ) else 0))
= (P .abc * P .a_b_c - P .ab_c * P .ac_b) ^ 6 := by
sorry
end BunkbedAux