Irrationality of the dilogarithm at 1/4
Abstract.
We prove that is irrational. Irrationality of was known for integers and by work of Hata and of Rhin and Viola, and Prellberg recently proved it for . The linear forms in and come from one double integral of Viola and Zudilin at . We expand it into Rhin–Viola integrals in three ways and apply their factorial transformations to each term. This gives a common factor of the coefficients of the th form. The third expansion adds the primes between and to this factor, which is too small without them. We bound the integral by the weighted arithmetic-geometric mean inequality and by concavity on circular arcs.
Key words and phrases:
dilogarithm, irrationality, permutation group method2020 Mathematics Subject Classification:
Primary 11J72; Secondary 33B301. Introduction
For let . Hata [3] proved that is irrational for every integer and every . Rhin and Viola adapted their permutation group method [5] to the dilogarithm and settled [6]. They later treated negative arguments [7]. Viola and Zudilin [8] introduced a six-parameter family of double integrals. In 2024 Calegari, Dimitrov and Tang [1, Remark 2.8.2 and Section 15.2] listed the integers still open: . Prellberg’s 2026 preprint [4] treats . We prove the case .
Theorem 1.
The number is irrational.
Put , , , and for
| (1.1) | ||||
with as in Section 2. By [8, Lemma 2.1], . Sections 3 and 4 give with
Since , Theorem 1 follows.
The arithmetic follows [4, Section 3.2]. Identity (2.1) for and for its image under (F2) gives the analogues of [4, (3.11)–(3.12)]. The factorial transformations of [6] act on each term. For these expansions give only in Lemma 3.2. These primes account for of , and the rest of is below . Expansion (2.2) gives one power of each such . The bounds of Lemma 3.2 depend only on , so we need not exclude the exceptional primes of [4, (3.6)–(3.7)]. One linear form suffices, since for large .
Two Python scripts recheck only part of the proof (Appendix C). The proof is complete without them. The use of AI tools is described at the end of the paper.
2. Integrals and known results
Let . For integers with put
and, with small positively oriented circles,
For define , , and in the same way from
For or , with components , put
For let
and call admissible if . Put
and let be the orbit of under the group generated by and . Both maps permute the multiset [6, (3.2), (3.15)], so every is admissible when is.
In the sources, (F1) and (F3) read and , with the displayed multiplier; (F2) and (F4) are stated there for each component. Numbering in [8] refers to the preprint version.
Lemma 2.1.
Let . Then
| (2.1) | ||||
| (2.2) |
Proof.
Expand as and as . Each term has the denominator and the pole of the corresponding -integrand. The powers of are and . The identities hold for each component, hence for . ∎
3. The divisor
3.1. Local bounds
For the tuple in (1.1), (F1) gives , , , . Since at ,
| (3.1) |
Fix and a prime with . Put and , and let be the Iverson bracket. For , and .
Lemma 3.1.
Let be admissible with all entries of and in , and let . Then, for ,
Proof.
By (F4), . The entries of and are those of and in some order. Apply (F3) to , where and are units at . ∎
Lemma 3.2.
Suppose . For put and
Then, for ,
| (3.2) |
If moreover , then .
Proof.
Here . By (F2), is unchanged if (1.1) is replaced by . So (2.1), applied to (1.1) for and to this tuple for , gives
where . Here ; all entries of and lie in . The tuples
lie in . Put . Then . Also for each , so Lemma 3.1 shows that the -th term of has valuation at least
Direct subtraction gives
By ,
Hence , and for every . The ultrametric inequality and (3.1) give (3.2).
3.2. Periodic intervals
Since divides , and , and , we get . For put , , and
Lemma 3.3.
For one has and on .
Proof.
Here , , and . So , and gives . For ,
and . Hence . ∎
Put ; by Lemma 3.3 these intervals are pairwise disjoint. Let be the open intervals
They are pairwise disjoint and lie in . Define
Proposition 3.4.
Let and let be a prime with . Then and for .
4. Density
Lemma 4.1.
Let over primes with . Then , , and
5. Analytic estimates
5.1. The double integral
Write , for , at the tuple (1.1).
Lemma 5.1.
Let . Then , where
In particular, with
we have
Proof.
We have
The exponents are , , , , and . The powers of cancel, since and . Those of add to , and . For put . Then runs over as runs over , and . ∎
Lemma 5.2.
For , .
5.2. The residue integral
Put , and, for ,
Lemma 5.3.
For and :
-
(1)
, , , , and ;
-
(2)
, and with ;
-
(3)
for .
Proof.
One has , , and ; similarly for . Also , so . Next , since equals for and is at least for ; likewise . For (2), and the denominator has modulus at most . With , and ,
For real take , and . Part (3) follows from and its analogue. ∎
Lemma 5.4.
For , , where
Proof.
Residues are invariant under the change of variables of Lemma 5.1, and corresponds to . Hence . Fix . By Lemma 5.3, runs from to in the upper half-plane and in the lower one, both in the closed unit disc. So followed by reversed is a positively oriented Jordan curve around , and the other pole lies outside. As has real coefficients, the residue theorem gives
By Lemma 5.3, also with replaced by ,
so both are bounded on . For fixed the function is holomorphic off , and . Cauchy’s theorem moves to the arc , and Fubini’s theorem gives . ∎
Lemma 5.5.
For , .
Proof.
Put and , so and . With
one has , , and . So , where
Let and . Since , , and ,
Here and, for ,
so . Therefore
is positive definite, since . So is strictly concave and . The partial derivatives are
Table B.2 gives at and at . Consider the box , . Since , we get on its face , on , on and on . So the maximum of on the box is an interior critical point, hence the global maximum. At , Table B.2 gives and . Concavity gives
By Lemma 5.3, , and . With ,
By Lemma 5.4,
6. Proof of Theorem 1
Appendix A Floor data
Table A.1 cuts each at the jumps of the . On each piece, with the left end. The columns , , follow from Lemma 3.2, and the last column is . The first row uses (2.2) instead of , , .
| piece | |||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| by (2.2) | |||||||||||||
| 0 | ||||
|---|---|---|---|---|
| 1 | ||||
| 2 | ||||
| 3 | ||||
| 4 |
Appendix B Numerical values
Values are truncated to the digits shown.
| quantity | value |
|---|---|
Appendix C Computer checks
The two scripts in Table C.1 recheck only the statements listed there, in exact rational arithmetic. They are included as ancillary files. The proof does not use them. For the analytic script writes with , , and uses terms of , , with tail at most .
| script | statements checked | time |
|---|---|---|
|
check_ |
the intervals and Tables A.1, A.2 as printed; Lemma 3.3; the tuples and the floor sums in Lemma 3.2; Proposition 3.4 for at each jump of the and between consecutive jumps, and , on ; the numbers in Lemma 4.1; and in Section 1; rows 4–6 of Table B.1 | 10 s |
|
check_ |
for and all primes with and (for larger , ), the best bound from Lemma 3.1 over (2.1) with and (2.2), all and all , is at least | 3 min |
|
check_ |
the exponents in Lemma 5.1; the constants in Lemma 5.2; the identities in Lemmas 5.3 and 5.5 at rational points; rows 1–3 of Table B.1 and Table B.2 as printed; | 1 s |
Use of AI tools
Codex (OpenAI, GPT-5.6 Sol) searched for the parameters in (1.1) and wrote the Python code and the interval lists. Claude Code (Anthropic, Claude Fable 5) checked the code, the parameters and the tables. The author checked every step of the proof, every table and every reference, and takes full responsibility for the content of the paper.
References
- [1] F. Calegari, V. Dimitrov, and Y. Tang, The linear independence of , , and , preprint (2024), arXiv:2408.15403v2.
- [2] NIST Digital Library of Mathematical Functions, https://dlmf.nist.gov/, Release 1.2.8 of 2026-09-15, F. W. J. Olver et al., eds.
- [3] M. Hata, Rational approximations to the dilogarithm, Trans. Amer. Math. Soc. 336 (1993), no. 1, 363–387. MR1147401
- [4] T. Prellberg, Three irrationality results for the dilogarithm: Rhin–Viola and Viola–Zudilin constructions at , , and , preprint (2026), arXiv:2609.06895v1.
- [5] G. Rhin and C. Viola, On a permutation group related to , Acta Arith. 77 (1996), no. 1, 23–56. MR1404975
- [6] G. Rhin and C. Viola, The permutation group method for the dilogarithm, Ann. Sc. Norm. Super. Pisa Cl. Sci. (5) 4 (2005), no. 3, 389–437. MR2185863
- [7] G. Rhin and C. Viola, Linear independence of , and , Mosc. J. Comb. Number Theory 8 (2019), no. 1, 81–96. MR3864310
- [8] C. Viola and W. Zudilin, Linear independence of dilogarithmic values, J. Reine Angew. Math. 736 (2018), 193–223; preprint version: Max-Planck-Institut für Mathematik Preprint Series 2014 (26), http://www.mpim-bonn.mpg.de/preblob/5515. MR3769989