Adapted from PrimeNumberTheoremAnd revision 127b50e33f6033e2147921167a117af96d9ba4ea, via Jason Davies's Iwaniec linear sieve snapshot c8d01549d2ae640b36ec198c1f0f6495f1b036cf (both Apache-2.0). Blueprint-only machinery is omitted.

Supporting lemmas for Iwaniec's sieve and its prime-number-theorem input.

theorem IwaniecLinearSievePNT.div_cpow_eq_cpow_neg (a x s : ℂ) : a / x ^ s = a * x ^ (-s)

theorem IwaniecLinearSievePNT.one_div_cpow_eq_cpow_neg (x s : ℂ) : 1 / x ^ s = x ^ (-s)

theorem IwaniecLinearSievePNT.div_rpow_eq_rpow_neg (a x s : ℝ) (hx : 0 ≤ x) : a / x ^ s = a * x ^ (-s)

theorem IwaniecLinearSievePNT.div_rpow_neg_eq_rpow_div {x y s : ℝ} (hx : 0 ≤ x) (hy : 0 ≤ y) : x ^ (-s) / y ^ (-s) = (y / x) ^ s

theorem IwaniecLinearSievePNT.div_rpow_eq_rpow_div_neg {x y s : ℝ} (hx : 0 ≤ x) (hy : 0 ≤ y) : x ^ s / y ^ s = (y / x) ^ (-s)

theorem IwaniecLinearSievePNT.ResidueOfTendsTo {f : ℂ → ℂ} {p : ℂ} {U : Set ℂ} (hU : U ∈ nhds p) (hf : HolomorphicOn f (U \ {p})) {A : ℂ} (h_limit : Filter.Tendsto (fun (s : ℂ) => (s - p) * f s) (nhdsWithin p {p}ᶜ) (nhds A)) : ∃ V ∈ nhds p, BddAbove (norm ∘ (f - fun (s : ℂ) => A * (s - p)⁻¹) '' (V \ {p}))

theorem IwaniecLinearSievePNT.analyticAt_riemannZeta {s : ℂ} (s_ne_one : s ≠ 1) : AnalyticAt ℂ riemannZeta s

theorem IwaniecLinearSievePNT.differentiableAt_deriv_riemannZeta {s : ℂ} (s_ne_one : s ≠ 1) : DifferentiableAt ℂ (deriv riemannZeta) s

theorem IwaniecLinearSievePNT.riemannZetaResidue : ∃ U ∈ nhds 1, BddAbove (norm ∘ (riemannZeta - fun (s : ℂ) => (s - 1)⁻¹) '' (U \ {1}))

theorem IwaniecLinearSievePNT.deriv_eqOn_of_eqOn_punctured (f g : ℂ → ℂ) (U : Set ℂ) (p : ℂ) (hU_open : IsOpen U) (h_eq : Set.EqOn f g (U \ {p})) : Set.EqOn (deriv f) (deriv g) (U \ {p})

theorem IwaniecLinearSievePNT.analytic_deriv_bounded_near_point (f : ℂ → ℂ) {U : Set ℂ} {p : ℂ} (hU : IsOpen U) (hp : p ∈ U) (hf : HolomorphicOn f U) : deriv f =O[nhdsWithin p {p}ᶜ] 1

theorem IwaniecLinearSievePNT.derivative_const_plus_product {g : ℂ → ℂ} (A p x : ℂ) (hg : DifferentiableAt ℂ g x) : deriv ((fun (x : ℂ) => A) + g * fun (s : ℂ) => s - p) x = deriv g x * (x - p) + g x

theorem IwaniecLinearSievePNT.deriv_inv_sub {x p : ℂ} (hp : x ≠ p) : deriv (fun (z : ℂ) => (z - p)⁻¹) x = -((x - p) ^ 2)⁻¹

theorem IwaniecLinearSievePNT.deriv_f_minus_A_inv_sub_clean (f : ℂ → ℂ) (A x p : ℂ) (hf : DifferentiableAt ℂ f x) (hp : x ≠ p) : deriv (f - fun (z : ℂ) => A * (z - p)⁻¹) x = deriv f x + A * ((x - p) ^ 2)⁻¹

theorem IwaniecLinearSievePNT.nonZeroOfBddAbove {f : ℂ → ℂ} {p : ℂ} {U : Set ℂ} (U_in_nhds : U ∈ nhds p) {A : ℂ} (A_ne_zero : A ≠ 0) (f_near_p : BddAbove (norm ∘ (f - fun (s : ℂ) => A * (s - p)⁻¹) '' (U \ {p}))) : ∃ V ∈ nhds p, IsOpen V ∧ ∀ s ∈ V \ {p}, f s ≠ 0

theorem IwaniecLinearSievePNT.logDerivResidue' {f : ℂ → ℂ} {p : ℂ} {U : Set ℂ} (U_is_open : IsOpen U) (non_zero : ∀ x ∈ U \ {p}, f x ≠ 0) (holc : HolomorphicOn f (U \ {p})) (U_in_nhds : U ∈ nhds p) {A : ℂ} (A_ne_zero : A ≠ 0) (f_near_p : BddAbove (norm ∘ (f - fun (s : ℂ) => A * (s - p)⁻¹) '' (U \ {p}))) : (deriv f * f⁻¹ + fun (s : ℂ) => (s - p)⁻¹) =O[nhdsWithin p {p}ᶜ] 1

theorem IwaniecLinearSievePNT.logDerivResidue {f : ℂ → ℂ} {p : ℂ} {U : Set ℂ} (non_zero : ∀ x ∈ U \ {p}, f x ≠ 0) (holc : HolomorphicOn f (U \ {p})) (U_in_nhds : U ∈ nhds p) {A : ℂ} (A_ne_zero : A ≠ 0) (f_near_p : BddAbove (norm ∘ (f - fun (s : ℂ) => A * (s - p)⁻¹) '' (U \ {p}))) : (deriv f * f⁻¹ + fun (s : ℂ) => (s - p)⁻¹) =O[nhdsWithin p {p}ᶜ] 1

theorem IwaniecLinearSievePNT.BddAbove_to_IsBigO {f : ℂ → ℂ} {p : ℂ} {U : Set ℂ} (hU : U ∈ nhds p) (bdd : BddAbove (norm ∘ f '' (U \ {p}))) : f =O[nhdsWithin p {p}ᶜ] 1

theorem IwaniecLinearSievePNT.logDerivResidue'' {f : ℂ → ℂ} {p : ℂ} {U : Set ℂ} (non_zero : ∀ x ∈ U \ {p}, f x ≠ 0) (holc : HolomorphicOn f (U \ {p})) (U_in_nhds : U ∈ nhds p) {A : ℂ} (A_ne_zero : A ≠ 0) (f_near_p : BddAbove (norm ∘ (f - fun (s : ℂ) => A * (s - p)⁻¹) '' (U \ {p}))) : ∃ V ∈ nhds p, BddAbove (norm ∘ (deriv f * f⁻¹ + fun (s : ℂ) => (s - p)⁻¹) '' (V \ {p}))

