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 limitation of the rectangular exponent model

We conclude the comparison of exponent models by bounding ΘHP, defined in Section 3. For ρ≥0 and σ≥1+ρ its denominator

(1+ρ)22+σ(1+ρ)+1+ρ22+σ

is positive. Put u=σ−1−ρ≥0. Multiplying the difference ΘHP(ρ,σ)−(1/2−1/π2) by 2π2 times this denominator gives exactly

−π2ρ2−π2ρu−2π2ρ−2ρ2−10ρu−4ρ−6u2−8u.

Every term is nonpositive. The original difference has the same sign, and it vanishes exactly when ρ=0 and σ=1 (exact expansion, nonpositivity, equality case). Equivalently, within that model the displayed threshold never exceeds the classical one-function margin, with equality only at the classical endpoint (bound, equality). This bounds only the displayed exponent model. Applying it to an approximation family would require the polynomial construction, integrality and asymptotic estimates connecting that family to ΘHP. The rational cutoff 81/200 discussed above satisfies

81200<log⁡2log⁡3.

For a sufficient criterion of the form log⁡b/log⁡a<T, including 3/2 requires T>log⁡2/log⁡3, not merely an improvement on 81/200. This numerical target applies to that form of criterion, not to every irrationality argument.

A concrete optimisation question is available within the 2004 construction itself. Write a source parameter direction as α=(α0,α1,α2;β), with positive integer entries satisfying

α1≤α2,α1+α2<β≤α0+α2,gcd(α0,α1,α2,β)=1.

The source parameters are aj=αjn+1 and b=βn+2; here b is not a rational-base denominator. The gcd condition is a normalisation of the parameter direction, not a primitivity assertion about evaluated rows. Its invariance under dilation is checked below. For these directions set

c00=α0+α1+α2−β,c01=α0,c11=α1,c21=α2,c12=β−α1,c22=β−α2,m=max(c00,c01,c11,c21,c12,c22),

and define the periodic step function

ωα(u)=max{0,⌊c21u⌋+⌊c22u⌋−⌊c11u⌋−⌊c12u⌋,⌊c01u⌋+⌊c21u⌋−⌊c00u⌋−⌊c12u⌋}.

Zudilin’s constants in (25) and (26), already used in the finite direction scan, are

C1(α)=(α0+α1+α2)β−α12+α22+β22,C0(α)=α122+α0α1+(β−α2)(α2−α1)−3π2(m2−∫01ωα(u)d(−ψ1(u))).

Here ψ1 is the trigamma function used earlier. The step function is bounded, nonnegative, periodic with period 1, and zero near zero, so the integral is finite.

The gcd normalisation does not change the ratio being optimised. Indeed, periodicity and −ψ1′(u)=2∑j≥0(u+j)−3 give, by Tonelli’s theorem,

∫01ωα(u)d(−ψ1(u))=∫0∞2ωα(u)u3du.

For any positive integer k, the floor formulas give ωkα(u)=ωα(ku). Substitution in the last integral therefore multiplies it by k2. All other terms in C0 and C1 are quadratic in the direction, including m2. Hence Ci(kα)=k2Ci(α) for i=0,1, so passing to a primitive direction preserves both positivity and C0/C1. Let A be exactly the displayed primitive directions with C0(α)>0 and C1(α)>0.

Problem 10.6 (optimising the published parameter directions). Determine

supα∈AC0(α)C1(α),

or improve its bounds. In particular, does an admissible direction give a ratio strictly greater than the value θ∗ in Theorem 2.2, attained at (14,12,14;27)? A finite numerical scan does not establish optimality over A.

The immediate bounds are θ∗≤supAC0/C1≤1/2. Indeed, at any integer base p≥2 the source gives μirr(F(p))≤C1(α)/C0(α), whereas pigeonhole approximation gives μirr(F(p))≥2. Thus even the optimal reciprocal criterion in this class cannot exceed 1/2, which is below log⁡2/log⁡3. Optimising these directions cannot include 3/2 by that criterion. For other noninteger bases, a new direction would still require the polynomial degree and coefficient-height estimates used in the rational-base transfer; the integer-base source alone does not supply that application. The unrestricted question of which rational bases give irrational values is not settled here and is not reduced to any one of these problems.

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.