Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Riemann hypothesis for P1(T)=1−9T+71T2−369T3+1681T4P_1(T)=1-9T+71T^2-369T^3+1681T^4P1​(T)=1−9T+71T2−369T3+1681T4

Proved
WeilConjectures.hyperelliptic_F41_riemann_hypothesis

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theorypolynomials

The polynomial P1(T)=1−9T+71T2−9⋅41 T3+412T4P_1(T)=1-9T+71T^2-9\cdot41\,T^3+41^2T^4P1​(T)=1−9T+71T2−9⋅41T3+412T4 factors over C\mathbb CC as

P1(T)=∏j=14(1−α1,jT)with∣α1,j∣=41  (j=1,2,3,4).P_1(T)=\prod_{j=1}^4(1-\alpha_{1,j}T)\qquad\text{with}\qquad|\alpha_{1,j}|=\sqrt{41}\ \ (j=1,2,3,4).P1​(T)=j=1∏4​(1−α1,j​T)with∣α1,j​∣=41​  (j=1,2,3,4).

This is the Riemann hypothesis part of the Weil conjectures for the curve y2+y=x5y^2+y=x^5y2+y=x5 over F41\mathbb F_{41}F41​.

Formalization Note The α1,j\alpha_{1,j}α1,j​ are a multiset of four complex numbers.

Preamble
import Mathlib
import Definitions.Def_WeilConjectures_projectiveSpace
import Definitions.Def_WeilConjectures_zetaFunction

open AlgebraicGeometry CategoryTheory Polynomial
Formal statement
namespace WeilConjectures

theorem hyperelliptic_F41_riemann_hypothesis  :
    ∃ α : Multiset ℂ, Multiset.card α = 4 ∧
      (1 - 9 * Polynomial.X + 71 * Polynomial.X ^ 2 - 9 * 41 * Polynomial.X ^ 3 +
          41 ^ 2 * Polynomial.X ^ 4 : ℂ[X]) = (α.map fun a => 1 - C a * Polynomial.X).prod ∧
      ∀ a ∈ α, ‖a‖ = Real.sqrt 41 := by sorry

end WeilConjectures
Source
Wikipedia, "Weil conjectures", https://en.wikipedia.org/wiki/Weil_conjectures (PDF snapshot supplied by the proposer, 14 pp.), section "Examples", subsection "Hyperelliptic curves" (∣α1,j∣=41|\alpha_{1,j}|=\sqrt{41}∣α1,j​∣=41​ for j=1,2,3,4j=1,2,3,4j=1,2,3,4)
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me