Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Compatible disk values with uniform depth decay vanish

Proved
PadicMeasure.compatible_disk_values_vanish_of_decay

by Wenqian Xing · Sep 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

measure-theoryp-adic-analysisp-adic-l-functions

Let ppp be prime and let D(n,a)∈CpD(n,a)\in\mathbf C_pD(n,a)∈Cp​ be values on positive-depth unit residue disks. Suppose

D(n,a)=∑b=0p−1D(n+1,a+bpn).D(n,a)=\sum_{b=0}^{p-1}D(n+1,a+bp^n).D(n,a)=b=0∑p−1​D(n+1,a+bpn).

Assume there is a real sequence B(n)→0B(n)\to0B(n)→0 such that ∣D(n,a)∣p≤B(n)|D(n,a)|_p\le B(n)∣D(n,a)∣p​≤B(n) for every positive nnn and every integer aaa prime to ppp. Then D(n,a)=0D(n,a)=0D(n,a)=0 for all these disks.

This is the vanishing mechanism used to identify prescribed higher moments with those of the measure constructed from degree-zero masses in the Colmez order-zero extension theorem.

Preamble
import Mathlib.NumberTheory.Padics.Complex
import Mathlib.RingTheory.Coprime.Lemmas
import Mathlib.Analysis.SpecificLimits.Basic

set_option autoImplicit false
noncomputable section
open scoped BigOperators
open Filter
Formal statement
theorem PadicMeasure.compatible_disk_values_vanish_of_decay {p : ℕ} [Fact p.Prime] (D : ℕ → ℤ → ℂ_[p])
    (hadd : ∀ n : ℕ, 0 < n → ∀ a : ℤ, IsCoprime a (p : ℤ) →
      (∑ b ∈ Finset.range p, D (n+1) (a+(b : ℤ)*(p : ℤ)^n)) = D n a)
    (B : ℕ → ℝ) (hB : Filter.Tendsto B Filter.atTop (nhds 0))
    (hbound : ∀ n : ℕ, 0 < n → ∀ a : ℤ, IsCoprime a (p : ℤ) → ‖D n a‖ ≤ B n) :
    ∀ n : ℕ, 0 < n → ∀ a : ℤ, IsCoprime a (p : ℤ) → D n a = 0 := by sorry
Source
Supporting uniqueness and vanishing arguments for PadicMeasure.colmez_r0_moment_extension in the Mazur–Tate–Teitelbaum interpolation mission.

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