Download data/lean/OAI/Analysis/AncientFlat/Spectral/RecursionUnique.lean from introvoyz045/math: direct link, hf CLI and curl.
- Browser
- Download file 4.35 kB
-
https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/AncientFlat/Spectral/RecursionUnique.lean
- Command line
-
hf download hf://datasets/introvoyz045/math/data/lean/OAI/Analysis/AncientFlat/Spectral/RecursionUnique.lean
-
curl -L -o RecursionUnique.lean https://huggingface.co/datasets/introvoyz045/math/resolve/main/data/lean/OAI/Analysis/AncientFlat/Spectral/RecursionUnique.lean
4.35 kB
| import OAI.Analysis.AncientFlat.Spectral.Recursion | |
| namespace OAI | |
| noncomputable section | |
| open scoped Topology BoundedContinuousFunction | |
| namespace PeriodicResolvent | |
| variable {E : Type*} [NormedAddCommGroup E] [NormedSpace β E] [CompleteSpace E] | |
| omit [CompleteSpace E] in | |
| lemma loop_right_identity (P : E βL[β] E) {q : β} (hq : 0<q) | |
| (hc : β z : β, βzβ=q β z β resolventSet β P) (t : β) : | |
| (q:β) β’ (osc 1 t β’ resolventLoop P q t)-resolventLoop P q t*P=1 := by | |
| have h := hc ((q:β)*osc 1 t) | |
| (by simp [osc_norm, Complex.norm_real, Real.norm_eq_abs, hq.le]) | |
| rw [resolventLoop, spectrum.resolvent_eq h] | |
| have hu := h.unit.inv_mul | |
| simp only [h.unit_spec, mul_sub, Algebra.algebraMap_eq_smul_one, mul_smul_comm, mul_one] at hu | |
| simpa only [smul_smul] using hu | |
| lemma green_right_identity (P : E βL[β] E) {q : β} (hq : 0<q) | |
| (hc : β z : β, βzβ=q β z β resolventSet β P) (n : β€) : | |
| (q:β) β’ coeff (resolventLoop P q) (n+1)-coeff (resolventLoop P q) n*P= | |
| if n=0 then 1 else 0 := by | |
| have hf := (loop_smooth P hq hc).continuous | |
| have hm := coeff_map ((ContinuousLinearMap.mul β (E βL[β] E)).flip P) | |
| (resolventLoop P q) hf n | |
| have he := congrArg (fun f : β β (E βL[β] E) => coeff f n) | |
| (funext (loop_right_identity P hq hc)) | |
| change coeff (fun t => resolventLoop P q t*P) n=coeff (resolventLoop P q) n*P at hm | |
| rw [coeff_sub (fun t => (q:β) β’ (osc 1 t β’ resolventLoop P q t)) | |
| (fun t => resolventLoop P q t*P) | |
| (((osc_continuous 1).smul hf).const_smul (q:β)) | |
| (hf.mul continuous_const), coeff_smul, coeff_shift, hm, coeff_const] at he | |
| exact he | |
| end PeriodicResolvent | |
| namespace FlatRecursion | |
| variable {E : Type*} [NormedAddCommGroup E] [NormedSpace β E] [CompleteSpace E] | |
| def difference (P : E βL[β] E) (q : β) : (β€ βα΅ E) βL[β] (β€ βα΅ E) := | |
| q β’ BoundedContinuousFunction.compContinuousCLM E β (shift (-1))- | |
| P.compLeftContinuousBounded β€ | |
| omit [CompleteSpace E] in | |
| @[simp] lemma difference_apply (P : E βL[β] E) (q : β) (f : β€ βα΅ E) (j : β€) : | |
| difference P q f j=q β’ f (j+1)-P (f j) := by | |
| change q β’ f (j-(-1))-P (f j)=_ | |
| congr 3 | |
| lemma greenOperator_left_inverse (P : E βL[β] E) (q : β) (G : β€ β E βL[β] E) | |
| (hG : Summable (fun n => βG nβ)) | |
| (hrec : β n : β€, q β’ G (n+1)-G n*P=if n=0 then 1 else 0) | |
| (f : β€ βα΅ E) : greenOperator G (difference P q f)=f := by | |
| ext j | |
| rw [greenOperator_apply G hG] | |
| simp only [difference_apply, map_sub, map_smul] | |
| have hs : Summable (fun n : β€ => G n (f (j+1-n))) := convolution_summable G hG f (j+1) | |
| have hsp : Summable (fun n : β€ => G n (P (f (j-n)))) := | |
| convolution_summable G hG (P.compLeftContinuousBounded β€ f) j | |
| 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 | |
| have hshift : (β' n : β€, q β’ G n (f (j-n+1)))=β' n : β€, q β’ G (n+1) (f (j-n)) := by | |
| rw [β (Equiv.addRight (1:β€)).tsum_eq] | |
| congr 1 | |
| funext n | |
| simp only [Equiv.coe_addRight] | |
| congr 3 | |
| omega | |
| have hs1 : Summable (fun n : β€ => q β’ G n (f (j-n+1))) := by | |
| convert hs.const_smul q using 1 | |
| funext n | |
| congr 3 | |
| omega | |
| rw [Summable.tsum_sub hs1 hsp, hshift, | |
| β Summable.tsum_sub (hs2.const_smul q) hsp] | |
| have he : (fun n : β€ => q β’ G (n+1) (f (j-n))-G n (P (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] | |
| theorem homogeneous_eq_zero (P : E βL[β] E) (q : β) (hq : 0<q) | |
| (hc : β z : β, βzβ=q β z β resolventSet β P) | |
| (f : β€ βα΅ E) (hf : β j : β€, (q:β) β’ f (j+1)=P (f j)) : f=0 := by | |
| let G := PeriodicResolvent.coeff (PeriodicResolvent.resolventLoop P q) | |
| have hG := PeriodicResolvent.green_summable P hq hc | |
| have hrec := PeriodicResolvent.green_right_identity P hq hc | |
| have hz : difference P (q:β) f=0 := by ext j; simp [hf] | |
| have he := greenOperator_left_inverse P (q:β) G hG hrec f | |
| rw [hz, map_zero] at he | |
| exact he.symm | |
| end FlatRecursion | |
| end | |
| end OAI | |