theorem IwaniecLinearSievePNT.ResidueMult {f g : ℂ → ℂ} {p : ℂ} {U : Set ℂ} (g_holc : HolomorphicOn g U) (U_in_nhds : U ∈ nhds p) {A : ℂ} (f_near_p : (f - fun (s : ℂ) => A * (s - p)⁻¹) =O[nhdsWithin p {p}ᶜ] 1) : (f * g - fun (s : ℂ) => A * g p * (s - p)⁻¹) =O[nhdsWithin p {p}ᶜ] 1

theorem IwaniecLinearSievePNT.riemannZetaLogDerivResidue : ∃ U ∈ nhds 1, BddAbove (norm ∘ (-(deriv riemannZeta / riemannZeta) - fun (s : ℂ) => (s - 1)⁻¹) '' (U \ {1}))

theorem IwaniecLinearSievePNT.riemannZetaLogDerivResidueBigO : (-deriv riemannZeta / riemannZeta - fun (z : ℂ) => (z - 1)⁻¹) =O[nhdsWithin 1 {1}ᶜ] 1

noncomputable def IwaniecLinearSievePNT.riemannZeta0 (N : ℕ) (s : ℂ) : ℂ

The Euler-Maclaurin representation of zeta with a cutoff at N.

Equations

• IwaniecLinearSievePNT.riemannZeta0 N s = ∑ n ∈ Finset.range (N + 1), 1 / ↑n ^ s + -↑N ^ (1 - s) / (1 - s) + -↑N ^ (-s) / 2 + s * ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) / ↑x ^ (s + 1)

theorem IwaniecLinearSievePNT.riemannZeta0_apply (N : ℕ) (s : ℂ) : riemannZeta0 N s = ∑ n ∈ Finset.range (N + 1), 1 / ↑n ^ s + (-↑N ^ (1 - s) / (1 - s) + -↑N ^ (-s) / 2 + s * ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-(s + 1)))

theorem Real.differentiableAt_cpow_const_of_ne (s : ℂ) {x : ℝ} (xpos : 0 < x) : DifferentiableAt ℝ (fun (x : ℝ) => ↑x ^ s) x

theorem Complex.one_div_cpow_eq {s : ℂ} {x : ℝ} (x_ne : x ≠ 0) : 1 / ↑x ^ s = ↑x ^ (-s)

theorem IwaniecLinearSievePNT.sum_eq_int_deriv {φ : ℝ → ℂ} {a b : ℝ} (apos : 0 ≤ a) (a_lt_b : a < b) (φDiff : ∀ x ∈ Set.uIcc a b, HasDerivAt φ (deriv φ x) x) (derivφCont : ContinuousOn (deriv φ) (Set.uIcc a b)) : ∑ n ∈ Finset.Ioc ⌊a⌋₊ ⌊b⌋₊, φ ↑n = (∫ (x : ℝ) in a..b, φ x) + (↑⌊b⌋₊ + 1 / 2 - ↑b) * φ b - (↑⌊a⌋₊ + 1 / 2 - ↑a) * φ a - ∫ (x : ℝ) in a..b, (↑⌊x⌋ + 1 / 2 - ↑x) * deriv φ x

theorem IwaniecLinearSievePNT.xpos_of_uIcc {a b : ℕ} (ha : a ∈ Set.Ioo 0 b) {x : ℝ} (x_in : x ∈ Set.uIcc ↑a ↑b) : 0 < x

theorem IwaniecLinearSievePNT.ZetaSum_aux1₁ {a b : ℕ} {s : ℂ} (s_ne_one : s ≠ 1) (ha : a ∈ Set.Ioo 0 b) : ∫ (x : ℝ) in ↑a..↑b, 1 / ↑x ^ s = (↑b ^ (1 - s) - ↑a ^ (1 - s)) / (1 - s)

theorem IwaniecLinearSievePNT.ZetaSum_aux1φDiff {s : ℂ} {x : ℝ} (xpos : 0 < x) : HasDerivAt (fun (t : ℝ) => 1 / ↑t ^ s) (deriv (fun (t : ℝ) => 1 / ↑t ^ s) x) x

theorem IwaniecLinearSievePNT.ZetaSum_aux1φderiv {s : ℂ} (s_ne_zero : s ≠ 0) {x : ℝ} (xpos : 0 < x) : deriv (fun (t : ℝ) => 1 / ↑t ^ s) x = (fun (x : ℝ) => -s * ↑x ^ (-(s + 1))) x

theorem IwaniecLinearSievePNT.ZetaSum_aux1derivφCont {s : ℂ} (s_ne_zero : s ≠ 0) {a b : ℕ} (ha : a ∈ Set.Ioo 0 b) : ContinuousOn (deriv fun (t : ℝ) => 1 / ↑t ^ s) (Set.uIcc ↑a ↑b)

theorem IwaniecLinearSievePNT.ZetaSum_aux1 {a b : ℕ} {s : ℂ} (s_ne_one : s ≠ 1) (s_ne_zero : s ≠ 0) (ha : a ∈ Set.Ioo 0 b) : ∑ n ∈ Finset.Ioc a b, 1 / ↑n ^ s = (↑b ^ (1 - s) - ↑a ^ (1 - s)) / (1 - s) + 1 / 2 * (1 / ↑b ^ s) - 1 / 2 * (1 / ↑a ^ s) + s * ∫ (x : ℝ) in ↑a..↑b, (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-(s + 1))

theorem IwaniecLinearSievePNT.ZetaSum_aux1_1' {a b x : ℝ} (apos : 0 < a) (hx : x ∈ Set.Icc a b) : 0 < x

theorem IwaniecLinearSievePNT.ZetaSum_aux1_1 {a b x : ℝ} (apos : 0 < a) (a_lt_b : a < b) (hx : x ∈ Set.uIcc a b) : 0 < x

theorem IwaniecLinearSievePNT.ZetaSum_aux1_2 {a b c : ℝ} (apos : 0 < a) (a_lt_b : a < b) (h : c ≠ 0 ∧ 0 ∉ Set.uIcc a b) : ∫ (x : ℝ) in a..b, 1 / x ^ (c + 1) = (a ^ (-c) - b ^ (-c)) / c

theorem IwaniecLinearSievePNT.ZetaSum_aux1_3 (x : ℝ) : ‖↑⌊x⌋ + 1 / 2 - x‖ ≤ 1 / 2

theorem IwaniecLinearSievePNT.ZetaSum_aux1_4' (x : ℝ) (hx : 0 < x) (s : ℂ) : ‖(↑⌊x⌋ + 1 / 2 - ↑x) / ↑x ^ (s + 1)‖ = ‖↑⌊x⌋ + 1 / 2 - x‖ / x ^ (s + 1).re

