Download data/lean/OAI/Probability/JammingConcavity/GaussianStepSlope.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 28.8 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/JammingConcavity/GaussianStepSlope.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Probability/JammingConcavity/GaussianStepSlope.lean
-
curl -L -o GaussianStepSlope.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Probability/JammingConcavity/GaussianStepSlope.lean
28.8 kB
| import Mathlib | |
| import OAI.Probability.JammingConcavity.GaussianTwiceTerminal | |
| namespace OAI | |
| /-! Gaussian Step Slope. -/ | |
| noncomputable section | |
| open MeasureTheory ProbabilityTheory Set | |
| open scoped NNReal ENNReal | |
| open Set Filter | |
| open scoped Topology | |
| open MeasureTheory ProbabilityTheory Filter Set | |
| open scoped ENNReal NNReal Topology BigOperators | |
| open MeasureTheory Filter Set | |
| open scoped ENNReal NNReal BigOperators | |
| open MeasureTheory ProbabilityTheory Set Filter | |
| open scoped ENNReal NNReal Topology | |
| open scoped NNReal ENNReal Topology | |
| open MeasureTheory ProbabilityTheory Set Filter | |
| open scoped NNReal ENNReal Topology | |
| namespace MicroscopicJamming | |
| lemma slope_bound_from_curvature {f : β β β} {D K : β} | |
| (hf : Differentiable β f) (hf' : Differentiable β (deriv f)) | |
| (hD : 0 β€ D) (hK : 0 β€ K) (hvals : |f 1-f 0| β€ D) | |
| (hb : β z, |deriv (deriv f) z| β€ K) : | |
| β x, |deriv f x| β€ (D+K)*(1+|x|) := by | |
| obtain β¨c,hc,heβ© := exists_deriv_eq_slope f (show (0:β)<1 by norm_num) | |
| hf.continuous.continuousOn hf.differentiableOn | |
| have hfc : |deriv f c| β€ D := by rw [he]; simpa using hvals | |
| intro x | |
| have hh := Convex.norm_image_sub_le_of_norm_deriv_le | |
| (f := deriv f) (s := univ) (C := K) (fun z _ => hf' z) | |
| (fun z _ => by simpa only [Real.norm_eq_abs] using hb z) | |
| convex_univ (x := c) (y := x) (mem_univ _) (mem_univ _) | |
| simp only [Real.norm_eq_abs] at hh | |
| have hd : |x-c| β€ 1+|x| := by | |
| have ht := abs_sub x c | |
| rw [abs_of_pos hc.1] at ht | |
| linarith [hc.2] | |
| have ht := abs_add_le (deriv f x-deriv f c) (deriv f c) | |
| rw [sub_add_cancel] at ht | |
| have hm := mul_le_mul_of_nonneg_left hd hK | |
| nlinarith [mul_nonneg hD (abs_nonneg x)] | |
| theorem gaussian_step_slope : GaussianStepSlopeStatement := by | |
| intro A B C ΞΊ Q hQ hA hC hk hsub | |
| let K := C+ΞΊ/(1-ΞΊ*Q) | |
| let D := 2*|B|+A*(3+2*Q) | |
| have hden : 0 < 1-ΞΊ*Q := by linarith | |
| have hK : 0 β€ K := add_nonneg hC (div_nonneg hk hden.le) | |
| have hD : 0 β€ D := by dsimp [D]; positivity | |
| refine β¨D+K,add_nonneg hD hK,?_β© | |
| intro u hu rs hrs hsum | |
| obtain β¨hf,hf',hbβ© := gaussian_step_bounds u A B C ΞΊ Q hQ hu rs hrs hsum | |
| have hR := gaussianStepTime_nonneg (fun r hr => (hrs r hr).2.2) | |
| have hdenR : 0 < 1-ΞΊ*gaussianStepTime rs := by | |
| have hh := mul_le_mul_of_nonneg_left hsum hk | |
| linarith | |
| have hcap : ΞΊ/(1-ΞΊ*gaussianStepTime rs) β€ ΞΊ/(1-ΞΊ*Q) := | |
| div_le_div_of_nonneg_left hk hden (by nlinarith [mul_le_mul_of_nonneg_left hsum hk]) | |
| have hcurv (z : β) : |deriv (deriv (gaussianRowComposition rs u)) z| β€ K := by | |
| rw [abs_le] | |
| have hz := (hb z).2 | |
| dsimp [K] | |
| constructor <;> linarith [div_nonneg hk hden.le,hz.1,hz.2] | |
| have habs (z : β) : |gaussianRowComposition rs u z| β€ |B|+A*(1+z^2+Q) := by | |
| rw [abs_le] | |
| have hz := (hb z).1 | |
| have hadd := mul_le_mul_of_nonneg_left hsum hA | |
| have hp : 0 β€ A*(1+z^2+Q) := mul_nonneg hA (by positivity) | |
| constructor <;> nlinarith [abs_nonneg B,le_abs_self B] | |
| have hv : |gaussianRowComposition rs u 1-gaussianRowComposition rs u 0| β€ D := by | |
| have hh := abs_sub (gaussianRowComposition rs u 1) (gaussianRowComposition rs u 0) | |
| have h1 := habs 1 | |
| have h0 := habs 0 | |
| dsimp [D] | |
| norm_num at h1 h0 | |
| linarith | |
| exact slope_bound_from_curvature hf hf' hD hK hv hcurv | |
| end MicroscopicJamming | |
| open MeasureTheory ProbabilityTheory Set Filter | |
| open scoped NNReal ENNReal Topology | |
| namespace MicroscopicJamming | |
| lemma heat_affine_continuousAt {v : β β β} (hv : Continuous v) | |
| (hg : HeatQuadraticGrowth v) {a b : β β β} {tβ : β} | |
| (ha : ContinuousAt a tβ) (hb : ContinuousAt b tβ) : | |
| ContinuousAt (fun t => β« z : β, v (a t+b t*z) βgaussianReal 0 1) tβ := by | |
| let K := 1+|a tβ|+|b tβ| | |
| have hK : 0 β€ K := by dsimp [K]; positivity | |
| have hea : βαΆ t in π tβ, |a t| β€ K := | |
| (ha.abs.tendsto.eventually (eventually_lt_nhds (show |a tβ| < K by | |
| dsimp [K]; linarith [abs_nonneg (b tβ)]))).mono fun _ h => h.le | |
| have heb : βαΆ t in π tβ, |b t| β€ K := | |
| (hb.abs.tendsto.eventually (eventually_lt_nhds (show |b tβ| < K by | |
| dsimp [K]; linarith [abs_nonneg (a tβ)]))).mono fun _ h => h.le | |
| obtain β¨C,hC,hgrowβ© := hg | |
| refine continuousAt_of_dominated | |
| (ΞΌ := gaussianReal 0 1) (bound := fun z => C*(1+2*K)^2*(1+|z|)^2) | |
| (Eventually.of_forall fun t => (hv.measurable.comp (by fun_prop)).aestronglyMeasurable) | |
| ?_ ((gaussian_abs_one_pow_integrable 2).const_mul _) ?_ | |
| Β· filter_upwards [hea,heb] with t hat hbt | |
| filter_upwards [] with z | |
| have hab : 1+|a t+b t*z| β€ (1+2*K)*(1+|z|) := | |
| (heat_affine_bound (a t) (b t) z).trans | |
| (mul_le_mul_of_nonneg_right (by linarith) (by positivity)) | |
| rw [Real.norm_eq_abs] | |
| calc | |
| |v (a t+b t*z)| β€ C*(1+|a t+b t*z|)^2 := hgrow _ | |
| _ β€ C*((1+2*K)*(1+|z|))^2 := | |
| mul_le_mul_of_nonneg_left (pow_le_pow_leftβ (by positivity) hab 2) hC | |
| _ = _ := by ring | |
| Β· filter_upwards [] with z | |
| exact hv.continuousAt.comp (ha.add (hb.mul_const z)) | |
| lemma gaussianHeat_time_continuous {v : β β β} (hv : Continuous v) | |
| (hg : HeatQuadraticGrowth v) (x : β) : | |
| Continuous (fun T => gaussianHeat v T x) := by | |
| rw [continuous_iff_continuousAt] | |
| intro T | |
| exact heat_affine_continuousAt hv hg continuousAt_const Real.continuous_sqrt.continuousAt | |
| lemma gaussianRowOperator_time_continuous {u : β β β} {A B C ΞΊ Q a : β} | |
| (hu : Twice.RowTwiceTerminal u A B C ΞΊ Q) (ha : 0 β€ a) (x : β) : | |
| Continuous (fun T => gaussianRowOperator a T u x) := by | |
| by_cases haz : a=0 | |
| Β· subst a | |
| simpa [gaussianRowOperator] using gaussianHeat_time_continuous | |
| hu.differentiable.continuous (Twice.row_terminal_quadratic_growth hu) x | |
| Β· have he : Continuous (fun y => Real.exp (a*u y)) := by | |
| exact Real.continuous_exp.comp (continuous_const.mul hu.differentiable.continuous) | |
| have hg := (Twice.row_exp_growth hu ha).1 | |
| have ht := gaussianHeat_time_continuous he hg x | |
| have hp (T : β) : gaussianHeat (fun y => Real.exp (a*u y)) T x β 0 := | |
| (integral_exp_pos (heat_affine_quadratic_integrable he.measurable hg x (Real.sqrt T))).ne' | |
| simpa [gaussianRowOperator,haz] using (ht.log hp).const_mul (1/a) | |
| end MicroscopicJamming | |
| open MeasureTheory ProbabilityTheory Set Filter | |
| open scoped NNReal ENNReal Topology | |
| namespace MicroscopicJamming | |
| lemma abs_sub_le_of_hasDerivAt_Ioo {f f' : β β β} {s t D : β} | |
| (hst : s < t) (hc : ContinuousOn f (Icc s t)) | |
| (hd : β r β Ioo s t, HasDerivAt f (f' r) r) | |
| (hb : β r β Ioo s t, |f' r| β€ D) : |f t-f s| β€ D*(t-s) := by | |
| obtain β¨r,hr,heβ© := exists_hasDerivAt_eq_slope f f' hst hc hd | |
| have hh := hb r hr | |
| rw [he,abs_div,abs_of_pos (sub_pos.mpr hst)] at hh | |
| exact (div_le_iffβ (sub_pos.mpr hst)).mp hh | |
| theorem gaussian_step_time : GaussianStepTimeStatement := by | |
| intro A B C ΞΊ Q hQ hA hC hk hsub | |
| obtain β¨L,hL,hlinβ© := gaussian_step_slope A B C ΞΊ Q hQ hA hC hk hsub | |
| let K := C+ΞΊ/(1-ΞΊ*Q) | |
| have hden : 0 < 1-ΞΊ*Q := by linarith | |
| have hK : 0 β€ K := add_nonneg hC (div_nonneg hk hden.le) | |
| refine β¨K+2*L^2,by positivity,?_β© | |
| intro u hu rs hrs a s t ha ha1 hs ht htime x | |
| have hR := gaussianStepTime_nonneg (fun r hr => (hrs r hr).2.2) | |
| have hRQ : gaussianStepTime rs β€ Q := by | |
| have hm : 0 β€ max s t := hs.trans (le_max_left _ _) | |
| linarith | |
| obtain β¨hdf,hdf',hbfβ© := gaussian_step_bounds u A B C ΞΊ Q hQ hu rs hrs hRQ | |
| have hsum : ΞΊ*((Q-gaussianStepTime rs)+gaussianStepTime rs)<1 := by simpa using hsub | |
| obtain β¨hkn,hknQ,_β© := gaussian_curvature_update hk hR (sub_nonneg.mpr hRQ) hsum | |
| have htw : Twice.RowTwiceTerminal (gaussianRowComposition rs u) | |
| (A*(1+gaussianStepTime rs)) B C (ΞΊ/(1-ΞΊ*gaussianStepTime rs)) | |
| (Q-gaussianStepTime rs) := by | |
| refine β¨hdf,hdf',mul_nonneg hA (by linarith),hC,hkn,hknQ,fun y => ?_β© | |
| refine β¨?_,(hbf y).1.2,(hbf y).2β© | |
| have hh := (hbf y).1.1 | |
| nlinarith [mul_nonneg (mul_nonneg hA hR) (sq_nonneg y)] | |
| let f : β β β := fun r => gaussianRowOperator a r (gaussianRowComposition rs u) x | |
| let d : β β β := fun r => (1/2:β)* | |
| (deriv (deriv (gaussianRowOperator a r (gaussianRowComposition rs u))) x+ | |
| a*(deriv (gaussianRowOperator a r (gaussianRowComposition rs u)) x)^2) | |
| have hcont : Continuous f := gaussianRowOperator_time_continuous htw ha x | |
| have hdiff (r : β) (hr : 0 < r) : HasDerivAt f (d r) r := | |
| (Twice.gaussianRowOperator_calculus htw ha hr).2.2 x | |
| have hb (r : β) (hr : 0 β€ r) (hrQ : r+gaussianStepTime rs β€ Q) : | |
| |d r| β€ (K+2*L^2)*(1+x^2) := by | |
| have hrr : β v β (a,r)::rs, 0 β€ v.1 β§ v.1 β€ 1 β§ 0 β€ v.2 := by | |
| intro v hv | |
| rcases List.mem_cons.mp hv with h | h | |
| Β· subst v; exact β¨ha,ha1,hrβ© | |
| Β· exact hrs v h | |
| have htot : gaussianStepTime ((a,r)::rs) β€ Q := by | |
| simpa [gaussianStepTime] using hrQ | |
| obtain β¨_,_,hbbβ© := gaussian_step_bounds u A B C ΞΊ Q hQ hu ((a,r)::rs) hrr htot | |
| have hj := hlin u hu ((a,r)::rs) hrr htot x | |
| have hdenr : 0 < 1-ΞΊ*gaussianStepTime ((a,r)::rs) := by | |
| have hh := mul_le_mul_of_nonneg_left htot hk | |
| linarith | |
| have hcap : ΞΊ/(1-ΞΊ*gaussianStepTime ((a,r)::rs)) β€ ΞΊ/(1-ΞΊ*Q) := | |
| div_le_div_of_nonneg_left hk hden (by nlinarith [mul_le_mul_of_nonneg_left htot hk]) | |
| have hcurv : |deriv (deriv (gaussianRowOperator a r (gaussianRowComposition rs u))) x| β€ K := by | |
| rw [abs_le] | |
| have hh := (hbb x).2 | |
| change -C β€ deriv (deriv (gaussianRowOperator a r (gaussianRowComposition rs u))) x β§ | |
| deriv (deriv (gaussianRowOperator a r (gaussianRowComposition rs u))) x β€ | |
| ΞΊ/(1-ΞΊ*gaussianStepTime ((a,r)::rs)) at hh | |
| dsimp [K] | |
| constructor <;> linarith [hh.1,hh.2,div_nonneg hk hden.le] | |
| change |deriv (gaussianRowOperator a r (gaussianRowComposition rs u)) x| β€ L*(1+|x|) at hj | |
| have hsq : (deriv (gaussianRowOperator a r (gaussianRowComposition rs u)) x)^2 β€ | |
| 2*L^2*(1+x^2) := by | |
| have hp := pow_le_pow_leftβ (abs_nonneg _) hj 2 | |
| rw [sq_abs] at hp | |
| have hx : (1+|x|)^2 β€ 2*(1+x^2) := by nlinarith [sq_nonneg (|x|-1),sq_abs x] | |
| have hx' := mul_le_mul_of_nonneg_left hx (sq_nonneg L) | |
| nlinarith [sq_nonneg L] | |
| have hadd := abs_add_le | |
| (deriv (deriv (gaussianRowOperator a r (gaussianRowComposition rs u))) x) | |
| (a*(deriv (gaussianRowOperator a r (gaussianRowComposition rs u)) x)^2) | |
| rw [abs_of_nonneg (mul_nonneg ha (sq_nonneg _))] at hadd | |
| have haSq := mul_le_mul_of_nonneg_right ha1 | |
| (sq_nonneg (deriv (gaussianRowOperator a r (gaussianRowComposition rs u)) x)) | |
| dsimp [d] | |
| rw [abs_mul,abs_of_pos (by norm_num : (0:β)<1/2)] | |
| nlinarith [mul_nonneg hK (sq_nonneg x)] | |
| have hbound (s t : β) (hs : 0 β€ s) (hst : s<t) | |
| (hT : t+gaussianStepTime rs β€ Q) : | |
| |f t-f s| β€ (K+2*L^2)*(1+x^2)*(t-s) := by | |
| apply abs_sub_le_of_hasDerivAt_Ioo hst hcont.continuousOn | |
| (fun r hr => hdiff r (by linarith [hr.1])) | |
| intro r hr | |
| exact hb r (by linarith [hr.1]) (by linarith [hr.2]) | |
| rcases lt_trichotomy s t with hst | he | hts | |
| Β· rw [abs_of_pos (sub_pos.mpr hst)] | |
| exact hbound s t hs hst (by linarith [le_max_right s t]) | |
| Β· subst t | |
| simp | |
| Β· rw [abs_sub_comm t s,abs_of_pos (sub_pos.mpr hts)] | |
| rw [abs_sub_comm (gaussianRowOperator a t (gaussianRowComposition rs u) x)] | |
| exact hbound t s ht hts (by linarith [le_max_left s t]) | |
| end MicroscopicJamming | |
| open MeasureTheory ProbabilityTheory Set Filter | |
| open scoped NNReal ENNReal Topology | |
| namespace MicroscopicJamming | |
| lemma gaussianStepPath_time_bound {A B C ΞΊ Q D : β} {u : β β β} | |
| (_hQ : 0 < Q) (_hu : RowAnalyticTerminal u A B C ΞΊ Q) (hD : 0 β€ D) | |
| (hblock : β rs : List (β Γ β), (β r β rs, 0 β€ r.1 β§ r.1 β€ 1 β§ 0 β€ r.2) β | |
| β a s t : β, 0 β€ a β a β€ 1 β 0 β€ s β 0 β€ t β | |
| max s t+gaussianStepTime rs β€ Q β β x, | |
| |gaussianRowOperator a t (gaussianRowComposition rs u) x- | |
| gaussianRowOperator a s (gaussianRowComposition rs u) x| β€ D*(1+x^2)*|t-s|) : | |
| β rs : List (β Γ β), (β r β rs, 0 β€ r.1 β§ r.1 β€ 1 β§ 0 β€ r.2) β | |
| gaussianStepTime rs β€ Q β β s t, 0 β€ s β s β€ t β β x, | |
| |gaussianStepPath rs u t x-gaussianStepPath rs u s x| β€ D*(1+x^2)*(t-s) := by | |
| intro rs | |
| induction rs with | |
| | nil => | |
| intro _ _ s t hs hst x | |
| simp only [gaussianStepPath,gaussianStepRemainder,gaussianRowComposition,sub_self,abs_zero] | |
| exact mul_nonneg (mul_nonneg hD (by positivity)) (sub_nonneg.mpr hst) | |
| | cons r rs ih => | |
| intro hrs hsum s t hs hst x | |
| have hr := hrs r (by simp) | |
| have htail : β v β rs, 0 β€ v.1 β§ v.1 β€ 1 β§ 0 β€ v.2 := fun v hv => hrs v (by simp [hv]) | |
| have hR := gaussianStepTime_nonneg (fun v hv => (htail v hv).2.2) | |
| have htot : gaussianStepTime (r::rs)=r.2+gaussianStepTime rs := by simp [gaussianStepTime] | |
| rw [htot] at hsum | |
| have ht : 0 β€ t := hs.trans hst | |
| by_cases htR : t β€ r.2 | |
| Β· have hsR : s β€ r.2 := hst.trans htR | |
| rw [gaussianStepPath_cons_le r rs u htR,gaussianStepPath_cons_le r rs u hsR] | |
| have hm : max (r.2-s) (r.2-t)+gaussianStepTime rs β€ Q := by | |
| rw [max_eq_left (by linarith)] | |
| linarith | |
| have hh := hblock rs htail r.1 (r.2-s) (r.2-t) hr.1 hr.2.1 | |
| (sub_nonneg.mpr hsR) (sub_nonneg.mpr htR) hm x | |
| have he : |(r.2-t)-(r.2-s)|=t-s := by rw [abs_of_nonpos (by linarith)]; ring | |
| simpa only [he] using hh | |
| Β· have hRt : r.2 < t := lt_of_not_ge htR | |
| rw [gaussianStepPath_cons_gt r rs u hRt] | |
| by_cases hsR : s β€ r.2 | |
| Β· rw [gaussianStepPath_cons_le r rs u hsR] | |
| have htailQ : gaussianStepTime rs β€ Q := by linarith | |
| have hfirst := ih htail htailQ 0 (t-r.2) (by norm_num) (by linarith) x | |
| rw [gaussianStepPath_zero (fun v hv => (htail v hv).2.2) u] at hfirst | |
| have hsecond := hblock rs htail r.1 (r.2-s) 0 hr.1 hr.2.1 | |
| (sub_nonneg.mpr hsR) (by norm_num) (by rw [max_eq_left (by linarith)]; linarith) x | |
| rw [gaussianRowOperator_zero] at hsecond | |
| rw [abs_of_nonpos (by linarith : 0-(r.2-s) β€ 0)] at hsecond | |
| have htri := abs_sub_le (gaussianStepPath rs u (t-r.2) x) | |
| (gaussianRowComposition rs u x) (gaussianRowOperator r.1 (r.2-s) (gaussianRowComposition rs u) x) | |
| nlinarith | |
| Β· rw [gaussianStepPath_cons_gt r rs u (lt_of_not_ge hsR)] | |
| have hh := ih htail (by linarith) (s-r.2) (t-r.2) (by linarith) (by linarith) x | |
| convert hh using 1; ring | |
| theorem gaussian_step_path : GaussianStepPathStatement := by | |
| intro A B C ΞΊ Q hQ hA hC hk hsub | |
| obtain β¨D,hD,hblockβ© := gaussian_step_time A B C ΞΊ Q hQ hA hC hk hsub | |
| obtain β¨L,hL,hlinβ© := gaussian_step_slope A B C ΞΊ Q hQ hA hC hk hsub | |
| refine β¨D,L,hD,hL,?_β© | |
| intro u hu rs hrs hsum | |
| have hnonneg : β r β rs, 0 β€ r.2 := fun r hr => (hrs r hr).2.2 | |
| refine β¨fun x => congrFun (gaussianStepPath_zero hnonneg u) x, | |
| fun x => congrFun (gaussianStepPath_terminal hrs u) x,?_,?_β© | |
| Β· intro s t hs ht x | |
| rcases le_total s t with hst | hts | |
| Β· rw [abs_of_nonneg (sub_nonneg.mpr hst)] | |
| exact gaussianStepPath_time_bound hQ hu hD (hblock u hu) rs hrs hsum s t hs hst x | |
| Β· rw [abs_sub_comm t s,abs_of_nonneg (sub_nonneg.mpr hts),abs_sub_comm] | |
| exact gaussianStepPath_time_bound hQ hu hD (hblock u hu) rs hrs hsum t s ht hts x | |
| Β· intro t ht htR | |
| obtain β¨hv,hvTβ© := gaussianStepRemainder_valid hrs ht | |
| rw [max_eq_left (sub_nonneg.mpr htR)] at hvT | |
| have hvQ : gaussianStepTime (gaussianStepRemainder rs t) β€ Q := by rw [hvT]; linarith | |
| obtain β¨hdf,hdf',hbfβ© := gaussian_step_bounds u A B C ΞΊ Q hQ hu _ hv hvQ | |
| refine β¨hdf,hdf',fun x => β¨hlin u hu _ hv hvQ x,(hbf x).2.1,?_β©β© | |
| change deriv (deriv (gaussianRowComposition (gaussianStepRemainder rs t) u)) x β€ _ | |
| rw [β hvT] | |
| exact (hbf x).2.2 | |
| end MicroscopicJamming | |
| open MeasureTheory ProbabilityTheory Set Filter | |
| open scoped NNReal Topology | |
| namespace MicroscopicJamming | |
| lemma gaussianStepPath_cylinder_lipschitz {u : β β β} {rs : List (β Γ β)} | |
| {Q R D L : β} (hR : 0 β€ R) (hD : 0 β€ D) (hL : 0 β€ L) | |
| (hQeq : gaussianStepTime rs=Q) | |
| (htime : β s t, 0 β€ s β 0 β€ t β β x, | |
| |gaussianStepPath rs u t x-gaussianStepPath rs u s x| β€ D*(1+x^2)*|t-s|) | |
| (hspace : β t, 0 β€ t β t β€ gaussianStepTime rs β | |
| Differentiable β (gaussianStepPath rs u t) β§ | |
| β x, |deriv (gaussianStepPath rs u t) x| β€ L*(1+|x|)) : | |
| LipschitzWith (β¨D*(1+R^2)+L*(1+R),by positivityβ© : ββ₯0) | |
| (fun p : RowCylinder Q R => gaussianStepPath rs u p.1.1 p.1.2) := by | |
| apply LipschitzWith.of_dist_le_mul | |
| intro p q | |
| have hp := p.2 | |
| have hq := q.2 | |
| have hpx : |p.1.2| β€ R := abs_le.mpr hp.2 | |
| have hqx : |q.1.2| β€ R := abs_le.mpr hq.2 | |
| have hhT := htime q.1.1 p.1.1 hq.1.1 hp.1.1 p.1.2 | |
| have hhS := hspace q.1.1 hq.1.1 (by rw [hQeq]; exact hq.1.2) | |
| have hhx : |gaussianStepPath rs u q.1.1 p.1.2-gaussianStepPath rs u q.1.1 q.1.2| β€ | |
| L*(1+R)*|p.1.2-q.1.2| := by | |
| have hc := Convex.norm_image_sub_le_of_norm_deriv_le | |
| (f := gaussianStepPath rs u q.1.1) (s := Icc (-R) R) (C := L*(1+R)) | |
| (fun z _ => hhS.1 z) | |
| (fun z hz => by | |
| rw [Real.norm_eq_abs] | |
| exact (hhS.2 z).trans (mul_le_mul_of_nonneg_left (by linarith [abs_le.mpr hz]) hL)) | |
| (convex_Icc (-R) R) hq.2 hp.2 | |
| simpa only [Real.norm_eq_abs] using hc | |
| have hprodT : |p.1.1-q.1.1| β€ dist p q := by | |
| change dist (p.1.1) (q.1.1) β€ dist p q | |
| change dist p.1.1 q.1.1 β€ dist p.1 q.1 | |
| rw [Prod.dist_eq] | |
| exact le_max_left _ _ | |
| have hprodX : |p.1.2-q.1.2| β€ dist p q := by | |
| change dist (p.1.2) (q.1.2) β€ dist p q | |
| change dist p.1.2 q.1.2 β€ dist p.1 q.1 | |
| rw [Prod.dist_eq] | |
| exact le_max_right _ _ | |
| have hp2 : p.1.2^2 β€ R^2 := by | |
| have hh := (sq_le_sqβ (abs_nonneg p.1.2) hR).mpr hpx | |
| simpa only [sq_abs] using hh | |
| have hhT' : |gaussianStepPath rs u p.1.1 p.1.2-gaussianStepPath rs u q.1.1 p.1.2| β€ | |
| D*(1+R^2)*dist p q := hhT.trans | |
| (mul_le_mul (mul_le_mul_of_nonneg_left (by linarith) hD) hprodT (abs_nonneg _) (by positivity)) | |
| have hhS' := hhx.trans (mul_le_mul_of_nonneg_left hprodX (by positivity : 0 β€ L*(1+R))) | |
| have htri := abs_sub_le (gaussianStepPath rs u p.1.1 p.1.2) | |
| (gaussianStepPath rs u q.1.1 p.1.2) (gaussianStepPath rs u q.1.1 q.1.2) | |
| change |gaussianStepPath rs u p.1.1 p.1.2-gaussianStepPath rs u q.1.1 q.1.2| β€ | |
| (D*(1+R^2)+L*(1+R))*dist p q | |
| nlinarith | |
| lemma gaussianStepPath_cylinder_bound {u : β β β} {A B C ΞΊ Q R : β} | |
| (hQ : 0 < Q) (hR : 0 β€ R) (hu : RowAnalyticTerminal u A B C ΞΊ Q) | |
| {rs : List (β Γ β)} (hrs : β r β rs, 0 β€ r.1 β§ r.1 β€ 1 β§ 0 β€ r.2) | |
| (hQeq : gaussianStepTime rs=Q) (p : RowCylinder Q R) : | |
| |gaussianStepPath rs u p.1.1 p.1.2| β€ |B|+A*(1+R^2+Q) := by | |
| obtain β¨hv,hvTβ© := gaussianStepRemainder_valid hrs p.2.1.1 | |
| rw [hQeq,max_eq_left (sub_nonneg.mpr p.2.1.2)] at hvT | |
| have hvQ : gaussianStepTime (gaussianStepRemainder rs p.1.1) β€ Q := by rw [hvT]; linarith [p.2.1.1] | |
| have hb := (gaussian_step_bounds u A B C ΞΊ Q hQ hu _ hv hvQ).2.2 p.1.2 | |
| change (-A*(1+p.1.2^2+gaussianStepTime (gaussianStepRemainder rs p.1.1)) β€ | |
| gaussianStepPath rs u p.1.1 p.1.2 β§ gaussianStepPath rs u p.1.1 p.1.2 β€ B) β§ _ at hb | |
| have hp := abs_le.mpr p.2.2 | |
| have hp2 : p.1.2^2 β€ R^2 := by | |
| have hh := (sq_le_sqβ (abs_nonneg p.1.2) hR).mpr hp | |
| simpa only [sq_abs] using hh | |
| have hmul := mul_le_mul_of_nonneg_left (show 1+p.1.2^2+gaussianStepTime (gaussianStepRemainder rs p.1.1) β€ | |
| 1+R^2+Q by linarith) hu.2.1 | |
| rw [abs_le] | |
| have hnn : 0 β€ A*(1+R^2+Q) := mul_nonneg hu.2.1 (by positivity) | |
| constructor <;> linarith [hb.1.1,hb.1.2,abs_nonneg B,le_abs_self B] | |
| end MicroscopicJamming | |
| open MeasureTheory ProbabilityTheory Set Filter | |
| open scoped NNReal Topology | |
| namespace MicroscopicJamming | |
| lemma gaussianStepPath_jointly_continuous {u : β β β} {rs : List (β Γ β)} | |
| {Q D L : β} (hD : 0 β€ D) (hL : 0 β€ L) (hQeq : gaussianStepTime rs=Q) | |
| (htime : β s t, 0 β€ s β 0 β€ t β β x, | |
| |gaussianStepPath rs u t x-gaussianStepPath rs u s x| β€ D*(1+x^2)*|t-s|) | |
| (hspace : β t, 0 β€ t β t β€ gaussianStepTime rs β | |
| Differentiable β (gaussianStepPath rs u t) β§ | |
| β x, |deriv (gaussianStepPath rs u t) x| β€ L*(1+|x|)) : | |
| ContinuousOn (fun p : β Γ β => gaussianStepPath rs u p.1 p.2) (Icc 0 Q ΓΛ’ univ) := by | |
| intro p hp | |
| let R := |p.2|+1 | |
| have hR : 0 < R := by dsimp [R]; positivity | |
| have hxl : -R < p.2 := by dsimp [R]; linarith [neg_abs_le p.2] | |
| have hxr : p.2 < R := by dsimp [R]; linarith [le_abs_self p.2] | |
| have hc : ContinuousOn (fun p : β Γ β => gaussianStepPath rs u p.1 p.2) | |
| (Icc 0 Q ΓΛ’ Icc (-R) R) := | |
| continuousOn_iff_continuous_domRestrict.mpr | |
| (gaussianStepPath_cylinder_lipschitz hR.le hD hL hQeq htime hspace).continuous | |
| apply (hc p β¨hp.1,β¨hxl.le,hxr.leβ©β©).mono_of_mem_nhdsWithin | |
| have hh : βαΆ q : β Γ β in π p, q.2 β Icc (-R) R := | |
| continuous_snd.continuousAt.eventually (Icc_mem_nhds hxl hxr) | |
| filter_upwards [self_mem_nhdsWithin,hh.filter_mono nhdsWithin_le_nhds] with q hq hqx | |
| exact β¨hq.1,hqxβ© | |
| lemma gaussianStepPath_global_value_bound {u : β β β} {A B C ΞΊ Q : β} | |
| (hQ : 0 < Q) (hu : RowAnalyticTerminal u A B C ΞΊ Q) | |
| {rs : List (β Γ β)} (hrs : β r β rs, 0 β€ r.1 β§ r.1 β€ 1 β§ 0 β€ r.2) | |
| (hQeq : gaussianStepTime rs=Q) {t : β} (ht : t β Icc 0 Q) (x : β) : | |
| |gaussianStepPath rs u t x| β€ (|B|+A*(1+Q))*(1+x^2) := by | |
| have hx : x β Icc (-|x|) |x| := abs_le.mp le_rfl | |
| have hh := gaussianStepPath_cylinder_bound hQ (abs_nonneg x) hu hrs hQeq | |
| (β¨(t,x),ht,hxβ© : RowCylinder Q |x|) | |
| change |gaussianStepPath rs u t x| β€ |B|+A*(1+|x|^2+Q) at hh | |
| rw [sq_abs] at hh | |
| have h1 := mul_nonneg (abs_nonneg B) (sq_nonneg x) | |
| have h2 := mul_nonneg (mul_nonneg hu.2.1 hQ.le) (sq_nonneg x) | |
| nlinarith | |
| end MicroscopicJamming | |
| namespace MicroscopicJamming | |
| def GaussianStepPDEStatement : Prop := | |
| β (u : β β β) (A B C ΞΊ Q : β), 0 < Q β RowAnalyticTerminal u A B C ΞΊ Q β | |
| β (pre rs : List (β Γ β)) (a T : β), | |
| (β r β pre ++ (a,T)::rs, 0 β€ r.1 β§ r.1 β€ 1 β§ 0 β€ r.2) β | |
| gaussianStepTime (pre ++ (a,T)::rs) β€ Q β | |
| β t : β, 0 < t β t < T β β x, | |
| HasDerivAt (fun s => gaussianStepPath (pre ++ (a,T)::rs) u (gaussianStepTime pre+s) x) | |
| (-(1/2:β)*(deriv (deriv (gaussianStepPath (pre ++ (a,T)::rs) u | |
| (gaussianStepTime pre+t))) x+ | |
| a*(deriv (gaussianStepPath (pre ++ (a,T)::rs) u | |
| (gaussianStepTime pre+t)) x)^2)) t | |
| end MicroscopicJamming | |
| open MeasureTheory ProbabilityTheory Set Filter | |
| open scoped Topology | |
| namespace MicroscopicJamming | |
| lemma gaussian_composition_twice {u : β β β} {A B C ΞΊ Q : β} | |
| (hQ : 0 < Q) (hu : RowAnalyticTerminal u A B C ΞΊ Q) | |
| {rs : List (β Γ β)} (hrs : β r β rs, 0 β€ r.1 β§ r.1 β€ 1 β§ 0 β€ r.2) | |
| (hsum : gaussianStepTime rs β€ Q) : | |
| Twice.RowTwiceTerminal (gaussianRowComposition rs u) | |
| (A*(1+gaussianStepTime rs)) B C (ΞΊ/(1-ΞΊ*gaussianStepTime rs)) | |
| (Q-gaussianStepTime rs) := by | |
| obtain β¨hd,hd',hbβ© := gaussian_step_bounds u A B C ΞΊ Q hQ hu rs hrs hsum | |
| have hR := gaussianStepTime_nonneg (fun r hr => (hrs r hr).2.2) | |
| have hk := hu.2.2.2.1 | |
| have hsub : ΞΊ*((Q-gaussianStepTime rs)+gaussianStepTime rs)<1 := by | |
| simpa using hu.2.2.2.2.1 | |
| obtain β¨hkn,hknQ,_β© := gaussian_curvature_update hk hR (sub_nonneg.mpr hsum) hsub | |
| refine β¨hd,hd',mul_nonneg hu.2.1 (by linarith),hu.2.2.1,hkn,hknQ,fun y => ?_β© | |
| refine β¨?_,(hb y).1.2,(hb y).2β© | |
| have hh := (hb y).1.1 | |
| nlinarith [mul_nonneg (mul_nonneg hu.2.1 hR) (sq_nonneg y)] | |
| end MicroscopicJamming | |
| open MeasureTheory ProbabilityTheory Set Filter | |
| open scoped Topology | |
| namespace MicroscopicJamming | |
| lemma gaussianStepTime_append (pre rs : List (β Γ β)) : | |
| gaussianStepTime (pre++rs)=gaussianStepTime pre+gaussianStepTime rs := by | |
| simp [gaussianStepTime] | |
| lemma gaussianStepPath_prefix (pre rs : List (β Γ β)) | |
| (hp : β r β pre, 0 β€ r.2) (u : β β β) {t : β} (ht : 0 < t) : | |
| gaussianStepPath (pre++rs) u (gaussianStepTime pre+t)=gaussianStepPath rs u t := by | |
| induction pre with | |
| | nil => simp [gaussianStepTime] | |
| | cons r pre ih => | |
| have hr := hp r (by simp) | |
| have htail : β v β pre, 0 β€ v.2 := fun v hv => hp v (by simp [hv]) | |
| have hP := gaussianStepTime_nonneg htail | |
| have hsum : gaussianStepTime (r::pre)=r.2+gaussianStepTime pre := by simp [gaussianStepTime] | |
| simp only [List.cons_append,hsum] | |
| rw [gaussianStepPath_cons_gt r (pre++rs) u (by linarith)] | |
| have he : r.2+gaussianStepTime pre+t-r.2=gaussianStepTime pre+t := by ring | |
| rw [he] | |
| exact ih htail | |
| theorem gaussian_step_pde : GaussianStepPDEStatement := by | |
| intro u A B C ΞΊ Q hQ hu pre rs a T hrs hsum t ht htT x | |
| have hr : 0 β€ a β§ a β€ 1 β§ 0 β€ T := hrs (a,T) (by simp) | |
| have hpre : β r β pre, 0 β€ r.2 := fun r h => (hrs r (List.mem_append_left _ h)).2.2 | |
| have htail : β r β rs, 0 β€ r.1 β§ r.1 β€ 1 β§ 0 β€ r.2 := fun r h => | |
| hrs r (List.mem_append_right _ (by simp [h])) | |
| have hP := gaussianStepTime_nonneg hpre | |
| have htime : gaussianStepTime (pre++(a,T)::rs)=gaussianStepTime pre+T+gaussianStepTime rs := by | |
| rw [gaussianStepTime_append] | |
| simp [gaussianStepTime,add_assoc] | |
| have hR : gaussianStepTime rs β€ Q := by rw [htime] at hsum; linarith | |
| have htw := gaussian_composition_twice hQ hu htail hR | |
| have hd := (Twice.gaussianRowOperator_calculus htw hr.1 (sub_pos.mpr htT)).2.2 x | |
| have hc := hd.comp t ((hasDerivAt_const t T).sub (hasDerivAt_id t)) | |
| have hpath (s : β) (hs : 0 < s) (hsT : s < T) : | |
| gaussianStepPath (pre++(a,T)::rs) u (gaussianStepTime pre+s)= | |
| gaussianRowOperator a (T-s) (gaussianRowComposition rs u) := by | |
| rw [gaussianStepPath_prefix pre ((a,T)::rs) hpre u hs] | |
| exact gaussianStepPath_cons_le (a,T) rs u hsT.le | |
| have hh := hc.congr_of_eventuallyEq | |
| (show (fun s => gaussianStepPath (pre++(a,T)::rs) u (gaussianStepTime pre+s) x) =αΆ [π t] | |
| (fun s => gaussianRowOperator a (T-s) (gaussianRowComposition rs u) x) from by | |
| filter_upwards [eventually_gt_nhds ht,eventually_lt_nhds htT] with s hs hsT | |
| exact congrFun (hpath s hs hsT) x) | |
| rw [hpath t ht htT] | |
| simpa only [zero_sub,mul_neg_one,neg_mul] using hh | |
| end MicroscopicJamming | |
| open Set Filter | |
| open scoped Topology | |
| namespace MicroscopicJamming | |
| def gaussianStepCoefficient : List (β Γ β) β β β β | |
| | [], _ => 0 | |
| | (a,T)::rs,t => if t β€ T then a else gaussianStepCoefficient rs (t-T) | |
| def RowClassicalVarianceSolution (Q : β) (u m : β β β) (F : β β β β β) : Prop := | |
| ContinuousOn (fun p : β Γ β => F p.1 p.2) (Icc 0 Q ΓΛ’ univ) β§ | |
| ContinuousOn (fun p : β Γ β => deriv (F p.1) p.2) (Icc 0 Q ΓΛ’ univ) β§ | |
| ContinuousOn (fun p : β Γ β => deriv (deriv (F p.1)) p.2) (Icc 0 Q ΓΛ’ univ) β§ | |
| (β t β Icc 0 Q, Differentiable β (F t) β§ Differentiable β (deriv (F t))) β§ | |
| (β t β Ioo 0 Q, β x, HasDerivAt (fun r => F r x) | |
| (-(1/2:β)*(deriv (deriv (F t)) x+m t*(deriv (F t) x)^2)) t) β§ | |
| (β x, F Q x=u x) β§ | |
| β K : β, 0 β€ K β§ β t β Icc 0 Q, β x, | |
| |F t x| β€ K*(1+x^2) β§ |deriv (F t) x| β€ K*(1+|x|) | |
| def RowVarianceExistenceStatement : Prop := | |
| β A B C ΞΊ Q : β, 0 < Q β 0 β€ A β 0 β€ C β 0 β€ ΞΊ β ΞΊ*Q < 1 β | |
| β L : β, 0 β€ L β§ β u : β β β, RowAnalyticTerminal u A B C ΞΊ Q β | |
| β m : β β β, ContinuousOn m (Icc 0 Q) β (β t β Icc 0 Q, 0 β€ m t β§ m t β€ 1) β | |
| β F : β β β β β, RowClassicalVarianceSolution Q u m F β§ | |
| (β t β Icc 0 Q, β x, -A*(1+x^2+Q-t) β€ F t x β§ F t x β€ B β§ | |
| |deriv (F t) x| β€ L*(1+|x|) β§ | |
| -C β€ deriv (deriv (F t)) x β§ deriv (deriv (F t)) x β€ ΞΊ/(1-ΞΊ*(Q-t))) β§ | |
| (β G : β β β β β, RowClassicalVarianceSolution Q u m G β | |
| β t β Icc 0 Q, β x, F t x=G t x) β§ | |
| (β rs : β β List (β Γ β), | |
| (β n, β r β rs n, 0 β€ r.1 β§ r.1 β€ 1 β§ 0 β€ r.2) β | |
| (β n, gaussianStepTime (rs n)=Q) β | |
| TendstoUniformlyOn (fun n => gaussianStepCoefficient (rs n)) m atTop (Icc 0 Q) β | |
| β R : β, 0 < R β | |
| TendstoUniformlyOn (fun n (p : β Γ β) => gaussianStepPath (rs n) u p.1 p.2) | |
| (fun p => F p.1 p.2) atTop (Icc 0 Q ΓΛ’ Icc (-R) R)) | |
| end MicroscopicJamming | |
| end | |
| end OAI | |