Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

y2+y=x5y^2+y=x^5y2+y=x5 over F41\mathbb F_{41}F41​: N1=33N_1=33N1​=33, N2=1743N_2=1743N2​=1743

Proved
WeilConjectures.hyperelliptic_F41_point_counts

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

finite-fieldshyperelliptic-curvesnumber-theory

Consider the genus-2 hyperelliptic curve C:y2+y=x5C: y^2+y=x^5C:y2+y=x5 over F41\mathbb F_{41}F41​. Counting affine solutions (x,y)(x,y)(x,y) over F41\mathbb F_{41}F41​ and F412\mathbb F_{41^2}F412​ and adding one point at infinity gives

N1=#{(x,y)∈F412:y2+y=x5}+1=33,N2=#{(x,y)∈F4122:y2+y=x5}+1=1743.N_1=\#\{(x,y)\in\mathbb F_{41}^2: y^2+y=x^5\}+1=33,\qquad N_2=\#\{(x,y)\in\mathbb F_{41^2}^2: y^2+y=x^5\}+1=1743.N1​=#{(x,y)∈F412​:y2+y=x5}+1=33,N2​=#{(x,y)∈F4122​:y2+y=x5}+1=1743.

These counts determine the coefficients c1=N1−1−q=−9c_1=N_1-1-q=-9c1​=N1​−1−q=−9 and c2=(N2−1−q2+c12)/2=71c_2=(N_2-1-q^2+c_1^2)/2=71c2​=(N2​−1−q2+c12​)/2=71 of the Weil polynomial P1P_1P1​.

Formalization Note F41\mathbb F_{41}F41​ is ZMod 41 and F412\mathbb F_{41^2}F412​ is GaloisField 41 2; the primality of 41 is supplied as a Fact instance argument.

Preamble
import Mathlib
import Definitions.Def_WeilConjectures_projectiveSpace
import Definitions.Def_WeilConjectures_zetaFunction

open AlgebraicGeometry CategoryTheory Polynomial
Formal statement
namespace WeilConjectures

theorem hyperelliptic_F41_point_counts [Fact (Nat.Prime 41)] :
    Nat.card {xy : ZMod 41 × ZMod 41 // xy.2 ^ 2 + xy.2 = xy.1 ^ 5} + 1 = 33 ∧
    Nat.card {xy : GaloisField 41 2 × GaloisField 41 2 // xy.2 ^ 2 + xy.2 = xy.1 ^ 5} + 1 = 1743 := 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" (counting yields N1=33N_1=33N1​=33 and N2=1743N_2=1743N2​=1743)
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