Exactly one of the five partition events holds
ProvedBunkbedAux.exists_unique_partition_stateThe five partition probabilities , , , , of a triple of vertices are defined as the probabilities of five events describing which pairs among are connected in a percolation configuration. For those five numbers to be a probability distribution on the five Wierman--Ziff states — which is what the robustness lemma requires of them — the five events must partition the configuration space.
This theorem establishes exactly that: for every configuration and every triple , precisely one of the five events holds.
The five events are, writing for connectivity in the configuration:
That these are exhaustive and mutually exclusive is not a formality — it rests on connectivity being an equivalence relation. There are exactly five partitions of into connectivity classes (all together, all separate, and the three ways of pairing two of them), and one has to check that the five conditions above, as written, pick out those five partitions one-to-one. For instance is stated as and captures the all-together case only because transitivity then forces .
Mathematical role. This licenses treating a hyperedge gadget as a five-state random object: each configuration determines a unique state, so the percolation measure pushes forward to a genuine distribution on the five states, whose weights are precisely the five partition probabilities. That is what allows a gadget to be substituted for a hyperedge in a Wierman--Ziff model.
import Definitions.Def_BunkbedHypergraph open Bunkbed Bunkbed.Hyper Finset SimpleGraph
namespace BunkbedAux
/-- **Exactly one of the five partition events holds.** For any configuration and any three
vertices, precisely one of the five mutually exclusive patterns -- all three connected, all three
separate, or exactly one of the three pairs joined -- occurs. -/
theorem exists_unique_partition_state {V : Type*} [Fintype V] [DecidableEq V]
(S : Finset (Sym2 V)) (a b c : V) :
∃! s : WZ,
(match s with
| WZ.abc => (ofEdges S).Reachable a b ∧ (ofEdges S).Reachable b c
| WZ.ab_c => (ofEdges S).Reachable a b ∧ ¬ (ofEdges S).Reachable a c
| WZ.ac_b => (ofEdges S).Reachable a c ∧ ¬ (ofEdges S).Reachable a b
| WZ.a_bc => (ofEdges S).Reachable b c ∧ ¬ (ofEdges S).Reachable a b
| WZ.a_b_c => ¬ (ofEdges S).Reachable a b ∧ ¬ (ofEdges S).Reachable b c
∧ ¬ (ofEdges S).Reachable a c) := by
sorry
end BunkbedAux