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

Complements and further questions

An unrestricted construction of small nonzero integer forms is another formulation of irrationality, not yet a method of proving it. The next problem remains equivalent to irrationality at 3/2 even with its quadratic degree bounds, and even after imposing the exponential coefficient-height bound discussed below. We prove the equivalence before asking what a specified approximation family can supply.

Problem 10.1 (a divided linear form with small nonzero remainder). Exhibit an integer constant C≥1 and, for every sufficiently large positive integer n, positive integers Wn,Rn,Sn,Mn such that

n2≤Wn,Rn,Sn≤Cn2,4Rn+2Sn≤Mn≤Cn2,

together with polynomial pairs (Un,j,Vn,j)∈Z[X]2 for 0≤j<Mn, each of degree at most the common degree bound Wn, whose specialised integer rows are primitive:

gcd(HWn(Un,j),HWn(Vn,j))=1.

Find a nonzero vector λ(n)∈{−1,0,1}Mn for which, on putting

Un=∑j<Mnλj(n)Un,j,Vn=∑j<Mnλj(n)Vn,j,

the pair (Un,Vn) is not (0,0), all four residues vanish,

J3,Rn(Un)=J3,Rn(Vn)=0,J2,Sn(Un)=J2,Sn(Vn)=0,

where every residue in this display is formed using the common degree bound Wn, and the resulting divided integer linear form

An=HWn(Un)3Rn2Sn,Bn=HWn(Vn)3Rn2Sn,ρn=AnF(3/2)−Bn

satisfies the explicit analytic condition

0<|ρn|<1n.

The residue equations make An,Bn integers. A solution would prove irrationality: if F(3/2)=a/b in lowest terms, every nonzero ρn has absolute value at least 1/b, contradicting the displayed bound for n>b. Theorem 5.8 supplies only a nonzero signed relation with the four residue equations once the pairs and size inequality are present; it does not supply primitive input rows, a nonzero combined polynomial pair, or the nonvanishing and decay of ρn.

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.