Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Certified enclosure of the analytic constant C₀ for Zudilin’s parameters

Proved
ZudilinZeta.zudilin_numeric_C0_bounds

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

analysiscertified-numericsnumber-theoryzeta-values

For the parameters r=3r=3r=3, q=13q=13q=13, η0=91\eta_0=91η0​=91, η1=η2=η3=27\eta_1=\eta_2=\eta_3=27η1​=η2​=η3​=27, and ηj=25+j\eta_j=25+jηj​=25+j for 4≤j≤134\le j\le134≤j≤13, let τ\tauτ be any root of the characteristic polynomial in the upper half-plane whose real part is maximal among upper-half-plane roots. Then the analytic constant C0=−Re⁡f0(τ)C_0=-\operatorname{Re}f_0(\tau)C0​=−Ref0​(τ) satisfies

227.58019641≤C0<227.58019642.227.58019641\le C_0<227.58019642.227.58019641≤C0​<227.58019642.

This is the analytic half of the numerical comparison in the proof of Zudilin’s theorem. The enclosure is uniform over every root satisfying the maximality condition, rather than an assumed decimal approximation to a chosen root.

Preamble
import Definitions.Def_ZudilinZetaAsymp
import Definitions.Def_ZudilinZetaParams13
Formal statement
namespace ZudilinZeta
theorem zudilin_numeric_C0_bounds (τ : ℂ) (hroot : charPoly params13 τ = 0) (him : 0 < τ.im)
    (hmax : ∀ σ : ℂ, charPoly params13 σ = 0 → 0 < σ.im → σ.re ≤ τ.re) :
    227.58019641 ≤ C0 params13 τ ∧ C0 params13 τ < 227.58019642 := by sorry
end ZudilinZeta
Source
W. Zudilin, Arithmetic of linear forms involving odd zeta values, https://arxiv.org/abs/math/0206176, Proposition 5 and proof of Theorem 3, printed pp. 34–35; the analytic constant is C0, and that paper denotes the mission arithmetic constant C1 by C2. Also One of the numbers ζ(5), ζ(7), ζ(9), ζ(11) is irrational, Russian Math. Surveys 56 (2001), 774–776.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me