Colmez order-zero extension of compatible polynomial disk moments
ProvedPadicMeasure.colmez_r0_moment_extensionLet be a prime, an integer, and let be prescribed moments for , positive depths , and integer centres prime to .
Assume the degree-zero masses depend only on the residue class of modulo . Assume each degree is compatible with subdivision:
Finally, assume that one constant satisfies
for all such centres, depths, and degrees.
Then there exists exactly one bounded -valued measure on such that
This is the order-zero polynomial-moment extension criterion associated with Colmez's extension theorem, restricted to the compact open unit group. It gives the higher moments as well as the masses.
Formalization Note Measures are continuous -linear functionals on continuous functions. The conclusion explicitly supplies continuous disk test functions with the specified pointwise values. Only degree-zero representative independence is assumed: after extending the masses, refinement and centred decay force agreement with every higher prescribed moment, by the Riemann-sum argument in Colmez's proof. The parameters of are degree, depth, and integer centre, in that order.
import Mathlib.NumberTheory.Padics.Complex import Mathlib.NumberTheory.Padics.RingHoms import Mathlib.NumberTheory.Padics.Measure.Basic set_option autoImplicit false noncomputable section open scoped BigOperators
theorem PadicMeasure.colmez_r0_moment_extension
{p : ℕ} [Fact p.Prime] (d : ℕ)
(M : ℕ → ℕ → ℤ → ℂ_[p])
(hres : ∀ (n : ℕ), 0 < n → ∀ (a b : ℤ),
IsCoprime a (p : ℤ) → IsCoprime b (p : ℤ) →
(a : ZMod (p^n)) = (b : ZMod (p^n)) → M 0 n a = M 0 n b)
(hadd : ∀ (j : ℕ), j ≤ d → ∀ (n : ℕ), 0 < n →
∀ (a : ℤ), IsCoprime a (p : ℤ) →
(∑ b ∈ Finset.range p, M j (n+1) (a+(b : ℤ)*(p : ℤ)^n)) = M j n a)
(hbound : ∃ C : ℝ, 0 ≤ C ∧ ∀ (n : ℕ), 0 < n →
∀ (a : ℤ), IsCoprime a (p : ℤ) → ∀ (j : ℕ), j ≤ d →
‖∑ t ∈ Finset.range (j+1),
(j.choose t : ℂ_[p]) * (-(a : ℂ_[p]))^(j-t) * M t n a‖ ≤
C * ‖(p : ℂ_[p])^(n*j)‖) :
∃! μ : AbstractMeasure (ℤ_[p])ˣ ℂ_[p] ℂ_[p],
∀ (n : ℕ), 0 < n → ∀ (a : ℤ), IsCoprime a (p : ℤ) →
∀ (j : ℕ), j ≤ d → ∃ g : C((ℤ_[p])ˣ, ℂ_[p]),
(∀ x, g x = if PadicInt.toZModPow n x.val = (a : ZMod (p^n))
then (algebraMap ℚ_[p] ℂ_[p] (x.val : ℚ_[p]))^j else 0) ∧
μ g = M j n a := by sorry