Infinitely many nonvanishing quadratic twists with the local type of an admissible seed
OpenMTT.Eigenform.friedberg_hoffstein_infinite_of_admissible_seedLet , let be even, and let be a normalized algebraic cuspidal Hecke eigenform at the least positive level in its Hecke system, with arbitrary nebentype and a fixed complex embedding. Fix and a primitive exact-order-two character whose modulus is coprime to . If the embedded coefficients of are real, assume that the actual twist satisfies
There are infinitely many primitive Dirichlet characters such that
and such that their local types agree with the seed at the prescribed places:
This is the prescribed-local-type Friedberg–Hoffstein theorem over the rationals. The positive-root-number hypothesis is imposed only in the self-dual case. It does not assert existence of an admissible seed.
Formalization Note. The central value and inverse twist are the original mission Mellin constructions. Reality of all embedded coefficients describes self-duality at minimal level. Infinite families are represented by primitive characters together with their positive levels. The classical-to-automorphic and Mellin comparisons belong to this open analytic input.
import Definitions.Def_MTT_QuadraticTwistRootNumber set_option autoImplicit false open HorizontalPadicL
/-- Prescribed-local quadratic nonvanishing, conditional on an actual quadratic
seed with positive root number when the primitive eigenform is self-dual. -/
theorem MTT.Eigenform.friedberg_hoffstein_infinite_of_admissible_seed
{N k : ℕ} (hN : 0 < N) (hk : 2 ≤ k) (heven : Even k)
(ι : MTT.Qbar →+* ℂ) (f : MTT.Eigenform N k ι) (hmin : f.HasMinimalLevel)
(d : ℕ) (hd : 0 < d) (η₀ : DirichletCharacterWithLevel)
(hprimitive : η₀.2.IsPrimitive) (horder : orderOf η₀.2 = 2)
(hcop : Nat.Coprime (N * d) η₀.1.1)
(hadmissible : f.HasRealCoefficients →
MTT.HasFrickeRootNumber
(@MTT.inverseTwist ι f.form η₀.1.1 ⟨Nat.ne_of_gt η₀.1.2⟩ η₀.2)
(N * η₀.1.1 ^ 2) k 1) :
Set.Infinite {η : DirichletCharacterWithLevel |
η.2.IsPrimitive ∧ orderOf η.2 = 2 ∧ Nat.Coprime (N * d) η.2.conductor ∧
η.2 (-1) = η₀.2 (-1) ∧
(∀ p : ℕ, p.Prime → p ∣ N * d → η.2 p = η₀.2 p) ∧
@MTT.criticalLValue ι f.form
η.1.1 ⟨Nat.ne_of_gt η.1.2⟩ η.2 (k / 2 - 1) ≠ 0} := by
sorry