Harmonic log-power bound with exact constant 2
Provedgpy_harmLogPow_boundnumber-theory
For every m and T, the harmonic log-power sum differs from the main term by at most . The proof is elementary telescoping, using the power-difference sandwich and ; no prime-number input, Chebyshev bound, or Mertens input is used. Formalization Note: the sum is written out in Mathlib terms, with no local definitions.
Preamble
import Mathlib open Classical
Formal statement
theorem gpy_harmLogPow_bound (m : ℕ) (T : ℕ) :
abs ((∑ e ∈ Finset.Icc 1 T, (Real.log (e : ℝ)) ^ m / (e : ℝ))
- (Real.log (T : ℝ)) ^ (m + 1) / ((m : ℝ) + 1))
≤ 2 * (Real.log (T : ℝ)) ^ m := by sorrySource
GPY Mertens partial: harmonic log-power bound and the conditional bridge from an S0 bound to the general S_m bound