Download data/lean/OAI/Probability/CriticalPercolation/Gluing/FewContacts.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.24 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/Gluing/FewContacts.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/CriticalPercolation/Gluing/FewContacts.lean
-
curl -L -o FewContacts.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/Gluing/FewContacts.lean
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 | |