theorem IwaniecLinearSievePNT.ZetaSum_aux1_4 {a b : ℝ} (apos : 0 < a) (a_lt_b : a < b) {s : ℂ} : ∫ (x : ℝ) in a..b, ‖(↑⌊x⌋ + ↑1 / 2 - ↑x) / ↑x ^ (s + 1)‖ = ∫ (x : ℝ) in a..b, |↑⌊x⌋ + 1 / 2 - x| / x ^ (s + 1).re

theorem IwaniecLinearSievePNT.ZetaSum_aux1_5a {a b : ℝ} (apos : 0 < a) {s : ℂ} (x : ℝ) (h : x ∈ Set.Icc a b) : |↑⌊x⌋ + 1 / 2 - x| / x ^ (s.re + 1) ≤ 1 / x ^ (s.re + 1)

theorem IwaniecLinearSievePNT.ZetaSum_aux1_5b {a b : ℝ} (apos : 0 < a) (a_lt_b : a < b) {s : ℂ} (σpos : 0 < s.re) : IntervalIntegrable (fun (u : ℝ) => 1 / u ^ (s.re + 1)) MeasureTheory.volume a b

theorem IwaniecLinearSievePNT.measurable_floor_add_half_sub : Measurable fun (u : ℝ) => ↑⌊u⌋ + 1 / 2 - u

theorem IwaniecLinearSievePNT.ZetaSum_aux1_5c {a b : ℝ} {s : ℂ} : have g := fun (u : ℝ) => |↑⌊u⌋ + 1 / 2 - u| / u ^ (s.re + 1); MeasureTheory.AEStronglyMeasurable g (MeasureTheory.volume.restrict (Set.uIoc a b))

theorem IwaniecLinearSievePNT.ZetaSum_aux1_5d {a b : ℝ} (apos : 0 < a) (a_lt_b : a < b) {s : ℂ} (σpos : 0 < s.re) : IntervalIntegrable (fun (u : ℝ) => |↑⌊u⌋ + 1 / 2 - u| / u ^ (s.re + 1)) MeasureTheory.volume a b

theorem IwaniecLinearSievePNT.ZetaSum_aux1_5 {a b : ℝ} (apos : 0 < a) (a_lt_b : a < b) {s : ℂ} (σpos : 0 < s.re) : ∫ (x : ℝ) in a..b, |↑⌊x⌋ + 1 / 2 - x| / x ^ (s.re + 1) ≤ ∫ (x : ℝ) in a..b, 1 / x ^ (s.re + 1)

theorem IwaniecLinearSievePNT.ZetaBnd_aux1a {a b : ℝ} (apos : 0 < a) (a_lt_b : a < b) {s : ℂ} (σpos : 0 < s.re) : ∫ (x : ℝ) in a..b, ‖(↑⌊x⌋ + 1 / 2 - ↑x) / ↑x ^ (s + 1)‖ ≤ (a ^ (-s.re) - b ^ (-s.re)) / s.re

theorem Finset.Ioc_eq_Ico (M N : ℕ) : Ioc N M = Ico (N + 1) (M + 1)

theorem Finset.Ioc_eq_Icc (M N : ℕ) : Ioc N M = Icc (N + 1) M

theorem Finset.Icc_eq_Ico (M N : ℕ) : Icc N M = Ico N (M + 1)

theorem IwaniecLinearSievePNT.finsetSum_tendsto_tsum {N : ℕ} {f : ℕ → ℂ} (hf : Summable f) : Filter.Tendsto (fun (k : ℕ) => ∑ n ∈ Finset.Ico N k, f n) Filter.atTop (nhds (∑' (n : ℕ), f (n + N)))

theorem Complex.cpow_tendsto {s : ℂ} (s_re_gt : 1 < s.re) : Filter.Tendsto (fun (x : ℕ) => ↑x ^ (1 - s)) Filter.atTop (nhds 0)

theorem Complex.cpow_inv_tendsto {s : ℂ} (hs : 0 < s.re) : Filter.Tendsto (fun (x : ℕ) => (↑x ^ s)⁻¹) Filter.atTop (nhds 0)

theorem IwaniecLinearSievePNT.ZetaSum_aux2a : ∃ (C : ℝ), ∀ (x : ℝ), ‖↑⌊x⌋ + 1 / 2 - x‖ ≤ C

theorem IwaniecLinearSievePNT.ZetaSum_aux3 {N : ℕ} {s : ℂ} (s_re_gt : 1 < s.re) : Filter.Tendsto (fun (k : ℕ) => ∑ n ∈ Finset.Ioc N k, 1 / ↑n ^ s) Filter.atTop (nhds (∑' (n : ℕ), 1 / (↑n + ↑N + 1) ^ s))

theorem IwaniecLinearSievePNT.integrableOn_of_Zeta0_fun {N : ℕ} (N_pos : 0 < N) {s : ℂ} (s_re_gt : 0 < s.re) : MeasureTheory.IntegrableOn (fun (x : ℝ) => (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-(s + 1))) (Set.Ioi ↑N) MeasureTheory.volume

theorem IwaniecLinearSievePNT.ZetaSum_aux2 {N : ℕ} (N_pos : 0 < N) {s : ℂ} (s_re_gt : 1 < s.re) : ∑' (n : ℕ), 1 / (↑n + ↑N + 1) ^ s = -↑N ^ (1 - s) / (1 - s) - ↑N ^ (-s) / 2 + s * ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-(s + 1))

theorem IwaniecLinearSievePNT.ZetaBnd_aux1b (N : ℕ) (Npos : 1 ≤ N) {σ t : ℝ} (σpos : 0 < σ) : ‖∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) / ↑x ^ (↑σ + ↑t * Complex.I + 1)‖ ≤ ↑N ^ (-σ) / σ

theorem IwaniecLinearSievePNT.ZetaBnd_aux1 (N : ℕ) (Npos : 1 ≤ N) {σ t : ℝ} (hσ : σ ∈ Set.Ioc 0 2) (ht : 2 ≤ |t|) : ‖(↑σ + ↑t * Complex.I) * ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) / ↑x ^ (↑σ + ↑t * Complex.I + 1)‖ ≤ 2 * |t| * ↑N ^ (-σ) / σ

theorem IwaniecLinearSievePNT.ZetaBnd_aux1p (N : ℕ) (Npos : 1 ≤ N) {σ : ℝ} (hσ : σ ∈ Set.Ioc 0 2) : (fun (t : ℝ) => ‖(↑σ + ↑t * Complex.I) * ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) / ↑x ^ (↑σ + ↑t * Complex.I + 1)‖) =O[Filter.principal {t : ℝ | 2 ≤ |t|}] fun (t : ℝ) => |t| * ↑N ^ (-σ) / σ

theorem IwaniecLinearSievePNT.isOpen_aux : IsOpen {z : ℂ | z ≠ 1 ∧ 0 < z.re}

theorem IwaniecLinearSievePNT.integrable_log_over_pow {r : ℝ} (rneg : r < 0) {N : ℕ} (Npos : 0 < N) : MeasureTheory.IntegrableOn (fun (x : ℝ) => ‖x ^ (r - 1)‖ * ‖Real.log x‖) (Set.Ioi ↑N) MeasureTheory.volume

theorem IwaniecLinearSievePNT.integrableOn_of_Zeta0_fun_log {N : ℕ} (Npos : 0 < N) {s : ℂ} (s_re_gt : 0 < s.re) : MeasureTheory.IntegrableOn (fun (x : ℝ) => (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-(s + 1)) * -↑(Real.log x)) (Set.Ioi ↑N) MeasureTheory.volume

theorem IwaniecLinearSievePNT.hasDerivAt_Zeta0Integral {N : ℕ} (Npos : 0 < N) {s : ℂ} (hs : s ∈ {s : ℂ | 0 < s.re}) : HasDerivAt (fun (z : ℂ) => ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-z - 1)) (∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-s - 1) * -↑(Real.log x)) s

