Download data/lean/OAI/Probability/CriticalPercolation/Growth/CosetSparseGrowth.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 5.35 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/Growth/CosetSparseGrowth.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/CriticalPercolation/Growth/CosetSparseGrowth.lean
-
curl -L -o CosetSparseGrowth.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/CriticalPercolation/Growth/CosetSparseGrowth.lean
5.35 kB
| import Mathlib | |
| import OAI.Probability.CriticalPercolation.Criticality.NormalClosureGrowth | |
| namespace OAI | |
| section | |
| noncomputable section | |
| open Set Function Filter Topology | |
| open scoped Classical Pointwise | |
| namespace CriticalPercolation.RelativeGrowth | |
| variable {A : Type*} [Group A] | |
| def ball (K : Subgroup A) (S : Set A) (n : β) : Set (A β§Έ K) := | |
| (QuotientGroup.mk : A β A β§Έ K) '' S^n | |
| def HasDegree (K : Subgroup A) (S : Set A) (d : β) : Prop := | |
| (β n, (ball K S n).Finite) β§ β C : β, β R : β, β nβ₯R, (ball K S n).ncardβ€C*n^d | |
| lemma ball_mono (K : Subgroup A) (S : Set A) (h1 : (1:A)βS) : | |
| Monotone (ball K S) := fun _ _ h => Set.image_mono (Set.pow_subset_pow_right h1 h) | |
| lemma not_quadratic_exponential_lower (K : Subgroup A) (S : Set A) (h1 : (1:A)βS) | |
| (d : β) (hg : HasDegree K S d) (L : β) (hL : 0<L) | |
| (hlo : β n : β, 2^n β€ (ball K S (L*n^2)).ncard) : False := by | |
| obtain β¨hfin,C,hCβ© := hg | |
| obtain β¨N,hNβ© := SparseGrowth.eventually_exponential_dominates (C*(4*L)^d) (2*d) | |
| obtain β¨r,hr,hboundβ© := hC (L*(max N 1)^2) | |
| let n := Nat.sqrt (r/L) | |
| have hn : max N 1 β€ n := Nat.le_sqrt'.mpr ((Nat.le_div_iff_mul_le hL).mpr (by | |
| simpa only [Nat.mul_comm] using hr)) | |
| have hn1 : 1 β€ n := (le_max_right N 1).trans hn | |
| have hnr : L*n^2 β€ r := by | |
| calc | |
| _ β€ L*(r/L) := Nat.mul_le_mul_left L (Nat.sqrt_le' (r/L)) | |
| _ β€ r := by simpa only [Nat.mul_comm] using Nat.div_mul_le_self r L | |
| have hrn : r β€ (4*L)*n^2 := by | |
| have ht := Nat.lt_mul_div_succ r hL | |
| have hs : r/L+1 β€ (n+1)^2 := Nat.succ_le_of_lt (Nat.lt_succ_sqrt' (r/L)) | |
| have hs' : (n+1)^2 β€ 4*n^2 := by nlinarith | |
| have hj := (Nat.mul_le_mul_left L hs).trans (Nat.mul_le_mul_left L hs') | |
| nlinarith | |
| have hu : 2^n β€ (C*(4*L)^d)*n^(2*d) := by | |
| calc | |
| _ β€ (ball K S (L*n^2)).ncard := hlo n | |
| _ β€ (ball K S r).ncard := Set.ncard_le_ncard (ball_mono K S h1 hnr) (hfin r) | |
| _ β€ C*r^d := hbound | |
| _ β€ C*((4*L)*n^2)^d := Nat.mul_le_mul_left C (Nat.pow_le_pow_left hrn d) | |
| _ = (C*(4*L)^d)*n^(2*d) := by rw [mul_pow,pow_mul]; ring | |
| exact (not_le_of_gt (hN n ((le_max_left N 1).trans hn))) hu | |
| lemma binaryProducts_coset_inj (K : Subgroup A) (H : β β Subgroup A) (hH : Monotone H) | |
| (hK : Kβ€H 0) (g : β β A) (hg : β n, g nβH (n+1)) (hout : β n, g nβH n) : | |
| β n, Set.InjOn (QuotientGroup.mk : A β A β§Έ K) (SparseGrowth.binaryProducts g n : Set A) := by | |
| intro n | |
| induction n with | |
| | zero => simp [SparseGrowth.binaryProducts,Set.InjOn] | |
| | succ n ih => | |
| intro x hx y hy he | |
| have hKn : Kβ€H n := hK.trans (hH (Nat.zero_le n)) | |
| have hmem := SparseGrowth.binaryProducts_mem H hH g hg n | |
| have hbad (x y : A) (hx : xβSparseGrowth.binaryProducts g n) | |
| (hy : yβSparseGrowth.binaryProducts g n) | |
| (he : (QuotientGroup.mk x : A β§Έ K)=QuotientGroup.mk (g n*y)) : False := by | |
| have hxy : xβ»ΒΉ*(g n*y)βH n := hKn (QuotientGroup.eq.mp he) | |
| have hz := (H n).mul_mem ((H n).mul_mem (hmem x hx) hxy) ((H n).inv_mem (hmem y hy)) | |
| apply hout n | |
| simpa only [mul_inv_cancel_left,mul_assoc,mul_inv_cancel,mul_one] using hz | |
| rcases Finset.mem_union.mp hx with hx|hx <;> rcases Finset.mem_union.mp hy with hy|hy | |
| Β· exact ih hx hy he | |
| Β· obtain β¨z,hz,rflβ© := Finset.mem_image.mp hy | |
| exact False.elim (hbad x z hx hz he) | |
| Β· obtain β¨z,hz,rflβ© := Finset.mem_image.mp hx | |
| exact False.elim (hbad y z hy hz he.symm) | |
| Β· obtain β¨a,ha,rflβ© := Finset.mem_image.mp hx | |
| obtain β¨b,hb,rflβ© := Finset.mem_image.mp hy | |
| apply congrArg (fun t => g n*t) | |
| apply ih ha hb | |
| apply QuotientGroup.eq.mpr | |
| have hh := QuotientGroup.eq.mp he | |
| simpa only [mul_inv_rev,mul_assoc,inv_mul_cancel_left] using hh | |
| lemma binaryProducts_subset_pow (S : Set A) (h1 : (1:A)βS) | |
| (g : β β A) (L : β) (hg : β n, g nβS^(L*(n+1))) : | |
| β n, (SparseGrowth.binaryProducts g n : Set A) β S^(L*n^2) := by | |
| intro n | |
| induction n with | |
| | zero => simp [SparseGrowth.binaryProducts] | |
| | succ n ih => | |
| intro x hx | |
| rcases Finset.mem_union.mp hx with hx | hx | |
| Β· exact Set.pow_subset_pow_right h1 (Nat.mul_le_mul_left L (Nat.pow_le_pow_left (Nat.le_succ n) 2)) (ih hx) | |
| Β· obtain β¨y,hy,rflβ© := Finset.mem_image.mp hx | |
| have hlen : L*(n+1)+L*n^2 β€ L*(n+1)^2 := by | |
| calc | |
| _ = L*(n+1+n^2) := by ring | |
| _ β€ L*(n+1)^2 := Nat.mul_le_mul_left L (by nlinarith) | |
| apply Set.pow_subset_pow_right h1 hlen | |
| rw [pow_add] | |
| exact Set.mul_mem_mul (hg n) (ih hy) | |
| lemma no_linear_strict_chain (K : Subgroup A) (S : Set A) (h1 : (1:A)βS) | |
| (d : β) (hg : HasDegree K S d) (H : β β Subgroup A) (hH : Monotone H) (hK : Kβ€H 0) | |
| (g : β β A) (hgin : β n, g nβH (n+1)) (hgout : β n, g nβH n) | |
| (L : β) (hL : 0<L) (hword : β n, g nβS^(L*(n+1))) : False := by | |
| apply not_quadratic_exponential_lower K S h1 d hg L hL | |
| intro n | |
| have hin := binaryProducts_coset_inj K H hH hK g hgin hgout n | |
| rw [βSparseGrowth.binaryProducts_card H hH g hgin hgout n] | |
| have heq := hin.ncard_image | |
| rw [Set.ncard_coe_finset] at heq | |
| rw [βheq] | |
| exact Set.ncard_le_ncard (Set.image_mono (binaryProducts_subset_pow S h1 g L hword n)) (hg.1 _) | |
| end CriticalPercolation.RelativeGrowth | |
| end | |
| end | |
| end OAI | |