The half-reflection involution and its connectivity properties
ProvedBunkbedAux.eta_half_reflectionLet be the Wierman--Ziff state space with the state removed, and let be the -element set of pairs from in which the two pairs and are represented by their refined variants. The half-reflection is the identity on
agrees with the level swap on , and on exchanges
This theorem collects the properties of that the involution argument requires. It is an involution of , it preserves , and it is weight-preserving: the only nonobvious case is , where both and carry weight . It also commutes with , which is what makes the roles of a hyperedge and its mirror image interchangeable.
The last three conjuncts are Proposition 3.7, the connectivity content. Writing a hyperedge as with transversal, and reading the first component of a pair as the lower-level state:
- if and are joined within the hyperedge, then after applying the first component joins to and the second joins to — so reaches along , using the post at the transversal vertex ;
- if and are joined, they remain joined;
- if and are joined, then and become joined.
Mathematical role. These three transformations are exactly what is needed to convert a path realising into one realising , and conversely. Combined with weight preservation they show that the configurations meeting contribute equally to the two connection events and therefore cancel from their difference — which reduces the robustness lemma to the configurations avoiding , where the alternative model and Hollom's computation take over.
Formalization note. Every assertion here is a finite check over the elements of , so all but the weight identity are decided by kernel reduction; the weight identity needs a case analysis because the state probabilities are arbitrary rationals.
import Definitions.Def_BunkbedWZRefined open Bunkbed.Hyper
namespace BunkbedAux
/-- **The half-reflection involution and its connectivity properties** (Definition 3.6 and
Proposition 3.7 of Gladkov-Pak-Zimin). On the 16-element set `Λ²₊` the map `eta` is a
weight-preserving involution which commutes with the level swap `rho`, and it transforms the
within-hyperedge connections in the three ways needed for the path-surgery argument. -/
theorem eta_half_reflection (P : WZ → ℚ) :
(∀ q : WZExt, WZExt.inLamSq q = true → WZExt.eta (WZExt.eta q) = q) ∧
(∀ q : WZExt, WZExt.inLamSq q = true → WZExt.inLamSq (WZExt.eta q) = true) ∧
(∀ q : WZExt, WZExt.inLamSq q = true → WZExt.wt P (WZExt.eta q) = WZExt.wt P q) ∧
(∀ q : WZExt, WZExt.inLamSq q = true →
WZExt.eta (WZExt.rho q) = WZExt.rho (WZExt.eta q)) ∧
(∀ q : WZExt, WZExt.inLamSq q = true → (WZExt.toPair q).1 = WZ.abc →
((WZExt.toPair (WZExt.eta q)).1 = WZ.abc ∨ (WZExt.toPair (WZExt.eta q)).1 = WZ.ab_c) ∧
((WZExt.toPair (WZExt.eta q)).2 = WZ.abc ∨ (WZExt.toPair (WZExt.eta q)).2 = WZ.ac_b)) ∧
(∀ q : WZExt, WZExt.inLamSq q = true →
((WZExt.toPair q).1 = WZ.abc ∨ (WZExt.toPair q).1 = WZ.ab_c) →
((WZExt.toPair (WZExt.eta q)).1 = WZ.abc ∨
(WZExt.toPair (WZExt.eta q)).1 = WZ.ab_c)) ∧
(∀ q : WZExt, WZExt.inLamSq q = true →
((WZExt.toPair q).1 = WZ.abc ∨ (WZExt.toPair q).1 = WZ.ac_b) →
((WZExt.toPair (WZExt.eta q)).2 = WZ.abc ∨
(WZExt.toPair (WZExt.eta q)).2 = WZ.ac_b)) := by
sorry
end BunkbedAux