noncomputable def IwaniecLinearSievePNT.ζ₀' (N : ℕ) (s : ℂ) : ℂ

The differentiated Euler-Maclaurin expression for riemannZeta0.

Equations

• One or more equations did not get rendered due to their size.

theorem IwaniecLinearSievePNT.HasDerivAt_neg_cpow_over2 {N : ℕ} (Npos : 0 < N) (s : ℂ) : HasDerivAt (fun (x : ℂ) => -↑N ^ (-x) / 2) (-(-↑(Real.log ↑N) * ↑N ^ (-s)) / 2) s

theorem IwaniecLinearSievePNT.HasDerivAt_cpow_over_var (N : ℕ) {z : ℂ} (z_ne_zero : z ≠ 0) : HasDerivAt (fun (z : ℂ) => -↑N ^ z / z) (↑N ^ z / z ^ 2 - ↑(Real.log ↑N) * ↑N ^ z / z) z

theorem IwaniecLinearSievePNT.HasDerivAtZeta0 {N : ℕ} (Npos : 0 < N) {s : ℂ} (reS_pos : 0 < s.re) (s_ne_one : s ≠ 1) : HasDerivAt (riemannZeta0 N) (ζ₀' N s) s

theorem IwaniecLinearSievePNT.HolomorphicOn_riemannZeta0 {N : ℕ} (N_pos : 0 < N) : HolomorphicOn (riemannZeta0 N) {s : ℂ | s ≠ 1 ∧ 0 < s.re}

theorem IwaniecLinearSievePNT.HolomorphicOn_riemannZeta : HolomorphicOn riemannZeta {s : ℂ | s ≠ 1}

theorem IwaniecLinearSievePNT.isPathConnected_aux : IsPathConnected {z : ℂ | z ≠ 1 ∧ 0 < z.re}

theorem IwaniecLinearSievePNT.Zeta0EqZeta {N : ℕ} (N_pos : 0 < N) {s : ℂ} (reS_pos : 0 < s.re) (s_ne_one : s ≠ 1) : riemannZeta0 N s = riemannZeta s

theorem IwaniecLinearSievePNT.DerivZeta0EqDerivZeta {N : ℕ} (N_pos : 0 < N) {s : ℂ} (reS_pos : 0 < s.re) (s_ne_one : s ≠ 1) : deriv (riemannZeta0 N) s = deriv riemannZeta s

theorem IwaniecLinearSievePNT.le_trans₄ {α : Type u_1} [Preorder α] {a b c d : α} : a ≤ b → b ≤ c → c ≤ d → a ≤ d

theorem IwaniecLinearSievePNT.lt_trans₄ {α : Type u_1} [Preorder α] {a b c d : α} : a < b → b < c → c < d → a < d

theorem IwaniecLinearSievePNT.norm_add₅_le {E : Type u_1} [SeminormedAddGroup E] (a b c d e : E) : ‖a + b + c + d + e‖ ≤ ‖a‖ + ‖b‖ + ‖c‖ + ‖d‖ + ‖e‖

theorem IwaniecLinearSievePNT.norm_add₆_le {E : Type u_1} [SeminormedAddGroup E] (a b c d e f : E) : ‖a + b + c + d + e + f‖ ≤ ‖a‖ + ‖b‖ + ‖c‖ + ‖d‖ + ‖e‖ + ‖f‖

theorem IwaniecLinearSievePNT.mul_le_mul₃ {α : Type u_1} {a b c d e f : α} [MulZeroClass α] [Preorder α] [PosMulMono α] [MulPosMono α] (h₁ : a ≤ b) (h₂ : c ≤ d) (h₃ : e ≤ f) (c0 : 0 ≤ c) (b0 : 0 ≤ b) (e0 : 0 ≤ e) : a * c * e ≤ b * d * f

theorem IwaniecLinearSievePNT.ZetaBnd_aux2 {n : ℕ} {t A σ : ℝ} (Apos : 0 < A) (σpos : 0 < σ) (n_le_t : ↑n ≤ |t|) (σ_ge : 1 - A / Real.log |t| ≤ σ) : ‖↑n ^ (-(↑σ + ↑t * Complex.I))‖ ≤ (↑n)⁻¹ * Real.exp A

theorem IwaniecLinearSievePNT.logt_gt_one {t : ℝ} (t_ge : 3 ≤ t) : 1 < Real.log t

theorem IwaniecLinearSievePNT.UpperBnd_aux {A σ t : ℝ} (hA : A ∈ Set.Ioc 0 (1 / 2)) (t_gt : 3 < |t|) (σ_ge : 1 - A / Real.log |t| ≤ σ) : have N := ⌊|t|⌋₊; 0 < N ∧ ↑N ≤ |t| ∧ 1 < Real.log |t| ∧ 1 - A < σ ∧ 0 < σ ∧ ↑σ + ↑t * Complex.I ≠ 1

theorem IwaniecLinearSievePNT.UpperBnd_aux2 {A σ t : ℝ} (t_ge : 3 < |t|) (σ_ge : 1 - A / Real.log |t| ≤ σ) : |t| ^ (1 - σ) ≤ Real.exp A

theorem IwaniecLinearSievePNT.riemannZeta0_zero_aux (N : ℕ) (Npos : 0 < N) : ∑ x ∈ Finset.Ico 0 N, (↑x)⁻¹ = ∑ x ∈ Finset.Ico 1 N, (↑x)⁻¹

theorem IwaniecLinearSievePNT.UpperBnd_aux3 {A C σ t : ℝ} (hA : A ∈ Set.Ioc 0 (1 / 2)) (σ_ge : 1 - A / Real.log |t| ≤ σ) (t_gt : 3 < |t|) (hC : 2 ≤ C) : have N := ⌊|t|⌋₊; ‖∑ n ∈ Finset.range (N + 1), ↑n ^ (-(↑σ + ↑t * Complex.I))‖ ≤ Real.exp A * C * Real.log |t|

theorem Nat.self_div_floor_bound {t : ℝ} (t_ge : 1 ≤ |t|) : have N := ⌊|t|⌋₊; |t| / ↑N ∈ Set.Icc 1 2

theorem IwaniecLinearSievePNT.UpperBnd_aux5 {σ t : ℝ} (t_ge : 3 < |t|) (σ_le : σ ≤ 2) : (|t| / ↑⌊|t|⌋₊) ^ σ ≤ 4

theorem IwaniecLinearSievePNT.UpperBnd_aux6 {σ t : ℝ} (t_ge : 3 < |t|) (hσ : σ ∈ Set.Ioc (1 / 2) 2) (neOne : ↑σ + ↑t * Complex.I ≠ 1) (Npos : 0 < ⌊|t|⌋₊) (N_le_t : ↑⌊|t|⌋₊ ≤ |t|) : ↑⌊|t|⌋₊ ^ (1 - σ) / ‖1 - (↑σ + ↑t * Complex.I)‖ ≤ |t| ^ (1 - σ) * 2 ∧ ↑⌊|t|⌋₊ ^ (-σ) / 2 ≤ |t| ^ (1 - σ) ∧ ↑⌊|t|⌋₊ ^ (-σ) / σ ≤ 8 * |t| ^ (-σ)

theorem IwaniecLinearSievePNT.ZetaUpperBnd' {A σ t : ℝ} (hA : A ∈ Set.Ioc 0 (1 / 2)) (t_gt : 3 < |t|) (hσ : σ ∈ Set.Icc (1 - A / Real.log |t|) 2) : have C := Real.exp A * (5 + 8 * 2); have N := ⌊|t|⌋₊; have s := ↑σ + ↑t * Complex.I; ‖∑ n ∈ Finset.range (N + 1), 1 / ↑n ^ s‖ + ‖↑N ^ (1 - s) / (1 - s)‖ + ‖↑N ^ (-s) / 2‖ + ‖s * ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) / ↑x ^ (s + 1)‖ ≤ C * Real.log |t|

theorem IwaniecLinearSievePNT.ZetaUpperBnd : ∃ (A : ℝ) (_ : A ∈ Set.Ioc 0 (1 / 2)) (C : ℝ) (_ : 0 < C), ∀ (σ t : ℝ), 3 < |t| → σ ∈ Set.Icc (1 - A / Real.log |t|) 2 → ‖riemannZeta (↑σ + ↑t * Complex.I)‖ ≤ C * Real.log |t|

theorem IwaniecLinearSievePNT.norm_complex_log_ofNat (n : ℕ) : ‖Complex.log ↑n‖ = Real.log ↑n

theorem Real.log_natCast_monotone : Monotone fun (n : ℕ) => log ↑n

theorem Finset.Icc0_eq (N : ℕ) : Icc 0 N = {0} ∪ Icc 1 N

theorem IwaniecLinearSievePNT.harmonic_eq_sum_Icc0_aux (N : ℕ) : ∑ i ∈ Finset.Icc 0 N, (↑i)⁻¹ = ∑ i ∈ Finset.Icc 1 N, (↑i)⁻¹

theorem IwaniecLinearSievePNT.harmonic_eq_sum_Icc0 (N : ℕ) : ∑ i ∈ Finset.Icc 0 N, (↑i)⁻¹ = ↑(harmonic N)

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux1 {A C σ t : ℝ} (hA : A ∈ Set.Ioc 0 (1 / 2)) (σ_ge : 1 - A / Real.log |t| ≤ σ) (t_gt : 3 < |t|) (hC : 2 ≤ C) : have N := ⌊|t|⌋₊; ‖∑ n ∈ Finset.range (N + 1), -1 / ↑n ^ (↑σ + ↑t * Complex.I) * ↑(Real.log ↑n)‖ ≤ Real.exp A * C * Real.log |t| ^ 2

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux2 {A σ t : ℝ} (t_gt : 3 < |t|) (hσ : σ ∈ Set.Icc (1 - A / Real.log |t|) 2) : have N := ⌊|t|⌋₊; have s := ↑σ + ↑t * Complex.I; 0 < N → ↑N ≤ |t| → s ≠ 1 → 1 / 2 < σ → ‖-↑N ^ (1 - s) / (1 - s) ^ 2‖ ≤ Real.exp A * 2 * (1 / 3)

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux3 {A σ t : ℝ} (t_gt : 3 < |t|) (hσ : σ ∈ Set.Icc (1 - A / Real.log |t|) 2) : have N := ⌊|t|⌋₊; have s := ↑σ + ↑t * Complex.I; 0 < N → ↑N ≤ |t| → s ≠ 1 → 1 / 2 < σ → ‖↑(Real.log ↑N) * ↑N ^ (1 - s) / (1 - s)‖ ≤ Real.exp A * 2 * Real.log |t|

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux4 {A σ t : ℝ} (t_gt : 3 < |t|) (hσ : σ ∈ Set.Icc (1 - A / Real.log |t|) 2) : have N := ⌊|t|⌋₊; have s := ↑σ + ↑t * Complex.I; 0 < N → ↑N ≤ |t| → s ≠ 1 → 1 / 2 < σ → ‖↑(Real.log ↑N) * ↑N ^ (-s) / 2‖ ≤ Real.exp A * Real.log |t|

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux5 {A σ t : ℝ} (t_gt : 3 < |t|) (hσ : σ ∈ Set.Icc (1 - A / Real.log |t|) 2) : have N := ⌊|t|⌋₊; have s := ↑σ + ↑t * Complex.I; 0 < N → 1 / 2 < σ → ‖1 * ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-s - 1)‖ ≤ 1 / 3 * (2 * |t| * ↑N ^ (-σ) / σ)

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux6 {A σ t : ℝ} (t_gt : 3 < |t|) (hσ : σ ∈ Set.Icc (1 - A / Real.log |t|) 2) : have N := ⌊|t|⌋₊; 0 < N → ↑N ≤ |t| → ↑σ + ↑t * Complex.I ≠ 1 → 1 / 2 < σ → 2 * |t| * ↑N ^ (-σ) / σ ≤ 2 * (8 * Real.exp A)

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux7_1 {x σ t : ℝ} (hx : 1 ≤ x) : have s := ↑σ + ↑t * Complex.I; ‖(↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-s - 1) * -↑(Real.log x)‖ = |↑⌊x⌋ + 1 / 2 - x| * x ^ (-σ - 1) * Real.log x

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux7_2 {x σ : ℝ} (hx : 1 ≤ x) : |↑⌊x⌋ + 1 / 2 - x| * x ^ (-σ - 1) * Real.log x ≤ x ^ (-σ - 1) * Real.log x

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux7_3 {x σ : ℝ} (xpos : 0 < x) (σnz : σ ≠ 0) : HasDerivAt (fun (t : ℝ) => -(1 / σ ^ 2 * t ^ (-σ) + 1 / σ * t ^ (-σ) * Real.log t)) (x ^ (-σ - 1) * Real.log x) x

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux7_3' {a σ : ℝ} (apos : 0 < a) (σnz : σ ≠ 0) (x : ℝ) : x ∈ Set.Ici a → HasDerivAt (fun (t : ℝ) => -(1 / σ ^ 2 * t ^ (-σ) + 1 / σ * t ^ (-σ) * Real.log t)) (x ^ (-σ - 1) * Real.log x) x

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux7_nonneg {a σ : ℝ} (ha : 1 ≤ a) (x : ℝ) : x ∈ Set.Ioi a → 0 ≤ x ^ (-σ - 1) * Real.log x

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux7_tendsto {σ : ℝ} (σpos : 0 < σ) : Filter.Tendsto (fun (t : ℝ) => -(1 / σ ^ 2 * t ^ (-σ) + 1 / σ * t ^ (-σ) * Real.log t)) Filter.atTop (nhds 0)

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux7_4 {a σ : ℝ} (σpos : 0 < σ) (ha : 1 ≤ a) : MeasureTheory.IntegrableOn (fun (x : ℝ) => x ^ (-σ - 1) * Real.log x) (Set.Ioi a) MeasureTheory.volume

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux7_5 {a σ : ℝ} (σpos : 0 < σ) (ha : 1 ≤ a) : MeasureTheory.IntegrableOn (fun (x : ℝ) => |↑⌊x⌋ + 1 / 2 - x| * x ^ (-σ - 1) * Real.log x) (Set.Ioi a) MeasureTheory.volume

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux7_integral_eq {a σ : ℝ} (ha : 1 ≤ a) (σpos : 0 < σ) : ∫ (x : ℝ) in Set.Ioi a, x ^ (-σ - 1) * Real.log x = 1 / σ ^ 2 * a ^ (-σ) + 1 / σ * a ^ (-σ) * Real.log a

