Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Rough lcm bound for Zudilin’s partial-fraction coefficients

Proved
ZudilinZeta.zudilin_partial_fraction_rough_denominators

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

number-theoryp-adic-valuationpartial-fractionszeta-values

Let PPP be an admissible parameter system, let n>0n>0n>0, and let (cs,k)(c_{s,k})(cs,k​) be any partial-fraction datum for the mission rational function RnR_nRn​. Put S=q−rS=q-rS=q−r and

m0=max⁡{ηr,η0−2ηr+1}.m_0=\max\{\eta_r,\eta_0-2\eta_{r+1}\}.m0​=max{ηr​,η0​−2ηr+1​}.

For every 1≤s≤S1\le s\le S1≤s≤S and every pole index hr+1≤k≤h0−hr+1h_{r+1}\le k\le h_0-h_{r+1}hr+1​≤k≤h0​−hr+1​,

Dm0nS−s cs,k∈Z.D_{m_0n}^{S-s}\,c_{s,k}\in\mathbb Z.Dm0​nS−s​cs,k​∈Z.

Here DN=lcm⁡(1,…,N)D_N=\operatorname{lcm}(1,\ldots,N)DN​=lcm(1,…,N), and D0=1D_0=1D0​=1. This is the rough coefficient denominator estimate in (8.10), before the improvement by the selected prime product. The rational function and its factor h0+2th_0+2th0​+2t are exactly those in the mission’s 2001 note.

Preamble
import Definitions.Def_ZudilinZetaPartialFractions
Formal statement
namespace ZudilinZeta

theorem zudilin_partial_fraction_rough_denominators (P : Params) (n : ℕ) (hn : 0 < n)
    (d : PartialFractionData P n) :
    ∀ s ∈ Finset.Icc 1 (P.q-P.r), ∀ k ∈ poleRange P n,
      ∃ a : ℤ,
        (D (max (P.eta P.r) (P.eta 0-2*P.eta (P.r+1))*n) : ℚ)^(P.q-P.r-s) *
          d.coeff s k = (a : ℚ) := by sorry

end ZudilinZeta
Source
W. Zudilin, Arithmetic of linear forms involving odd zeta values, https://arxiv.org/abs/math/0206176, Lemmas 15–19, pp. 27–33, especially inequalities (8.10)–(8.11); One of the numbers ζ(5), ζ(7), ζ(9), ζ(11) is irrational, Russian Math. Surveys 56 (2001), pp. 774–775, Lemma 1 and the exact prime cutoff, https://www.math.ru.nl/~zudilin/PS/zeta5-11%24.pdf.

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