Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Product-norm cutoffs on the real and p-adic places: infinite tensor rank and a bounded-window period

Proved
MasulloRH.padic_product_norm_cutoff_rigidity_and_rank

by Yi · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

harmonic-analysisp-adic-analysistrace-formula

For every rational prime ppp put Fm(x,y)=e−x21∥y∥p≤1m(∣x∣∥y∥p)F_m(x,y)=e^{-x^2}\mathbf1_{\|y\|_p\le1}m(|x|\|y\|_p)Fm​(x,y)=e−x21∥y∥p​≤1​m(∣x∣∥y∥p​) on R×Qp\mathbf R\times\mathbf Q_pR×Qp​. There is a neighborhood of y=0y=0y=0 on which all real slices take their value at zero if and only if mmm is constant on [0,∞)[0,\infty)[0,∞). A common open additive period group or a finite separated sum with locally constant ppp-adic factors forces that same constancy. If m(a)≠0m(a)\ne0m(a)=0 for some a>0a>0a>0 and m=0m=0m=0 above a finite positive threshold, FmF_mFm​ has infinite tensor rank even on x>0, ∥y∥p≤1x>0,\,\|y\|_p\le1x>0,∥y∥p​≤1, with arbitrary complex factors. In particular a smooth compact cutoff taking values between zero and one, equal to one on [−1,1][-1,1][−1,1] and to zero outside (−2,2)(-2,2)(−2,2), witnesses all three failures.

Conversely, if an input fff is supported in ∣x∣≤X|x|\le X∣x∣≤X and invariant under ppp-adic shifts of norm at most ddd, multiplying by m(∣x∣∥y∥p)m(|x|\|y\|_p)m(∣x∣∥y∥p​) preserves all periods of norm at most min⁡(d,δ/X)\min(d,\delta/X)min(d,δ/X) whenever mmm is constant on [0,δ][0,\delta][0,δ] and X,δ,d>0X,\delta,d>0X,δ,d>0.

Preamble
import Mathlib.NumberTheory.Padics.PadicNumbers
import Mathlib.Analysis.Calculus.BumpFunction.InnerProduct
import Mathlib.Topology.LocallyConstant.Basic
import Mathlib.Analysis.SpecialFunctions.Exp

open Filter Set
open scoped Topology
Formal statement
theorem MasulloRH.padic_product_norm_cutoff_rigidity_and_rank (p : ℕ) [Fact p.Prime] :
    let F (m : ℝ → ℝ) (x : ℝ) (y : ℚ_[p]) : ℂ :=
      if ‖y‖ ≤ 1 then (Real.exp (-(x^2)):ℂ) * (m (|x| * ‖y‖):ℂ) else 0
    let UniformAtZero (m : ℝ → ℝ) := ∀ᶠ y in 𝓝 (0:ℚ_[p]), ∀ x : ℝ, F m x y = F m x 0
    let CommonPeriod (m : ℝ → ℝ) := ∃ H : AddSubgroup ℚ_[p], IsOpen (H : Set ℚ_[p]) ∧
      ∀ (x : ℝ) (y h : ℚ_[p]), h ∈ H → F m x (y+h) = F m x y
    let FiniteLoc (m : ℝ → ℝ) := ∃ (n : ℕ) (a : Fin n → ℝ → ℂ) (b : Fin n → ℚ_[p] → ℂ),
      (∀ i, IsLocallyConstant (b i)) ∧ ∀ x y, F m x y = ∑ i, a i x * b i y
    let FiniteOnBall (m : ℝ → ℝ) := ∃ (n : ℕ) (a : Fin n → ℝ → ℂ) (b : Fin n → ℚ_[p] → ℂ),
      ∀ x : ℝ, 0<x → ∀ y : ℚ_[p], ‖y‖≤1 → F m x y = ∑ i, a i x * b i y
    (∀ m : ℝ → ℝ, (UniformAtZero m ↔ ∀ t : ℝ, 0 ≤ t → m t = m 0) ∧
      (CommonPeriod m → ∀ t : ℝ, 0 ≤ t → m t = m 0) ∧
      (FiniteLoc m → ∀ t : ℝ, 0 ≤ t → m t = m 0) ∧
      (∀ a C : ℝ, 0<a → 0<C → m a ≠ 0 → (∀ t : ℝ, C≤t → m t=0) → ¬FiniteOnBall m)) ∧
    (∀ (m : ℝ → ℝ) (X δ d : ℝ), 0<X → 0<δ → 0<d →
      (∀ t : ℝ, 0 ≤ t → t ≤ δ → m t = m 0) →
      ∀ f : ℝ → ℚ_[p] → ℂ, (∀ x, X < |x| → ∀ y, f x y = 0) →
      (∀ x y h, ‖h‖ ≤ d → f x (y+h) = f x y) →
      ∀ (x : ℝ) (y h : ℚ_[p]), ‖h‖ ≤ min d (δ/X) →
        (m (|x| * ‖y+h‖):ℂ) * f x (y+h) = (m (|x| * ‖y‖):ℂ) * f x y) ∧
    ∃ m : ℝ → ℝ, ContDiff ℝ (⊤:ℕ∞) m ∧ HasCompactSupport m ∧
      (∀ t, 0 ≤ m t ∧ m t ≤ 1) ∧ (∀ t : ℝ, |t| ≤ 1 → m t = 1) ∧
      (∀ t : ℝ, 2 ≤ |t| → m t = 0) ∧
      ¬UniformAtZero m ∧ ¬CommonPeriod m ∧ ¬FiniteLoc m ∧ ¬FiniteOnBall m := by sorry
Source
A two-place test of the S-norm Fourier cutoff in Masullo, The Music of the Primes, Chapter 12, §12.4. The distinction is between the algebraic finite tensor of local test spaces and an operator acting on a larger completion.

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