Download data/lean/OAI/Analysis/AncientFlat/Kernel/GreenConvolution.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 3.3 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/AncientFlat/Kernel/GreenConvolution.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Analysis/AncientFlat/Kernel/GreenConvolution.lean
-
curl -L -o GreenConvolution.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/AncientFlat/Kernel/GreenConvolution.lean
3.3 kB
| import Mathlib | |
| namespace OAI | |
| noncomputable section | |
| open scoped Topology BoundedContinuousFunction | |
| namespace FlatRecursion | |
| variable {E : Type*} [NormedAddCommGroup E] [NormedSpace β E] | |
| def shift (n : β€) : C(β€,β€) := β¨fun j => j-n, continuous_of_discreteTopologyβ© | |
| def greenTerm (G : E βL[β] E) (n : β€) : (β€ βα΅ E) βL[β] (β€ βα΅ E) := | |
| (G.compLeftContinuousBounded β€).comp (BoundedContinuousFunction.compContinuousCLM E β (shift n)) | |
| @[simp] lemma greenTerm_apply (G : E βL[β] E) (n : β€) (f : β€ βα΅ E) (j : β€) : | |
| greenTerm G n f j=G (f (j-n)) := rfl | |
| lemma greenTerm_norm (G : E βL[β] E) (n : β€) : βgreenTerm G nββ€βGβ := by | |
| refine ContinuousLinearMap.opNorm_le_bound _ (norm_nonneg G) (fun f => ?_) | |
| refine (BoundedContinuousFunction.norm_le (mul_nonneg (norm_nonneg _) (norm_nonneg _))).mpr ?_ | |
| intro j | |
| exact G.le_opNorm_of_le (f.norm_coe_le_norm (j-n)) | |
| variable [CompleteSpace E] | |
| lemma greenTerm_summable (G : β€ β E βL[β] E) (hG : Summable (fun n => βG nβ)) : | |
| Summable (fun n => greenTerm (G n) n) := | |
| Summable.of_norm_bounded hG (fun index => greenTerm_norm (G index) index) | |
| def greenOperator (G : β€ β E βL[β] E) : (β€ βα΅ E) βL[β] (β€ βα΅ E) := | |
| β' n : β€, greenTerm (G n) n | |
| lemma convolution_summable (G : β€ β E βL[β] E) (hG : Summable (fun n => βG nβ)) | |
| (f : β€ βα΅ E) (j : β€) : Summable (fun n => G n (f (j-n))) := by | |
| refine Summable.of_norm_bounded (hG.mul_right βfβ) (fun n => ?_) | |
| exact (G n).le_opNorm_of_le (f.norm_coe_le_norm _) | |
| lemma greenOperator_apply (G : β€ β E βL[β] E) (hG : Summable (fun n => βG nβ)) | |
| (f : β€ βα΅ E) (j : β€) : greenOperator G f j=β' n : β€, G n (f (j-n)) := by | |
| exact ((BoundedContinuousFunction.evalCLM β j).comp | |
| (ContinuousLinearMap.apply β (β€ βα΅ E) f)).map_tsum (greenTerm_summable G hG) | |
| lemma greenOperator_solves (P : E βL[β] E) (q : β) (G : β€ β E βL[β] E) | |
| (hG : Summable (fun n => βG nβ)) | |
| (hrec : β n : β€, q β’ G (n+1)-P*G n=if n=0 then 1 else 0) | |
| (f : β€ βα΅ E) (j : β€) : q β’ greenOperator G f (j+1)=P (greenOperator G f j)+f j := by | |
| have hs := convolution_summable G hG f j | |
| have hs' := convolution_summable G hG f (j+1) | |
| have hshift : (β' n : β€, G n (f (j+1-n)))=β' n : β€, G (n+1) (f (j-n)) := by | |
| rw [β (Equiv.addRight (1:β€)).tsum_eq] | |
| congr 1 | |
| funext n | |
| simp only [Equiv.coe_addRight] | |
| congr 2 | |
| omega | |
| have hs2 : Summable (fun n : β€ => G (n+1) (f (j-n))) := by | |
| convert hs'.comp_injective (i := fun n : β€ => n+1) (fun a b h => add_right_cancel h) using 1 | |
| funext n | |
| dsimp | |
| congr 2 | |
| omega | |
| rw [greenOperator_apply G hG, greenOperator_apply G hG, hshift] | |
| apply sub_eq_zero.mp | |
| rw [sub_add_eq_sub_sub, P.map_tsum hs, β Summable.tsum_const_smul q hs2, β Summable.tsum_sub (Summable.const_smul q hs2) (P.summable hs)] | |
| have he : (fun n : β€ => q β’ G (n+1) (f (j-n))-P (G n (f (j-n))))= | |
| (fun n : β€ => if n=0 then f j else 0) := by | |
| funext n | |
| have hn := congrArg (fun L : E βL[β] E => L (f (j-n))) (hrec n) | |
| by_cases hn0 : n=0 | |
| Β· simpa [hn0] using hn | |
| Β· simpa [hn0] using hn | |
| rw [he, tsum_ite_eq, sub_self] | |
| end FlatRecursion | |
| end | |
| end OAI | |