Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Positive-density orderly primes for a seeded twist

Open
HorizontalPadicL.seededPositiveDensityPrimeSystem_exists

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

modular-formsmodular-symbolsnumber-theoryp-adic-l-functionsprime-density

Let fff be a new eigenform and let η\etaη be a primitive even character. Fix a prime power pmp^mpm with m>0m>0m>0, assume that ppp is coprime to the order of η\etaη and to its conductor, and fix a positive avoidance modulus BBB.

Then one can choose a ppp-adic embedding of the coefficient field and an injectively enumerated set of primes ℓ\ellℓ which avoid BBB, satisfy ℓ≡1(modpm)\ell\equiv1\pmod{p^m}ℓ≡1(modpm), and for which

η(ℓ)aℓ(f)−1−η(ℓ)2εf(ℓ)\eta(\ell)a_\ell(f)-1-\eta(\ell)^2\varepsilon_f(\ell)η(ℓ)aℓ​(f)−1−η(ℓ)2εf​(ℓ)

is a ppp-adic unit. This set has positive natural density among the rational primes.

The conclusion includes the density, rather than merely infinitude, because the quantitative character count later depends on that density.

Deprecated: inverse-seed convention correction. Use HorizontalPadicL.seededPositiveDensityPrimeSystem_exists_inverseSeed instead (the orderly Euler expression is eta(l)*a_l - eta(l)^2 - epsilon(l), matching MTT criticalLValue). The replacement preserves the original interpolation and seed convention.

Preamble
import Definitions.Def_KN_SeededHorizontalPadicLFunctionV2

set_option autoImplicit false
Formal statement
namespace HorizontalPadicL

/-- The Chebotarev/orderly-prime input. For a seed whose order is prime to `p`,
one can choose a `p`-adic place and enumerate a positive-density set of order-`m`
orderly primes, while avoiding any prescribed finite modulus. -/
theorem seededPositiveDensityPrimeSystem_exists
    {N k p : ℕ} [Fact p.Prime]
    (hN : 0 < N) (hk : 2 ≤ k) (heven : Even k)
    (ι : MTT.Qbar →+* ℂ) (f : MTT.Eigenform N k ι)
    (hnew : IsNewEigenform f)
    (η : DirichletCharacterWithLevel)
    (hηprim : η.2.IsPrimitive) (hηeven : η.2 (-1) = 1)
    (m B : ℕ) (hm : 0 < m) (hB : 0 < B)
    (hηorder : 2 ≤ orderOf η.2)
    (horderCoprime : Nat.Coprime (orderOf η.2) p)
    (hηcoprime : Nat.Coprime (N * p) η.2.conductor) :
    ∃ (ιp : MTT.Qbar →+* ℂ_[p])
      (L : SeededHorizontalPrimeSystemV2 p ιp f η B),
      L.orderExponent = m := by sorry

end HorizontalPadicL
Source
Kriz--Nordentoft, https://arxiv.org/pdf/2310.20678, Definition 4.1 and Corollary 4.15; Chebotarev density theorem.

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