Hankel determinants and the length of finite Pierce expansions

Get email updates

Jason Davies

For integers 0<b<a0 < b < a, repeatedly replace b by the remainder of a divided by b until the value is zero. The number of positive terms is at most CεC\varepsilon a(β+ε)a^{(\beta +\varepsilon )} for every ε>0\varepsilon > 0, uniformly in b, where β=(41301−382849)/137480\beta = (41301-3\sqrt{82849})/137480, approximately 0.294134.

What was already known

Chase and Pandey’s earlier exponent was 1/3−2/177. Davies also notes Shallit’s unpublished 3/10 bound.

AI involvement AI-led

Davies initiated and directed the work. GPT-6-Astra found the mathematical results and key proof steps. Astra and Claude Opus 5.5 produced and revised the Lean development and manuscript.

Importance Notable

The uniform exponent improves the cited polynomial upper bounds for the length of the iteration.

Technical verification Formal (Lean)

The pinned manifest reports a Lean build and axiom audit, Lean Comparator checks of the selected statements with NanoDa and con-ron, and exact recomputation of supporting algebraic identities.

Formal checking

The pinned manifest reports a Lean build and axiom audit, Lean Comparator checks of the selected statements with NanoDa and con-ron, and exact recomputation of supporting algebraic identities.

Checker
Jason Davies, reporting Lean 4 verification
Scope
The pinned manifest reports a Lean build and axiom audit, Lean Comparator checks of the selected statements with NanoDa and con-ron, and exact recomputation of supporting algebraic identities.
Basis
Reported by the linked checker

Human understanding Few

The documented review and exposition were produced by models. No human account of the central projection and counting proof was identified.

Correction and publication history