Download data/lean/OAI/Analysis/HardSphere/Paths/Admissible.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 6.32 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/HardSphere/Paths/Admissible.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Analysis/HardSphere/Paths/Admissible.lean
-
curl -L -o Admissible.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/HardSphere/Paths/Admissible.lean
6.32 kB
| import Mathlib | |
| import OAI.Analysis.HardSphere.Paths.AcceptedIntegrand | |
| namespace OAI | |
| section | |
| noncomputable section | |
| open MeasureTheory ProbabilityTheory | |
| open scoped ENNReal BigOperators | |
| namespace HardSphere.DyadicSkeleton | |
| open HardSphere.Lattice | |
| attribute [local instance] Classical.propDecidable | |
| def currentAdmissiblePair {K : β} [NeZero K] (x y : DiscreteTorus K) : Prop := | |
| β n : β, Kβ€10*n β§ 8*nβ€K β§ β d : Fin 2 β β€, (β j, |d j|β€n) β§ | |
| y=x+![(n:ZMod K),(d 0:ZMod K),(d 1:ZMod K)] | |
| def currentAdmissiblePairs (K : β) [NeZero K] : Finset (DiscreteTorus K Γ DiscreteTorus K) := | |
| Finset.univ.filter (fun z β¦ currentAdmissiblePair z.1 z.2) | |
| lemma current_admissible_lift {K : β} [NeZero K] {x y : DiscreteTorus K} | |
| (h : currentAdmissiblePair x y) : | |
| β n : β, 0<n β§ 8*nβ€K β§ Kβ€10*n β§ β v : Vertex, β d : Fin 2 β β€, | |
| (βj, |d j|β€n) β§ torusProjection K v=x β§ | |
| torusProjection K (v+![(n:β€),d 0,d 1])=y := by | |
| obtain β¨n,hl,hu,d,hd,hyβ© := h | |
| let v : Vertex := fun j β¦ (x j).val | |
| have hK : 0<K := NeZero.pos K | |
| refine β¨n,by omega,hu,hl,v,d,hd,?_,?_β© | |
| Β· ext j; simp [torusProjection,v] | |
| Β· rw [hy] | |
| ext j; fin_cases j <;> simp [torusProjection,v] | |
| lemma current_admissible_card {K : β} [NeZero K] (hK : 400β€K) : | |
| K^6β€2000*(currentAdmissiblePairs K).card := by | |
| let m := K/10 | |
| let I := Finset.Icc (K/10+1) (K/8) | |
| let J := Finset.range (2*m+1) | |
| let S : Finset (DiscreteTorus K Γ β Γ β Γ β) := | |
| Finset.univ ΓΛ’ (I ΓΛ’ (J ΓΛ’ J)) | |
| let f : DiscreteTorus K Γ β Γ β Γ β β DiscreteTorus K Γ DiscreteTorus K := | |
| fun z β¦ (z.1,z.1+![(z.2.1:ZMod K),((z.2.2.1:β€)-m:ZMod K),((z.2.2.2:β€)-m:ZMod K)]) | |
| have hI (n : β) (hn : nβI) : Kβ€10*n β§ 8*nβ€K β§ n<K β§ m<n := by | |
| have hn := Finset.mem_Icc.mp hn | |
| dsimp [m] | |
| omega | |
| have hJ (b : β) (hb : bβJ) : b<K β§ |(b:β€)-m|β€(m:β€) := by | |
| have hb := Finset.mem_range.mp hb | |
| dsimp [m] at * | |
| constructor | |
| Β· omega | |
| Β· rw [abs_le]; constructor <;> omega | |
| have hsub : S.image fβcurrentAdmissiblePairs K := by | |
| intro z hz | |
| obtain β¨β¨x,n,b,cβ©,hu,rflβ© := Finset.mem_image.mp hz | |
| simp only [S,Finset.mem_product] at hu | |
| obtain β¨_,hn,hb,hcβ© := hu | |
| have hin := hI n hn | |
| apply Finset.mem_filter.mpr | |
| refine β¨Finset.mem_univ _,n,hin.1,hin.2.1,![(b:β€)-m,(c:β€)-m],?_,?_β© | |
| Β· intro j | |
| fin_cases j | |
| Β· exact (hJ b hb).2.trans (by exact_mod_cast hin.2.2.2.le) | |
| Β· exact (hJ c hc).2.trans (by exact_mod_cast hin.2.2.2.le) | |
| Β· simp [f] | |
| have hinj : Set.InjOn f (βS : Set _) := by | |
| rintro β¨x,n,b,cβ© hx β¨x',n',b',c'β© hx' he | |
| have heβ : x=x' := congrArg Prod.fst he | |
| subst x' | |
| have heβ : ![(n:ZMod K),((b:β€)-m:ZMod K),((c:β€)-m:ZMod K)]= | |
| ![(n':ZMod K),((b':β€)-m:ZMod K),((c':β€)-m:ZMod K)] := | |
| add_left_cancel (congrArg Prod.snd he) | |
| change (x,n,b,c)βS at hx | |
| change (x,n',b',c')βS at hx' | |
| simp only [S,Finset.mem_product] at hx hx' | |
| obtain β¨_,hn,hb,hcβ© := hx | |
| obtain β¨_,hn',hb',hc'β© := hx' | |
| have hnval := congrArg (fun z : Fin 3 β ZMod K β¦ (z 0).val) heβ | |
| simp only [Matrix.cons_val_zero,ZMod.val_natCast_of_lt (hI n hn).2.2.1, | |
| ZMod.val_natCast_of_lt (hI n' hn').2.2.1] at hnval | |
| have hbeq : (b:ZMod K)=(b':ZMod K) := by | |
| have h := congrFun heβ 1 | |
| simpa using h | |
| have hceq : (c:ZMod K)=(c':ZMod K) := by | |
| have h := congrFun heβ 2 | |
| simpa using h | |
| have hbval := congrArg ZMod.val hbeq | |
| have hcval := congrArg ZMod.val hceq | |
| simp only [ZMod.val_natCast_of_lt (hJ b hb).1,ZMod.val_natCast_of_lt (hJ b' hb').1] at hbval | |
| simp only [ZMod.val_natCast_of_lt (hJ c hc).1,ZMod.val_natCast_of_lt (hJ c' hc').1] at hcval | |
| simp only [Prod.mk.injEq] | |
| exact β¨trivial,hnval,hbval,hcvalβ© | |
| have hcard : S.cardβ€(currentAdmissiblePairs K).card := | |
| (Finset.card_image_iff.mpr hinj).symm.trans_le (Finset.card_le_card hsub) | |
| have hcardS : S.card=K^3*I.card*J.card^2 := by | |
| dsimp only [S] | |
| rw [Finset.card_product,Finset.card_product,Finset.card_product] | |
| simp [DiscreteTorus,mul_assoc,pow_two] | |
| have hcardI : Kβ€50*I.card := by | |
| dsimp [I] | |
| rw [Nat.card_Icc] | |
| omega | |
| have hcardJ : Kβ€6*J.card := by | |
| simp only [J,Finset.card_range,m] | |
| omega | |
| rw [hcardS] at hcard | |
| calc | |
| K^6=K^3*K*K^2 := by ring | |
| _ β€ K^3*(50*I.card)*(6*J.card)^2 := Nat.mul_le_mul | |
| (Nat.mul_le_mul_left _ hcardI) (Nat.pow_le_pow_left hcardJ 2) | |
| _ = 1800*(K^3*I.card*J.card^2) := by ring | |
| _ β€ 1800*(currentAdmissiblePairs K).card := Nat.mul_le_mul_left _ hcard | |
| _ β€ _ := Nat.mul_le_mul_right _ (by decide) | |
| end HardSphere.DyadicSkeleton | |
| end | |
| end | |
| section | |
| noncomputable section | |
| open MeasureTheory ProbabilityTheory | |
| open scoped ENNReal BigOperators | |
| namespace HardSphere.DyadicSkeleton | |
| open HardSphere.Lattice | |
| theorem current_good_paths (R : β) : | |
| β pβ ΞΊ : β, 0<pβ β§ 0<ΞΊ β§ β Kβ : β, β K : β, Kββ€K β β _ : NeZero K, | |
| K^6β€2000*(currentAdmissiblePairs K).card β§ | |
| β {Ξ© : Type*} [MeasurableSpace Ξ©], β P : Measure Ξ©, β _ : IsProbabilityMeasure P, | |
| β b : Ξ© β Finset (DiscreteTorus K), Measurable b β | |
| β p : β, 0β€p β pβ€pβ β | |
| (β A : Finset (DiscreteTorus K), P {d | Aβb d}β€(ENNReal.ofReal p)^A.card) β | |
| β x y : DiscreteTorus K, currentAdmissiblePair x y β | |
| β E : Set Ξ©, MeasurableSet E β§ (1/2:ββ₯0β)β€P E β§ | |
| β Ξ½ : Kernel Ξ© (SimplePath x y), IsMarkovKernel Ξ½ β§ | |
| (β eβE, Ξ½ e {q | simplePathGood (b e) q}=1) β§ | |
| (β«β» e, E.indicator (fun e β¦ β«β» q, β«β» q', | |
| ENNReal.ofReal (Real.exp (ΞΊ*(simpleEncounter R q q':β))) βΞ½ e βΞ½ e) e βP)β€2 := by | |
| obtain β¨pβ,ΞΊ,hpβ,hΞΊ,Kβ,hallβ© := dyadic_good_paths_lift R | |
| refine β¨pβ,ΞΊ,hpβ,hΞΊ,max Kβ 400,?_β© | |
| intro K hK inst | |
| refine β¨current_admissible_card ((le_max_right Kβ 400).trans hK),?_β© | |
| intro Ξ© mΞ© P hP b hb p hp hpp hbad x y hxy | |
| obtain β¨n,hn,hnK,_,v,d,hd,hv,hwβ© := current_admissible_lift hxy | |
| subst x y | |
| exact hall K ((le_max_left Kβ 400).trans hK) inst P hP b hb p hp hpp hbad n hn hnK d hd v | |
| end HardSphere.DyadicSkeleton | |
| end | |
| end | |
| end OAI | |