math / data /lean /OAI /Probability /CriticalPercolation /GraphGeometry /GraphApproximateNeighborhoods.lean
Download data/lean/OAI/Probability/CriticalPercolation/GraphGeometry/GraphApproximateNeighborhoods.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 7.18 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/GraphGeometry/GraphApproximateNeighborhoods.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/CriticalPercolation/GraphGeometry/GraphApproximateNeighborhoods.lean
-
curl -L -o GraphApproximateNeighborhoods.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/GraphGeometry/GraphApproximateNeighborhoods.lean
7.18 kB
| import Mathlib | |
| import OAI.Probability.CriticalPercolation.GraphTopology.GraphNeighborhoodCompact | |
| import OAI.Probability.CriticalPercolation.Growth.SparseDoubling | |
| namespace OAI | |
| section | |
| noncomputable section | |
| open Set Function Topology | |
| open scoped Classical Pointwise | |
| namespace CriticalPercolation.GraphTopology | |
| variable {X : Type*} (Ξ : SimpleGraph X) | |
| def displacement (o : X) (r : β) : Set (Ξ βg Ξ) := | |
| {g | g oβreachBall Ξ o r} | |
| lemma reachBall_mono (o : X) : Monotone (reachBall Ξ o) := by | |
| intro r s hrs x hx | |
| obtain β¨p,hpβ© := hx | |
| exact β¨p,hp.trans hrsβ© | |
| lemma iso_reachBall_image (g : Ξ βg Ξ) (o : X) (r : β) : | |
| g '' reachBall Ξ o r=reachBall Ξ (g o) r := by | |
| apply Set.Subset.antisymm | |
| Β· rintro x β¨y,hy,rflβ© | |
| exact iso_reachBall Ξ g hy | |
| Β· intro x hx | |
| refine β¨g.symm x,?_,g.apply_symm_apply xβ© | |
| simpa using iso_reachBall Ξ g.symm hx | |
| lemma reachBall_ncard_eq (ht : β u v, β g : Ξ βg Ξ, g u=v) (o x : X) (r : β) : | |
| (reachBall Ξ x r).ncard=(reachBall Ξ o r).ncard := by | |
| obtain β¨g,rflβ© := ht o x | |
| rw [βiso_reachBall_image Ξ g o r,Set.ncard_image_of_injective _ g.injective] | |
| lemma one_mem_displacement (o : X) (r : β) : 1βdisplacement Ξ o r := | |
| reachBall_self Ξ o r | |
| lemma displacement_inv {o : X} {r : β} {g : Ξ βg Ξ} : | |
| gβ»ΒΉβdisplacement Ξ o r β gβdisplacement Ξ o r := by | |
| constructor | |
| Β· intro h | |
| change g oβreachBall Ξ o r | |
| simpa using inverse_displacement Ξ g.symm h | |
| Β· exact inverse_displacement Ξ g | |
| lemma displacement_mul_subset (o : X) (r s : β) : | |
| displacement Ξ o r * displacement Ξ o s β displacement Ξ o (r+s) := by | |
| rintro g β¨a,ha,b,hb,rflβ© | |
| exact reachBall_add Ξ ha (iso_reachBall Ξ a hb) | |
| lemma reachBall_packing (hl : β x, (Ξ.neighborSet x).Finite) | |
| (ht : β u v, β g : Ξ βg Ξ, g u=v) (o : X) (r K : β) | |
| (hd : (reachBall Ξ o (5*r)).ncardβ€K*(reachBall Ξ o r).ncard) : | |
| β F : Finset X, (βF : Set X)βreachBall Ξ o (4*r) β§ F.cardβ€K β§ | |
| β uβreachBall Ξ o (4*r), β vβF, uβreachBall Ξ v (2*r) := by | |
| let A := (reachBall_finite Ξ hl o (4*r)).toFinset | |
| let C : Finset (Finset X) := A.powerset.filter | |
| (fun F => (F : Set X).PairwiseDisjoint (fun v => reachBall Ξ v r)) | |
| obtain β¨F,hFmaxβ© := C.exists_maximal <| Finset.filter_nonempty_iff.mpr | |
| β¨β ,Finset.empty_mem_powerset _,by simpβ© | |
| simp only [C,Finset.mem_filter,Finset.mem_powerset] at hFmax | |
| obtain β¨hFA,hFβ© := hFmax.1 | |
| have hFo : (F : Set X)βreachBall Ξ o (4*r) := by | |
| intro u hu | |
| exact (reachBall_finite Ξ hl o (4*r)).mem_toFinset.mp (hFA hu) | |
| have hsub : (β uβ(F : Set X), reachBall Ξ u r) β reachBall Ξ o (5*r) := by | |
| intro v hv | |
| obtain β¨u,hu,hvβ© := Set.mem_iUnionβ.mp hv | |
| simpa only [show 4*r+r=5*r by omega] using reachBall_add Ξ (hFo hu) hv | |
| have hcount : F.card*(reachBall Ξ o r).ncardβ€(reachBall Ξ o (5*r)).ncard := by | |
| calc | |
| F.card*(reachBall Ξ o r).ncard = β uβF, (reachBall Ξ u r).ncard := by | |
| symm | |
| apply Finset.sum_const_nat | |
| intro u _ | |
| exact reachBall_ncard_eq Ξ ht o u r | |
| _ = (β uβ(F : Set X), reachBall Ξ u r).ncard := by | |
| rw [(F.finite_toSet).ncard_biUnion (fun u _ => reachBall_finite Ξ hl u r) hF, | |
| finsum_mem_coe_finset] | |
| _ β€ (reachBall Ξ o (5*r)).ncard := Set.ncard_le_ncard hsub (reachBall_finite Ξ hl o _) | |
| have hpos : 0<(reachBall Ξ o r).ncard := | |
| (Set.ncard_pos (reachBall_finite Ξ hl o r)).mpr β¨o,reachBall_self Ξ o rβ© | |
| refine β¨F,hFo,le_of_mul_le_mul_right (hcount.trans hd) hpos,?_β© | |
| intro u hu | |
| by_cases huF : uβF | |
| Β· exact β¨u,huF,reachBall_self Ξ u _β© | |
| by_cases! H : β vβF, Disjoint (reachBall Ξ u r) (reachBall Ξ v r) | |
| Β· refine False.elim (hFmax.not_gt ?_ (Finset.ssubset_insert huF)) | |
| rw [Finset.insert_subset_iff,Finset.coe_insert] | |
| exact β¨β¨(reachBall_finite Ξ hl o (4*r)).mem_toFinset.mpr hu,hFAβ©, | |
| hF.insert (fun v hv _ => H v hv)β© | |
| Β· simp_rw [Set.not_disjoint_iff] at H | |
| obtain β¨v,hv,w,hwu,hwvβ© := H | |
| refine β¨v,hv,?_β© | |
| simpa only [show r+r=2*r by omega] using | |
| reachBall_add Ξ hwv (reachBall_symm Ξ hwu) | |
| lemma displacement_cover_of_doubling (hl : β x, (Ξ.neighborSet x).Finite) | |
| (ht : β u v, β g : Ξ βg Ξ, g u=v) (o : X) (r K : β) | |
| (hd : (reachBall Ξ o (5*r)).ncardβ€K*(reachBall Ξ o r).ncard) : | |
| CovBySMul (Ξ βg Ξ) (K : β) (displacement Ξ o (4*r)) (displacement Ξ o (2*r)) := by | |
| obtain β¨F,hFo,hFK,hcoverβ© := reachBall_packing Ξ hl ht o r K hd | |
| have hex : β v : F, β Ο : Ξ βg Ξ, Ο o=v.val := fun v => ht o v.val | |
| choose Ο hΟ using hex | |
| let H := Finset.univ.image Ο | |
| have hH : H.cardβ€K := (Finset.card_image_le).trans (by simpa using hFK) | |
| refine β¨H,by exact_mod_cast hH,?_β© | |
| intro Ο hΟ | |
| obtain β¨v,hv,huvβ© := hcover (Ο o) hΟ | |
| let c := Ο β¨v,hvβ© | |
| have hc : cβH := Finset.mem_image.mpr β¨β¨v,hvβ©,Finset.mem_univ _,rflβ© | |
| have hco : c o=v := hΟ β¨v,hvβ© | |
| have hrem : cβ»ΒΉ*Οβdisplacement Ξ o (2*r) := by | |
| have hh := iso_reachBall Ξ c.symm huv | |
| rw [βhco] at hh | |
| change c.symm (Ο o)βreachBall Ξ o (2*r) | |
| simpa using hh | |
| change Οβ(H : Set (Ξ βg Ξ))*displacement Ξ o (2*r) | |
| exact Set.mem_mul.mpr β¨c,hc,cβ»ΒΉ*Ο,hrem,by simpβ© | |
| lemma displacement_approximate_of_doubling (hl : β x, (Ξ.neighborSet x).Finite) | |
| (ht : β u v, β g : Ξ βg Ξ, g u=v) (o : X) (r K : β) | |
| (hd : (reachBall Ξ o (5*r)).ncardβ€K*(reachBall Ξ o r).ncard) : | |
| IsApproximateSubgroup (K : β) (displacement Ξ o (2*r)) where | |
| one_mem := one_mem_displacement Ξ o _ | |
| inv_eq_self := by | |
| ext Ο | |
| change Οβ»ΒΉβdisplacement Ξ o (2*r) β Οβdisplacement Ξ o (2*r) | |
| exact displacement_inv Ξ | |
| sq_covBySMul := by | |
| apply (displacement_cover_of_doubling Ξ hl ht o r K hd).subset_left | |
| rw [pow_two] | |
| simpa only [show 2*r+2*r=4*r by omega] using displacement_mul_subset Ξ o (2*r) (2*r) | |
| theorem compact_open_approximate_scales | |
| [TopologicalSpace X] [DiscreteTopology X] | |
| (hc : Ξ.Connected) (hl : β x, (Ξ.neighborSet x).Finite) | |
| (ht : β u v, β g : Ξ βg Ξ, g u=v) (o : X) (d : β) | |
| (hpoly : β R : β, β nβ₯R, (reachBall Ξ o n).ncardβ€n^d) : | |
| let _ : TopologicalSpace (Ξ βg Ξ) := autTopology Ξ | |
| β R : β, β nβ₯R, IsCompact (displacement Ξ o (2*n)) β§ | |
| IsOpen (displacement Ξ o (2*n)) β§ | |
| IsApproximateSubgroup (5^(d+1) : β) (displacement Ξ o (2*n)) := by | |
| let _ : TopologicalSpace (Ξ βg Ξ) := autTopology Ξ | |
| dsimp only | |
| intro R | |
| obtain β¨n,hn,hdβ© := sparse_polynomial_doubling_scales | |
| (fun n => (reachBall Ξ o n).ncard) | |
| (fun r s hrs => Set.ncard_le_ncard (reachBall_mono Ξ o hrs) (reachBall_finite Ξ hl o s)) | |
| (fun n => (Set.ncard_pos (reachBall_finite Ξ hl o n)).mpr β¨o,reachBall_self Ξ o nβ©) | |
| d hpoly R | |
| refine β¨n,hn,compact_displacement Ξ hc hl o _,open_displacement Ξ o _,?_β© | |
| exact_mod_cast displacement_approximate_of_doubling Ξ hl ht o n (5^(d+1)) hd | |
| end CriticalPercolation.GraphTopology | |
| end | |
| end | |
| end OAI | |