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
Finite certificates and an all-rank degree check.

Put DN,h(p)=det(si+j+h(p))0≤i,j<N, with D0,h=1. Exact polynomial calculations give strictly positive coefficients in t=p−1 for DN,h(1+t) when h=0,1 and 1≤N≤8. Thus sixteen determinant polynomials are positive for every real p≥1. Their degrees, in increasing rank, are

h=00105415634063010501624h=12269623647082213161976.

The calculation uses exact arithmetic in Z[p]. Starting from D0,h=1 and D1,h=sh, the Desnanot–Jacobi identity gives

DN,h=DN−1,hDN−1,h+2−DN−1,h+12DN−2,h+2(N≥2).

The degree argument below shows that each denominator is nonzero. The computation checks that every division has zero remainder, then substitutes p=1+t and tests every coefficient. All 8824 coefficients in the sixteen polynomials are strictly positive. A program computes the full lists. An independent checker evaluates each stored polynomial at more integer bases than its degree and compares the values with fraction-free determinants of the integer Hankel matrices, which identifies the stored list with DN,h(1+t) in Z[t]. As a separate check of the normalisation, direct integer determinants at p=1,2,3,5,11 agree with evaluations of all sixteen polynomials. Those evaluations are checks, not the proof of polynomial positivity. This is a finite computer-algebra calculation and gives no all-rank result.

For the eight unshifted determinants, positivity is also a Lean theorem, proved by a different certificate. Put T=22929. An explicit bound shows that every coefficient of DN,0(1+t), N≤8, has absolute value less than T/2. An integer polynomial with this property is determined by its value at t=T, and its coefficients are the base-T digits of that value whenever every digit is less than T/2. The Lean kernel computes the eight integers DN,0(1+T) exactly and checks this digit condition and that the lowest digit is nonzero. Every coefficient of DN,0(1+t) is therefore nonnegative and the constant term is positive, so DN,0(p)>0 for every real p≥1. This is the positivity used in Proposition 3.9. The strict positivity of every coefficient, and the shifted determinants DN,1, rest on the computation above. Neither the finite computation nor the Lean proof yields an all-rank coefficient-positivity theorem.

The degrees admit a separate all-rank proof. The Gaussian binomial [uv]p is monic of degree v(u−v). In the signed sum for Rm, the degree increases by 2m−k from the kth to the (k+1)st term. The unique maximal term is k=m, with positive leading coefficient. Hence Rm is monic of degree (3m2+m)/2, and sm is monic of degree 3m2−m. In the determinant, the only permutation-dependent part of the degree is 6∑iiσ(i); strict rearrangement makes the identity its unique maximum. Therefore

deg⁡DN,h=∑i=0N−1(3(2i+h)2−(2i+h)),lc⁡DN,h=1.

More generally the same argument works for a fixed minor with distinct increasing row and column indices. Each such minor is positive for all sufficiently large p, with a threshold that may depend on the minor. At p=1, both leading Hankel families are positive definite by the infinite-support product measure, so each fixed rank is also positive in some neighbourhood of 1. Neither argument provides a neighbourhood or large-base threshold uniform over every rank.

A Stieltjes moment representation requires positive semidefiniteness of both Hankel families at all ranks. The positive-definite formulation for nondegenerate sequences is stated in [33]; finite support requires allowing semidefinite matrices. The necessity of both conditions is visible from their quadratic forms: if a positive measure μ on [0,∞) satisfies sm=∫0∞xmdμ(x), and P(x)=∑i=0N−1cixi has real coefficients, then

∑i,j=0N−1cicjsi+j+h=∫0∞xhP(x)2dμ(x)≥0,h=0,1.

The shifted test records nonnegative support, not merely positivity of the measure. For example, the positive point mass at −1 has moments (−1)m. Its unshifted quadratic form is P(−1)2, whereas its shifted form is −P(−1)2. Thus a Hamburger moment sequence, which permits support anywhere on R, need not be a Stieltjes moment sequence. The two tests above do not assert a measure for the entire coefficient sequence considered here. Coefficientwise total positivity would be stronger than the sixteen certificates above. Positive production matrices and path constructions can supply such a mechanism in other families [38][39]; no such matrix for this moving-degree sequence has been established here.

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.