Plectis

Long paper

Geometric Moments and Rational Lambert Values: Proofs and Further Results

Summary. The record proves the fixed-base Hankel asymptotic for Zudilin's normalised moments and the rational-base irrationality criterion log b/log a<0.4056830213840605…. The determinant proof separates geometric node configurations from positive weights; the irrationality proof instead specialises Zudilin's 2004 polynomial forms after cancellation. Coefficient moments, evaluated lattices and congruence conditions distinguish integer divisibility from nonzero remainder decay. A broader ratio-limit argument and a rational-value model remain unformalised. None of these arguments settles F(3/2).

This paper covers the sharp fixed-base Hankel asymptotic and rational-base irrationality proofs, coefficient moments and arithmetic obstructions, with ordinary ratio-limit and rational-value models distinguished from checked results.

It does not establish the validity of claims tagged Lean, which belongs to the cited kernel-checked source, or a solution to Erdős #1049, which remains open.

In this paper
A certified finite parameter search.

The parameter ratios (14,12,14;27) are Zudilin’s [8]. They maximise C0/C1 in the following finite box: positive integer parameters (α0,α1,α2;β) with every entry at most 30, greatest common divisor 1, and

α1≤α2,α1+α2<β≤α0+α2.

These are the source’s parameter inequalities [8], with a bound imposed for enumeration. The definitions of C0,C1 and their floor function are reproduced in Section 10. There are exactly 37,533 tuples. Exactly two attain the maximum: (14,12,14;27) and (15,12,13;26). Both give θ∗, although they are distinct primitive directions.

The enumeration and comparisons are certified by rational intervals. The fractions j/c with 1≤c≤30 partition [0,1) into 278 half-open intervals. Every floor function occurring in the search is constant on each interval, and the first interval contributes zero. On each remaining interval [u,v), the integral is a sum of positive differences (k+u)−2−(k+v)−2, weighted by 0 or 1. With M=256, the tail lies between

(M+u)−1−(M+v)−1and(M+u)−1−(M+v)−1+(M+u)−2−(M+v)−2.

This follows by comparing the positive decreasing summand with its integral. Outward rounding of rational numbers and Machin’s bounds for π give, for each of the two maximisers,

0.40568302137302<C0/C1<0.40568302139506.

Every other tuple has C0/C1<0.40563943278333. The intervals therefore separate these two candidates from all other tuples, without relying on floating-point ordering.

Their exact equality is not inferred from overlapping intervals. Write ωA,ωB for their step functions in the order just listed, and let JA,JB be their integrals against d(−ψ1) on [0,1]. The floor formulas give

ωB(u)−ωA(u)=⌊13u⌋+⌊15u⌋−2⌊14u⌋.

For every positive integer c, telescoping the c intervals and splitting the defining trigamma series into residue classes gives

∫01⌊cu⌋d(−ψ1(u))=∑j=1c−1ψ1(j/c)−(c−1)ψ1(1)=c(c−1)π26.

Hence JB−JA=π2/3. Both directions have m=15 and C1=1091/2, while the quadratic part of C0 before the 3/π2 correction is 266 for A and 265 for B. Its decrease by 1 exactly cancels the increase 3(JB−JA)/π2=1. Thus C0 also agrees.

A calculation compares every tuple of the box with interval bounds, and a second implementation repeats it with 512 summands before the tail and a different enumeration order; both are in one program, with its recorded result. The calculation proves optimality only in the displayed finite box. No bound on a direction outside that box follows, and this calculation is not needed for the irrationality theorem.

The two-coordinate forms in 1 and F(p) should be distinguished from simultaneous approximation to two target values. Postelmans and Van Assche prove the Q-linear independence of 1,ζq(1),ζq(2) for q=1/p with integer p≥2 [30]. Their confluent multiple little q-Jacobi construction has two orthogonality conditions; its common integer normalisation and nonvanishing argument are in Section 6, especially (6.1)–(6.4). That theorem treats two target values and retains the integer inverse-base restriction. It supplies neither the coefficient pairs nor the all-base estimates assumed in Theorem 2.5; it is not an application at 3/2.

About this paper

Authorship and AI use. Will Cook built and directed the research infrastructure and maintains the public release. He reviewed claims when he could. AI agents did most of the research and drafting. Cook did not independently verify every claim.

Cite and contact. Cite this paper by its title, author and date above, with its PDF; cite the earlier sources it uses for a mathematical result. For software, use the release citation and give the commit used. Contact Will with questions or corrections.

Prefer the manuscript?

Equations typeset from the exact TeX. Rendered from the LaTeX manuscript source with file fingerprint sha256:1f04580702ed8f8c. Its file fingerprint matched the published source record, so the PDF above, the LaTeX, and this page are one manuscript. Redeploying the site regenerates this page from whatever the public repository holds at that moment.