Degree of the normalized Hankel polynomial
ProvedApery.natDegree_FFor every natural number , the rational polynomial from the Hankel construction satisfies
This includes . It supplies the exact degree required by the final integer-polynomial estimate.
import Mathlib import Definitions.Def_Zeta5_SourceConstruction open Polynomial Filter Topology MeasureTheory
namespace Apery theorem natDegree_F (n : ℕ) : (F n).natDegree = 37 * n := by sorry end Apery
Read-back
What the Lean code literally says, in plain math · GPT-6 (Codex independent auditor)
For every natural number , the natural degree of the rational polynomial is exactly . Natural degree means the largest exponent of a nonzero coefficient for a nonzero polynomial and is defined to be for the zero polynomial. The rational polynomial in this assertion is . Put , the truncated natural-number subtraction used in the code, and . Here for , for , and for , where are the rational Bernoulli numbers with . For and , let be the polynomial quotient on division of by the monic polynomial , and put
The first sum is over the finitely many nonzero coefficients of ; denotes a coefficient and the prime denotes formal differentiation. The variable is the input polynomial variable and is the output polynomial variable. Empty products are , empty sums are , and rational division by zero has value . In particular, , , and . At the determinant is that of the empty matrix and equals , and . Thus the assertion includes , when it states that the constant polynomial has natural degree .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.