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

The cyclotomic limit

We prove the cyclotomic limits of Zudilin [8] by summing over reciprocal intervals, following [7]. The summatory totient estimate handles each finite set of intervals. A bound on the remaining small indices permits passage to their infinite union.

Write Σn=∑2≤l≤Nνn,lφ(l). The elementary summatory estimate is ∑l≤yφ(l)=3π−2y2+O(ylog⁡(2y)). Fix one half-open interval [u,v) of Lemma 2.1. The condition {n/l}∈[u,v) holds exactly on the blocks

nk+v<l≤nk+u,k=0,1,2,…,

so the summatory estimate gives, for each fixed k, n−2∑l in block kφ(l)→3π−2((k+u)−2−(k+v)−2). For L≥1, all blocks with k≥L lie below n/(L+u). For every y≥0,

∑l≤yφ(l)≤y2.

For y<1 the sum is empty; otherwise it is at most ⌊y⌋(⌊y⌋+1)/2≤y2. Hence the normalised contribution of the omitted blocks is at most (L+u)−2, uniformly in n. This is the bound needed to pass from finitely many blocks to all of them. Taking n→∞ first and then L→∞ justifies the infinite block sum, and summing the thirteen half-open intervals gives n−2Σn→3J/π2. With ∑l≤15nφ(l)=3π−2225n2+O(nlog⁡n), equation (8) yields

(10)Knn2→C1,Kn−Wnn2=Mn−∑l≤Nφ(l)+Σnn2→266−3π2(225−J)=C0,

and hence Wn/n2→C1−C0. These are the rational-base degree limits built on Zudilin’s cyclotomic limits [8].

For the real size estimate, fix x>1. The Möbius product formula and reindexing the divisors give

∑l≤N|log⁡Φl(x)−φ(l)log⁡x|≤∑d≤N⌊N/d⌋[−log⁡(1−x−d)]≤N∑d≥1−log⁡(1−x−d)d.

The bound −log⁡(1−x−d)≤x−d/(1−x−1) shows that the series on the right is finite for each fixed x>1. Since νn,l∈{0,1}, this proves the bound

(11)log⁡DN(x)Ωn(x)=(∑l≤Nφ(l)−Σn)log⁡x+Ox(N).

Here N=15n, so the error is Ox(n)=o(n2). The bracket equals Wn−Kn+Mn by (8). No uniform constant as x↓1 is asserted.

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.