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
Where the earlier criterion stops.

Both regions are cut out by the same quantity. The published cutoff 1/2−1/π2 of [6] is the reciprocal of μBV=2π2/(π2−2), the constant Van Assche later recovered as an integer-base irrationality-exponent bound for F(p) [18], and the cutoff θ∗ of Theorem 2.2 is the reciprocal of the smaller integer-base bound μ=C1/C0 printed at [8]. For Zudilin’s family this reciprocal relation uses both the exact degree limit d=C1−C0 and the stronger evaluation bound |Un(p)|≤pWnexp⁡(Op(n)) proved in Corollary 2.4, together with decay exponent σ=C0. A general exponential coefficient-height bound would contribute an additional term to the integer-base exponent estimate; it cannot simply be discarded. The discussion following Theorem 2.5 makes that distinction explicit. The rational-base proof clears the denominators of the already cancelled polynomials. It does not infer value irrationality merely by taking the reciprocal of a published exponent bound. The bases gained are exactly the strip sμ<r≤sμBV, which is empty for s=2 and s=3 and is first occupied at s=4 by the single coprime numerator 31. The integer comparisons and rational bracket in Section 2.5 establish membership in the region. The irrationality conclusion in Theorem 2.3 also uses the constructed forms and their proved analytic estimates. This application does not improve either inherited integer-base exponent bound.

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.