Positive-density orderly primes for a seeded twist (inverse-seed convention)
OpenHorizontalPadicL.seededPositiveDensityPrimeSystem_exists_inverseSeedLet be a new eigenform and let be a primitive even character. Fix a prime power with , assume that is coprime to the order of and to its conductor, and fix a positive avoidance modulus .
Then one can choose a -adic embedding of the coefficient field and an injectively enumerated set of primes which avoid , satisfy , and for which
is a -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.
This replacement uses the inverse-seed convention matching MTT criticalLValue: the orderly-prime expression and Euler augmentation are eta(l)*a_l - eta(l)^2 - epsilon(l). The critical values and seed hypotheses themselves retain the character eta. It supersedes HorizontalPadicL.seededPositiveDensityPrimeSystem_exists.
import Definitions.Def_KN_SeededHorizontalPadicLFunctionV2 import Definitions.Def_KN_InverseSeedConvention set_option autoImplicit false
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_inverseSeed
{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 : SeededHorizontalPrimeSystemV3 p ιp f η B),
L.orderExponent = m := by sorry
end HorizontalPadicL