AlexKontorovich/PrimeNumberTheoremAnd
Source indexedtheorem · leanprover/lean4:v4.32.0
CH2.norm_Phi_lambda_one_add_I_mul_le_of_neg
PrimeNumberTheoremAnd.IEANTN.CH2.CH2 · PrimeNumberTheoremAnd/IEANTN/CH2/CH2.lean:3326 to 3344
Source documentation
For negative λ, Phi_lambda on 1 + i y is bounded by y away from the downward pole.
Exact Lean statement
theorem norm_Phi_lambda_one_add_I_mul_le_of_neg (lam ε y : ℝ) (hlam : lam < 0)
(hε : ε = 1 ∨ ε = -1) (hy : 0 ≤ y) (hpole : y ≠ |lam| / (2 * π)) :
‖Phi_lambda lam ε (1 + I * (y : ℂ))‖ ≤ yComplete declaration
Lean source
Full Lean sourceLean 4
theorem norm_Phi_lambda_one_add_I_mul_le_of_neg (lam ε y : ℝ) (hlam : lam < 0) (hε : ε = 1 ∨ ε = -1) (hy : 0 ≤ y) (hpole : y ≠ |lam| / (2 * π)) : ‖Phi_lambda lam ε (1 + I * (y : ℂ))‖ ≤ y := by have hν : 0 < |lam| := abs_pos.mpr (ne_of_lt hlam) have hphi : Phi_lambda lam ε (1 + I * (y : ℂ)) = -Phi_star |lam| ε (-I * (y : ℂ)) := by have hsign_lam : (Real.sign lam : ℂ) = -1 := by simp [Real.sign_of_neg hlam] have hsign_re : (Real.sign ((1 + I * (y : ℂ)).re) : ℂ) = 1 := by simp [Real.sign_of_pos (by norm_num : (0 : ℝ) < 1)] rw [Phi_lambda] rw [hsign_lam, hsign_re] simp only [one_mul, neg_mul] rw [show -(1 + I * ↑y) = -1 - I * ↑y by ring] rw [show Phi_circ |lam| ε (-1 - I * ↑y) + -Phi_star |lam| ε (-1 - I * ↑y) = Phi_circ |lam| ε (-1 - I * ↑y) - Phi_star |lam| ε (-1 - I * ↑y) by ring] convert shift_downwards_phi_diff |lam| ε hν y hpole using 3 ring rw [hphi, norm_neg] exact (norm_Phi_star_neg_I_mul_le |lam| ε y hε).trans_eq (abs_of_nonneg hy)