Splitting a connection probability by the status of a third vertex
ProvedBunkbedAux.Pabc_add_Pab_c_eq_connProbFix a finite edge set , a weight function , and three vertices . Then
In words: the event that and are connected splits into exactly two disjoint sub-events according to whether the third vertex joins them. The reason the split is exact is that, given , the relations and are equivalent, since reachability is transitive and symmetric; so the first sub-event is and its complement within is .
This identity is how partition probabilities of a triple are converted into ordinary two-point connection probabilities, which is what makes closed-form computations of the former possible: one computes and by other means and reads off as the difference.
Formalization Note The definitions in BunkbedPercolation give as the event and as , so the proof is a pointwise case analysis over configurations, using transitivity to see that the two conditions are complementary under . Both sides are sums over E.powerset, so the sums can be merged before the pointwise argument.
import Definitions.Def_BunkbedPercolation open Bunkbed Finset
namespace BunkbedAux
/-- Splitting a two-point connection probability by the status of a third vertex. -/
theorem Pabc_add_Pab_c_eq_connProb {V : Type*} [Fintype V] [DecidableEq V] (E : Finset (Sym2 V))
(w : Sym2 V → ℚ) (a b c : V) :
Pabc E w a b c + Pab_c E w a b c = connProb E w a b := by sorry
end BunkbedAux