Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Degree of an elliptic curve local Euler factor

Definition
HorizontalPadicL_LocalEulerFactorDegree

by davidloeffler · Sep 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

elliptic-curvesl-functionsnumber-theory

For an elliptic curve E/QE/\mathbb{Q}E/Q and a prime ppp, define coefficient-side predicates expressing the two possible recurrence types for its local Euler factor. LocalEulerFactorDegreeBelowTwo E p is the linear recurrence apr+2=apapr+1a_{p^{r+2}}=a_p a_{p^{r+1}}apr+2​=ap​apr+1​, covering local Euler polynomials of degree zero or one. LocalEulerFactorDegreeTwo E p is the normalized quadratic recurrence apr+2=apapr+1−papra_{p^{r+2}}=a_p a_{p^{r+1}}-p a_{p^r}apr+2​=ap​apr+1​−papr​.

Definition code
import Definitions.Def_KN_HorizontalPadicL

set_option autoImplicit false

namespace HorizontalPadicL

/-- Coefficient-side formulation that the local Euler polynomial of `E` at `p`
has degree strictly below two.  For an elliptic curve the reciprocal local Euler
factor then has the linear recurrence displayed here (including the degree-zero
case, when `E.LFunction p = 0`). -/
def LocalEulerFactorDegreeBelowTwo (E : WeierstrassCurve ℚ) (p : ℕ) : Prop :=
  ∀ r : ℕ,
    E.LFunction (p ^ (r + 2)) =
      E.LFunction p * E.LFunction (p ^ (r + 1))

/-- Coefficient-side formulation that the local Euler polynomial of `E` at `p`
has degree two, with its weight-two constant term equal to `p`. -/
def LocalEulerFactorDegreeTwo (E : WeierstrassCurve ℚ) (p : ℕ) : Prop :=
  ∀ r : ℕ,
    E.LFunction (p ^ (r + 2)) =
      E.LFunction p * E.LFunction (p ^ (r + 1)) -
        (p : ℤ) * E.LFunction (p ^ r)

end HorizontalPadicL
Source
Silverman, The Arithmetic of Elliptic Curves, 2nd ed., Chapter V, §2; standard local Euler factors of elliptic curves over Q.

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