The complement of contributes strictly positively
ProvedBunkbedAux.xc_block_posAfter the involution has cancelled every configuration meeting , the robustness lemma comes down to the complementary configurations — those in which every hyperedge avoids . This theorem shows that block contributes a strictly positive amount, which is the whole of the inequality.
Let be a probability distribution on the five Wierman--Ziff states, put , and assume together with Eq. [1],
Then the weighted net difference between the cross-level and the same-level connection indicator, summed over the complement, is strictly positive.
How the sign is obtained. The complement splits in two. The sub-block in which every hyperedge is in a state — fully present on one level, fully absent on the other — is exactly the alternative bunkbed hypergraph model, and it contributes precisely : each of its configurations has weight , and their net indicator surplus is Hollom's . Everything else in the complement is an error term, bounded in absolute value by its total weight, since each indicator difference lies in and all weights are nonnegative.
The two weights are for the whole complement and for the block, where . So positivity amounts to
Eq. [1] gives , hence , and the requirement reduces to the numerical fact
i.e. .
On the constant. The margin is about one part in two thousand. This is why Eq. [1] needs a constant as large as it does: by this route any constant below fails. It is also why the hypothesis is indispensable — it is exactly the positivity of the leading term , and when the whole expression vanishes.
import Definitions.Def_BunkbedWZSurgery open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedAux
/-- **The complement of `Λ²₊` contributes a strictly positive amount.** Under Eq. [1] together
with `0 < W`, the weighted net indicator difference over the configurations all of whose
hyperedges avoid `Λ²₊` is strictly positive. -/
theorem xc_block_pos (P : WZ → ℚ)
(hnn : ∀ s, 0 ≤ P s)
(hsum : P .abc + P .a_b_c + P .a_bc + P .ab_c + P .ac_b = 1)
(hpos : 0 < P .abc * P .a_b_c - P .ab_c * P .ac_b)
(h400 : 400 * P .a_bc ≤ P .abc * P .a_b_c - P .ab_c * P .ac_b) :
0 < ∑ Ψ ∈ 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)) *
((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)) := by
sorry
end BunkbedAux