Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The seeded Frobenius class consists of orderly primes (inverse-seed convention)

Proved
HorizontalPadicL.seededFrobeniusClass_isOrderly_inverseSeed

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

dirichlet-charactersnumber-theoryp-adic-l-functions

Assume the seed character has order at least two and its order is prime to ppp. Every prime ℓ\ellℓ in the simultaneous Frobenius class is orderly of exponent mmm. The local expression is a ppp-adic unit because modulo the maximal ideal it is

2η(ℓ)−1−η(ℓ)2=−(η(ℓ)−1)2,2\eta(\ell)-1-\eta(\ell)^2=-(\eta(\ell)-1)^2,2η(ℓ)−1−η(ℓ)2=−(η(ℓ)−1)2,

and a nontrivial root of unity of order prime to ppp remains nontrivial after reduction.

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.seededFrobeniusClass_isOrderly.

Preamble
import Definitions.Def_KN_SeededPrimeGaloisData
import Definitions.Def_KN_InverseSeedConvention

set_option autoImplicit false
Formal statement
namespace HorizontalPadicL

theorem seededFrobeniusClass_isOrderly_inverseSeed
    {N k p m B : ℕ} {ι : MTT.Qbar →+* ℂ} [Fact p.Prime]
    {f : MTT.Eigenform N k ι} {η : DirichletCharacterWithLevel}
    {V : SeededEigenformPadicPlaceData (p := p) f η}
    (D : SeededOrderlyFrobeniusClassData f η m B V)
    (hηorder : 2 ≤ orderOf η.2)
    (horderCoprime : Nat.Coprime (orderOf η.2) p) :
    ∀ ⦃ℓ : ℕ⦄, ℓ ∈ D.primes →
      IsOrderlyPrimeForSeededEigenformV3 p m V.embedding f η ℓ := by sorry

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