AlexKontorovich/PrimeNumberTheoremAnd
Source indexedtheorem · leanprover/lean4:v4.32.0
BKLNW.prop_3_sub_1
PrimeNumberTheoremAnd.IEANTN.BKLNW.BKLNW · PrimeNumberTheoremAnd/IEANTN/BKLNW/BKLNW.lean:238 to 294
Mathematical statement
Exact Lean statement
@[blueprint
"bklnw-prop-3-sub-1"
(title := "BKLNW Proposition 3, substep 1")
(statement := /-- Let $x \geq x_0$ and let $\alpha$ be admissible. Then
\[
\frac{\psi(x) - \theta(x) - \theta(x^{1/2})}{x^{1/3}} \leq (1 + \alpha) \sum_{k=3}^{\lfloor \frac{\log x}{\log 2} \rfloor} x^{\frac{1}{k} - \frac{1}{3}}.
\]
-/)
(proof := /-- Bound each $\theta(x^{1/k})$ term by $(1 + \alpha)x^{1/k}$ in Sublemma \ref{costa-pereira-sublemma-1-1}. -/)
(latexEnv := "sublemma")
(discussion := 630)]
theorem prop_3_sub_1 (I : Inputs) {x₀ x : ℝ} (hx₀ : x₀ ≥ 1)
(hx : x ≥ x₀) :
(ψ x - θ x - θ (x^((1:ℝ)/2))) / x^((1:ℝ)/3) ≤ (1 + I.α) * f xComplete declaration
Lean source
Full Lean sourceLean 4
@[blueprint "bklnw-prop-3-sub-1" (title := "BKLNW Proposition 3, substep 1") (statement := /-- Let $x \geq x_0$ and let $\alpha$ be admissible. Then\[\frac{\psi(x) - \theta(x) - \theta(x^{1/2})}{x^{1/3}} \leq (1 + \alpha) \sum_{k=3}^{\lfloor \frac{\log x}{\log 2} \rfloor} x^{\frac{1}{k} - \frac{1}{3}}.\]-/) (proof := /-- Bound each $\theta(x^{1/k})$ term by $(1 + \alpha)x^{1/k}$ in Sublemma \ref{costa-pereira-sublemma-1-1}. -/) (latexEnv := "sublemma") (discussion := 630)]theorem prop_3_sub_1 (I : Inputs) {x₀ x : ℝ} (hx₀ : x₀ ≥ 1) (hx : x ≥ x₀) : (ψ x - θ x - θ (x^((1:ℝ)/2))) / x^((1:ℝ)/3) ≤ (1 + I.α) * f x := by have hx1 : x ≥ 1 := le_trans hx₀ hx have hx_pos : 0 < x := lt_of_lt_of_le one_pos hx1 have hx13_pos : (0 : ℝ) < x ^ ((1 : ℝ)/3) := rpow_pos_of_pos hx_pos _ rw [div_le_iff₀ hx13_pos] have h_step1 : ψ x - θ x - θ (x ^ ((1:ℝ)/2)) ≤ ∑ n ∈ Icc 3 ⌊log x / log 2⌋₊, θ (x ^ (1 / (n : ℝ))) := by by_cases! hx2 : x < 2 · have hpsi : ψ x = 0 := psi_eq_zero_of_lt_two hx2 have htheta : θ x = 0 := theta_eq_zero_of_lt_two hx2 have htheta2 : θ (x ^ ((1:ℝ)/2)) = 0 := theta_eq_zero_of_lt_two (by calc x ^ ((1:ℝ)/2) ≤ 2 ^ ((1:ℝ)/2) := rpow_le_rpow hx_pos.le hx2.le (by norm_num) _ < 2 ^ (1:ℝ) := rpow_lt_rpow_of_exponent_lt (by norm_num) (by norm_num) _ = 2 := rpow_one 2) simp only [hpsi, htheta, htheta2, sub_zero] exact Finset.sum_nonneg fun i _ ↦ Chebyshev.theta_nonneg _ · have hpsi_eq := psi_eq_theta_add_sum_theta hx2 by_cases! hN2 : 2 ≤ ⌊log x / log 2⌋₊ · have hsplit : ∑ n ∈ Icc 2 ⌊log x / log 2⌋₊, θ (x ^ (1 / (n : ℝ))) = θ (x ^ ((1:ℝ)/2)) + ∑ n ∈ Icc 3 ⌊log x / log 2⌋₊, θ (x ^ (1 / (n : ℝ))) := by rw [← add_sum_Ioc_eq_sum_Icc hN2, ← Icc_add_one_left_eq_Ioc] push_cast; ring_nf linarith · have hN_le : ⌊log x / log 2⌋₊ ≤ 1 := by omega have h_empty2 : Icc 2 ⌊log x / log 2⌋₊ = ∅ := by simp only [Finset.Icc_eq_empty_iff]; omega have h_empty3 : Icc 3 ⌊log x / log 2⌋₊ = ∅ := by simp only [Finset.Icc_eq_empty_iff]; omega rw [h_empty2] at hpsi_eq simp only [Finset.sum_empty] at hpsi_eq rw [h_empty3, Finset.sum_empty] linarith [Chebyshev.theta_nonneg (x ^ ((1:ℝ)/2))] have h_step2 : ∑ n ∈ Icc 3 ⌊log x / log 2⌋₊, θ (x ^ (1 / (n : ℝ))) ≤ (1 + I.α) * f x * x ^ ((1:ℝ)/3) := by calc ∑ n ∈ Icc 3 ⌊log x / log 2⌋₊, θ (x ^ (1 / (n : ℝ))) ≤ ∑ n ∈ Icc 3 ⌊log x / log 2⌋₊, (1 + I.α) * x ^ (1 / (n : ℝ)) := by exact sum_le_sum fun i _ => I.hα (x ^ (1 / (i : ℝ))) (rpow_pos_of_pos hx_pos _) _ = (1 + I.α) * f x * x ^ ((1:ℝ)/3) := by simp only [f, mul_sum, sum_mul] apply Finset.sum_congr rfl intro k _ rw [mul_assoc, ← rpow_add hx_pos] congr 1; ring_nf linarith