Matching works

1 work

math.NT — Number Theory

Products of two logarithms and arithmetic holonomy bounds

Contributed by Shawn Krisman

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.

Primarily AI-generated textHuman understanding: no partsHermite–Padé approximationarithmetic holonomy boundscomputer-assisted proofinterval arithmeticirrationalitylinear independencemonodromyproducts of logarithms
Nov 20, 202627 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations