The weights of the two blocks outside
ProvedBunkbedAux.xc_and_A_weightOnce the configurations meeting have been cancelled by the involution, the robustness lemma reduces to the complementary set: those in which every hyperedge avoids . This theorem computes the total weight of that set, and of the sub-block that carries the refutation.
Write and let be a probability distribution on the five Wierman--Ziff states. Then:
- the configurations all of whose hyperedges avoid have total weight
- the configurations all of whose hyperedges are in a state have total weight
Both follow from the per-hyperedge weights by independence across hyperedges: a set of configurations specified by a condition on each coordinate separately is a product, so its total weight is the product of the per-coordinate weights, and here that product is a sixth power since the condition is the same at every hyperedge. The per-hyperedge figure counts the two variants, of weight each, together with the nine pairs involving the state , whose weight is by inclusion--exclusion; the normalisation is used exactly there.
Mathematical role. The ratio of the two is the conditional probability that every hyperedge is in a state, given that all avoid . Those all-minus configurations are precisely the alternative bunkbed hypergraph model, and by Hollom's computation they contribute a net surplus of one cross-level connection — the source of the refutation. All other configurations in the complement are error terms, bounded in absolute value by their total weight . Under Eq. [1], which reads , one has , and the refutation survives because
which is exactly the inequality needed for the surplus to dominate the error . The margin is about one part in two thousand, which is why the constant in Eq. [1] has to be as large as it is.
import Definitions.Def_BunkbedWZRefined open Bunkbed Bunkbed.Hyper Finset
namespace BunkbedAux
/-- **The weights of the two blocks outside `Λ²₊`.** The configurations all of whose hyperedges
avoid `Λ²₊` have total weight `Z ^ 6` with `Z = 2W + 2 P_a|bc - P_a|bc ^ 2`, and those all of
whose hyperedges are in a `-` state have total weight `(2W) ^ 6`, where
`W = P_abc * P_a|b|c - P_ab|c * P_ac|b`. -/
theorem xc_and_A_weight (P : WZ → ℚ)
(hsum : P .abc + P .a_b_c + P .a_bc + P .ab_c + P .ac_b = 1) :
(∑ Ψ ∈ Finset.univ.filter (fun Ψ : Fin 6 → WZExt =>
∀ h, Ψ h ∈ Finset.univ.filter
(fun q : WZExt => WZExt.legal q = true ∧ WZExt.inLamSq q = false)),
∏ h, WZExt.wt P (Ψ h))
= (2 * (P .abc * P .a_b_c - P .ab_c * P .ac_b) + 2 * P .a_bc - P .a_bc * P .a_bc) ^ 6
∧ (∑ Ψ ∈ Finset.univ.filter (fun Ψ : Fin 6 → WZExt =>
∀ h, Ψ h ∈ ({Sum.inr 1, Sum.inr 3} : Finset WZExt)), ∏ h, WZExt.wt P (Ψ h))
= (2 * (P .abc * P .a_b_c - P .ab_c * P .ac_b)) ^ 6 := by
sorry
end BunkbedAux