AlexKontorovich/PrimeNumberTheoremAnd
Source indexedtheorem · leanprover/lean4:v4.32.0
CH2.norm_Phi_lambda_neg_one_add_I_mul_le_of_pos
PrimeNumberTheoremAnd.IEANTN.CH2.CH2 · PrimeNumberTheoremAnd/IEANTN/CH2/CH2.lean:3307 to 3323
Source documentation
For positive λ, Phi_lambda on -1 + i y is bounded by y.
Exact Lean statement
theorem norm_Phi_lambda_neg_one_add_I_mul_le_of_pos (lam ε y : ℝ) (hlam : 0 < lam)
(hε : ε = 1 ∨ ε = -1) (hy : 0 ≤ y) :
‖Phi_lambda lam ε (-1 + I * (y : ℂ))‖ ≤ yComplete declaration
Lean source
Full Lean sourceLean 4
theorem norm_Phi_lambda_neg_one_add_I_mul_le_of_pos (lam ε y : ℝ) (hlam : 0 < lam) (hε : ε = 1 ∨ ε = -1) (hy : 0 ≤ y) : ‖Phi_lambda lam ε (-1 + I * (y : ℂ))‖ ≤ y := by have hν : 0 < |lam| := abs_pos.mpr (ne_of_gt 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_pos hlam] have hsign_re : (Real.sign ((-1 + I * (y : ℂ)).re) : ℂ) = -1 := by simp [Real.sign_of_neg (by norm_num : (-1 : ℝ) < 0)] rw [Phi_lambda] rw [hsign_lam, hsign_re] simp only [one_mul, neg_mul] 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] exact shift_upwards_phi_diff |lam| ε hν y hy rw [hphi, norm_neg] exact (norm_Phi_star_I_mul_le |lam| ε y hε).trans_eq (abs_of_nonneg hy)