English

Linear independence of odd zeta values using Siegel's lemma

Number Theory 2025-12-01 v3

Abstract

We prove that among 1 and the odd zeta values ζ(3)\zeta(3), ζ(5)\zeta(5), \ldots, ζ(s)\zeta(s), at least 0.21s/logs 0.21 \sqrt{s}/\sqrt{\log s} are linearly independent over the rationals, for any sufficiently large odd integer ss. This is the first asymptotic improvement on the lower bound, logarithmic in ss, obtained by Ball-Rivoal in 2001. The proof is based on Siegel's lemma to construct non-explicit linear forms in values at odd integers of the Riemann zeta function, instead of using explicit well-poised hypergeometric series. A new refinement of Siegel's linear independence criterion is applied, together with a multiplicity estimate (namely a generalization of Shidlovsky's lemma). The result is also adapted to deal with values of the first ss polylogarithms at a fixed algebraic point in the unit disk, improving bounds of Rivoal and Marcovecchio.

Keywords

Cite

@article{arxiv.2109.10136,
  title  = {Linear independence of odd zeta values using Siegel's lemma},
  author = {Stéphane Fischler},
  journal= {arXiv preprint arXiv:2109.10136},
  year   = {2025}
}

Comments

44 pages. A new refinement of Siegel's linear independence criterion is used to correct an error pointed out by a referee and Ludovic Mistiaen. It turns out that the coefficient matrix of the linear forms we construct does not have always maximal rank: it satifies only a weaker assumption, proved to be sufficient in Siegel's linear independence criterion