introvoyz045's picture
Migrated from GitHub
4a56cd6 verified
Raw History Blame Contribute Delete
4.88 kB
import OAI.MathematicalPhysics.RapidForcing.FieldExpressions
namespace OAI
open scoped BigOperators Topology ENNReal ContDiff
open Set Filter
namespace RapidForcing
lemma finite_order (k : β„•) : (k : β„•βˆžΟ‰) ≀ (⊀ : β„•βˆž) := by
exact_mod_cast (le_top : (k : β„•βˆž) ≀ ⊀)
section JetEstimates
variable {E F G : Type} [NormedAddCommGroup E] [NormedSpace ℝ E]
[NormedAddCommGroup F] [NormedSpace ℝ F] [NormedAddCommGroup G] [NormedSpace ℝ G]
lemma jet_sum_le {ΞΉ : Type} (s : Finset ΞΉ) (f : ΞΉ β†’ E β†’ F)
(hf : βˆ€ i ∈ s, ContDiff ℝ (⊀ : β„•βˆž) (f i)) (k : β„•) (x : E) :
β€–iteratedFDeriv ℝ k (fun y => βˆ‘ i ∈ s, f i y) xβ€– ≀
βˆ‘ i ∈ s, β€–iteratedFDeriv ℝ k (f i) xβ€– := by
rw [iteratedFDeriv_fun_sum_apply (fun i hi => ((hf i hi).of_le (finite_order k)).contDiffAt)]
exact norm_sum_le _ _
lemma jet_postcomp_le (L : F β†’L[ℝ] G) {f : E β†’ F}
(hf : ContDiff ℝ (⊀ : β„•βˆž) f) (k : β„•) (x : E) (C : ℝ) (hC : β€–Lβ€– ≀ C) :
β€–iteratedFDeriv ℝ k (fun y => L (f y)) xβ€– ≀ C * β€–iteratedFDeriv ℝ k f xβ€– :=
(L.norm_iteratedFDeriv_comp_left hf.contDiffAt (finite_order k)).trans
(mul_le_mul_of_nonneg_right hC (norm_nonneg _))
lemma jet_smul_const_le {f : E β†’ ℝ} (hf : ContDiff ℝ (⊀ : β„•βˆž) f)
(v : F) (k : β„•) (x : E) :
β€–iteratedFDeriv ℝ k (fun y => f y β€’ v) xβ€– ≀ β€–vβ€– * β€–iteratedFDeriv ℝ k f xβ€– := by
exact jet_postcomp_le (ContinuousLinearMap.toSpanSingleton ℝ v) hf k x β€–vβ€–
(by rw [ContinuousLinearMap.norm_toSpanSingleton])
end JetEstimates
namespace EffectiveProfile.Formula
variable {d : β„•}
lemma fderiv_eq_sum (a : Formula d) (x : Fin d β†’ ℝ) :
fderiv ℝ a.value x = βˆ‘ i : Fin d, (a.diff i).value x β€’ ContinuousLinearMap.proj i := by
ext v
have he : v = βˆ‘ i : Fin d, (v i) β€’ Pi.single i (1 : ℝ) := by
simpa only [← Pi.single_smul, smul_eq_mul, mul_one] using (Finset.univ_sum_single v).symm
calc
_ = βˆ‘ i : Fin d, v i * (a.diff i).value x := by
rw [he, map_sum]
apply Finset.sum_congr rfl
intro i _
simp only [map_smul, fderiv_apply_single, smul_eq_mul]
congr 1
exact congrFun he i
_ = _ := by simp [mul_comm]
lemma jet_succ_le (a : Formula d) (k : β„•) (x : Fin d β†’ ℝ) :
β€–iteratedFDeriv ℝ (k+1) a.value xβ€– ≀
βˆ‘ i : Fin d, β€–iteratedFDeriv ℝ k (a.diff i).value xβ€– := by
rw [← norm_iteratedFDeriv_fderiv]
have he : fderiv ℝ a.value = fun y => βˆ‘ i : Fin d,
(a.diff i).value y β€’ ContinuousLinearMap.proj i := funext (a.fderiv_eq_sum)
rw [he]
apply (jet_sum_le _ _ (fun i _ => (a.diff i).contDiff.smul contDiff_const) _ _).trans
apply Finset.sum_le_sum
intro i _
have hp : β€–(ContinuousLinearMap.proj i : (Fin d β†’ ℝ) β†’L[ℝ] ℝ)β€– ≀ 1 :=
ContinuousLinearMap.opNorm_le_bound _ zero_le_one (fun v => by simpa using norm_le_pi_norm v i)
exact (jet_smul_const_le (a.diff i).contDiff _ k x).trans (by
simpa using mul_le_mul_of_nonneg_right hp (norm_nonneg (iteratedFDeriv ℝ k (a.diff i).value x)))
def allDiff (as : List (Formula d)) : List (Formula d) :=
as.flatMap fun a => (List.finRange d).map (fun i => a.diff i)
def jetBound (R : β„š) (k : β„•) (a : Formula d) : β„š :=
((allDiff^[k] [a]).map (fun e => e.bound R)).sum
lemma jetBound_nonneg (R : β„š) (k : β„•) (a : Formula d) : 0 ≀ a.jetBound R k := by
apply List.sum_nonneg
intro r hr
obtain ⟨e, _, rfl⟩ := List.mem_map.mp hr
exact e.bound_nonneg R
lemma jet_list_le (R : β„š) (k : β„•) (as : List (Formula d)) (x : Fin d β†’ ℝ)
(hx : βˆ€ i, |x i| ≀ |(R : ℝ)|) :
(as.map fun a => β€–iteratedFDeriv ℝ k a.value xβ€–).sum ≀
(((allDiff^[k] as).map fun a => a.bound R).sum : β„š) := by
induction k generalizing as with
| zero =>
simp only [Function.iterate_zero_apply, norm_iteratedFDeriv_zero, Real.norm_eq_abs]
induction as with
| nil => simp
| cons a as ih =>
simpa only [List.map_cons, List.sum_cons, Rat.cast_add] using add_le_add (a.abs_value_le R x hx) ih
| succ k ih =>
rw [Function.iterate_succ_apply]
apply le_trans _ (ih (allDiff as))
induction as with
| nil => simp [allDiff]
| cons a as ih' =>
simp only [List.map_cons, List.sum_cons, allDiff, List.flatMap_cons, List.map_append, List.sum_append] at ih' ⊒
apply add_le_add _ ih'
simpa only [List.map_map, Function.comp_def, ← List.ofFn_eq_map, List.map_ofFn, List.sum_ofFn] using a.jet_succ_le k x
lemma norm_jet_le (R : β„š) (k : β„•) (a : Formula d) (x : Fin d β†’ ℝ)
(hx : βˆ€ i, |x i| ≀ |(R : ℝ)|) :
β€–iteratedFDeriv ℝ k a.value xβ€– ≀ (a.jetBound R k : ℝ) := by
simpa only [List.map_singleton, List.sum_singleton, jetBound] using jet_list_le R k [a] x hx
end EffectiveProfile.Formula
end RapidForcing
end OAI