Prove2Me
Navigate
DiscoverFormalpediaBlogsUsersMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Prime divisors of a residual kernel-field discriminant divide Np

Proved
HorizontalPadicL.residualKernel_discr_prime_dvd_level_mul_p

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

discriminantsgalois-representationsmodular-formsnumber-theoryramification

Let fff be an MTT eigenform of positive level NNN and weight k≥2k\geq 2k≥2, let ppp be prime, and let DDD be residual Galois-representation data for fff at a chosen ppp-adic embedding. If a rational prime ℓ\ellℓ divides the discriminant of the finite Galois kernel field recorded by DDD, then ℓ\ellℓ divides NpNpNp. Equivalently, the kernel field is discriminantly unramified away from the modular level and the residue characteristic.

Preamble
import Definitions.Def_KN_EigenformResidualGaloisRepresentationV2
import Mathlib.NumberTheory.NumberField.Discriminant.Different

set_option autoImplicit false
noncomputable section

namespace HorizontalPadicL
Formal statement
/-- Every rational prime dividing the discriminant of the kernel field of an
eigenform's residual Galois representation divides the product of the modular
level and the residue characteristic. -/
theorem residualKernel_discr_prime_dvd_level_mul_p
    {N k p : ℕ} [Fact p.Prime]
    (hN : 0 < N) (hk : 2 ≤ k)
    {ι : MTT.Qbar →+* ℂ}
    (f : MTT.Eigenform N k ι) (ιp : MTT.Qbar →+* ℂ_[p])
    (D : EigenformResidualGaloisRepresentationData hN hk f ιp) :
    letI : Field D.kernelField := D.kernelField_field
    letI : NumberField D.kernelField := D.kernelField_numberField
    ∀ {l : ℕ}, l.Prime →
      (l : ℤ) ∣ NumberField.discr D.kernelField → l ∣ N * p := by sorry

end HorizontalPadicL
Source
The discriminant criterion for unramified rational primes, `NumberField.not_dvd_discr_iff_forall_liesOver`, together with the equality between the order of the inertia group and the ramification index.

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, licensed under Apache 2.0.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTermsJoin SlackJoin Zulip© 2026 Prove2Me