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 separate positive-measure estimate.

We seek positive moment weights comparable to (k+1)2(k+2)/2, with constants depending only on q. In the determinant expansion these constants give factors exponential in N, so they do not change its cubic exponent of q. For fixed 0<q<1 write P=(q;q)∞, Q=(q;q)∞, T=(−1;q)∞2, and

Gq(w)=1(w;q)∞3∑t≥0wt(q;q)t(qtw2;q)∞(qtw;q)∞2,γk=[wk]Gq(w),ck=(k+1)2(k+2)2.

The choice w=qm+1 collects all dependence on the moment index. Indeed, the three finite products in the tth remainder summand become

(q;q)m=P(w;q)∞,(qt+1;q)m=P(q;q)t(qtw;q)∞,(qm+t+1;q)m+1=(qtw;q)∞(qtw2;q)∞.

Their substitution gives vm∗=P4Gq(qm+1) term by term. For fixed q and 0<r<1, the tth summand on |w|≤r satisfies

|wt(qtw2;q)∞(q;q)t(w;q)∞3(qtw;q)∞2|≤(−r2;q)∞P(r;q)∞5rt.

Indeed, (q;q)t≥P, each denominator product in w has modulus at least (r;q)∞>0, and the numerator product has modulus at most (−r2;q)∞. The bound is independent of t, so the sum converges uniformly and absolutely on each such disk. The individual products converge there as well, since their tails are bounded by geometric series in q. Thus Gq is holomorphic for |w|<1, and its Taylor series may be evaluated at w=qm+1 to obtain the moment expansion. For formal series, the corresponding substitution is justified coefficient by coefficient, as in the short paper. The q-binomial theorem [28]

(Aw;q)∞(w;q)∞=∑j≥0(A;q)j(q;q)jwj(0≤A≤1)

follows by comparing coefficients in (1−w)R(w)=(1−Aw)R(qw) with R(0)=1; the series converges for |w|<1 since its coefficients are at most P−1. They are nonnegative, and at least (A;q)∞ if A<1. For A=1 the series equals 1. Factor the numerator of the tth term using

(qtw2;q)∞=(qt/2w;q)∞(−qt/2w;q)∞(q(t+1)/2w;q)∞(−q(t+1)/2w;q)∞.

After pairing each positive-argument factor with one denominator, the tth summand of Gq becomes

wt(q;q)t(qt/2w;q)∞(w;q)∞(q(t+1)/2w;q)∞(w;q)∞×(−qt/2w;q)∞(−q(t+1)/2w;q)∞(w;q)∞(qtw;q)∞2.

The q-binomial identity makes the two ratios nonnegative coefficientwise; the remaining product also has nonnegative coefficients. When t=0, the first ratio is 1 and every coefficient of the second is at least Q. The last fraction has coefficients at least those of (1−w)−3. Thus the t=0 term alone bounds γk below by Q(k+33).

For the upper bound, if R has nonnegative coefficients and R(1)≤C<∞, convolution with a nondecreasing sequence dk is bounded by Cdk. At t=0, bound the second ratio coefficientwise by P−1(1−w)−1. After extracting (1−w)−3 from the last fraction, its remaining factor has value at w=1 at most TP−3. This gives TP−4(k+33). For t≥1, both ratios are bounded by P−1(1−w)−1. Extracting the one factor (1−w)−1 from the last fraction leaves a factor with value at 1 at most TP−3; also (q;q)t−1≤P−1. The tth summand is therefore bounded coefficientwise by TP−6wt(1−w)−3. Summing t≥1 gives TP−6(k+23) as the bound for its kth coefficient. Consequently

Q3ck≤γk≤T(P−4+P−6)ck.

Thus ∑k≥0P4γkqkδqk is a finite positive measure on [0,1], with infinitely many distinct support points and moments vm∗(q). In standard terminology, (vm∗(q))m≥0 is a Hausdorff moment sequence. This statement fixes q; the measure is not a representing measure for the coefficient sequence sm(p) considered in the next subsection. A nonzero polynomial of degree less than N cannot vanish at all of its first N atoms; the associated Gram matrix is positive definite. Truncate the measure to its first K+1 atoms. At fixed rank N, each matrix entry converges as K→∞, and the determinant converges because it is a polynomial in those entries. Finite Cauchy–Binet and monotone convergence of the nonnegative tuple sums therefore give Heine’s expansion, whose integral form is reproved in [10]:

VN∗=∑k0<⋯<kN−1∏i(P4γkiqki)∏i<j(qki−qkj)2.

Retaining the tuple ki=i and using ∏d=1N−1(1−qd)2(N−d)≥P2N gives the lower bound below. For the upper bound put ki=i+λi, where the λi are nonnegative and nondecreasing. Factoring the smaller power from each Vandermonde difference gives the exact exponent

∑iki+2∑i<jki=BN+∑i=0N−1(2N−1−2i)λi.

Every weight 2N−1−2i is at least 1. Since 0<q<1, the remaining power of q is at most q∑iλi. Also ci+λ/ci≤(λ+1)3. Discard the remaining Vandermonde factors, each bounded by 1, and enlarge the nonnegative sum by dropping the ordering restriction on the λi. It now factors into N copies of ∑λ≥0(λ+1)3qλ, which gives

(P6Q/3)NCNqBN≤VN∗(q)≤[P4T(P−4+P−6)1+4q+q2(1−q)4]NCNqBN.

Both constants are positive and finite, so VN∗(q)>0 and log⁡(VN∗(q)/(CNqBN))=Oq(N), including N=0 under the empty determinant convention. Here N→∞ with q fixed; the constants are not uniform as q↑1. The formal-order calculation instead fixes N and expands at q=0. No joint uniform limit is asserted. The measure depends on q, not on the moment index or rank: one measure represents the whole sequence at that base. This is an analytic representation, not a denominator factor for the 2004 polynomial forms. Section 3.2 replaces the band Oq(N) by an exact asymptotic with an explicit positive constant, using the same weights.

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.