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

Positive Hankel determinants and a rational special value

We construct a generating function with the rational special value 1, although its moment determinants have the same formal orders, leading coefficients and type of fixed-base power correction as Zudilin’s. This shows why those determinant properties alone do not establish irrationality. The construction uses neither Zudilin’s recurrence nor his polynomial factorisation or cyclotomic divisors, and gives no conclusion about F(3/2). The arguments below have ordinary proofs only and are stated as unformalised remarks.

We choose the tail of the weight sequence to obtain the determinant asymptotic, and its first terms to fix the special value. A telescoping difference of the moments will then give the value 1. The cut-off below separates these two choices while leaving room to keep every weight positive.

Put

ck=(k+1)2(k+2)2,dk=(k+1)(k+2)2,R(w)=∑k≥0ckwk=1+2w(1−w)4.

For 0<q≤2/3 define, with a single fixed cut-off 32,

(25)ak(q)={ck(1−q)32,1≤k<32,ck−12qdk,k≥32,a0(q)=1−∑k≥1ak(q)qk.

The weight generating function Aq(w)=∑k≥0ak(q)wk is rational in w. The value Gq(q) concerns a different generating function, formed from the moments below. To obtain Aq, put

Tq(w)=R(w)−12q(1−w)3−∑k=031(ck−12qdk)wk,

so that Aq(w) equals

a0(q)+(1−q)32∑k=131ckwk+Tq(w),a0(q)=1−(1−q)32∑k=131ckqk−Tq(q).

Set μm(q)=Aq(qm+1), νm(q)=μm(q)−qμm+1(q), and Gq(z)=∑m≥0νm(q)zm. The choice of a0 makes μ0=1, while the factor q in νm makes the sum defining Gq(q) telescope. Independently, for k≥32 the tail satisfies ak/ck=1−12q/(k+1); at q=2/3 this becomes 1−8/(k+1), which produces the required power N−8 in the product of the weights. The proof below checks positivity, convergence and both determinant claims.

Remark (a rational special value). All the weights in (25) are positive for 0<q≤2/3. The two moment sequences (μm) and (νm) have positive Hankel determinants of every size, Gq is not a rational function, and Gq(q)=1. Their formal Hankel determinants both begin with

CNqBN,BN=∑j<Nj2,CN=(N!)2(N+1)!2N(N≥1).

At the fixed base q0=2/3, with P(q)=∏j≥1(1−qj) and M(q)=∏j≥1(1−qj)−j, there is an explicit A>0 such that

det(μi+j(q0))0≤i,j<N∼AM(q0)3CNq0BNP(q0)2NN−8ξ,ξ=Gq0(q0)=1.

This countermodel and its denominator calculation have ordinary proofs below; they have not been Lean-checked or externally peer reviewed.

Proof. For k≥32 we have ak(q)=dk(k+1−12q)>0, and the smaller-index weights are plainly positive. Write M(q)=(1−q)32∑k=131ckqk. The generating function for the ck gives R(q)−1≤6q(1−q)−4, whence M(q)≤6q(1−q)28≤6/29<1/4. For k≥32,

ddq(dk(k+1−12q)qk)=dk(k+1)qk−1(k−12q)>0.

Direct substitution into the rational expression for Tq gives

T2/3(2/3)=24794846199808205891132094649<14.

Therefore 1/2<a0(q)=1−M(q)−Tq(q)<1.

The moments have positive atomic representations

μm=∑k≥0akqk(qk)m,νm=∑k≥0akqk(1−qk+1)(qk)m.

Infinitely many distinct atoms have positive mass. The Gram quadratic form of a nonzero polynomial of degree below N is strictly positive for either measure, proving positive definiteness of every N-by-N Hankel matrix. Summing the geometric series in m gives

Gq(z)=∑k≥0akqk(1−qk+1)1−zqk.

Each z=q−k is a genuine pole: its residue is nonzero and the other terms are analytic there. Hence Gq is not rational. Telescoping shows Gq(q)=μ0(q)=Aq(q)=1 and, for Sn−1=∑m<nqmνm, gives

1−Sn−1=qnμn∈(0,qn](n≥0).

Every ak(q) belongs to Z[[q]] and has constant term ck, including a0, for which the defining sum is coefficientwise finite. The moments μm and νm also lie in Z[[q]], but their constant terms are 1: only a0 contributes at q=0. Their rational expressions have no poles for |q|<1, so these formal series converge at q0. For HN(q)=det(μi+j(q))i,j<N, the Gram determinant expansion is

HN(q)=∑0≤k0<⋯<kN−1(∏i<Naki(q)qki)∏i<j(qki−qkj)2.

It holds first for finitely many atoms and then coefficientwise. The lowest possible degree of one summand is ∑i<N(2N−1−2i)ki. Its unique minimum is attained at ki=i and equals BN; the coefficient is ∏i<Nci=CN. Replacing ak by ak(1−qk+1) proves the same leading term for (νm).

At q0 set ε=3−32 and b0=a0(q0)>0. For k≥32, ak(q0)/ck=(k−7)/(k+1); all these ratios lie in [ε,1]. Hence for fixed h, ak+h/ak→1 as k→∞, and uniformly ak+h/ak≤332(1+h)3. These are precisely the weight hypotheses of Theorem 3.6, whose conclusion is

HN(q0)∼M(q0)3q0BNP(q0)2N∏k<Nak(q0).

The finite product has the exact form, for N≥32,

∏k<Nak(q0)CN=b0ε3132!24!(N−8)!N!.

Thus A=b0ε3132!/24!, and N8(N−8)!/N!→1. The displayed exponent is exactly −8ξ because ξ=1; it is asserted at this one fixed base, not as a uniform special-value formula for this family. ◻

The following calculation is retained with its ordinary proof. It has no Lean proof in the supplied record.

Remark (exact denominators of the calibrated moments). Let q0=2/3 and δn=3n+1−2n+1. For every n≥1, the reduced denominators are

den⁡μn(q0)=331n+62δn4,den⁡(q0nμn(q0))=332n+62δn4.

The least integer clearing both rational coefficients in μn=q0−nξ−q0−nSn−1 is 2n331n+62δn4. At n=0 the moment and tail equal one.

Proof. At q0, split the rational seed into a pole part and a polynomial:

Aq0(w)=−7+10w(1−w)4+Q(w),Q(w)=p0+∑k=131pkwk,

where p0=b0+7 and pk=(3−32−1)ck+8dk. These coefficients have only powers of three in their denominators. The finite formulas give v3(p0)≥−63, v3(pk)≥−32 for 1≤k≤30, and v3(p31)=−31: in the last calculation c31=16896 has v3(c31)=1 and the other numerator terms are multiples of 332. At w=(2/3)n+1, n≥1, the term p31w31 has valuation −31n−62, uniquely lower than all other terms of Q(w). The pole part equals

33n+3(−7⋅3n+1+10⋅2n+1)δn4

and has positive 3-adic valuation. Hence v3(μn)=−31n−62.

Every prime ℓ∣δn differs from 2,3. Its numerator in the displayed pole part is congruent to 3⋅2n+1(modδn) and is coprime to δn. The polynomial part is ℓ-integral, so it cannot cancel the pole part’s ℓ-denominator of order 4vℓ(δn). There are no other denominator primes. Multiplying by q0n=2n/3n adds exactly n factors of three, proving the second formula. In the affine error, q0−n=3n/2n has denominator 2n, coprime to the odd denominator of μn. Subtraction does not reduce either negative valuation, proving the stated least common denominator. ◻

Each individual μn has logarithmic height linear in n: log⁡den⁡μn=(35n+66)log⁡3+o(1). The determinant has a different scale.

The following calculation is retained with its ordinary proof. It has no Lean proof in the supplied record.

Remark (determinant height and row denominators). For DN=den⁡HN(q0) in lowest terms,

lim infN→∞log⁡DNN3≥log⁡(3/2)3,log⁡DN=O(N3).

Already for N=2, multiplying H2=μ2−μ12 by den⁡μ1den⁡μ2 leaves reduced denominator 625.

Proof. The positive Heine expansion above gives a bound independent of the asymptotic theorem. Since 0<ak(q0)≤ck, write ki=i+si. Dropping the ordering restriction and bounding ci+si/ci≤(1+si)3 and each residual Vandermonde factor by one gives

0<HN(q0)≤CNq0BN∏j≥0∑s≥0(s+1)3q0(2j+1)s.

For A(t)=∑s≥0(s+1)3ts=(1+4t+t2)/(1−t)4, log⁡A(t)≤A(t)−1≤8t/(1−t)4. The product is therefore at most exp⁡(3888/5). Since DNHN is a positive integer,

log⁡DN≥BNlog⁡(3/2)−log⁡CN−3888/5.

Here BN∼N3/3 and log⁡CN=O(Nlog⁡N). Conversely,

EN=331N(N−1)+62N∏0≤i,j<Nδi+j4

clears every term in the determinant expansion, by the preceding denominator formula. Thus DN∣EN; using log⁡δm≤(m+1)log⁡3 and ∑i,j<N(i+j+1)=N3 gives the asserted cubic upper bound.

For the assertion about H2, den⁡μ1=39354 and den⁡μ2=3124194. At five, v5(μ2)=0 and v5(μ12)=−8, while the proposed product contributes only 54. At three and nineteen that product clears the denominator, and no other prime occurs. The remaining denominator is therefore 54=625. ◻

Zudilin’s determinantal criterion retains a divisibility condition on its successive clearing integers [11]; the calculation for H2 rules out replacing it with their numerical ordering, not the criterion itself. The usual integer-polynomial height criterion likewise needs a common coefficient denominator for the same polynomial being evaluated. The model’s exact partial errors alone cannot supply one cheaply. In fact, with αm=q0−m and βm=αm−μm(q0), the pencil det(αi+jX−βi+j)i,j<N is affine in X because (αi+j) has rank one. At X=1 it is the positive rational HN(q0); after primitive integral clearing its value is a positive integer. Matching Hankel order, positivity, fixed-base asymptotic and a small rational value thus leaves the rational-base denominator problem exactly where it was. The Christoffel-type reweighting akqk↦akqk(1−qk+1) is standard moment machinery, not a new transform [31]; this example’s claim is the explicit combination and its arithmetic obstruction.

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.