Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Counting exact-order characters on positive-density prime sets

Proved
HorizontalPadicL.supportedPrimePowerCharacters_logLowerBound_v2

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

dirichlet-charactersnumber-theoryp-adic-l-functions

Counting exact-order characters supported on a positive-density set of primes congruent to 1 modulo p^m, after finitely many primes are excluded. The strict slack in alpha avoids an endpoint asymptotic from mere natural density. Intended proof: weighted squarefree counting (a weakened form of Kriz--Nordentoft Lemma 5.7), followed by removing lower-order characters. Source: https://arxiv.org/pdf/2310.20678 .

Preamble
import Definitions.Def_KN_PrimePowerPropagationV2

set_option autoImplicit false
noncomputable section
open scoped BigOperators

namespace HorizontalPadicL
Formal statement
/-- Counting exact-order characters supported on a positive-density set of
primes congruent to 1 modulo p^m, after finitely many primes are excluded.
The strict slack in alpha avoids an endpoint asymptotic from mere natural
density. Intended proof: weighted squarefree counting (a weakened form of
Kriz--Nordentoft Lemma 5.7), followed by removing lower-order characters.
Source: https://arxiv.org/pdf/2310.20678 . -/
theorem supportedPrimePowerCharacters_logLowerBound_v2
    (p m : ℕ) [Fact p.Prime] (hm : 0 < m)
    (ℓ : ℕ → ℕ) (hprime : ∀ n, (ℓ n).Prime)
    (hinj : Function.Injective ℓ) (hcong : ∀ n, Nat.ModEq (p ^ m) (ℓ n) 1)
    (δ : ℝ) (hδ : 0 < δ)
    (hdensity : HasPrimeNaturalDensity (Set.range ℓ) δ)
    (A : Finset ℕ) :
    ∃ α : ℝ, 0 < α ∧ α < ((p ^ m - 1 : ℕ) : ℝ) * δ ∧
      HasLogPowerLowerBound
        (characterConductorCount (supportedPrimePowerCharacters ℓ A p m)) α := by
  sorry

end HorizontalPadicL
Source
Kriz--Nordentoft, Horizontal p-adic L-functions, https://arxiv.org/pdf/2310.20678, Section 2.3.3, Lemma 5.7, Theorem 5.9 and Corollary 5.10.

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