Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Galois data for seeded orderly prime systems

Definition
KN_SeededPrimeGaloisData

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

galois-representationsmodular-formsnumber-theoryp-adic-l-functions

This interface packages the Galois-theoretic data used in the proof of Kriz–Nordentoft, Corollary 4.15. It records: a ppp-adic coefficient place; a genuine finite residual representation and its identity-Frobenius locus; the cyclotomic and seed-character factors; a Chebotarev conjugacy class; and the simultaneous local conditions imposed on primes in that class.

For a prime ℓ\ellℓ in the final class, the data assert that aℓ(f)≡2a_{\ell}(f)\equiv 2aℓ​(f)≡2, the nebentypus is congruent to 111, ℓ≡1(modpm)\ell\equiv1\pmod {p^m}ℓ≡1(modpm), and η(ℓ)\eta(\ell)η(ℓ) has full order. It also records avoidance of a prescribed finite modulus.

This separates the arithmetic construction of the Frobenius class from Chebotarev density, the local unit calculation, and enumeration of the resulting prime set.

Definition code
import Definitions.Def_KN_SeededHorizontalPadicLFunctionV2
import Definitions.Def_LanglandsTunnell_TowerCounting

set_option autoImplicit false
noncomputable section

namespace HorizontalPadicL

/-- A chosen `p`-adic place of the coefficient field generated by an eigenform
and a seed character, together with the integrality needed for reduction. -/
structure SeededEigenformPadicPlaceData
    {N k p : ℕ} {ι : MTT.Qbar →+* ℂ} [Fact p.Prime]
    (f : MTT.Eigenform N k ι) (η : DirichletCharacterWithLevel) where
  embedding : MTT.Qbar →+* ℂ_[p]
  coeff_integral : ∀ n : ℕ, ‖embedding (f.coeff n)‖ ≤ 1
  character_integral : ∀ a : ℕ, ‖embedding (η.2 a)‖ ≤ 1

/-- The two finite abelian Galois characters used in the orderly-prime
argument: the cyclotomic character modulo `p ^ m * N`, and the character cut
out by the seed Dirichlet character. -/
structure SeedCyclotomicGaloisData
    (N p m : ℕ) (η : DirichletCharacterWithLevel) where
  modulus : ℕ
  modulus_eq : modulus = Nat.lcm (p ^ m * N) η.2.conductor
  seedGenerator : MTT.Qbar
  seedGenerator_order : orderOf seedGenerator = orderOf η.2

/-- A rational-prime set represented by a single conjugacy class in a finite
Galois extension, up to deleting finitely many primes. -/
inductive IsChebotarevPrimeClass (A : Set ℕ) : Prop
  | ofFiniteGalois
      (L : Type) [Field L] [NumberField L] [IsGalois ℚ L]
      (σ : L ≃ₐ[ℚ] L) (S : Finset ℕ)
      (realizes : A = {ℓ : ℕ |
        ℓ ∉ S ∧ LanglandsTunnell.classIndicator σ ℓ = 1}) :
      IsChebotarevPrimeClass A

/-- A finite residual representation attached to an eigenform, together with
the rational primes whose Frobenius maps to the identity.  The constructor
records that this is an actual representation of a finite Galois group, that
the identity locus is a Chebotarev class, and that trace compatibility makes
the Hecke coefficient congruent to `2` there. -/
inductive ResidualEigenformRepresentationData
    {N k p : ℕ} {ι : MTT.Qbar →+* ℂ} [Fact p.Prime]
    (f : MTT.Eigenform N k ι) (η : DirichletCharacterWithLevel)
    (V : SeededEigenformPadicPlaceData (p := p) f η) : Type 2
  | ofRepresentation
      (L 𝕜 : Type) [Field L] [NumberField L] [IsGalois ℚ L]
      [Field 𝕜] [Fintype 𝕜]
      (ρ : TaylorWiles.ResidualRep L 𝕜)
      (identityFrobeniusPrimes : Set ℕ)
      (identity_isChebotarev : IsChebotarevPrimeClass identityFrobeniusPrimes)
      (prime_of_mem : ∀ ⦃ℓ : ℕ⦄, ℓ ∈ identityFrobeniusPrimes → ℓ.Prime)
      (coeff_near_two : ∀ ⦃ℓ : ℕ⦄, ℓ ∈ identityFrobeniusPrimes →
        ‖V.embedding (f.coeff ℓ - 2)‖ < 1)
      (unramified_away : ∀ ⦃ℓ : ℕ⦄, ℓ ∈ identityFrobeniusPrimes →
        Nat.Coprime ℓ (N * p)) :
      ResidualEigenformRepresentationData f η V

/-- The simultaneous Frobenius class required by the horizontal construction.
It imposes identity Frobenius on the residual representation and cyclotomic
part, and a generator on the seed-character part. -/
structure SeededOrderlyFrobeniusClassData
    {N k p : ℕ} {ι : MTT.Qbar →+* ℂ} [Fact p.Prime]
    (f : MTT.Eigenform N k ι) (η : DirichletCharacterWithLevel)
    (m B : ℕ) (V : SeededEigenformPadicPlaceData (p := p) f η) where
  primes : Set ℕ
  chebotarevClass : IsChebotarevPrimeClass primes
  prime_of_mem : ∀ ⦃ℓ : ℕ⦄, ℓ ∈ primes → ℓ.Prime
  avoids : ∀ ⦃ℓ : ℕ⦄, ℓ ∈ primes → Nat.Coprime ℓ B
  congruent_one_mod_pm : ∀ ⦃ℓ : ℕ⦄, ℓ ∈ primes → Nat.ModEq (p ^ m) ℓ 1
  coprime_level_seed : ∀ ⦃ℓ : ℕ⦄, ℓ ∈ primes →
    Nat.Coprime ℓ (N * η.2.conductor)
  coeff_near_two : ∀ ⦃ℓ : ℕ⦄, ℓ ∈ primes →
    ‖V.embedding (f.coeff ℓ - 2)‖ < 1
  nebentype_near_one : ∀ ⦃ℓ : ℕ⦄, ℓ ∈ primes →
    ‖V.embedding (f.epsilon ℓ - 1)‖ < 1
  seed_value_has_full_order : ∀ ⦃ℓ : ℕ⦄, ℓ ∈ primes →
    orderOf (η.2 ℓ) = orderOf η.2

end HorizontalPadicL
Source
Kriz–Nordentoft, Horizontal p-adic L-functions, arXiv:2310.20678v3, §4.3, Lemma 4.14 and Corollary 4.15, pp. 30–31.

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