math / data /lean /OAI /Probability /CriticalPercolation /Clusters /ThreeClusterAvoidanceSecond.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
2.31 kB
import Mathlib
import OAI.Probability.CriticalPercolation.Model
import OAI.Probability.CriticalPercolation.GraphGeometry.IsolateThree
import OAI.Probability.CriticalPercolation.ProductMeasure.ProbDisjoint
namespace OAI
section
section
open Set MeasureTheory ProbabilityTheory
open Set
open scoped BigOperators
namespace CriticalPercolation.BondGraph
open FiniteProduct
open scoped Classical
variable {V E : Type*} (G : BondGraph V E) [Fintype V] [Fintype E]
lemma threeCluster_avoidance_second (w : E β†’ Prop β†’ ℝ)
(hw : βˆ€ e, βˆ‘ z, w e z = 1) (hp : βˆ€ e z, 0 ≀ w e z) (hc : βˆ€ e, 0 < w e False)
(a s t b : V) (hat : t β‰  a) (hst : t β‰  s) :
prob w (fun Ο‰ => G.joinedPair t a s Ο‰ ∧ (G.openGraph Ο‰).Reachable t b) *
prob w (G.separateThree a s t) ≀
prob w (G.joinedPair t a s) *
prob w (fun Ο‰ => G.separateThree a s t Ο‰ ∧ (G.openGraph Ο‰).Reachable t b) := by
have h := G.threeCluster_avoidance w hw hp hc t a s b hat hst
rw [prob_congr w (G.separateThree_rotate a s t),
prob_congr w (fun Ο‰ => and_congr_left (fun _ => G.separateThree_rotate a s t Ο‰))] at h
exact h
omit [Fintype V] in
lemma threeCluster_event_bounds (w : E β†’ Prop β†’ ℝ) (hp : βˆ€ e z, 0 ≀ w e z)
(a s t b : V) :
prob w (fun Ο‰ => G.separateThree a s t Ο‰ ∧ (G.openGraph Ο‰).Reachable t b) ≀
prob w (G.separateThree a s t) ∧
prob w (fun Ο‰ => G.separateThree a s t Ο‰ ∧ (G.openGraph Ο‰).Reachable t b) ≀
prob w (G.separateThree a s t) + prob w (G.joinedPair a s t) -
prob w (fun Ο‰ => G.separateThree a s t Ο‰ ∧ (G.openGraph Ο‰).Reachable a b) -
prob w (fun Ο‰ => G.joinedPair a s t Ο‰ ∧ (G.openGraph Ο‰).Reachable a b) := by
constructor
Β· exact prob_mono w hp (fun _ h => h.1)
Β· have h1 := prob_disjoint_le w hp
(fun Ο‰ => G.separateThree a s t Ο‰ ∧ (G.openGraph Ο‰).Reachable t b)
(fun Ο‰ => G.separateThree a s t Ο‰ ∧ (G.openGraph Ο‰).Reachable a b)
(G.separateThree a s t) (fun _ h => h.1) (fun _ h => h.1)
(fun _ h => h.1.1.1.2 (h.2.2.trans h.1.2.symm))
have h2 := prob_mono w hp (P := fun Ο‰ => G.joinedPair a s t Ο‰ ∧ (G.openGraph Ο‰).Reachable a b)
(Q := G.joinedPair a s t) (fun _ h => h.1)
linarith
end CriticalPercolation.BondGraph
end
end
end OAI