Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Strict positivity of the Hankel determinant at ζ(5)

Proved
Apery.delta_pos

by tomasz · Oct 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

formalizationirrationalitynumber-theoryzeta5-mo271

For every positive natural number nnn,

Δn(z5)>0.\Delta_n(z_5)>0.Δn​(z5​)>0.

Here Δn\Delta_nΔn​ is the determinant of the explicit 37n×37n37n\times37n37n×37n polynomial Hankel matrix. This establishes nonvanishing for the determinant used to construct small integer-polynomial values.

Formalization Note The source declaration Apery.Δ_pos is named Apery.delta_pos here to use an ASCII platform identifier; its assertion and hypotheses are unchanged.

Preamble
import Mathlib
import Definitions.Def_Zeta5_SourceConstruction
import Definitions.Def_Zeta5_SourceValue

open Polynomial Filter Topology MeasureTheory
Formal statement
namespace Apery

theorem delta_pos (n : ℕ) (hn : 0 < n) : 0 < aeval zeta5 (Δ n) := by sorry

end Apery
Source
https://github.com/mo271/Zeta5/blob/7fe736760f4b96bfdb4334b68e3b3124ecbe10b0/Apery/Positivity.lean#L133-L134
Read-back

What the Lean code literally says, in plain math · GPT-6 (Codex independent auditor)

For every natural number nnn satisfying n>0n>0n>0, the rational polynomial Δn(x)=det⁡[M40n(D3n(t)6ti+j;x)]0≤i,j<37n\Delta_n(x)=\det\bigl[M_{40n}(D_{3n}(t)^6t^{i+j};x)\bigr]_{0\le i,j<37n}Δn​(x)=det[M40n​(D3n​(t)6ti+j;x)]0≤i,j<37n​ has strictly positive real evaluation at x=Zx=Zx=Z, namely Δn(Z)>0\Delta_n(Z)>0Δn​(Z)>0, with rational coefficients embedded in R\mathbb RR for evaluation. The real number ZZZ is ∑k∈N1/k5\sum_{k\in\mathbb N}1/k^5∑k∈N​1/k5, with the natural numbers embedded in R\mathbb RR and the k=0k=0k=0 summand equal to 000 by total division. Infinite sums mean unconditional sums, assigned 000 if no such sum exists. Here Dm(t)=∏r=1m(t+r2)D_m(t)=\prod_{r=1}^{m}(t+r^2)Dm​(t)=∏r=1m​(t+r2) for m∈Nm\in\mathbb Nm∈N, Hj=∑v=1jv−5H_j=\sum_{v=1}^{j}v^{-5}Hj​=∑v=1j​v−5 for j∈Nj\in\mathbb Nj∈N, and βe=(−1)eB2e+2(2e+3)(2e+4)(2e+5)/24\beta_e=(-1)^eB_{2e+2}(2e+3)(2e+4)(2e+5)/24βe​=(−1)eB2e+2​(2e+3)(2e+4)(2e+5)/24 for e∈Ne\in\mathbb Ne∈N, where BkB_kBk​ are the rational Bernoulli numbers with B1=−1/2B_1=-1/2B1​=−1/2. For K∈NK\in\mathbb NK∈N and P∈Q[t]P\in\mathbb Q[t]P∈Q[t], let qK,Pq_{K,P}qK,P​ be the polynomial quotient on division of PPP by the monic polynomial DKD_KDK​, and put

MK(P;x)=∑e[te]qK,P βe+∑j=1KP(−j2)DK′(−j2)(j4(x−Hj)−14+12j).\begin{aligned} M_K(P;x)&=\sum_e [t^e]q_{K,P}\,\beta_e\\ &\quad+\sum_{j=1}^{K}\frac{P(-j^2)}{D_K'(-j^2)} \bigl(j^4(x-H_j)-\frac14+\frac{1}{2j}\bigr). \end{aligned}MK​(P;x)​=e∑​[te]qK,P​βe​+j=1∑K​DK′​(−j2)P(−j2)​(j4(x−Hj​)−41​+2j1​).​

The first sum is over the finitely many nonzero coefficients of qK,Pq_{K,P}qK,P​; [te][t^e][te] denotes a coefficient and the prime denotes formal differentiation. The variable ttt is the input polynomial variable and xxx is the output polynomial variable. Empty products are 111, empty sums are 000, and rational division by zero has value 000. In particular, D0=1D_0=1D0​=1, H0=0H_0=0H0​=0, and M0(P;x)=∑e[te]P βeM_0(P;x)=\sum_e[t^e]P\,\beta_eM0​(P;x)=∑e​[te]Pβe​. The index n=0n=0n=0 is excluded by the hypothesis; at that index the defining matrix would be empty and its determinant would be 111.

Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by tomasz · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me