math / data /lean /OAI /Probability /CriticalPercolation /GraphGeometry /GraphApproximateNeighborhoods.lean
introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
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