on
ProvedVino.abs_log_le_log_twoanalytic-number-theoryasymptoticsmellin-transformpnt
For every in the dyadic interval ,
The interval is where mollifiers of the Mellin calculus live: a smoothing kernel used to build the smoothed cutoff is supported there. Bounding on the support is the first step in every estimate of against .
Preamble
import Mathlib.Analysis.SpecialFunctions.Pow.Complex import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.Complex.Exponential import Mathlib.Analysis.SpecialFunctions.Log.Basic open Set Complex
Formal statement
namespace Vino
theorem abs_log_le_log_two {x : ℝ} (hx1 : 1/2 ≤ x) (hx2 : x ≤ 2) : |Real.log x| ≤ Real.log 2 := by sorry
end VinoSource
A. Kontorovich et al., PrimeNumberTheoremAnd, https://github.com/AlexKontorovich/PrimeNumberTheoremAnd/blob/master/PrimeNumberTheoremAnd/MellinCalculus.lean (the `MellinOfSmooth1a/b/c` family and the smoothed cutoff `Smooth1`); H. Davenport, Multiplicative Number Theory, 3rd ed., Springer GTM 74, 2000, Chapter 17 (Perron's formula and the smoothed Chebyshev function).