Irrationality of dilogarithm values at rational points
The dilogarithm is the sum of over positive integers m for . At which rational inputs is this value irrational? One approach is to fix the absolute numerator p and ask how large the denominator q must be to guarantee irrationality for either sign.
Why it matters and what counts as progress
Why it matters: Even when the series is easy to compute, deciding whether its value is a fraction requires arithmetic information. A uniform denominator bound shows how the guarantee scales with the numerator.
What counts as progress: Prove irrationality for a new rational input, lower a sufficient denominator threshold, or give one bound that works across a range of numerators. State the sign and range of the input and whether the threshold is strict.
How the problem developed
- 2005 · Positive rational inputs [1]
Georges Rhin and Carlo Viola Used a permutation group to strengthen irrationality criteria for dilogarithm values at positive rational arguments.
Thomas Prellberg Gave proofs of irrationality at −1/4, 1/5 and −1/3. The later uniform negative bound adapts his use of adjacent moments.
- 31 Oct 2026 · Uniform cubic bound [3]
Hu Tan and Ying Zhang with ChatGPT through Codex Gave one explicit cubic sufficient bound for both signs and sharpened the negative threshold. The authors report checking the new deductions in Lean with explicit external inputs.
AI contribution
Uniform cubic bounds for irrational values of the dilogarithm
For any positive integers p and q with , Tan and Zhang prove that both and are irrational. They give a slightly lower sufficient threshold for negative arguments. The integers p and q need not be coprime.
Sources
Publication history
Uniform cubic bounds for irrational values of the dilogarithm
Daily emails by default, only when there’s an update.