Percolation with constant weights is relabelling-invariant
ProvedBunkbedAux.probOf_image_mapBernoulli bond percolation should not care how the vertices are named. This theorem is that statement, in the form needed when a gadget is embedded into a larger graph.
Let be an injective map of vertex sets, a finite edge set, and a constant weight. If an event on configurations of corresponds to an event on configurations of the image — meaning for every — then
Two things make this work. Injectivity of makes injective, so taking images is a bijection from the subsets of onto the subsets of the image, under which the corresponding events match by hypothesis. And with a constant weight the configuration weight depends only on the two cardinalities and , both of which an injective image preserves.
The constancy hypothesis is genuinely needed in this form: for a general weight function one would have to assume that the weights correspond under , since otherwise the two models assign different probabilities to corresponding configurations. In the application the weight is the constant , so the hypothesis costs nothing.
Mathematical role. Together with the transport of reachability along an injective relabelling, this identifies the five partition probabilities of an embedded gadget copy with those of the gadget itself. That identification is what lets the abstract analysis of the gadget — its partition probabilities, and the verification that they satisfy the robustness lemma's conditions — be applied to the copies sitting inside the -vertex counterexample graph.
import Definitions.Def_BunkbedPercolation open Bunkbed Finset SimpleGraph
namespace BunkbedAux
/-- **Percolation with constant weights is invariant under injective relabelling.** -/
theorem probOf_image_map {V W : Type*} [Fintype V] [DecidableEq V] [Fintype W] [DecidableEq W]
(f : V → W) (hf : Function.Injective f) (E : Finset (Sym2 V)) (c : ℚ)
(ev : Finset (Sym2 V) → Prop) [DecidablePred ev]
(ev' : Finset (Sym2 W) → Prop) [DecidablePred ev']
(hev : ∀ S, S ⊆ E → (ev S ↔ ev' (S.image (Sym2.map f)))) :
probOf E (fun _ => c) ev = probOf (E.image (Sym2.map f)) (fun _ => c) ev' := by
sorry
end BunkbedAux