Download data/lean/OAI/Probability/CriticalPercolation/Gluing/DomainFreshExit.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 7.51 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/Gluing/DomainFreshExit.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/CriticalPercolation/Gluing/DomainFreshExit.lean
-
curl -L -o DomainFreshExit.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/Gluing/DomainFreshExit.lean
7.51 kB
| import Mathlib | |
| import OAI.Probability.CriticalPercolation.ProductMeasure.MonotoneIndicatorUpper | |
| import OAI.Probability.CriticalPercolation.Exploration.SliceExploration | |
| import OAI.Probability.CriticalPercolation.Criticality.ContractingDomains | |
| import OAI.Probability.CriticalPercolation.Criticality.DomainPercolation | |
| import OAI.Probability.CriticalPercolation.Gluing.FreshExitContinuity | |
| import OAI.Probability.CriticalPercolation.Gluing.FreshExitWitness | |
| import OAI.Probability.CriticalPercolation.Gluing.UniformFreshBoundary | |
| import OAI.Probability.CriticalPercolation.Modular.ClusterDiscrepancy | |
| namespace OAI | |
| section | |
| noncomputable section | |
| open Set MeasureTheory ProbabilityTheory | |
| open scoped Classical ENNReal | |
| namespace CriticalPercolation.BondGraph | |
| open BernoulliProduct | |
| variable {V E : Type*} (G : BondGraph V E) | |
| def domainFreshExitEvent (D S : Set V) (v : V) (N : β) : Set (Set E) := | |
| {Ο | Οβ©G.inducedEdges D β G.freshExitEvent S v N} | |
| lemma domainFreshExitEvent_upper {D S : Set V} {v : V} (hv : vβS) (N : β) : | |
| IsUpperSet (G.domainFreshExitEvent D S v N) := | |
| (G.freshExitEvent_upper hv N).preimage (fun _ _ h => Set.inter_subset_inter_left _ h) | |
| lemma domainFreshExitEvent_finiteWitness {D S : Set V} {v : V} (hv : vβS) (N : β) : | |
| HasFiniteOpenWitness (G.domainFreshExitEvent D S v N) := by | |
| intro Ο hΟ | |
| obtain β¨F,hF,hFΟ,hFeβ© := G.freshExitEvent_finiteWitness hv N _ hΟ | |
| refine β¨F,hF,hFΟ.trans Set.inter_subset_left,?_β© | |
| change Fβ©G.inducedEdges D β G.freshExitEvent S v N | |
| rwa [Set.inter_eq_left.mpr (hFΟ.trans Set.inter_subset_right)] | |
| lemma measurableSet_domainFreshExitEvent [Countable E] | |
| {D S : Set V} {v : V} (hv : vβS) (N : β) : | |
| MeasurableSet (G.domainFreshExitEvent D S v N) := | |
| measurableSet_finiteWitness _ (G.domainFreshExitEvent_upper hv N) | |
| (G.domainFreshExitEvent_finiteWitness hv N) | |
| lemma freshExit_in_domain_of_mass (D S : Set V) (v : V) (K : ββ₯0β) (N : β) | |
| (hD : G.weightCeiling v KβD) : | |
| G.freshExitEvent S v N\G.massTailEvent v v K β G.domainFreshExitEvent D S v N := by | |
| rintro Ο β¨β¨F,hF,hFΟβ©,hmβ© | |
| have hmass : G.modularMass v (G.cluster Ο v)β€K := le_of_not_gt hm | |
| let X := G.inducedEdges S | |
| let C := G.inducedEdges (G.weightCeiling v K) | |
| have hCD : CβG.inducedEdges D := G.inducedEdges_monotone hD | |
| have hC : G.cluster ((Οβ©G.inducedEdges D)β©X) v=G.cluster (Οβ©X) v := by | |
| apply Set.Subset.antisymm (G.cluster_mono (Set.inter_subset_inter_left _ Set.inter_subset_left) v) | |
| have he : G.cluster ((Οβ©X)β©C) v=G.cluster (Οβ©X) v := | |
| G.cluster_eq_with_weightCeiling | |
| ((G.modularMass_mono v (G.cluster_mono Set.inter_subset_left v)).trans hmass) | |
| rw [βhe] | |
| apply G.cluster_mono | |
| intro e he | |
| exact β¨β¨he.1.1,hCD he.2β©,he.1.2β© | |
| refine β¨F,hF,fun e he => ?_β© | |
| obtain β¨β¨x,y,hexy,hx,hyβ©,heXβ© := (hFΟ he).1 | |
| have hyC : yβG.cluster Ο v := G.cluster_mono Set.inter_subset_left v hy | |
| have hxC : xβG.cluster Ο v := by | |
| by_cases heq : y=x | |
| Β· simpa only [heq] using hyC | |
| Β· exact hyC.trans (show (G.openGraph Ο).Adj y x from by | |
| apply (SimpleGraph.fromEdgeSet_adj _).mpr | |
| refine β¨β¨e,(hFΟ he).2,?_β©,heqβ© | |
| rw [hexy,Sym2.eq_swap]).reachable | |
| have heD : eβG.inducedEdges D := by | |
| apply hCD | |
| intro z hz | |
| rw [hexy] at hz | |
| rcases Sym2.mem_iff.mp hz with rfl|rfl | |
| Β· exact (G.stabilizerWeight_le_modularMass hxC).trans hmass | |
| Β· exact (G.stabilizerWeight_le_modularMass hyC).trans hmass | |
| refine β¨β¨β¨x,y,hexy,?_,?_β©,heXβ©,(hFΟ he).2,heDβ© | |
| Β· change xβG.cluster ((Οβ©G.inducedEdges D)β©X) v | |
| rwa [hC] | |
| Β· change yβG.cluster ((Οβ©G.inducedEdges D)β©X) v | |
| rwa [hC] | |
| lemma freshExit_same_cluster {S : Set V} {x y : V} {N : β} {Ο : Set E} | |
| (hxy : yβG.cluster (Οβ©G.inducedEdges S) x) : | |
| ΟβG.freshExitEvent S x N β ΟβG.freshExitEvent S y N := by | |
| simp only [freshExitEvent,Set.mem_ofPred_eq,freshClusterBoundary] | |
| rw [G.cluster_eq_of_reachable hxy] | |
| lemma InsideWalk.domainFreshExit_transfer [Countable V] [Countable E] | |
| (p : unitInterval) {D S : Set V} {x y : V} {L : β} (_ : xβS) (hy : yβS) | |
| (h : G.InsideWalk (Dβ©S) x y L) (N : β) : | |
| (p:β)^L*(G.law p).real (G.domainFreshExitEvent D S y N) β€ | |
| (G.law p).real (G.domainFreshExitEvent D S x N) := by | |
| obtain β¨w,hw,hsβ© := h | |
| obtain β¨F,hF,hFS,hcard,hconnβ© := G.walk_finite_bond_witness w (Dβ©S) hs | |
| let A : Set (Set E) := {Ο | FβΟ} | |
| have hA : IsUpperSet A := fun _ _ hΟΞ· hΟ => hΟ.trans hΟΞ· | |
| have hAw : HasFiniteOpenWitness A := fun Ο hΟ => β¨F,hF,hΟ,Set.Subset.rflβ© | |
| have hH := harris_finiteWitness (fun _ : E => p) A (G.domainFreshExitEvent D S y N) | |
| hA (G.domainFreshExitEvent_upper hy N) hAw (G.domainFreshExitEvent_finiteWitness hy N) | |
| simp only [law_const] at hH | |
| have hsub : Aβ©G.domainFreshExitEvent D S y N β G.domainFreshExitEvent D S x N := by | |
| intro Ο hΟ | |
| apply (G.freshExit_same_cluster (S := S) (x := x) (y := y) (N := N) (Ο := Οβ©G.inducedEdges D) ?_).mpr hΟ.2 | |
| apply G.cluster_mono (Ο := F) _ x hconn | |
| intro e he | |
| refine β¨β¨hΟ.1 he,fun z hz => (hFS he z hz).1β©,fun z hz => (hFS he z hz).2β© | |
| have hprob : (p:β)^Lβ€(G.law p).real A := by | |
| rw [law,βlaw_const,real_law_subset p F hF] | |
| exact pow_le_pow_of_le_one p.2.1 p.2.2 (hcard.trans hw) | |
| exact (mul_le_mul_of_nonneg_right hprob measureReal_nonneg).trans | |
| (hH.trans (measureReal_mono hsub)) | |
| theorem uniform_domainFreshExit_of_mass | |
| (hc : G.fullGraph.Connected) (hl : G.LocallyFinite) (hq : G.QuasiTransitive) | |
| (p : unitInterval) (hp : 0<(p:β)) (hp1 : (p:β)<1) | |
| (hper : 0<G.law p G.percolates) | |
| (hm : β v, βα΅ Ο βG.law p, G.modularMass v (G.cluster Ο v)β β) : | |
| β ΞΈ : β, 0<ΞΈ β§ β K : β, 1β€K β§ β N : β, β R : β, | |
| β (D S : Set V) (v : V), G.weightCeiling v KβD β G.vertexBall v RβS β | |
| (βα΅ Ο βG.law p, (G.cluster (Οβ©G.inducedEdges S) v).Finite) β | |
| ΞΈ<(G.law p).real (G.domainFreshExitEvent D S v N) := by | |
| let := G.countable_vertices hc hl | |
| let := G.countable_bonds hc hl | |
| obtain β¨ΞΈ,hΞΈ,hrootβ© := G.uniform_rooted_probability hc hl hq p hper | |
| obtain β¨K,hK,htailβ© := G.uniform_massTail_small hq p hm (ΞΈ/4) (by positivity) | |
| refine β¨ΞΈ/2,by positivity,K,hK,fun N => ?_β© | |
| obtain β¨R,hRβ© := G.fewOpenFreshBoundary_uniform_ball hc hl hq p hp hp1 N (ΞΈ/4) (by positivity) | |
| refine β¨R,fun D S v hD hS hf => ?_β© | |
| have hfail : (G.law p).real (G.infiniteEvent v\G.freshExitEvent S v N)<ΞΈ/4 := by | |
| exact lt_of_le_of_lt | |
| (ENNReal.toReal_mono (measure_ne_top _ _) | |
| (G.infinite_sdiff_freshExit_bound hl p S v N hf)) | |
| (hR v _ (G.inducedEdges_monotone hS)) | |
| have hcover : G.infiniteEvent vβ | |
| (G.infiniteEvent v\G.freshExitEvent S v N)βͺ | |
| (G.massTailEvent v v KβͺG.domainFreshExitEvent D S v N) := by | |
| intro Ο hΟ | |
| by_cases he : ΟβG.freshExitEvent S v N | |
| Β· right | |
| by_cases hm : ΟβG.massTailEvent v v K | |
| Β· exact Or.inl hm | |
| Β· exact Or.inr (G.freshExit_in_domain_of_mass D S v K N hD β¨he,hmβ©) | |
| Β· exact Or.inl β¨hΟ,heβ© | |
| have hprob := (measureReal_mono hcover (ΞΌ := G.law p)).trans (measureReal_union_le _ _) | |
| have hu := measureReal_union_le (G.massTailEvent v v K) (G.domainFreshExitEvent D S v N) (ΞΌ := G.law p) | |
| have hr := hroot v | |
| have ht := htail v | |
| linarith | |
| end CriticalPercolation.BondGraph | |
| end | |
| end | |
| end OAI | |