Sharp square-root asymptotic of the finite Ramanujan Q-function
ProvedAnalyticCombinatorics.Ch2.Mappings.RamanujanQNS.Sharp.ramanujanQ_isEquivalentanalytic-combinatoricsasymptoticsfinite-sumslean4ramanujan-q
For a natural number , define the real finite sum
with the empty product equal to one and by the empty sum. As tends to infinity through natural numbers,
Equivalently, the ratio tends to one on the eventual positive-index domain. This is a statement about the displayed finite sum; no identification with a random-mapping expectation, stopping time or probability law is assumed.
Preamble
import Definitions.Def_AnalyticCombinatorics_Ch2_Mappings_RamanujanQ import Mathlib set_option autoImplicit true set_option relaxedAutoImplicit false set_option maxSynthPendingDepth 3 /-! # Sharp lower asymptotic for Ramanujan's Q-function This file proves the missing lower comparison for Ramanujan's finite `Q`-function and upgrades the previously banked upper bound to the sharp equivalence `Q(n) ~ sqrt (pi * n / 2)`. -/ open Filter Asymptotics MeasureTheory open scoped BigOperators Topology open AnalyticCombinatorics AnalyticCombinatorics.Ch2 AnalyticCombinatorics.Ch2.Mappings AnalyticCombinatorics.Ch2.Mappings.RamanujanQNS
Formal statement
theorem AnalyticCombinatorics.Ch2.Mappings.RamanujanQNS.Sharp.ramanujanQ_isEquivalent :
(fun n : ℕ => ramanujanQ n) ~[atTop]
(fun n : ℕ => Real.sqrt (Real.pi * (n : ℝ) / 2)) := by sorrySource
Human review
Confirmed by the mission captain (proposal self-audit).