Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (6.15) — Stirling bound for log⁡Sn\log S_nlogSn​

Proved
Apery.log_S_le

by tomasz · Oct 11, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisformalizationirrationalitynumber-theoryzeta5-mo271

Let n>0n > 0n>0, put Kn=40nK_n = 40nKn​=40n, and let

Sn  =  Kn! 2h 4 h−1Nn! 12h ∏i=1h−1(2i)! 2,Nn=3n,h=37n,S_n \;=\; \frac{K_n!^{\,2h}\,4^{\,h-1}}{N_n!^{\,12h}\,\prod_{i=1}^{h-1}(2i)!^{\,2}}, \qquad N_n = 3n,\quad h = 37n,Sn​=Nn​!12h∏i=1h−1​(2i)!2Kn​!2h4h−1​,Nn​=3n,h=37n,

be the explicit positive factorial ratio of (2.5). With λ=37/40\lambda = 37/40λ=37/40, α=3/40\alpha = 3/40α=3/40, and C∗C^*C∗ the constant (6.3),

log⁡Sn  ≤  (2λ−12αλ−2λ2)Kn2log⁡Kn+C∗Kn2+6⋅37n log⁡Kn+6⋅37n.\log S_n \;\le\; \bigl(2\lambda - 12\alpha\lambda - 2\lambda^2\bigr) K_n^2 \log K_n + C^* K_n^2 + 6\cdot 37n\,\log K_n + 6\cdot 37n.logSn​≤(2λ−12αλ−2λ2)Kn2​logKn​+C∗Kn2​+6⋅37nlogKn​+6⋅37n.

This is the Stirling bound (6.15) of Section 6, used together with (6.14) to reduce log⁡Fn(ζ(5))=log⁡Sn+log⁡Δn(ζ(5))\log F_n(\zeta(5)) = \log S_n + \log\Delta_n(\zeta(5))logFn​(ζ(5))=logSn​+logΔn​(ζ(5)) to the numerical inequality (6.4).

Formalization Note The product ∏i=1h−1(2i)!2\prod_{i=1}^{h-1}(2i)!^2∏i=1h−1​(2i)!2 uses natural-number subtraction in the upper endpoint, as in the definition of SnS_nSn​; the estimate is asserted for n>0n > 0n>0.

Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceConstruction
import Definitions.Def_Zeta5_SourceValue
import Definitions.Def_Zeta5_SourceConstants
import Definitions.Def_Zeta5_SourceMeasure

open Polynomial Filter Topology Finset
Formal statement
namespace Apery

theorem log_S_le (n : ℕ) (hn : 0 < n) :
    Real.log (S n) ≤ (2 * lam - 12 * alph * lam - 2 * lam ^ 2) * Kr n ^ 2 * Real.log (Kr n) +
      Cstar * Kr n ^ 2 + 6 * (37 * n) * Real.log (Kr n) + 6 * (37 * n) := by sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/RealBound.lean#L35-L85, Stirling bound (6.15)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me