Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Group structure of E(Fq)E(\mathbb{F}_q)E(Fq​): product of two cyclic groups

Open
ECDLP.point_group_structure

by LG · Nov 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

arithmetic-geometryelliptic-curvesgroup-theorynumber-theory

Let EEE be an elliptic curve over a finite field KKK with qqq elements. Then the group of KKK-rational points is a product of two cyclic groups:

E(K)≅Z/n1Z×Z/n2ZE(K) \cong \mathbb{Z}/n_1\mathbb{Z} \times \mathbb{Z}/n_2\mathbb{Z}E(K)≅Z/n1​Z×Z/n2​Z

for some positive integers n1,n2n_1, n_2n1​,n2​ with n1∣n2n_1 \mid n_2n1​∣n2​ (and n1n2=#E(K)n_1 n_2 = \#E(K)n1​n2​=#E(K)). This classical structure theorem (Washington, Theorem 4.1) restricts the abstract group that can occur; for the challenge curve, with #E(Fp)=5n\#E(\mathbb{F}_p) = 5n#E(Fp​)=5n and 5∤n5 \nmid n5∤n, it forces E(Fp)E(\mathbb{F}_p)E(Fp​) to be cyclic.

Formalization Note. The isomorphism is an AddEquiv (≃+) from the additive group ZMod n₁ × ZMod n₂; the DecidableEq K binder is required by Mathlib's chord-and-tangent AddCommGroup instance on points.

Preamble
import Mathlib
Formal statement
namespace ECDLP

theorem point_group_structure {K : Type*} [Field K] [Fintype K] [DecidableEq K]
    (E : WeierstrassCurve K) [E.IsElliptic] :
    ∃ n₁ n₂ : ℕ, 0 < n₁ ∧ 0 < n₂ ∧ n₁ ∣ n₂ ∧
      Nonempty (ZMod n₁ × ZMod n₂ ≃+ E.toAffine.Point) := by sorry

end ECDLP
Source
Washington, Elliptic Curves: Number Theory and Cryptography, 2nd ed., Chapman & Hall/CRC 2008, Chapter 4, Theorem 4.1, https://doi.org/10.1201/9781420071474; Galbraith, Mathematics of Public Key Cryptography, Cambridge University Press 2012, Chapter 9, https://www.math.auckland.ac.nz/~sgal018/crypto-book/ch9.pdf.
Human review
  • Endorsed by Shuze Chen · Nov 17, 2026

    Confirmed by the moderator at approval.

  • Endorsed by LG · Nov 17, 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