betaFeedback

WorksMathematics

Products of two logarithms and arithmetic holonomy bounds

Abstract

We prove, assuming the arithmetic holonomy bound of Calegari, Dimitrov and Tang (Theorem 7.0.1 of their preprint arXiv:2408.15403), that 11, log⁡(1+1/q)\log(1+1/q), log⁡(1−1/q)\log(1-1/q) and log⁡(1+1/q)log⁡(1−1/q)\log(1+1/q)\log(1-1/q) are linearly independent over Q\mathbb{Q} for every integer 26≤q≤5326\le q\le53. Together with Hata's theorem for q≥54q\ge54 this gives the four-term independence for every q≥26q\ge26. In particular the seven numbers log⁡(1+1/N)log⁡(1+1/(N+1))\log(1+1/N)\log(1+1/(N+1)), 25≤N≤3125\le N\le31, are irrational; irrationality was previously known for N≥32N\ge32 (Lysov). The proof feeds Lysov's explicit type II Hermite–Padé forms into the holonomy bound, and replaces the arithmetic of the forms by an analytic input: the monodromy of a minimal differential operator of order 13, which we show to be irreducible by interval-arithmetic certificates. Conditionally on the published form of the Calegari–Dimitrov–Tang argument for products of two logarithms, we also widen their Theorem C from ∣m/n−1∣<10−6|m/n-1|<10^{-6} to ∣m/n−1∣<3⋅10−6|m/n-1|<3\cdot10^{-6}, which gives infinitely many new irrational products log⁡(1+1/m)log⁡(1+1/n)\log(1+1/m)\log(1+1/n) with ∣m−n∣≥2|m-n|\ge2, and we show by pooling several pairs that at most one exceptional pair class exists with ∣m/n−1∣<5⋅10−5|m/n-1|<5\cdot10^{-5}, and at most two with ∣m/n−1∣<10−4|m/n-1|<10^{-4}. All certificates are exact or rigorous ball arithmetic and can be reproduced from the accompanying code.

Introduction

For an integer q≥2q \ge2 put

θq=log⁡(1+1q)log⁡(1−1q).\theta_q = \log\left(1 + \frac{1}{q}\right)\log\left(1 - \frac{1}{q}\right).

Hata [3 Cor. 6.3] showed that 11, log⁡(1+1/q)\log(1 + 1/q), log⁡(1−1/q)\log(1 - 1/q), θq\theta_q are linearly independent over Q\mathbb{Q} for every integer q≥54q \ge54, with an effective linear independence measure; in particular θq∉Q\theta_q \notin\mathbb{Q} for every integer q≥54q \ge54 [3 Thm. 0.1]. Lysov [6] found an explicit formula for the common denominator of the type II Hermite–Padé approximants to (log⁡(1+1/z),log⁡(1−1/z),log⁡(1+1/z)log⁡(1−1/z))(\log(1 + 1/z), \log(1 - 1/z), \log(1 + 1/z)\log(1 - 1/z)) and deduced that θq\theta_q is irrational for every q≥33q \ge33 [6, 7] ([6] is a preprint; we found no journal version as of 19 November 2026). Calegari, Dimitrov and Tang [1 Thm. C, Thm. 14.0.1] proved, by a new arithmetic holonomy bound, that 11, log⁡(1+1/m)\log(1+1/m), log⁡(1+1/n)\log(1+1/n) and log⁡(1+1/m)log⁡(1+1/n)\log(1+1/m)\log(1+1/n) are linearly independent over Q\mathbb{Q} whenever m≠nm \ne n are integers in Z∖{−1,0}\mathbb{Z}\setminus\{-1,0\} with ∣m/n−1∣<10−6|m/n-1|<10^{-6}. In [1 §15.1.10] they suggest forming “the generating function of the special linear forms obtained from evaluating a regular sequence of functional Hermite–Padé approximants” and reading it through their holonomy bounds. This paper carries out that scheme for Lysov’s forms, and pushes the constant 10−610^{-6} of [1 Thm. C].

Dependence on one preprint