theorem IwaniecLinearSievePNT.DerivUpperBnd_aux7 {A σ t : ℝ} (t_gt : 3 < |t|) (hσ : σ ∈ Set.Icc (1 - A / Real.log |t|) 2) : have N := ⌊|t|⌋₊; have s := ↑σ + ↑t * Complex.I; 0 < N → ↑N ≤ |t| → s ≠ 1 → 1 / 2 < σ → ‖s * ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-s - 1) * -↑(Real.log x)‖ ≤ 6 * |t| * ↑N ^ (-σ) / σ * Real.log |t|

theorem IwaniecLinearSievePNT.ZetaDerivUpperBnd' {A σ t : ℝ} (hA : A ∈ Set.Ioc 0 (1 / 2)) (t_gt : 3 < |t|) (hσ : σ ∈ Set.Icc (1 - A / Real.log |t|) 2) : have C := Real.exp A * 59; have N := ⌊|t|⌋₊; have s := ↑σ + ↑t * Complex.I; ‖∑ n ∈ Finset.range (N + 1), -1 / ↑n ^ s * ↑(Real.log ↑n)‖ + ‖-↑N ^ (1 - s) / (1 - s) ^ 2‖ + ‖↑(Real.log ↑N) * ↑N ^ (1 - s) / (1 - s)‖ + ‖↑(Real.log ↑N) * ↑N ^ (-s) / 2‖ + ‖1 * ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-s - 1)‖ + ‖s * ∫ (x : ℝ) in Set.Ioi ↑N, (↑⌊x⌋ + 1 / 2 - ↑x) * ↑x ^ (-s - 1) * -↑(Real.log x)‖ ≤ C * Real.log |t| ^ 2

