Skip to main content
AlexKontorovich/PrimeNumberTheoremAnd
Source indexedlemma · leanprover/lean4:v4.32.0

CH2.Inu_bounds_zero

PrimeNumberTheoremAnd.IEANTN.CH2.CH2_part1 · PrimeNumberTheoremAnd/IEANTN/CH2/CH2_part1.lean:5165 to 5181

Mathematical statement

Exact Lean statement

lemma Inu_bounds_zero (ν : ℝ) (hν : ν > 0) :
    (𝓕 (ϕ_pm ν (-1)) 0).re ≤ Inu ν 0 ∧ Inu ν 0 ≤ (𝓕 (ϕ_pm ν 1) 0).re

Complete declaration

Lean source

Canonical source
Full Lean sourceLean 4
lemma Inu_bounds_zero (ν : ) (hν : ν > 0) :    (𝓕 (ϕ_pm ν (-1)) 0).re  Inu ν 0  Inu ν 0  (𝓕 (ϕ_pm ν 1) 0).re := by  rw [show Inu ν 0 = 1 by simp [Inu]]  have h_cont :  ε : , Continuous (fun x :   (𝓕 (ϕ_pm ν ε) x).re) := fun ε     continuous_re.comp <| VectorFourier.fourierIntegral_continuous Real.continuous_fourierChar      (by fun_prop) (varphi_integ ν ε hν.ne')  haveI hbot : Filter.NeBot (nhdsWithin 0 (Set.Ioi (0 : ))) := nhdsWithin_Ioi_neBot le_rfl  have h_I_rcts : Filter.Tendsto (fun x :   Inu ν x) (nhdsWithin 0 (Set.Ioi (0 : ))) (nhds 1) := by    have h_eq : (fun x :   Inu ν x) =ᶠ[nhdsWithin 0 (Set.Ioi (0 : ))] (fun x  Real.exp (-ν * x)) :=      eventually_nhdsWithin_of_forall fun _ hx  if_pos (le_of_lt hx)    have h_tendsto_exp : Filter.Tendsto (fun x  Real.exp (-ν * x)) (nhds 0) (nhds 1) := by      simpa using Continuous.tendsto (by fun_prop : Continuous fun x  Real.exp (-ν * x)) 0    exact Filter.Tendsto.congr' h_eq.symm (Filter.Tendsto.mono_left h_tendsto_exp nhdsWithin_le_nhds)  exact le_of_tendsto_of_tendsto (hf := (h_cont (-1)).continuousAt.continuousWithinAt) (hg := h_I_rcts)      (eventually_nhdsWithin_of_forall fun x hx  (Inu_bounds_pos ν x hν hx).1),    le_of_tendsto_of_tendsto (hf := h_I_rcts) (hg := (h_cont 1).continuousAt.continuousWithinAt)      (eventually_nhdsWithin_of_forall fun x hx  (Inu_bounds_pos ν x hν hx).2)