Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Coprime discriminants give the simultaneous seeded Frobenius class

Proved
HorizontalPadicL.coprimeDiscriminant_simultaneousSeededFrobeniusClass_exists

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

chebotarevdirichlet-charactersmodular-formsnumber-theoryramification

Let a residual eigenform representation have kernel-field discriminant supported on NpNpNp, and choose a residue class on which the seed character has full order. If the seed conductor is coprime to NpNpNp, then there is a Chebotarev class of primes whose residual and pmNp^mNpmN-cyclotomic Frobenius components are trivial and whose seed component is the chosen full-order value, while avoiding a prescribed integer BBB. Consequently the primes have all congruence, coprimality, coefficient and character properties recorded by SeededOrderlyFrobeniusClassData.

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

set_option autoImplicit false
noncomputable section

namespace HorizontalPadicL
Formal statement
/-- The pure Galois-theoretic step in the seeded-prime construction.

Suppose the kernel field of a residual eigenform representation has
discriminant supported on `N * p`, and choose a residue class on which the
seed character has full order.  If the seed conductor is coprime to `N * p`,
then the residual kernel field and the `p ^ m * N` cyclotomic field are
linearly disjoint from the seed cyclotomic field.  A product automorphism
which is trivial on the first two factors and realizes the chosen seed class
therefore determines the required Chebotarev class. -/
theorem coprimeDiscriminant_simultaneousSeededFrobeniusClass_exists
    {N k p : ℕ} [Fact p.Prime]
    (hN : 0 < N) (hk : 2 ≤ k)
    (ι : MTT.Qbar →+* ℂ) (f : MTT.Eigenform N k ι)
    (η : DirichletCharacterWithLevel)
    (m B : ℕ) (hB : 0 < B)
    (hηcoprime : Nat.Coprime (N * p) η.2.conductor)
    (V : SeededEigenformPadicPlaceData (p := p) f η)
    (D : EigenformResidualGaloisRepresentationData hN hk f V.embedding)
    (a : (ZMod η.1.1)ˣ)
    (ha : orderOf (η.2 (a : ZMod η.1.1)) = orderOf η.2)
    (hdiscr :
      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) :
    Nonempty (SeededOrderlyFrobeniusClassData f η m B V) := by sorry

end HorizontalPadicL
Source
Disjoint ramification and linear disjointness, the cyclotomic description of Frobenius, and Chebotarev. The compositum-unramified and cyclotomic-discriminant support nodes isolate the two discriminant inputs.

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