theorem IwaniecLinearSievePNT.ZetaDerivUpperBnd : ∃ (A : ℝ) (_ : A ∈ Set.Ioc 0 (1 / 2)) (C : ℝ) (_ : 0 < C), ∀ (σ t : ℝ), 3 < |t| → σ ∈ Set.Icc (1 - A / Real.log |t|) 2 → ‖deriv riemannZeta (↑σ + ↑t * Complex.I)‖ ≤ C * Real.log |t| ^ 2

theorem IwaniecLinearSievePNT.Tendsto_nhdsWithin_punctured_map_add {f : ℝ → ℝ} (a x : ℝ) (f_mono : StrictMono f) (f_iso : Isometry f) : Filter.Tendsto (fun (y : ℝ) => f y + a) (nhdsWithin x (Set.Ioi x)) (nhdsWithin (f x + a) (Set.Ioi (f x + a)))

theorem IwaniecLinearSievePNT.Tendsto_nhdsWithin_punctured_add (a x : ℝ) : Filter.Tendsto (fun (y : ℝ) => y + a) (nhdsWithin x (Set.Ioi x)) (nhdsWithin (x + a) (Set.Ioi (x + a)))

theorem IwaniecLinearSievePNT.riemannZeta_isBigO_near_one_horizontal : (fun (x : ℝ) => riemannZeta (1 + ↑x)) =O[nhdsWithin 0 (Set.Ioi 0)] fun (x : ℝ) => 1 / ↑x

theorem IwaniecLinearSievePNT.ZetaNear1BndFilter : (fun (σ : ℝ) => riemannZeta ↑σ) =O[nhdsWithin 1 (Set.Ioi 1)] fun (σ : ℝ) => 1 / (↑σ - 1)

theorem IwaniecLinearSievePNT.ZetaNear1BndExact : ∃ (c : ℝ) (_ : 0 < c), ∀ σ ∈ Set.Ioc 1 2, ‖riemannZeta ↑σ‖ ≤ c / (σ - 1)

theorem IwaniecLinearSievePNT.norm_zeta_product_ge_one {x : ℝ} (hx : 0 < x) (y : ℝ) : ‖riemannZeta (1 + ↑x) ^ 3 * riemannZeta (1 + ↑x + Complex.I * ↑y) ^ 4 * riemannZeta (1 + ↑x + 2 * Complex.I * ↑y)‖ ≥ 1

For positive x and nonzero y we have that $|\zeta(x)^3 \cdot \zeta(x+iy)^4 \cdot \zeta(x+2iy)| \ge 1$.

theorem IwaniecLinearSievePNT.ZetaLowerBound1_aux1 {σ t : ℝ} (this : 1 ≤ ‖riemannZeta ↑σ‖ ^ 3 * ‖riemannZeta (↑σ + Complex.I * ↑t)‖ ^ 4 * ‖riemannZeta (↑σ + 2 * Complex.I * ↑t)‖) : ‖riemannZeta ↑σ‖ ^ (3 / 4) * ‖riemannZeta (↑σ + 2 * ↑t * Complex.I)‖ ^ (1 / 4) * ‖riemannZeta (↑σ + ↑t * Complex.I)‖ ≥ 1