Every result in this paper depends on the preprint [1] (arXiv:2408.15403v2, 16 September 2024; still the current version on 19 November 2026), which to our knowledge has not been refereed. Theorem 1 and Corollary 2 use only its general holonomy bound [1 Thm. 7.0.1], which we apply as stated. Theorems 3 and 4 also use the specific construction of [1 §14] for products of two logarithms, together with [1 Thm. 6.0.2, Cor. 9.0.19, Lemma 12.0.1]. That construction contains a step that is asserted rather than proved in [1], the irreducibility of a certain differential operator La,b\mathcal{L}_{a,b}, and we inherit it; see § 5. Each theorem below names exactly what it assumes.

Results

Theorem 1. Assume [1 Thm. 7.0.1]. For every integer qq with 26≤q≤5326 \le q \le53, the numbers

1,log⁡(1+1q),log⁡(1−1q),log⁡(1+1q)log⁡(1−1q)1,\qquad\log\left(1+\frac{1}{q}\right),\qquad\log\left(1-\frac{1}{q}\right),\qquad\log\left(1+\frac{1}{q}\right)\log\left(1-\frac{1}{q}\right)

are linearly independent over Q\mathbb{Q}.

With Hata’s theorem [3] for q≥54q \ge54, the same holds for every integer q≥26q \ge26. Precisely, [3 Cor. 6.3] states: let q≥54q \ge54 be an integer; for every ε>0\varepsilon> 0 there is an effectively computable H1=H1(ε,q)H_1=H_1(\varepsilon,q) such that

∣n0+n1log⁡(1+1q)+n2log⁡(1−1q)+n3θq+n4Λ(1q)∣≥H−σ(q2)/τ(q2)−ε\left|n_0+n_1\log\left(1+\frac{1}{q}\right)+n_2\log\left(1-\frac{1}{q}\right)+n_3\theta_q+n_4\Lambda\left(\frac{1}{q}\right)\right|\ge H^{-\sigma(q^2)/\tau(q^2)-\varepsilon}

for all (n0,…,n4)∈Z5(n_0,\ldots,n_4)\in\mathbb{Z}^5 with H=max⁡1≤m≤4∣nm∣≥H1H=\max_{1\le m\le4}|n_m|\ge H_1. Here Λ(x)=Li⁡2((1+x)/2)−Li⁡2((1−x)/2)−log⁡2⋅log⁡((1+x)/(1−x))\Lambda(x)=\operatorname{Li}_2((1+x)/2)-\operatorname{Li}_2((1-x)/2)-\log2\cdot\log((1+x)/(1-x)) [3 (3.5)], and σ,τ\sigma,\tau are explicit [3 (6.3), (6.4)]; the bound q≥54q\ge54 comes from Hata’s τ(k)>0\tau(k)>0 for every integer k≥2909k\ge2909 (and 532<2909≤54253^2<2909\le54^2), and σ(k)/τ(k)→4\sigma(k)/\tau(k)\to4 as k→∞k\to\infty. Taking n4=0n_4=0 gives the four-term independence; in fact 11, log⁡(1+1/q)\log(1+1/q), log⁡(1−1/q)\log(1-1/q), θq\theta_q, Λ(1/q)\Lambda(1/q) are linearly independent over Q\mathbb{Q}. Hata states this for integers qq only: Corollary 6.3 is the case k=q2k=q^2 of his Theorem 6.2, the analogous statement at 1/k1/\sqrt{k} for every integer k≥2909k\ge2909.

Since log⁡(1−1/q)=−log⁡(1+1/(q−1))\log(1-1/q)=-\log(1+1/(q-1)), Theorem 1 at q=N+1q=N+1 contains the irrationality of the product of two consecutive logarithms log⁡(1+1/N)log⁡(1+1/(N+1))=−θN+1\log(1+1/N)\log(1+1/(N+1))=-\theta_{N+1}:

Corollary 2. Assume [1 Thm. 7.0.1]. For every integer NN with 25≤N≤3125 \le N \le31,

log⁡(1+1N)log⁡(1+1N+1)∉Q.\log\left(1+\frac{1}{N}\right)\log\left(1+\frac{1}{N+1}\right) \notin\mathbb{Q}.

These are seven new irrational numbers. By Theorem 1 for 32≤N≤5232 \le N \le52 and Hata’s theorem for N≥53N \ge53 (and, independently, Lysov’s theorem [6] for N≥32N \ge32), the product is irrational for every N≥25N \ge25.

The second group of results concerns CDT’s two-parameter family. For m∈Z∖{−1,0}m \in\mathbb{Z} \setminus\{-1,0\} write ℓm=log⁡(1+1/m)\ell_m=\log(1+1/m).

