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 𝐹(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
𝑐𝑘=(𝑘+1)2(𝑘+2)2,𝑑𝑘=(𝑘+1)(𝑘+2)2,𝑅(𝑤)=∑𝑘≥0𝑐𝑘𝑤𝑘=1+2𝑤(1−𝑤)4.
For 0 <𝑞 ≤2/3 define, with a single fixed
cut-off 32,
𝑎𝑘(𝑞)={𝑐𝑘(1−𝑞)32,1≤𝑘<32,𝑐𝑘−12𝑞𝑑𝑘,𝑘≥32,𝑎0(𝑞)=1−∑𝑘≥1𝑎𝑘(𝑞)𝑞𝑘.(25)
The weight generating function 𝐴𝑞(𝑤) =∑𝑘≥0𝑎𝑘(𝑞)𝑤𝑘 is rational
in 𝑤. The value 𝐺𝑞(𝑞) concerns a different generating
function, formed from the moments below. To obtain 𝐴𝑞, put
𝑇𝑞(𝑤)=𝑅(𝑤)−12𝑞(1−𝑤)3−31∑𝑘=0(𝑐𝑘−12𝑞𝑑𝑘)𝑤𝑘,
so that 𝐴𝑞(𝑤) equals
𝑎0(𝑞)+(1−𝑞)3231∑𝑘=1𝑐𝑘𝑤𝑘+𝑇𝑞(𝑤),𝑎0(𝑞)=1−(1−𝑞)3231∑𝑘=1𝑐𝑘𝑞𝑘−𝑇𝑞(𝑞).
Set 𝜇𝑚(𝑞) =𝐴𝑞(𝑞𝑚+1), 𝜈𝑚(𝑞) =𝜇𝑚(𝑞) −𝑞𝜇𝑚+1(𝑞), and
𝐺𝑞(𝑧) =∑𝑚≥0𝜈𝑚(𝑞)𝑧𝑚. The
choice of 𝑎0 makes 𝜇0 =1, while the factor 𝑞 in 𝜈𝑚 makes the sum defining 𝐺𝑞(𝑞) telescope. Independently, for
𝑘 ≥32 the tail satisfies 𝑎𝑘/𝑐𝑘 =1 −12𝑞/(𝑘 +1); at 𝑞 =2/3 this becomes 1 −8/(𝑘 +1), which produces the required
power 𝑁−8 in the product of the
weights. The proof below checks positivity, convergence and both
determinant claims.
This countermodel and its denominator calculation have ordinary
proofs below; they have not been Lean-checked or externally peer
reviewed.
Proof. For 𝑘 ≥32 we
have 𝑎𝑘(𝑞) =𝑑𝑘(𝑘 +1 −12𝑞) >0, and
the smaller-index weights are plainly positive. Write 𝑀(𝑞) =(1 −𝑞)32∑31𝑘=1𝑐𝑘𝑞𝑘. The
generating function for the 𝑐𝑘
gives 𝑅(𝑞) −1 ≤6𝑞(1 −𝑞)−4, whence
𝑀(𝑞) ≤6𝑞(1 −𝑞)28 ≤6/29 <1/4.
For 𝑘 ≥32,
𝑑𝑑𝑞(𝑑𝑘(𝑘+1−12𝑞)𝑞𝑘)=𝑑𝑘(𝑘+1)𝑞𝑘−1(𝑘−12𝑞)>0.
Direct substitution into the
rational expression for 𝑇𝑞 gives
𝑇2/3(2/3)=24794846199808205891132094649<14.
Therefore 1/2 <𝑎0(𝑞) =1 −𝑀(𝑞) −𝑇𝑞(𝑞) <1.
The moments have positive atomic representations
𝜇𝑚=∑𝑘≥0𝑎𝑘𝑞𝑘(𝑞𝑘)𝑚,𝜈𝑚=∑𝑘≥0𝑎𝑘𝑞𝑘(1−𝑞𝑘+1)(𝑞𝑘)𝑚.
Infinitely many
distinct atoms have positive mass. The Gram quadratic form of a nonzero
polynomial of degree below 𝑁 is
strictly positive for either measure, proving positive definiteness of
every 𝑁-by-𝑁 Hankel matrix. Summing the geometric
series in 𝑚 gives
𝐺𝑞(𝑧)=∑𝑘≥0𝑎𝑘𝑞𝑘(1−𝑞𝑘+1)1−𝑧𝑞𝑘.
Each 𝑧 =𝑞−𝑘 is a genuine pole:
its residue is nonzero and the other terms are analytic there. Hence
𝐺𝑞 is not rational. Telescoping
shows 𝐺𝑞(𝑞) =𝜇0(𝑞) =𝐴𝑞(𝑞) =1 and,
for 𝑆𝑛−1 =∑𝑚<𝑛𝑞𝑚𝜈𝑚,
gives
1−𝑆𝑛−1=𝑞𝑛𝜇𝑛∈(0,𝑞𝑛](𝑛≥0).
Every 𝑎𝑘(𝑞) belongs to ℤ[[𝑞]] and has constant term 𝑐𝑘, including 𝑎0, for which the defining sum is
coefficientwise finite. The moments 𝜇𝑚 and 𝜈𝑚 also lie in ℤ[[𝑞]], but their constant terms are
1: only 𝑎0 contributes at 𝑞 =0. Their rational expressions have no
poles for |𝑞| <1, so these formal
series converge at 𝑞0. For 𝐻𝑁(𝑞) =det(𝜇𝑖+𝑗(𝑞))𝑖,𝑗<𝑁, the
Gram determinant expansion is
𝐻𝑁(𝑞)=∑0≤𝑘0<⋯<𝑘𝑁−1(∏𝑖<𝑁𝑎𝑘𝑖(𝑞)𝑞𝑘𝑖)∏𝑖<𝑗(𝑞𝑘𝑖−𝑞𝑘𝑗)2.
It holds first for
finitely many atoms and then coefficientwise. The lowest possible degree
of one summand is ∑𝑖<𝑁(2𝑁 −1 −2𝑖)𝑘𝑖. Its unique
minimum is attained at 𝑘𝑖 =𝑖 and
equals 𝐵𝑁; the coefficient is
∏𝑖<𝑁𝑐𝑖 =𝐶𝑁. Replacing
𝑎𝑘 by 𝑎𝑘(1 −𝑞𝑘+1) proves the same leading
term for (𝜈𝑚).
At 𝑞0 set 𝜀 =3−32 and 𝑏0 =𝑎0(𝑞0) >0. For 𝑘 ≥32, 𝑎𝑘(𝑞0)/𝑐𝑘 =(𝑘 −7)/(𝑘 +1); all these
ratios lie in [𝜀,1].
Hence for fixed ℎ, 𝑎𝑘+ℎ/𝑎𝑘 →1 as 𝑘 →∞, and uniformly 𝑎𝑘+ℎ/𝑎𝑘 ≤332(1 +ℎ)3. These are
precisely the weight hypotheses of Theorem 3.6,
whose conclusion is
𝐻𝑁(𝑞0)∼M(𝑞0)3𝑞𝐵𝑁0𝑃(𝑞0)2𝑁∏𝑘<𝑁𝑎𝑘(𝑞0).
The finite product
has the exact form, for 𝑁 ≥32,
∏𝑘<𝑁𝑎𝑘(𝑞0)𝐶𝑁=𝑏0𝜀3132!24!(𝑁−8)!𝑁!.
Thus
A =𝑏0𝜀3132!/24!, and 𝑁8(𝑁 −8)!/𝑁! →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.
Proof. At 𝑞0, split
the rational seed into a pole part and a polynomial:
𝐴𝑞0(𝑤)=−7+10𝑤(1−𝑤)4+𝑄(𝑤),𝑄(𝑤)=𝑝0+31∑𝑘=1𝑝𝑘𝑤𝑘,
where 𝑝0 =𝑏0 +7 and 𝑝𝑘 =(3−32 −1)𝑐𝑘 +8𝑑𝑘. These
coefficients have only powers of three in their denominators. The finite
formulas give 𝑣3(𝑝0) ≥ −63, 𝑣3(𝑝𝑘) ≥ −32 for 1 ≤𝑘 ≤30, and 𝑣3(𝑝31) = −31: in the last calculation
𝑐31 =16896 has 𝑣3(𝑐31) =1 and the other numerator
terms are multiples of 332. At
𝑤 =(2/3)𝑛+1, 𝑛 ≥1, the term 𝑝31𝑤31 has valuation −31𝑛 −62, uniquely lower than all other
terms of 𝑄(𝑤). The pole part equals
33𝑛+3(−7⋅3𝑛+1+10⋅2𝑛+1)𝛿4𝑛
and has positive 3-adic valuation.
Hence 𝑣3(𝜇𝑛) = −31𝑛 −62.
Every prime ℓ ∣𝛿𝑛
differs from 2,3. Its numerator in
the displayed pole part is congruent to 3 ⋅2𝑛+1(mod𝛿𝑛) and is
coprime to 𝛿𝑛. The polynomial
part is ℓ-integral, so it cannot
cancel the pole part’s ℓ-denominator of order 4𝑣ℓ(𝛿𝑛). There are no other
denominator primes. Multiplying by 𝑞𝑛0 =2𝑛/3𝑛 adds exactly 𝑛 factors of three, proving the second
formula. In the affine error, 𝑞−𝑛0 =3𝑛/2𝑛 has denominator 2𝑛, coprime to the odd denominator of
𝜇𝑛. Subtraction does not reduce
either negative valuation, proving the stated least common
denominator. ◻
Each individual 𝜇𝑛 has
logarithmic height linear in 𝑛:
logden𝜇𝑛 =(35𝑛 +66)log3 +𝑜(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.
Proof. The positive Heine expansion above gives a bound
independent of the asymptotic theorem. Since 0 <𝑎𝑘(𝑞0) ≤𝑐𝑘, write 𝑘𝑖 =𝑖 +𝑠𝑖. Dropping the ordering
restriction and bounding 𝑐𝑖+𝑠𝑖/𝑐𝑖 ≤(1 +𝑠𝑖)3 and each
residual Vandermonde factor by one gives
0<𝐻𝑁(𝑞0)≤𝐶𝑁𝑞𝐵𝑁0∏𝑗≥0∑𝑠≥0(𝑠+1)3𝑞(2𝑗+1)𝑠0.
For 𝐴(𝑡) =∑𝑠≥0(𝑠 +1)3𝑡𝑠 =(1 +4𝑡 +𝑡2)/(1 −𝑡)4,
log𝐴(𝑡) ≤𝐴(𝑡) −1 ≤8𝑡/(1 −𝑡)4.
The product is therefore at most exp(3888/5). Since 𝐷𝑁𝐻𝑁 is a positive integer,
log𝐷𝑁≥𝐵𝑁log(3/2)−log𝐶𝑁−3888/5.
Here 𝐵𝑁 ∼𝑁3/3 and log𝐶𝑁 =𝑂(𝑁log𝑁). Conversely,
𝐸𝑁=331𝑁(𝑁−1)+62𝑁∏0≤𝑖,𝑗<𝑁𝛿4𝑖+𝑗
clears every term in the determinant
expansion, by the preceding denominator formula. Thus 𝐷𝑁 ∣𝐸𝑁; using log𝛿𝑚 ≤(𝑚 +1)log3 and ∑𝑖,𝑗<𝑁(𝑖 +𝑗 +1) =𝑁3 gives the
asserted cubic upper bound.
For the assertion about 𝐻2,
den𝜇1 =39354
and den𝜇2 =3124194. At
five, 𝑣5(𝜇2) =0 and 𝑣5(𝜇21) = −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 𝐻2 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 𝛼𝑚 =𝑞−𝑚0 and 𝛽𝑚 =𝛼𝑚 −𝜇𝑚(𝑞0), the pencil
det(𝛼𝑖+𝑗𝑋 −𝛽𝑖+𝑗)𝑖,𝑗<𝑁
is affine in 𝑋 because (𝛼𝑖+𝑗) has rank one. At 𝑋 =1 it is the positive rational 𝐻𝑁(𝑞0); 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 𝑎𝑘𝑞𝑘 ↦𝑎𝑘𝑞𝑘(1 −𝑞𝑘+1) is
standard moment machinery, not a new transform [31]; this example’s claim is the
explicit combination and its arithmetic obstruction.