introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.24 kB
import Mathlib
import OAI.Probability.CriticalPercolation.ProductMeasure.LevelCutProbability
import OAI.Probability.CriticalPercolation.ProductMeasure.LevelContactMeasurability
namespace OAI
section
section
noncomputable section
open Set Function MeasureTheory ProbabilityTheory
open scoped Classical BigOperators ENNReal
namespace CriticalPercolation.BondGraph
open BernoulliProduct
variable {V E : Type*} [Countable V] [Countable E] (G : BondGraph V E)
theorem few_contacts_cost (hlocal : G.LocallyFinite) (q : E β†’ unitInterval)
(Ο€ : V β†’ β„€) (j : β„€) (o : V) (ho : j ≀ Ο€ o)
(hcross : βˆ€ e v w, G.ends e=s(v,w) β†’ j ≀ Ο€ v β†’ Ο€ w<j β†’ Ο€ v=j)
(p : unitInterval)
(hq : βˆ€ e v w, G.ends e=s(v,w) β†’ Ο€ v=j β†’ Ο€ w<j β†’ (q e : ℝ) ≀ p)
(D k : β„•) (hD : βˆ€ v, Ο€ v=j β†’ (G.incidentEdges {v}).ncard ≀ D) :
(1-(p : ℝ))^(D*k)*(BernoulliProduct.law q).real (G.fewContacts Ο€ j o k) ≀
(BernoulliProduct.law q).real (G.minimumLevel Ο€ o j) := by
let X := G.inducedEdges {v | j ≀ Ο€ v}
let d : Set E β†’ Finset E := fun Ο‰ => finiteSetChoice (G.contactDrop Ο€ j o Ο‰)
let A : Finset E β†’ Set (Set E) := fun U => closedBlock ((U : Set E)∩Xᢜ)
have hd (U : Finset E) : MeasurableSet[blockSigma X] {Ο‰ | d Ο‰=U} :=
@measurableSet_finiteSetChoice (Set E) E (blockSigma X) inferInstance
(G.contactDrop Ο€ j o) (G.measurable_contactDrop Ο€ j o) U
have hA (U : Finset E) : MeasurableSet[blockSigma Xᢜ] (A U) :=
(blockSigma_mono Set.inter_subset_right) _
(measurableSet_closedBlock _ ((U.finite_toSet.subset Set.inter_subset_left).countable))
have he (Ο‰ : Set E) (hΟ‰ : Ο‰βˆˆG.fewContacts Ο€ j o k) :
((d Ο‰ : Set E)∩Xᢜ)=G.contactDrop Ο€ j o Ο‰ := by
rw [finiteSetChoice_coe (G.finite_contactDrop hlocal Ο€ j o Ο‰
(G.fewContacts_finite π j o k ω hω).1)]
exact Set.inter_eq_left.mpr (Set.disjoint_left.mp
(G.contactDrop_disjoint_exterior Ο€ j o Ο‰))
have hb (Ο‰ : Set E) (hΟ‰ : Ο‰βˆˆG.fewContacts Ο€ j o k) :
(1-(p : ℝ))^(D*k) ≀ (BernoulliProduct.law q).real (A (d Ο‰)) := by
change _ ≀ (BernoulliProduct.law q).real (closedBlock ((d Ο‰ : Set E)∩Xᢜ))
rw [he ω hω]
have hω' := G.fewContacts_finite π j o k ω hω
apply law_closedBlock_lower q _ (G.finite_contactDrop hlocal π j o ω hω'.1) p
Β· calc
_ ≀ (G.levelContacts Ο€ j o Ο‰).ncard*D :=
G.contactDrop_ncard_le hlocal π j o ω hω'.1 D (fun v hv => hD v hv.2)
_ ≀ k*D := Nat.mul_le_mul_right D (Nat.le_of_lt hΟ‰'.2.2)
_ = D*k := Nat.mul_comm _ _
· rintro e ⟨v,hv,w,hw,hend⟩
exact hq e v w hend hv.2 hw
have hh := selected_fresh_lower q X Xᢜ disjoint_compl_right d A hd hA
(G.fewContacts Ο€ j o k) (G.measurableSet_fewContacts Ο€ j o k)
((1-(p : ℝ))^(D*k)) (pow_nonneg (sub_nonneg.mpr p.2.2) _) hb
apply hh.trans
refine measureReal_mono ?_ (measure_ne_top _ _)
rintro Ο‰ ⟨hΟ‰,hclosed⟩
apply G.minimumLevel_of_drop_closed Ο€ j o ho hcross Ο‰
(G.fewContacts_finite π j o k ω hω).2.1
change Disjoint ((d Ο‰ : Set E)∩Xᢜ) Ο‰ at hclosed
rwa [he ω hω] at hclosed
theorem exists_few_contact_level (hlocal : G.LocallyFinite) (q : E β†’ unitInterval)
(Ο€ : V β†’ β„€) (o : V) (J : Finset β„€) (hJ : J.Nonempty)
(ho : βˆ€ j∈J, j ≀ Ο€ o)
(hcross : βˆ€ j∈J, βˆ€ e v w, G.ends e=s(v,w) β†’ j ≀ Ο€ v β†’ Ο€ w<j β†’ Ο€ v=j)
(p : unitInterval) (hp : (p : ℝ)<1)
(hq : βˆ€ j∈J, βˆ€ e v w, G.ends e=s(v,w) β†’ Ο€ v=j β†’ Ο€ w<j β†’ (q e : ℝ) ≀ p)
(D k : β„•) (hD : βˆ€ j∈J, βˆ€ v, Ο€ v=j β†’ (G.incidentEdges {v}).ncard ≀ D) :
βˆƒ j∈J, (BernoulliProduct.law q).real (G.fewContacts Ο€ j o k) ≀
1/((J.card : ℝ)*(1-(p : ℝ))^(D*k)) := by
apply exists_level_small (BernoulliProduct.law q) J hJ (fun j => G.fewContacts Ο€ j o k)
(G.minimumLevel Ο€ o) (fun j _ => G.measurableSet_minimumLevel Ο€ o j)
Β· intro i hi j hj hij
exact G.minimumLevel_pairwiseDisjoint Ο€ o hij
Β· exact pow_pos (sub_pos.mpr hp) _
Β· intro j hj
exact G.few_contacts_cost hlocal q Ο€ j o (ho j hj) (hcross j hj) p (hq j hj) D k (hD j hj)
end CriticalPercolation.BondGraph
end
end
end
end OAI