theorem IwaniecLinearSievePNT.ZetaLowerBound1 {σ t : ℝ} (σ_gt : 1 < σ) : ‖riemannZeta ↑σ‖ ^ (3 / 4) * ‖riemannZeta (↑σ + 2 * ↑t * Complex.I)‖ ^ (1 / 4) * ‖riemannZeta (↑σ + ↑t * Complex.I)‖ ≥ 1

theorem IwaniecLinearSievePNT.ZetaLowerBound2 {σ t : ℝ} (σ_gt : 1 < σ) : 1 / (‖riemannZeta ↑σ‖ ^ (3 / 4) * ‖riemannZeta (↑σ + 2 * ↑t * Complex.I)‖ ^ (1 / 4)) ≤ ‖riemannZeta (↑σ + ↑t * Complex.I)‖

theorem IwaniecLinearSievePNT.ZetaLowerBound3_aux1 (A : ℝ) (ha : A ∈ Set.Ioc 0 (1 / 2)) (t : ℝ) (ht_2 : 3 < |2 * t|) : 0 < A / Real.log |2 * t|

theorem IwaniecLinearSievePNT.ZetaLowerBound3_aux2 {C σ t : ℝ} (ζ_2t_bound : ‖riemannZeta (↑σ + 2 * ↑t * Complex.I)‖ ≤ C * Real.log |2 * t|) : ‖riemannZeta (↑σ + 2 * ↑t * Complex.I)‖ ^ (1 / 4) ≤ (C * Real.log |2 * t|) ^ (1 / 4)

theorem IwaniecLinearSievePNT.ZetaLowerBound3_aux3 (C c_near : ℝ) {σ : ℝ} (t : ℝ) (σ_gt : 1 < σ) : c_near ^ (3 / 4) * ((-1 + σ) ^ (3 / 4))⁻¹ * C ^ (1 / 4) * Real.log |t * 2| ^ (1 / 4) = c_near ^ (3 / 4) * C ^ (1 / 4) * Real.log |t * 2| ^ (1 / 4) * (-1 + σ) ^ (-3 / 4)

theorem IwaniecLinearSievePNT.ZetaLowerBound3_aux4 (C : ℝ) (hC : 0 < C) (c_near : ℝ) (hc_near : 0 < c_near) {σ : ℝ} (t : ℝ) (ht : 3 < |t|) (σ_gt : 1 < σ) : 0 < c_near ^ (3 / 4) * (σ - 1) ^ (-3 / 4) * C ^ (1 / 4) * Real.log |2 * t| ^ (1 / 4)

theorem IwaniecLinearSievePNT.ZetaLowerBound3_aux5 {σ : ℝ} (t : ℝ) (this : ‖riemannZeta ↑σ‖ ^ (3 / 4) * ‖riemannZeta (↑σ + 2 * ↑t * Complex.I)‖ ^ (1 / 4) * ‖riemannZeta (↑σ + ↑t * Complex.I)‖ ≥ 1) : 0 < ‖riemannZeta ↑σ‖ ^ (3 / 4) * ‖riemannZeta (↑σ + 2 * ↑t * Complex.I)‖ ^ (1 / 4)

theorem IwaniecLinearSievePNT.ZetaLowerBound3 : ∃ c > 0, ∀ {σ : ℝ}, σ ∈ Set.Ioc 1 2 → ∀ (t : ℝ), 3 < |t| → c * (σ - 1) ^ (3 / 4) / Real.log |t| ^ (1 / 4) ≤ ‖riemannZeta (↑σ + ↑t * Complex.I)‖

theorem IwaniecLinearSievePNT.ZetaInvBound1 {σ t : ℝ} (σ_gt : 1 < σ) : 1 / ‖riemannZeta (↑σ + ↑t * Complex.I)‖ ≤ ‖riemannZeta ↑σ‖ ^ (3 / 4) * ‖riemannZeta (↑σ + 2 * ↑t * Complex.I)‖ ^ (1 / 4)

theorem IwaniecLinearSievePNT.Ioi_union_Iio_mem_cocompact {a : ℝ} (ha : 0 ≤ a) : Set.Ioi a ∪ Set.Iio (-a) ∈ Filter.cocompact ℝ

theorem IwaniecLinearSievePNT.lt_abs_mem_cocompact {a : ℝ} (ha : 0 ≤ a) : {t : ℝ | a < |t|} ∈ Filter.cocompact ℝ

theorem IwaniecLinearSievePNT.ZetaInvBound2 : ∃ C > 0, ∀ {σ : ℝ}, σ ∈ Set.Ioc 1 2 → ∀ (t : ℝ), 3 < |t| → 1 / ‖riemannZeta (↑σ + ↑t * Complex.I)‖ ≤ C * (σ - 1) ^ (-3 / 4) * Real.log |t| ^ (1 / 4)

theorem IwaniecLinearSievePNT.deriv_fun_re {t : ℝ} {f : ℂ → ℂ} (diff : ∀ (σ : ℝ), DifferentiableAt ℂ f (↑σ + ↑t * Complex.I)) : (deriv fun {σ₂ : ℝ} => f (↑σ₂ + ↑t * Complex.I)) = fun (σ : ℝ) => deriv f (↑σ + ↑t * Complex.I)

theorem IwaniecLinearSievePNT.Zeta_eq_int_derivZeta {σ₁ σ₂ t : ℝ} (t_ne_zero : t ≠ 0) : ∫ (σ : ℝ) in σ₁..σ₂, deriv riemannZeta (↑σ + ↑t * Complex.I) = riemannZeta (↑σ₂ + ↑t * Complex.I) - riemannZeta (↑σ₁ + ↑t * Complex.I)

theorem IwaniecLinearSievePNT.Zeta_diff_Bnd : ∃ (A : ℝ) (_ : A ∈ Set.Ioc 0 (1 / 2)) (C : ℝ) (_ : 0 < C), ∀ (σ₁ σ₂ t : ℝ), 3 < |t| → 1 - A / Real.log |t| ≤ σ₁ → σ₂ ≤ 2 → σ₁ < σ₂ → ‖riemannZeta (↑σ₂ + ↑t * Complex.I) - riemannZeta (↑σ₁ + ↑t * Complex.I)‖ ≤ C * Real.log |t| ^ 2 * (σ₂ - σ₁)

theorem IwaniecLinearSievePNT.ZetaInvBnd_aux' {t : ℝ} (logt_gt_one : 1 < Real.log |t|) : Real.log |t| < Real.log |t| ^ 9

theorem IwaniecLinearSievePNT.ZetaInvBnd_aux {t : ℝ} (logt_gt_one : 1 < Real.log |t|) : Real.log |t| ≤ Real.log |t| ^ 9

