/- Adapted finite Mertens-factor and Rankin arguments from openai/math, revision adc7f1241b42e322a6451854ab7e4b4c146bf78a (Apache-2.0). Modified for the frozen Lean 4.35.0-rc3/Mathlib environment: the integral-test proof is replaced by a proved dyadic finite-sum argument. No foreign imports. -/ import PrimeLog import Mathlib.NumberTheory.EulerProduct.Basic noncomputable section open scoped BigOperators namespace MertensBand private def negativePower (u : ℝ) : ℕ →* ℝ where toFun n := (n : ℝ) ^ (-(1 + u)) 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)] /-- The block [2^k,2^(k+1)) contributes at most (2^(-u))^k. -/ theorem dyadic_block_le {u : ℝ} (hu : 0 < u) (k : ℕ) : (∑ i ∈ Finset.range (2 ^ k), ((2 ^ k + i : ℕ) : ℝ) ^ (-(1 + u))) ≤ ((2 : ℝ) ^ (-u)) ^ k := by have hn : (0 : ℝ) < (2 ^ k : ℕ) := by positivity calc _ ≤ ∑ _i ∈ Finset.range (2 ^ k), ((2 ^ k : ℕ) : ℝ) ^ (-(1 + u)) := by apply Finset.sum_le_sum intro i hi exact Real.rpow_le_rpow_of_nonpos hn (by exact_mod_cast Nat.le_add_right (2 ^ k) i) (by linarith) _ = ((2 ^ k : ℕ) : ℝ) * ((2 ^ k : ℕ) : ℝ) ^ (-(1 + u)) := by simp _ = ((2 : ℝ) ^ (-u)) ^ k := by rw [show ((2 ^ k : ℕ) : ℝ) * ((2 ^ k : ℕ) : ℝ) ^ (-(1 + u)) = ((2 ^ k : ℕ) : ℝ) ^ (1 + -(1 + u)) by rw [Real.rpow_add hn, Real.rpow_one]] simp only [show (1 : ℝ) + -(1 + u) = -u by ring, Nat.cast_pow, Nat.cast_ofNat] exact (Real.rpow_pow_comm (by norm_num : (0 : ℝ) ≤ 2) (-u) k).symm theorem dyadic_partial_sum_le {u : ℝ} (hu : 0 < u) (K : ℕ) : (∑ n ∈ Finset.range (2 ^ K), (n : ℝ) ^ (-(1 + u))) ≤ ∑ k ∈ Finset.range K, ((2 : ℝ) ^ (-u)) ^ k := by induction K with | zero => simp only [pow_zero, Finset.sum_range_one, Nat.cast_zero, Finset.sum_range_zero] rw [Real.zero_rpow (show -(1 + u) ≠ 0 by linarith)] | succ K ih => rw [pow_succ, show 2 ^ K * 2 = 2 ^ K + 2 ^ K by omega, Finset.sum_range_add, Finset.sum_range_succ] exact add_le_add ih (dyadic_block_le hu K) theorem negative_power_partial_sum_le {u : ℝ} (hu : 0 < u) (M : ℕ) : (∑ n ∈ Finset.range M, (n : ℝ) ^ (-(1 + u))) ≤ (1 - (2 : ℝ) ^ (-u))⁻¹ := by have hr0 : 0 ≤ (2 : ℝ) ^ (-u) := Real.rpow_nonneg (by norm_num) _ have hr1 : (2 : ℝ) ^ (-u) < 1 := by simpa using Real.rpow_lt_rpow_of_exponent_lt (by norm_num : (1 : ℝ) < 2) (neg_lt_zero.mpr hu) have hnorm : ‖(2 : ℝ) ^ (-u)‖ < 1 := by simpa [Real.norm_eq_abs, abs_of_nonneg hr0] using hr1 have hs := summable_geometric_of_norm_lt_one hnorm calc _ ≤ ∑ n ∈ Finset.range (2 ^ M), (n : ℝ) ^ (-(1 + u)) := by apply Finset.sum_le_sum_of_subset_of_nonneg · exact Finset.range_mono (Nat.le_of_lt (Nat.lt_two_pow_self (n := M))) · intro n hn hm exact Real.rpow_nonneg (Nat.cast_nonneg n) _ _ ≤ ∑ k ∈ Finset.range M, ((2 : ℝ) ^ (-u)) ^ k := dyadic_partial_sum_le hu M _ ≤ ∑' k : ℕ, ((2 : ℝ) ^ (-u)) ^ k := hs.sum_le_tsum _ (fun k _ => pow_nonneg hr0 k) _ = _ := tsum_geometric_of_norm_lt_one hnorm theorem negative_power_summable {u : ℝ} (hu : 0 < u) : Summable (fun n : ℕ => (n : ℝ) ^ (-(1 + u))) := summable_of_sum_range_le (fun n => Real.rpow_nonneg (Nat.cast_nonneg n) _) (negative_power_partial_sum_le hu) theorem negative_power_sum_le {u : ℝ} (hu : 0 < u) : (∑' n : ℕ, (n : ℝ) ^ (-(1 + u))) ≤ 1 + 1 / (u * Real.log 2) := by have hl : 0 < Real.log 2 := Real.log_pos (by norm_num) have hv : 0 < u * Real.log 2 := mul_pos hu hl have hr : (2 : ℝ) ^ (-u) = Real.exp (-(u * Real.log 2)) := by rw [Real.rpow_def_of_pos (by norm_num)]; congr 1; ring have hd : 0 < 1 - Real.exp (-(u * Real.log 2)) := by have := Real.exp_lt_one_iff.mpr (neg_lt_zero.mpr hv); linarith have hbound : (1 - Real.exp (-(u * Real.log 2)))⁻¹ ≤ 1 + 1 / (u * Real.log 2) := by rw [inv_eq_one_div] apply (div_le_iff₀ hd).mpr have he := Real.add_one_le_exp (u * Real.log 2) have hp := Real.exp_pos (u * Real.log 2) rw [Real.exp_neg] have heq : (1 + 1 / (u * Real.log 2)) * (1 - (Real.exp (u * Real.log 2))⁻¹) = ((u * Real.log 2 + 1) * (Real.exp (u * Real.log 2) - 1)) / ((u * Real.log 2) * Real.exp (u * Real.log 2)) := by field_simp rw [heq] apply (le_div_iff₀ (mul_pos hv hp)).mpr nlinarith exact (Real.tsum_le_of_sum_range_le (fun n => Real.rpow_nonneg (Nat.cast_nonneg n) _) (negative_power_partial_sum_le hu)).trans (by simpa [hr] using hbound) theorem finite_power_euler_product_le {u : ℝ} (hu : 0 < u) (S : Finset ℕ) : (∏ p ∈ S.filter Nat.Prime, (1 - (p : ℝ) ^ (-(1 + u)))⁻¹) ≤ 1 + 1 / (u * Real.log 2) := by have hp : ∀ {p : ℕ}, p.Prime → ‖negativePower u p‖ < 1 := by intro p hp change ‖(p : ℝ) ^ (-(1 + u))‖ < 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) (show -(1 + u) < 0 by linarith) have he := EulerProduct.summable_and_hasSum_factoredNumbers_prod_filter_prime_geometric (f := negativePower u) hp S have hb := (negative_power_summable hu).tsum_subtype_le (fun n : ℕ => (n : ℝ) ^ (-(1 + u))) (Nat.factoredNumbers S) (fun n => Real.rpow_nonneg (Nat.cast_nonneg n) _) have heq : (∑' n : Nat.factoredNumbers S, negativePower u n) = ∏ p ∈ S.filter Nat.Prime, (1 - (p : ℝ) ^ (-(1 + u)))⁻¹ := he.2.tsum_eq exact heq.symm.trans_le (hb.trans (negative_power_sum_le hu)) lemma mertens_factor_le {u : ℝ} (hu : 0 ring _ ≤ _ := by simpa [add_comm] using Real.add_one_le_exp (2*u*Real.log p/p) simpa only [div_eq_mul_inv] using (le_div_iff₀ hB).mpr he def ordinaryInverse (N : ℕ) : ℝ := ∏ p ∈ (Finset.Icc 2 N).filter Nat.Prime, (p : ℝ) / (p - 1) theorem ordinary_rankin {u : ℝ} (hu : 0 < u) (N : ℕ) : ordinaryInverse N ≤ Real.exp (2 * u * (∑ p ∈ (Finset.Icc 2 N).filter Nat.Prime, Real.log p / (p : ℝ))) * (1 + 1 / (u * Real.log 2)) := by let S := (Finset.Icc 2 N).filter Nat.Prime have he : (∏ p ∈ S, Real.exp (2 * u * Real.log p / p)) = Real.exp (2 * u * (∑ p ∈ S, Real.log p / p)) := by rw [← Real.exp_sum, Finset.mul_sum] congr 1 apply Finset.sum_congr rfl intro p hp ring calc ordinaryInverse N ≤ ∏ p ∈ S, Real.exp (2 * u * Real.log p / p) * (1 - (p : ℝ) ^ (-(1 + u)))⁻¹ := by apply Finset.prod_le_prod₀ · intro p hp have hp2 : (2 : ℝ) ≤ p := by exact_mod_cast (Finset.mem_filter.mp hp).2.two_le exact div_nonneg (Nat.cast_nonneg _) (by linarith) · intro p hp exact mertens_factor_le hu (Finset.mem_filter.mp hp).2 _ = Real.exp (2 * u * (∑ p ∈ S, Real.log p / p)) * ∏ p ∈ S, (1 - (p : ℝ) ^ (-(1 + u)))⁻¹ := by rw [Finset.prod_mul_distrib, he] _ ≤ _ := mul_le_mul_of_nonneg_left (finite_power_euler_product_le hu (Finset.Icc 2 N)) (Real.exp_pos _).le theorem ordinary_inverse_le (N : ℕ) (hN : 2 ≤ N) : ordinaryInverse N ≤ (4 * Real.exp (10 * Real.log 4)) * Real.log N := by have hl2 : (1 / 2 : ℝ) ≤ Real.log 2 := by have := Real.one_sub_inv_le_log_of_pos (by norm_num : (0 : ℝ) < 2) norm_num at this ⊢; exact this have hlog : (1 / 2 : ℝ) ≤ Real.log N := by have hn : (2 : ℝ) ≤ N := by exact_mod_cast hN exact hl2.trans (Real.log_le_log (by norm_num : (0 : ℝ) < 2) hn) have hc : 0 ≤ Real.log 4 := Real.log_nonneg (by norm_num) have hlog0 : 0 < Real.log N := by linarith have hu : 0 < 1 / Real.log N := one_div_pos.mpr hlog0 have hb := ordinary_rankin hu N have hm := mul_le_mul_of_nonneg_left (PrimeLog.prime_log_mass_le N hN) (show 0 ≤ 2 * (1 / Real.log N) by positivity) have hexp : 2 * (1 / Real.log N) * (∑ p ∈ (Finset.Icc 2 N).filter Nat.Prime, Real.log p / (p : ℝ)) ≤ 10 * Real.log 4 := by have hi : 1 / Real.log N ≤ 2 := by apply (div_le_iff₀ (by linarith : 0 < Real.log N)).mpr linarith have he : 2 * (1 / Real.log N) * (Real.log 4 * (2 + Real.log N)) = 4 * (1 / Real.log N) * Real.log 4 + 2 * Real.log 4 := by field_simp; ring rw [he] at hm nlinarith have hlast : 1 + 1 / ((1 / Real.log N) * Real.log 2) ≤ 4 * Real.log N := by have he : 1 / ((1 / Real.log N) * Real.log 2) = Real.log N / Real.log 2 := by field_simp rw [he] have hh : Real.log N / Real.log 2 ≤ 2 * Real.log N := by apply (div_le_iff₀ (by linarith : 0 < Real.log 2)).mpr nlinarith linarith calc ordinaryInverse N ≤ _ := hb _ ≤ Real.exp (10 * Real.log 4) * (4 * Real.log N) := mul_le_mul (Real.exp_le_exp.mpr hexp) hlast (by positivity) (by positivity) _ = _ := by ring /-- Elementary finite harmonic lower bound, including N=0. -/ theorem log_succ_le_harmonic (N : ℕ) : Real.log (N + 1 : ℕ) ≤ (harmonic N : ℝ) := by induction N with | zero => simp | succ N ih => have hn : (0 : ℝ) < (N : ℝ) + 1 := by positivity have hn2 : (0 : ℝ) < (N : ℝ) + 2 := by positivity have hh := Real.log_le_sub_one_of_pos (div_pos hn2 hn) have he : ((N : ℝ) + 2) / ((N : ℝ) + 1) - 1 = ((N : ℝ) + 1)⁻¹ := by field_simp; ring rw [he, Real.log_div hn2.ne' hn.ne'] at hh have hrec : (harmonic (N + 1) : ℝ) = (harmonic N : ℝ) + ((N : ℝ) + 1)⁻¹ := by rw [harmonic_succ]; push_cast; rfl rw [hrec] push_cast at ih ⊢ have he2 : (N : ℝ) + 1 + 1 = (N : ℝ) + 2 := by ring rw [he2] linarith theorem harmonic_le_ordinary_inverse (N : ℕ) : (harmonic N : ℝ) ≤ ordinaryInverse N := by classical let S := (Finset.Icc 2 N).filter Nat.Prime have hp : ∀ {p : ℕ}, p.Prime → ‖negativePower 0 p‖ < 1 := by intro p hp change ‖(p : ℝ) ^ (-(1 + 0 : ℝ))‖ < 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) (by norm_num : -(1 + 0 : ℝ) < 0) have he := EulerProduct.summable_and_hasSum_factoredNumbers_prod_filter_prime_geometric (f := negativePower 0) hp S have hf (n : ℕ) (hn : n ∈ Finset.range N) : n + 1 ∈ Nat.factoredNumbers S := by rw [Nat.mem_factoredNumbers_iff_forall_le] refine ⟨by omega, ?_⟩ intro p hpn hpp hpd exact Finset.mem_filter.mpr ⟨Finset.mem_Icc.mpr ⟨hpp.two_le, by have := Finset.mem_range.mp hn; omega⟩, hpp⟩ let j : {n // n ∈ Finset.range N} → Nat.factoredNumbers S := fun n => ⟨n + 1, hf n n.2⟩ have hj : Function.Injective j := by intro a b h apply Subtype.ext have hval := congrArg Subtype.val h change a.val + 1 = b.val + 1 at hval omega have hsum := he.1.of_norm have hb := hsum.sum_le_tsum ((Finset.range N).attach.image j) (fun n _ => Real.rpow_nonneg (Nat.cast_nonneg n.val) (-(1 + 0))) rw [Finset.sum_image (fun a _ b _ h => hj h)] at hb have hleft : (∑ a ∈ (Finset.range N).attach, negativePower 0 (j a)) = (harmonic N : ℝ) := by change (∑ a ∈ (Finset.range N).attach, ((a.val + 1 : ℕ) : ℝ) ^ (-(1 + 0 : ℝ))) = _ simp only [add_zero, Real.rpow_neg_one] unfold harmonic push_cast exact Finset.sum_attach (Finset.range N) (fun n : ℕ => ((n : ℝ) + 1)⁻¹) change (∑ a ∈ (Finset.range N).attach, negativePower 0 (j a)) ≤ ∑' n : Nat.factoredNumbers S, negativePower 0 n at hb rw [hleft, he.2.tsum_eq] at hb have hright : (∏ p ∈ S, (1 - (p : ℝ) ^ (-(1 + 0 : ℝ)))⁻¹) = ordinaryInverse N := by unfold ordinaryInverse apply Finset.prod_congr rfl intro p hp have hp0 : (0 : ℝ) < p := by exact_mod_cast (Finset.mem_filter.mp hp).2.pos have hp1 : (1 : ℝ) < p := by exact_mod_cast (Finset.mem_filter.mp hp).2.one_lt simp only [add_zero, Real.rpow_neg_one] field_simp have hfilter : S.filter Nat.Prime = S := Finset.filter_eq_self.mpr (fun p hp => (Finset.mem_filter.mp hp).2) change (harmonic N : ℝ) ≤ ∏ p ∈ S.filter Nat.Prime, (1 - (p : ℝ) ^ (-(1 + 0 : ℝ)))⁻¹ at hb simpa only [hfilter, hright] using hb def ordinaryProduct (N : ℕ) : ℝ := ∏ p ∈ (Finset.Icc 2 N).filter Nat.Prime, (1 - (p : ℝ)⁻¹) theorem ordinary_product_pos (N : ℕ) : 0 < ordinaryProduct N := by apply Finset.prod_pos intro p hp have hp1 : (1 : ℝ) < p := by exact_mod_cast (Finset.mem_filter.mp hp).2.one_lt have : (p : ℝ)⁻¹ < 1 := (inv_lt_one₀ (by linarith)).mpr hp1 exact sub_pos.mpr this theorem ordinary_product_inv (N : ℕ) : (ordinaryProduct N)⁻¹ = ordinaryInverse N := by rw [ordinaryProduct, ← Finset.prod_inv_distrib] apply Finset.prod_congr rfl intro p hp have hp0 : (0 : ℝ) < p := by exact_mod_cast (Finset.mem_filter.mp hp).2.pos have hp1 : (1 : ℝ) < p := by exact_mod_cast (Finset.mem_filter.mp hp).2.one_lt field_simp theorem ordinary_product_le (N : ℕ) (hN : 2 ≤ N) : ordinaryProduct N ≤ 1 / Real.log N := by have hN0 : (0 : ℝ) < N := by exact_mod_cast (show 0 < N by omega) have hlog0 : 0 < Real.log N := Real.log_pos (by exact_mod_cast (show 1 < N by omega)) have hh : Real.log N ≤ ordinaryInverse N := (Real.log_le_log hN0 (by push_cast; linarith)).trans ((log_succ_le_harmonic N).trans (harmonic_le_ordinary_inverse N)) rw [← ordinary_product_inv N] at hh have hh' := (inv_le_inv₀ (inv_pos.mpr (ordinary_product_pos N)) hlog0).mpr hh simpa only [inv_inv, one_div] using hh' /-- Ordinary factors over the exact strict/closed natural prime band. -/ theorem band_product_eq_ratio (A B : ℕ) (hAB : A ≤ B) : (∏ p ∈ ((Finset.Icc 2 B).filter Nat.Prime).filter (fun p => A < p), (1 - (p : ℝ)⁻¹)) = ordinaryProduct B / ordinaryProduct A := by have hfilter : ((Finset.Icc 2 B).filter Nat.Prime).filter (fun p => p ≤ A) = (Finset.Icc 2 A).filter Nat.Prime := by ext p simp only [Finset.mem_filter, Finset.mem_Icc] constructor · rintro ⟨⟨⟨hp2, hpB⟩, hpp⟩, hpA⟩ exact ⟨⟨hp2, hpA⟩, hpp⟩ · rintro ⟨⟨hp2, hpA⟩, hpp⟩ exact ⟨⟨⟨hp2, hpA.trans hAB⟩, hpp⟩, hpA⟩ have he := Finset.prod_filter_mul_prod_filter_not ((Finset.Icc 2 B).filter Nat.Prime) (fun p => p ≤ A) (fun p => 1 - (p : ℝ)⁻¹) simp only [hfilter, not_le] at he apply (eq_div_iff (ordinary_product_pos A).ne').mpr simpa only [ordinaryProduct, mul_comm] using he theorem band_product_le (A B : ℕ) (hA : 2 ≤ A) (hB : 2 ≤ B) (hAB : A ≤ B) : (∏ p ∈ ((Finset.Icc 2 B).filter Nat.Prime).filter (fun p => A < p), (1 - (p : ℝ)⁻¹)) ≤ (4 * Real.exp (10 * Real.log 4)) * Real.log A / Real.log B := by rw [band_product_eq_ratio A B hAB, div_eq_mul_inv, ordinary_product_inv] have hlogB : 0 < Real.log B := Real.log_pos (by exact_mod_cast (show 1 < B by omega)) have hInvA : 0 ≤ ordinaryInverse A := by rw [← ordinary_product_inv]; exact (inv_pos.mpr (ordinary_product_pos A)).le have hh := mul_le_mul (ordinary_product_le B hB) (ordinary_inverse_le A hA) hInvA (one_div_nonneg.mpr hlogB.le) convert hh using 1 <;> ring def smallCorrection (p : ℕ) : ℝ := if p = 2 then 2 else 1 theorem small_correction_prod_le (S : Finset ℕ) : (∏ p ∈ S, smallCorrection p) ≤ 2 := by classical have he : (∏ p ∈ S, smallCorrection p) = ∏ p ∈ S ∩ {2}, smallCorrection p := by symm apply Finset.prod_subset Finset.inter_subset_left intro p hp hn have hp2 : p ≠ 2 := by intro h; exact hn (Finset.mem_inter.mpr ⟨hp, by simp [h]⟩) simp [smallCorrection, hp2] rw [he] calc _ ≤ ∏ p ∈ ({2} : Finset ℕ), smallCorrection p := Finset.prod_le_prod_of_subset_of_one_le₀ Finset.inter_subset_right (fun p _ => by unfold smallCorrection; split_ifs <;> norm_num) (fun p _ _ => by unfold smallCorrection; split_ifs <;> norm_num) _ = 2 := by norm_num [smallCorrection] /-- Actual eq15 density factors, including its derived p=2 exception. -/ theorem actual_factor_le (z0 z1 : ℝ) (hz0 : 3 < z0) (p : ℕ) (hp : p.Prime) : 1 - ActualBoundingSieve.density (ManuscriptResidues.omegaSet z0 z1) p ≤ smallCorrection p * (1 - (p : ℝ)⁻¹) ^ 2 * (if ManuscriptResidues.middleBand z0 z1 p then (1 - (p : ℝ)⁻¹) ^ 2 else 1) := by rw [ActualBoundingSieve.density_prime z0 z1 p hp, ManuscriptResidues.omega_card z0 z1 hz0 p hp] by_cases hp2 : p = 2 · subst p have hb : ¬ ManuscriptResidues.middleBand z0 z1 2 := by intro h; have := h.1; norm_num at this; linarith norm_num [smallCorrection, hb] have hq0 : 0 ≤ (p : ℝ)⁻¹ := inv_nonneg.mpr (Nat.cast_nonneg p) have hq1 : (p : ℝ)⁻¹ ≤ 1 := by have hp1 : (1 : ℝ) < p := by exact_mod_cast hp.one_lt exact ((inv_lt_one₀ (by linarith)).mpr hp1).le simp only [hp2, ite_false, smallCorrection, one_mul] by_cases hb : ManuscriptResidues.middleBand z0 z1 p · simp only [hb, ite_true, ite_false, Nat.cast_ofNat, div_eq_mul_inv] have hq2 := sq_nonneg ((p : ℝ)⁻¹) have hq4 := sq_nonneg (((p : ℝ)⁻¹) ^ 2) have hq3 := mul_nonneg hq2 (sub_nonneg.mpr hq1) nlinarith · simp only [hb, ite_false, Nat.cast_ofNat, div_eq_mul_inv, mul_one] nlinarith [sq_nonneg ((p : ℝ)⁻¹)] theorem actual_product_le (S : Finset ℕ) (hS : ∀ p ∈ S, p.Prime) (z0 z1 : ℝ) (hz0 : 3 < z0) : (∏ p ∈ S, (1 - ActualBoundingSieve.density (ManuscriptResidues.omegaSet z0 z1) p)) ≤ 2 * (∏ p ∈ S, (1 - (p : ℝ)⁻¹)) ^ 2 * (∏ p ∈ S.filter (ManuscriptResidues.middleBand z0 z1), (1 - (p : ℝ)⁻¹)) ^ 2 := by classical have hb : (∏ p ∈ S, (1 - ActualBoundingSieve.density (ManuscriptResidues.omegaSet z0 z1) p)) ≤ ∏ p ∈ S, smallCorrection p * (1 - (p : ℝ)⁻¹) ^ 2 * (if ManuscriptResidues.middleBand z0 z1 p then (1 - (p : ℝ)⁻¹) ^ 2 else 1) := by apply Finset.prod_le_prod₀ · intro p hp exact (sub_pos.mpr (ActualBoundingSieve.density_prime_lt_one z0 z1 hz0 p (hS p hp))).le · intro p hp; exact actual_factor_le z0 z1 hz0 p (hS p hp) rw [Finset.prod_mul_distrib, Finset.prod_mul_distrib, ← Finset.prod_filter, Finset.prod_pow, Finset.prod_pow] at hb exact hb.trans (mul_le_mul_of_nonneg_right (mul_le_mul_of_nonneg_right (small_correction_prod_le S) (sq_nonneg _)) (sq_nonneg _)) /-- Literal auxiliary sqrt(y) family, with unchanged real band endpoints. -/ theorem actual_auxiliary_product_le (y z0 z1 : ℝ) (hz0 : 3 < z0) : (∏ p ∈ ManuscriptResidues.paperPrimes y, (1 - ActualBoundingSieve.density (ManuscriptResidues.omegaSet z0 z1) p)) ≤ 2 * (∏ p ∈ ManuscriptResidues.paperPrimes y, (1 - (p : ℝ)⁻¹)) ^ 2 * (∏ p ∈ (ManuscriptResidues.paperPrimes y).filter (ManuscriptResidues.middleBand z0 z1), (1 - (p : ℝ)⁻¹)) ^ 2 := actual_product_le (ManuscriptResidues.paperPrimes y) (ManuscriptResidues.paperPrimeFamily y) z0 z1 hz0 end MertensBand #print axioms MertensBand.dyadic_block_le #print axioms MertensBand.dyadic_partial_sum_le #print axioms MertensBand.negative_power_partial_sum_le #print axioms MertensBand.negative_power_summable #print axioms MertensBand.negative_power_sum_le #print axioms MertensBand.finite_power_euler_product_le #print axioms MertensBand.mertens_factor_le #print axioms MertensBand.ordinaryInverse #print axioms MertensBand.ordinary_rankin #print axioms MertensBand.ordinary_inverse_le #print axioms MertensBand.log_succ_le_harmonic #print axioms MertensBand.harmonic_le_ordinary_inverse #print axioms MertensBand.ordinaryProduct #print axioms MertensBand.ordinary_product_pos #print axioms MertensBand.ordinary_product_inv #print axioms MertensBand.ordinary_product_le #print axioms MertensBand.band_product_eq_ratio #print axioms MertensBand.band_product_le #print axioms MertensBand.smallCorrection #print axioms MertensBand.small_correction_prod_le #print axioms MertensBand.actual_factor_le #print axioms MertensBand.actual_product_le #print axioms MertensBand.actual_auxiliary_product_le