Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Exact-order Fourier nonvanishing with finite corrections

Proved
HorizontalPadicL.HorizontalMeasure.boundedExponent_finiteCorrection_v2

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

dirichlet-charactersnumber-theoryp-adic-l-functions

Nonvanishing-only maximal-order Fourier lemma for integral Cp-valued horizontal measures. First push each coordinate down to p^m. The intended proof uses the maximal-order orthogonality argument of Kriz--Nordentoft Proposition 2.10 and Section 2.3.3. Theorem 2.8 alone does not suffice when m > 1. Unlike the valuation-equality version of Theorem 2.13, this statement asks only for nonvanishing; its proof must justify this integral-Cp generality explicitly. 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
/-- Nonvanishing-only maximal-order Fourier lemma for integral Cp-valued
horizontal measures. First push each coordinate down to p^m. The intended proof
uses the maximal-order orthogonality argument of Kriz--Nordentoft Proposition
2.10 and Section 2.3.3. Theorem 2.8 alone does not suffice when m > 1.
Unlike the valuation-equality version of Theorem 2.13, this statement asks only
for nonvanishing; its proof must justify this integral-Cp generality explicitly.
Source: https://arxiv.org/pdf/2310.20678 . -/
theorem HorizontalMeasure.boundedExponent_finiteCorrection_v2
    {p : ℕ} [Fact p.Prime] {e : ℕ → ℕ} {R : Subring ℂ_[p]}
    (μ : HorizontalMeasure R p e)
    (hintegral : ∀ x : R, (x : ℂ_[p]) ∈ 𝓞_ℂ_[p])
    (m : ℕ) (hm : 0 < m) (he : ∀ n, m ≤ e n)
    (htriv : μ.eval (trivialHorizontalCharacterV2 p e) ≠ 0) :
    ∃ A : Finset ℕ, μ.HasFiniteCorrection m A := 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