Zeta Surrogate zeros in closed Ball₀ count
Backlund.zetaSurrogate_zeros_in_closedBall₀_count
Plain-language statement
Let be the project's entire zeta surrogate, obtained by removing the pole of at . There is a constant such that, for every , the total multiplicity of the zeros of in is bounded by
Exact Lean statement
lemma zetaSurrogate_zeros_in_closedBall₀_count :
∃ C' : ℝ, 0 < C' ∧
∀ R : ℝ, 1 ≤ R →
Complex.Hadamard.divisorMassClosedBall₀ zetaSurrogate R ≤
C' * (1 + R) ^ (3/2 : ℝ)Formal artifact
Lean source
lemma zetaSurrogate_zeros_in_closedBall₀_count : ∃ C' : ℝ, 0 < C' ∧ ∀ R : ℝ, 1 ≤ R → Complex.Hadamard.divisorMassClosedBall₀ zetaSurrogate R ≤ C' * (1 + R) ^ (3/2 : ℝ) := by obtain ⟨C, hC0, hC⟩ := zetaSurrogate_log_growth set K : ℝ := |Real.log ‖meromorphicTrailingCoeffAt zetaSurrogate 0‖| with hK refine ⟨(C * 2 ^ (3/2 : ℝ) + K) / Real.log 2, ?_, ?_⟩ · refine div_pos ?_ (Real.log_pos one_lt_two) have h2 : (0 : ℝ) < 2 ^ (3/2 : ℝ) := Real.rpow_pos_of_pos two_pos _ have hKnn : (0 : ℝ) ≤ K := abs_nonneg _ nlinarith [mul_pos hC0 h2] · intro R hR have hmass := Complex.Hadamard.divisorMassClosedBall₀_le_of_growth zetaSurrogate_differentiable hC hR refine hmass.trans ?_ rw [div_mul_eq_mul_div, div_eq_mul_inv, div_eq_mul_inv] refine mul_le_mul_of_nonneg_right ?_ (inv_nonneg.mpr (Real.log_nonneg one_le_two)) have habs : |2 * R| = 2 * R := abs_of_nonneg (by linarith) rw [habs] have h1R : (0 : ℝ) ≤ 1 + R := by linarith have hone : (1 : ℝ) ≤ (1 + R) ^ (3/2 : ℝ) := by calc (1 : ℝ) = (1 : ℝ) ^ (3/2 : ℝ) := (Real.one_rpow _).symm _ ≤ (1 + R) ^ (3/2 : ℝ) := Real.rpow_le_rpow zero_le_one (by linarith) (by norm_num) have hpow : (1 + 2 * R) ^ (3/2 : ℝ) ≤ 2 ^ (3/2 : ℝ) * (1 + R) ^ (3/2 : ℝ) := by rw [← Real.mul_rpow (by norm_num) h1R] exact Real.rpow_le_rpow (by linarith) (by linarith) (by norm_num) have hKnn : (0 : ℝ) ≤ K := abs_nonneg _ calc C * (1 + 2 * R) ^ (3/2 : ℝ) + K ≤ C * (2 ^ (3/2 : ℝ) * (1 + R) ^ (3/2 : ℝ)) + K * (1 + R) ^ (3/2 : ℝ) := add_le_add (mul_le_mul_of_nonneg_left hpow hC0.le) (le_mul_of_one_le_right hKnn hone) _ = (C * 2 ^ (3/2 : ℝ) + K) * (1 + R) ^ (3/2 : ℝ) := by ring- Project
- Prime Number Theorem and More
- License
- Apache-2.0
- Commit
- a93551347dce
- Source
- PrimeNumberTheoremAnd/Backlund/ZeroCountCrude.lean:856-889
Reuse this declaration
Bring the exact result into your workflow
The import identifies the source module. Your project still needs the pinned package dependency shown on this page.
What this badge means
This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.
Continue in this project
Related declarations
Admissible bound mono
admissible_bound.mono
Plain-language statement
For positive parameters , the classical error-bound function is nonincreasing once .
Source project: Prime Number Theorem and More
Person-level attribution pending.
Analytic On div Removable zero
AnalyticOn_divRemovable_zero
Plain-language statement
Let be analytic on an open set containing , and suppose . Define for and . Then the apparent singularity at is removable and is analytic throughout .
Source project: Prime Number Theorem and More
Person-level attribution pending.
Analytic On div Removable zero closed Ball
AnalyticOn_divRemovable_zero_closedBall
Plain-language statement
Suppose and is analytic on the closed disc with . Define for and . Then is analytic on the entire closed disc, including at the removed singularity.
Source project: Prime Number Theorem and More
Person-level attribution pending.