/- Released under Apache-2.0; see adjacent LICENSE. Finite Rankin bound for the actual positive smooth count, with inclusive real prime cutoff. Local factored-number summability holds for every alpha>0; no global summability or analytic smooth estimate is assumed. -/ import SmoothLogLimit namespace SmoothRankin noncomputable section open scoped BigOperators def weightHom (α : ℝ) : ℕ →* ℝ where toFun n := (n : ℝ) ^ (-α) map_one' := by simp map_mul' m n := by simp only [Nat.cast_mul, Real.mul_rpow (Nat.cast_nonneg m) (Nat.cast_nonneg n)] theorem prime_norm_lt_one {α : ℝ} (hα : 0 < α) {p : ℕ} (hp : p.Prime) : ‖weightHom α p‖ < 1 := by change ‖(p : ℝ) ^ (-α)‖ < 1 rw [Real.norm_eq_abs, abs_of_nonneg (Real.rpow_nonneg (Nat.cast_nonneg _) _)] simpa using Real.rpow_lt_rpow_of_exponent_lt (show (1 : ℝ) < p by exact_mod_cast hp.one_lt) (neg_lt_zero.mpr hα) theorem primeCutoff_eq_primesLE (Z : ℝ) : ManuscriptResidues.primeCutoff Z = Nat.primesLE ⌊Z⌋₊ := rfl theorem smooth_mem_factored (X : ℕ) (Z : ℝ) {n : ℕ} (hn : n ∈ Nat.smoothNumbersUpTo X (⌊Z⌋₊ + 1)) : n ∈ Nat.factoredNumbers (ManuscriptResidues.primeCutoff Z) := by have hs := (Nat.mem_smoothNumbersUpTo.mp hn).2 rw [Nat.mem_factoredNumbers'] intro p hp hd have hb := (Nat.mem_smoothNumbers'.mp hs) p hp hd exact Finset.mem_filter.mpr ⟨Finset.mem_range.mpr hb, hp⟩ /-- The finite positive smooth sum is bounded by an actually convergent local Euler sum. -/ theorem finite_weight_sum_le_product {α : ℝ} (hα : 0 < α) (X : ℕ) (Z : ℝ) : (∑ n ∈ Nat.smoothNumbersUpTo X (⌊Z⌋₊ + 1), (n : ℝ) ^ (-α)) ≤ ∏ p ∈ ManuscriptResidues.primeCutoff Z, (1 - (p : ℝ) ^ (-α))⁻¹ := by classical let s := Nat.smoothNumbersUpTo X (⌊Z⌋₊ + 1) let e : ↥s ↪ Nat.factoredNumbers (ManuscriptResidues.primeCutoff Z) := { toFun := fun n => ⟨n.val, smooth_mem_factored X Z n.property⟩ inj' := fun a b h => Subtype.ext (congrArg (fun n : Nat.factoredNumbers (ManuscriptResidues.primeCutoff Z) => n.val) h) } have he := EulerProduct.summable_and_hasSum_factoredNumbers_prod_filter_prime_geometric (f := weightHom α) (prime_norm_lt_one hα) (ManuscriptResidues.primeCutoff Z) have hfilter : (ManuscriptResidues.primeCutoff Z).filter Nat.Prime = ManuscriptResidues.primeCutoff Z := by apply Finset.filter_eq_self.mpr intro p hp exact (Finset.mem_filter.mp hp).2 calc _ = ∑ n ∈ s.attach.map e, weightHom α n := by rw [Finset.sum_map] change (∑ n ∈ s, (n : ℝ) ^ (-α)) = ∑ n ∈ s.attach, (n.val : ℝ) ^ (-α) exact (Finset.sum_attach s (fun n => (n : ℝ) ^ (-α))).symm _ ≤ ∑' n : Nat.factoredNumbers (ManuscriptResidues.primeCutoff Z), weightHom α n := he.1.of_norm.sum_le_tsum _ (fun n _ => Real.rpow_nonneg (Nat.cast_nonneg _) _) _ = _ := by have heq : (∑' n : Nat.factoredNumbers (ManuscriptResidues.primeCutoff Z), weightHom α n) = ∏ p ∈ (ManuscriptResidues.primeCutoff Z).filter Nat.Prime, (1 - (p : ℝ) ^ (-α))⁻¹ := he.2.tsum_eq rw [hfilter] at heq exact heq theorem rankin_weight_one_le {α : ℝ} (hα : 0 < α) {X n : ℕ} (hn : 1 ≤ n) (hnX : n ≤ X) : 1 ≤ (X : ℝ) ^ α * (n : ℝ) ^ (-α) := by have hn0 : (0 : ℝ) < n := by exact_mod_cast (show 0 < n by omega) have hp := Real.rpow_le_rpow (Nat.cast_nonneg n) (Nat.cast_le.mpr hnX) hα.le have hid : (n : ℝ) ^ α * (n : ℝ) ^ (-α) = 1 := by rw [← Real.rpow_add hn0, add_neg_cancel, Real.rpow_zero] rw [← hid] exact mul_le_mul_of_nonneg_right hp (Real.rpow_nonneg (Nat.cast_nonneg n) _) /-- Actual Psi counts n=1,...,X; the prime family includes exactly prime p<=Z. -/ theorem finite_rankin {α : ℝ} (hα : 0 < α) (X : ℕ) (_hX : 1 ≤ X) (Z : ℝ) (hZ : 2 ≤ Z) : (EarlyCover.Psi X Z : ℝ) ≤ (X : ℝ) ^ α * ∏ p ∈ ManuscriptResidues.primeCutoff Z, (1 - (p : ℝ) ^ (-α))⁻¹ := by classical rw [SmoothParameters.Psi_eq X Z (by linarith)] calc _ = ∑ _n ∈ Nat.smoothNumbersUpTo X (⌊Z⌋₊ + 1), (1 : ℝ) := by simp _ ≤ ∑ n ∈ Nat.smoothNumbersUpTo X (⌊Z⌋₊ + 1), (X : ℝ) ^ α * (n : ℝ) ^ (-α) := by apply Finset.sum_le_sum intro n hn have hf := Nat.mem_smoothNumbersUpTo.mp hn exact rankin_weight_one_le hα (Nat.one_le_iff_ne_zero.mpr (Nat.ne_zero_of_mem_smoothNumbers hf.2)) hf.1 _ = (X : ℝ) ^ α * ∑ n ∈ Nat.smoothNumbersUpTo X (⌊Z⌋₊ + 1), (n : ℝ) ^ (-α) := (Finset.mul_sum ..).symm _ ≤ _ := mul_le_mul_of_nonneg_left (finite_weight_sum_le_product hα X Z) (Real.rpow_nonneg (Nat.cast_nonneg X) α) theorem finite_rankin_primesLE {α : ℝ} (hα : 0 < α) (X : ℕ) (hX : 1 ≤ X) (Z : ℝ) (hZ : 2 ≤ Z) : (EarlyCover.Psi X Z : ℝ) ≤ (X : ℝ) ^ α * ∏ p ∈ Nat.primesLE ⌊Z⌋₊, (1 - (p : ℝ) ^ (-α))⁻¹ := by simpa only [primeCutoff_eq_primesLE] using finite_rankin hα X hX Z hZ theorem actual_finite_rankin {α : ℝ} (hα : 0 < α) (y A : ℝ) (hZ : 2 ≤ SmoothParameters.Z y A) : (EarlyCover.Psi (SmoothParameters.X y A) (SmoothParameters.Z y A) : ℝ) ≤ (SmoothParameters.X y A : ℝ) ^ α * ∏ p ∈ ManuscriptResidues.primeCutoff (SmoothParameters.Z y A), (1 - (p : ℝ) ^ (-α))⁻¹ := by exact finite_rankin hα _ (by unfold SmoothParameters.X; omega) _ hZ end end SmoothRankin #print axioms SmoothRankin.weightHom #print axioms SmoothRankin.prime_norm_lt_one #print axioms SmoothRankin.primeCutoff_eq_primesLE #print axioms SmoothRankin.smooth_mem_factored #print axioms SmoothRankin.finite_weight_sum_le_product #print axioms SmoothRankin.rankin_weight_one_le #print axioms SmoothRankin.finite_rankin #print axioms SmoothRankin.finite_rankin_primesLE #print axioms SmoothRankin.actual_finite_rankin