Theorem 3. Assume the following parts of [1] as published: Theorem 6.0.2, Corollary 9.0.19, Lemma 12.0.1 and §14, including the irreducibility of the operator La,b\mathcal{L}_{a,b} and the reduction in the proof of Lemma 14.3.1. Let m≠nm \ne n be integers in Z∖{−1,0}\mathbb{Z} \setminus\{-1,0\} with ∣m/n−1∣<3⋅10−6\lvert m/n-1\rvert< 3 \cdot10^{-6}. Then 11, ℓm\ell_m, ℓn\ell_n and ℓmℓn\ell_m\ell_n are linearly independent over Q\mathbb{Q}; in particular ℓmℓn\ell_m\ell_n is irrational.

Theorem 4. Make the assumptions of Theorem 3. Call a pair (m,n)(m,n) of distinct integers in Z∖{−1,0}\mathbb{Z} \setminus\{-1,0\} exceptional if 11, ℓm\ell_m, ℓn\ell_n, ℓmℓn\ell_m\ell_n are linearly dependent over Q\mathbb{Q}, and take classes of pairs modulo (m,n)∼(n,m)∼(−m−1,−n−1)(m,n) \sim(n,m) \sim(-m-1,-n-1). Then:

  1. at most one exceptional class has a representative with ∣m/n−1∣<5⋅10−5\lvert m/n-1\rvert< 5 \cdot10^{-5};

  2. at most two exceptional classes have a representative with ∣m/n−1∣<10−4\lvert m/n-1\rvert< 10^{-4};

  3. every exceptional class has ∣m/n−1∣≥3⋅10−6\lvert m/n-1\rvert\ge3 \cdot10^{-6} in all its representatives (Theorem 3);

  4. in the ranges of (i) and (ii), every exceptional class has ∣m−n∣≥2\lvert m-n\rvert\ge2, by Hata’s theorem [3 Cor. 6.3].

References

  1. [1]Frank Calegari, Vesselın Dimitrov, and Yunqing Tang, The linear independence of 1, ζ(2), and L(2, χ−3), Preprint, arXiv:2408.15403v2 [math.NT], 2024, Version 2, 16 September 2024.arxiv.org/abs/2408.15403
  2. [2]J. Hadamard, Théorème sur les séries entières, Acta Math. 22 (1899), 55–63.DOI
  3. [3]Masayoshi Hata, The irrationality of log(1 + 1/q) log(1 − 1/q), Trans. Amer. Math. Soc. 350 (1998), no. 6, 2311–2327.DOI
  4. [4]Fredrik Johansson, Arb: efficient arbitrary-precision midpoint-radius interval arithmetic, IEEE Trans. Comput. 66 (2017), no. 8, 1281–1292, doi:10.1109/TC.2017.2690633.DOI
  5. [5]Y. Li, D. Sauzin, and S. Sun, Hadamard product and resurgence theory, Preprint, arXiv:2012.14175v1 [math.CV], 2020.arxiv.org/abs/2012.14175
  6. [6]V. G. Lysov, On Diophantine approximants for the product of logarithms, Keldysh Institute Preprints, no. 158, 20 pp., 2018, In Russian. doi:10.20948/prepr-2018-158.DOI
  7. [7]Vladimir Lysov, On the irrationality and the measure of irrationality of log(1 + 1/m) log(1 − 1/m), Talk abstract, OPSFA 2019 (International Symposium on Orthogonal Polynomials, Special Functions and Applications), 25 July 2019, 2019.
  8. [8]The FLINT team, FLINT: Fast Library for Number Theory, 2026, Version 3.6.0, https://flintlib.org.
  9. [9]The python-flint developers, python-flint: Python bindings for FLINT, 2026, Version 0.9.0, https://github.com/flintlib/python-flint.
  10. [10]Doron Zeilberger and W adim Zudilin, Automatic discovery of irrationality proofs and irrationality measures, Preprint, arXiv:1912.10381v1, 2019, published in Int. J. Number Theory 17 (2021), no. 3, 815–825, doi:10.1142/S1793042120400230; page references are to the arXiv version.DOI

Paper details

vlnc:W_eehda8qt
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 9

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Anthropic Claude Opus 5.5

View statement
Looking for related papers…
Contents