theorem IwaniecLinearSievePNT.ZetaInvBnd_aux2 {A C₁ C₂ : ℝ} (Apos : 0 < A) (C₁pos : 0 < C₁) (C₂pos : 0 < C₂) (hA : A ≤ 1 / 2 * (C₁ / (C₂ * 2)) ^ 4) : 0 < (C₁ * A ^ (3 / 4) - C₂ * 2 * A)⁻¹

theorem IwaniecLinearSievePNT.ZetaLowerBndStrip : ∃ (A : ℝ) (_ : A ∈ Set.Ioc 0 (1 / 2)) (C : ℝ) (_ : 0 < C), ∀ (σ t : ℝ), 3 < |t| → σ ∈ Set.Ico (1 - A / Real.log |t| ^ 9) (1 + A / Real.log |t| ^ 9) → C / Real.log |t| ^ 7 ≤ ‖riemannZeta (↑σ + ↑t * Complex.I)‖

theorem IwaniecLinearSievePNT.ZetaInvBnd : ∃ (A : ℝ) (_ : A ∈ Set.Ioc 0 (1 / 2)) (C : ℝ) (_ : 0 < C), ∀ (σ t : ℝ), 3 < |t| → σ ∈ Set.Ico (1 - A / Real.log |t| ^ 9) (1 + A / Real.log |t| ^ 9) → 1 / ‖riemannZeta (↑σ + ↑t * Complex.I)‖ ≤ C * Real.log |t| ^ 7

theorem IwaniecLinearSievePNT.ZetaLowerBnd : ∃ (A : ℝ) (_ : A ∈ Set.Ioc 0 (1 / 2)) (c : ℝ) (_ : 0 < c), ∀ (σ t : ℝ), 3 < |t| → σ ∈ Set.Ico (1 - A / Real.log |t| ^ 9) 1 → c / Real.log |t| ^ 7 ≤ ‖riemannZeta (↑σ + ↑t * Complex.I)‖

def IwaniecLinearSievePNT.ZetaZeroFreeGenProp (n : ℝ) : Prop

A zero-free region of width a constant times log |t| to the power -n.

Equations

• IwaniecLinearSievePNT.ZetaZeroFreeGenProp n = ∃ (A : ℝ) (_ : A ∈ Set.Ioc 0 (1 / 2)), ∀ (σ t : ℝ), 3 < |t| → σ ∈ Set.Ico (1 - A / Real.log |t| ^ n) 1 → riemannZeta (↑σ + ↑t * Complex.I) ≠ 0

theorem IwaniecLinearSievePNT.ZetaZeroFree9 : ZetaZeroFreeGenProp 9

theorem IwaniecLinearSievePNT.LogDerivZetaBnd : ∃ (A : ℝ) (_ : A ∈ Set.Ioc 0 (1 / 2)) (C : ℝ) (_ : 0 < C), ∀ (σ t : ℝ), 3 < |t| → σ ∈ Set.Ico (1 - A / Real.log |t| ^ 9) (1 + A / Real.log |t| ^ 9) → ‖deriv riemannZeta (↑σ + ↑t * Complex.I) / riemannZeta (↑σ + ↑t * Complex.I)‖ ≤ C * Real.log |t| ^ 9

theorem IwaniecLinearSievePNT.ZetaNoZerosOn1Line (t : ℝ) : riemannZeta (1 + ↑t * Complex.I) ≠ 0

theorem IwaniecLinearSievePNT.ZetaCont : ContinuousOn riemannZeta (Set.univ \ {1})

theorem IwaniecLinearSievePNT.ZetaNoZerosInBox (T : ℝ) : ∃ (σ : ℝ) (_ : σ < 1), ∀ (t : ℝ), |t| ≤ T → ∀ σ' ≥ σ, riemannZeta (↑σ' + ↑t * Complex.I) ≠ 0

theorem IwaniecLinearSievePNT.LogDerivZetaHoloOn {S : Set ℂ} (s_ne_one : 1 ∉ S) (nonzero : ∀ s ∈ S, riemannZeta s ≠ 0) : HolomorphicOn (fun (s : ℂ) => deriv riemannZeta s / riemannZeta s) S

theorem IwaniecLinearSievePNT.LogDerivZetaHolcSmallT : ∃ (σ₂ : ℝ) (_ : σ₂ < 1), HolomorphicOn (fun (s : ℂ) => deriv riemannZeta s / riemannZeta s) (Set.uIcc σ₂ 2 ×ℂ Set.uIcc (-3) 3 \ {1})

theorem IwaniecLinearSievePNT.LogDerivZetaHolcSmallT' : ∃ (σ₂ : ℝ) (_ : σ₂ ∈ Set.Ioo 0 1), HolomorphicOn (fun (s : ℂ) => deriv riemannZeta s / riemannZeta s) (Set.uIcc σ₂ 2 ×ℂ Set.uIcc (-3) 3 \ {1})

def IwaniecLinearSievePNT.LogDerivZetaHolcLargeTGenProp (n : ℝ) : Prop

Holomorphy of the logarithmic derivative on expanding zero-free rectangles.

Equations

• One or more equations did not get rendered due to their size.

theorem IwaniecLinearSievePNT.LogDerivZetaHolcLargeTGen {n : ℝ} (ZetaZeroFree : ZetaZeroFreeGenProp n) (n_pos : 0 < n) : LogDerivZetaHolcLargeTGenProp n

theorem IwaniecLinearSievePNT.LogDerivZetaHolcLargeT9 : LogDerivZetaHolcLargeTGenProp 9

theorem IwaniecLinearSievePNT.summable_complex_then_summable_real_part (f : ℕ → ℂ) (h : Summable f) : Summable fun (n : ℕ) => (f n).re

theorem IwaniecLinearSievePNT.dlog_riemannZeta_bdd_on_vertical_lines_generalized (σ₀ σ₁ t : ℝ) (σ₀_gt_one : 1 < σ₀) (σ₀_lt_σ₁ : σ₀ ≤ σ₁) : ‖-deriv riemannZeta (↑σ₁ + ↑t * Complex.I) / riemannZeta (↑σ₁ + ↑t * Complex.I)‖ ≤ ‖deriv riemannZeta ↑σ₀ / riemannZeta ↑σ₀‖

theorem IwaniecLinearSievePNT.triv_bound_zeta : ∃ C ≥ 0, ∀ (σ₀ t : ℝ), 1 < σ₀ → ‖-deriv riemannZeta (↑σ₀ + ↑t * Complex.I) / riemannZeta (↑σ₀ + ↑t * Complex.I)‖ ≤ (σ₀ - 1)⁻¹ + C

def IwaniecLinearSievePNT.LogDerivZetaBndUnifGenProp (n₁ n₂ : ℝ) : Prop

Existence of constants giving a uniform logarithmic-derivative bound near re = 1.

Equations

• One or more equations did not get rendered due to their size.

theorem IwaniecLinearSievePNT.LogDerivZetaBndUnif99 : LogDerivZetaBndUnifGenProp 9 9