Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Finite partial-fraction data and rational coefficients for Zudilin’s forms

Definition
ZudilinZetaPartialFractions

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

number-theorypartial-fractionszeta-values

For admissible parameters PPP and an integer n≥0n\ge0n≥0, put hj=hh(P,n,j)h_j=\mathrm{hh}(P,n,j)hj​=hh(P,n,j), S=q−rS=q-rS=q−r, and K={hr+1,…,h0−hr+1}K=\{h_{r+1},\ldots,h_0-h_{r+1}\}K={hr+1​,…,h0​−hr+1​}. A partial-fraction datum consists of rational numbers cs,kc_{s,k}cs,k​ with the identities

Rn(t)=∑s=1S∑k∈Kcs,k(t+k)s(t>−1),cs,h0−k=(−1)s+1cs,k,∑k∈Kc1,k=0.R_n(t)=\sum_{s=1}^{S}\sum_{k\in K}\frac{c_{s,k}}{(t+k)^s}\quad(t>-1),\qquad c_{s,h_0-k}=(-1)^{s+1}c_{s,k},\qquad \sum_{k\in K}c_{1,k}=0.Rn​(t)=s=1∑S​k∈K∑​(t+k)scs,k​​(t>−1),cs,h0​−k​=(−1)s+1cs,k​,k∈K∑​c1,k​=0.

The reflection identity is required for 1≤s≤S1\le s\le S1≤s≤S and k∈Kk\in Kk∈K. No existence of such data is asserted by this definition.

Write

ws=s(s+1)⋯(s+r−2)(r−1)!,As=ws∑k∈Kcs,k,A0=−∑s=1Sws∑k∈Kcs,k∑l=1k−1l−(s+r−1).w_s=\frac{s(s+1)\cdots(s+r-2)}{(r-1)!},\qquad A_s=w_s\sum_{k\in K}c_{s,k},\qquad A_0=-\sum_{s=1}^{S}w_s\sum_{k\in K}c_{s,k}\sum_{l=1}^{k-1}l^{-(s+r-1)}.ws​=(r−1)!s(s+1)⋯(s+r−2)​,As​=ws​k∈K∑​cs,k​,A0​=−s=1∑S​ws​k∈K∑​cs,k​l=1∑k−1​l−(s+r−1).

The empty rising product is 111. The named coefficient definitions are these finite rational expressions. The definition also names the rational normalization

Qn=Dm1nr∏j=2q−rDmjnΦn.Q_n=\frac{D_{m_1n}^{r}\prod_{j=2}^{q-r}D_{m_jn}}{\Phi_n}.Qn​=Φn​Dm1​nr​∏j=2q−r​Dmj​n​​.

These data separate the finite partial-fraction and coefficient estimates from the analytic evaluation of the series defining FnF_nFn​. The rational function is exactly the one in the 2001 note, including its factor h0+2th_0+2th0​+2t.

Definition code
import Definitions.Def_ZudilinZetaArith

/-!
# Finite partial-fraction data for Zudilin's linear forms

The coefficients describe the mission's rational function on the open ray (-1,∞).
The reflection and residue identities record its antisymmetry and decay at infinity.
The remaining definitions are finite rational expressions; they do not assume any
zeta-value identity or denominator estimate.
-/
namespace ZudilinZeta

/-- The integer locations of the possible poles of `R P n`. -/
def poleRange (P : Params) (n : ℕ) : Finset ℕ :=
  Finset.Icc (hh P n (P.r + 1)) (hh P n 0 - hh P n (P.r + 1))

/-- The rational multiplier in the definition of `Lambda`. -/
noncomputable def denominatorScale (P : Params) (n : ℕ) : ℚ :=
  ((D (m P 1 * n) : ℚ) ^ P.r *
    ∏ j ∈ Finset.Icc 2 (P.q - P.r), (D (m P j * n) : ℚ)) / (Phi P n : ℚ)

/-- The derivative multiplier, equal to `choose (s+r-2) (r-1)` for `s>0`. -/
def derivativeWeight (r s : ℕ) : ℚ :=
  (s.ascFactorial (r - 1) : ℚ) / ((r - 1).factorial : ℚ)

/-- A finite rational partial-fraction expansion with the two cancellation identities. -/
structure PartialFractionData (P : Params) (n : ℕ) where
  coeff : ℕ → ℕ → ℚ
  expansion : ∀ t : ℝ, -1 < t →
    R P n t = ∑ s ∈ Finset.Icc 1 (P.q - P.r),
      ∑ k ∈ poleRange P n, (coeff s k : ℝ) / (t + (k : ℝ)) ^ s
  reflection : ∀ s ∈ Finset.Icc 1 (P.q - P.r), ∀ k ∈ poleRange P n,
    coeff s (hh P n 0 - k) = (-1 : ℚ) ^ (s + 1) * coeff s k
  residues : ∑ k ∈ poleRange P n, coeff 1 k = 0

/-- Coefficient of `ζ(s+r-1)` before eliminating the zero rows. -/
def PartialFractionData.zetaCoefficient {P : Params} {n : ℕ}
    (d : PartialFractionData P n) (s : ℕ) : ℚ :=
  derivativeWeight P.r s * ∑ k ∈ poleRange P n, d.coeff s k

/-- Constant term obtained by subtracting the finite initial tails of the zeta series. -/
def PartialFractionData.constantCoefficient {P : Params} {n : ℕ}
    (d : PartialFractionData P n) : ℚ :=
  -(∑ s ∈ Finset.Icc 1 (P.q - P.r), derivativeWeight P.r s *
    ∑ k ∈ poleRange P n, d.coeff s k *
      ∑ l ∈ Finset.range (k - 1), (1 : ℚ) / ((l : ℚ) + 1) ^ (s + (P.r - 1)))

end ZudilinZeta
Source
W. Zudilin, One of the numbers ζ(5), ζ(7), ζ(9), ζ(11) is irrational, Russian Math. Surveys 56 (2001), pp. 774–775, definition of R_n and Lemma 1, https://www.math.ru.nl/~zudilin/PS/zeta5-11%24.pdf; W. Zudilin, Arithmetic of linear forms involving odd zeta values, https://arxiv.org/abs/math/0206176, Lemma 19 and its proof, pp. 31–33, equations (8.10)–(8.12).

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