File size: 6,185 Bytes
4a56cd6 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 | import Mathlib
import OAI.Probability.CriticalPercolation.Gluing.SelectedFresh
import OAI.Probability.CriticalPercolation.ProductMeasure.LevelContactMeasurability
import OAI.Probability.CriticalPercolation.Criticality.FewOpenBonds
import OAI.Probability.CriticalPercolation.Exploration.FrontierDivergence
namespace OAI
section
noncomputable section
open Set MeasureTheory ProbabilityTheory Filter
open scoped Classical ENNReal Topology
namespace CriticalPercolation.BernoulliProduct
variable {E : Type*} [Countable E]
lemma measurableSet_fewOpenBonds (S : Set E) (N : β) :
MeasurableSet[blockSigma S] {Ο : Set E | (Sβ©Ο).ncard β€ N} := by
simpa only [Set.inter_comm,Set.preimage_ofPred_eq,Set.Iic,Function.comp_apply] using
(measurableSet_Iic.preimage (measurable_ncard.comp (measurable_inter_block S)))
end CriticalPercolation.BernoulliProduct
namespace CriticalPercolation.BondGraph
open BernoulliProduct
variable {V E : Type*} [Countable V] [Countable E] (G : BondGraph V E)
def fewOpenFreshBoundary (X : Set E) (v : V) (N : β) : Set (Set E) :=
{Ο | (G.cluster (Οβ©X) v).Finite β§ (G.freshClusterBoundary X v Ο β© Ο).ncard β€ N}
lemma fewOpenFreshBoundary_probability_le (hl : G.LocallyFinite) (p : unitInterval)
(X : Set E) (v : V) (N L : β) :
(G.law p).real (G.infiniteEvent v β© G.fewOpenFreshBoundary X v N) β€
(G.law p).real (G.infiniteEvent v β© G.smallFreshBoundary X v ((N+1)*L)) +
(N+1 : β)*(1-(p:β))^L := by
let M := (N+1)*L
let C : Set (Set E) := {Ο | (G.cluster (Οβ©X) v).Finite β§
M β€ (G.freshClusterBoundary X v Ο).ncard}
let d : Set E β Finset E := fun Ο => finiteSetChoice (G.freshClusterBoundary X v Ο)
let A : Finset E β Set (Set E) := fun S =>
{Ο | (((S : Set E)β©XαΆ)β©Ο).ncard β€ N}
have hC : MeasurableSet[blockSigma X] C := by
have hf : MeasurableSet[blockSigma X] {Ο | (G.cluster (Οβ©X) v).Finite} := by
let : MeasurableSpace (Set E) := blockSigma X
simpa only [Function.comp_apply,Set.not_infinite] using
(((G.measurable_infinite_cluster v).comp (measurable_inter_block X)).not).setOf
exact hf.inter (measurableSet_Ici.preimage
(measurable_ncard.comp (G.measurable_freshClusterBoundary X v)))
have hd (S : Finset E) : MeasurableSet[blockSigma X] {Ο | d Ο=S} :=
@measurableSet_finiteSetChoice (Set E) E (blockSigma X) inferInstance
(G.freshClusterBoundary X v) (G.measurable_freshClusterBoundary X v) S
have hA (S : Finset E) : MeasurableSet[blockSigma XαΆ] (A S) :=
blockSigma_mono Set.inter_subset_right _ (measurableSet_fewOpenBonds _ N)
have he (Ο : Set E) (hΟ : (G.cluster (Οβ©X) v).Finite) :
((d Ο : Set E)β©XαΆ)=G.freshClusterBoundary X v Ο := by
change (finiteSetChoice (G.freshClusterBoundary X v Ο) : Set E)β©XαΆ = _
have hf : (G.freshClusterBoundary X v Ο).Finite :=
(G.finite_cutEdges hl hΟ).subset Set.sdiff_subset
rw [finiteSetChoice_coe hf]
exact Set.inter_eq_left.mpr (Set.sdiff_subset_compl _ _)
let r : β := (N+1 : β)*(1-(p:β))^L
have hr : 0 β€ r := mul_nonneg (by positivity) (pow_nonneg (sub_nonneg.mpr p.2.2) _)
have hb (Ο : Set E) (hΟ : ΟβC) : (BernoulliProduct.law (fun _ : E => p)).real (A (d Ο)) β€ r := by
change (BernoulliProduct.law (fun _ : E => p)).real
{Ο | (((d Ο : Set E)β©XαΆ)β©Ο).ncard β€ N} β€ _
rw [he Ο hΟ.1]
exact fewOpenBonds_probability_le p _
((G.finite_cutEdges hl hΟ.1).subset Set.sdiff_subset) N L hΟ.2
have ht := selected_fresh_bound (fun _ : E => p) X XαΆ disjoint_compl_right
d A hd hA C hC r hr hb
simp only [law_const] at ht
change (G.law p).real (Cβ©selectedEvent d A) β€ r*(G.law p).real C at ht
have ht' : (G.law p).real (Cβ©selectedEvent d A) β€ r :=
ht.trans ((mul_le_mul_of_nonneg_left measureReal_le_one hr).trans_eq (mul_one r))
have hsub : G.infiniteEvent v β© G.fewOpenFreshBoundary X v N β
(G.infiniteEvent v β© G.smallFreshBoundary X v M) βͺ (Cβ©selectedEvent d A) := by
intro Ο hΟ
by_cases h : (G.freshClusterBoundary X v Ο).ncard β€ M
Β· exact Or.inl β¨hΟ.1,hΟ.2.1,hβ©
Β· right
refine β¨β¨hΟ.2.1,(Nat.le_of_lt (Nat.lt_of_not_ge h))β©,?_β©
change (((d Ο : Set E)β©XαΆ)β©Ο).ncard β€ N
rw [he Ο hΟ.2.1]
exact hΟ.2.2
exact ((measureReal_mono hsub).trans (measureReal_union_le _ _)).trans
(add_le_add_right ht' _)
theorem fewOpenFreshBoundary_probability_tendsto_zero
(hl : G.LocallyFinite) (p : unitInterval) (hp : 0 < (p:β)) (hp1 : (p:β)<1)
(X : β β Set E) (hX : β S : Finset E, βαΆ n in atTop, (S : Set E) β X n)
(v : V) (N : β) :
Tendsto (fun n => G.law p (G.infiniteEvent v β© G.fewOpenFreshBoundary (X n) v N))
atTop (π 0) := by
have hpow : Tendsto (fun L : β => (N+1 : β)*(1-(p:β))^L) atTop (π 0) := by
simpa only [mul_zero] using (tendsto_pow_atTop_nhds_zero_of_lt_one
(sub_nonneg.mpr p.2.2) (by linarith : 1-(p:β)<1)).const_mul (N+1 : β)
have ht : Tendsto (fun n => (G.law p).real
(G.infiniteEvent v β© G.fewOpenFreshBoundary (X n) v N)) atTop (π 0) := by
apply tendsto_order.mpr
constructor
Β· intro a ha
exact Eventually.of_forall (fun _ => lt_of_lt_of_le ha measureReal_nonneg)
Β· intro b hb
obtain β¨L,hLβ© := (hpow.eventually (gt_mem_nhds (half_pos hb))).exists
have hs := G.smallFreshBoundary_probability_tendsto_zero hl p hp1 X hX v ((N+1)*L)
have hsreal := ENNReal.tendsto_toReal ENNReal.zero_ne_top |>.comp hs
simp only [ENNReal.toReal_zero,Function.comp_def] at hsreal
change Tendsto (fun n => (G.law p).real
(G.infiniteEvent v β© G.smallFreshBoundary (X n) v ((N+1)*L))) atTop (π 0) at hsreal
filter_upwards [hsreal.eventually (gt_mem_nhds (half_pos hb))] with n hn
exact lt_of_le_of_lt (G.fewOpenFreshBoundary_probability_le hl p (X n) v N L)
(by linarith)
have hh := ENNReal.tendsto_ofReal ht
simpa only [ENNReal.ofReal_zero,Measure.real,ENNReal.ofReal_toReal (measure_ne_top _ _)] using hh
end CriticalPercolation.BondGraph
end
end
end OAI
|