Analytic upper bound for the Hankel polynomial value
ProvedApery.real_boundFor every positive natural number , with and ,
This is the repository's analytic estimate, including its explicit lower-order terms. Together with the arithmetic normalization bound, it gives the negative quadratic exponent needed for irrationality.
import Mathlib import Definitions.Def_Zeta5_SourceConstruction import Definitions.Def_Zeta5_SourceConstants import Definitions.Def_Zeta5_SourceValue open Polynomial Filter Topology MeasureTheory
namespace Apery
theorem real_bound (n : ℕ) (hn : 0 < n) :
0 < aeval zeta5 (F n) ∧
Real.log (aeval zeta5 (F n)) ≤
(U : ℝ) * Kr n ^ 2 + 27 * Kr n * Real.log (Kr n) + 200 * Kr 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 satisfying , the real evaluation of the rational polynomial at satisfies both
Here rational coefficients and the natural number are embedded in , and is the real natural logarithm. The real number is , with the natural numbers embedded in and the summand equal to by total division. Infinite sums mean unconditional sums, assigned if no such sum exists. 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 . The hypothesis excludes , and both logarithm arguments in the assertion are positive.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.