Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

A Fourier multiplier with decaying symbol is a compact operator on L²(S¹, ℝ²ⁿ)

Proved
AsymptoticOperator.exists_isCompactOperator_fourierMultiplier

by Mazecto · Oct 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

asymptotic-operatorcompact-operatorfourier-serieshilbert-space

Let n≥0n\ge 0n≥0 and let m:Z→C2n×2nm:\mathbb Z\to\mathbb C^{2n\times 2n}m:Z→C2n×2n be a family of complex matrices that is conjugate-symmetric, m−k=mk‾m_{-k}=\overline{m_k}m−k​=mk​​ (entrywise conjugate), for all k∈Zk\in\mathbb Zk∈Z. Suppose there are real numbers ckc_kck​ with ck→0c_k\to 0ck​→0 as ∣k∣→∞|k|\to\infty∣k∣→∞ (along the cofinite filter on Z\mathbb ZZ) such that

∣mkv∣2≤ck ∣v∣2for all k∈Z, v∈C2n,|m_k v|^2\le c_k\,|v|^2\qquad\text{for all }k\in\mathbb Z,\ v\in\mathbb C^{2n},∣mk​v∣2≤ck​∣v∣2for all k∈Z, v∈C2n,

where ∣v∣2=∑i∣vi∣2|v|^2=\sum_i|v_i|^2∣v∣2=∑i​∣vi​∣2. Then there is a compact bounded linear operator TTT on L2(S1,R2n)L^2(S^1,\mathbb R^{2n})L2(S1,R2n), S1=R/ZS^1=\mathbb R/\mathbb ZS1=R/Z with its Haar probability measure, such that for every g∈L2g\in L^2g∈L2 and every k∈Zk\in\mathbb Zk∈Z the kkk-th Fourier coefficient of TgTgTg is

(Tg)^k=mk g^k.\widehat{(Tg)}_k=m_k\,\hat g_k .(Tg)​k​=mk​g^​k​.

Role: a general compactness criterion for operators on L2(S1,R2n)L^2(S^1,\mathbb R^{2n})L2(S1,R2n) that are diagonal in the Fourier basis, reusable throughout the spectral theory of asymptotic operators AS=−J0∂t−SA_S=-J_0\partial_t-SAS​=−J0​∂t​−S on the circle.

Formalization note: L2L^2L2 is L2 n and g^k\hat g_kg^​k​ is coeff g k from the AsymptoticOperator_Setting definition module (Fourier coefficients of the complexified function, in Fin n ⊕ Fin n → ℂ). The matrices act by Matrix.mulVec; conjugate symmetry is stated as m (-k) = (m k).map (starRingEnd ℂ). Compactness is Mathlib's IsCompactOperator. The bound is stated with squared norms, ∑i∥(mkv)i∥2≤ck∑i∥vi∥2\sum_i\|(m_k v)_i\|^2\le c_k\sum_i\|v_i\|^2∑i​∥(mk​v)i​∥2≤ck​∑i​∥vi​∥2, and ck→0c_k\to0ck​→0 is Filter.Tendsto c Filter.cofinite (nhds 0).

Preamble
import Definitions.Def_AsymptoticOperator_Setting
Formal statement
namespace AsymptoticOperator

open ConleyZehnder Matrix

/-- A Fourier multiplier on `L²(S¹, ℝ²ⁿ)` with a decaying symbol is a compact operator.
The symbol `m : ℤ → ℂ^{2n×2n}` is conjugate-symmetric (`m₋ₖ = m̄ₖ`, so that real functions go to
real functions), and `|mₖ v|² ≤ cₖ |v|²` with `cₖ → 0` as `|k| → ∞`. Then there is a compact
operator `T` on `L²` acting on Fourier coefficients by `(Tg)^ₖ = mₖ ĝₖ`. -/
theorem exists_isCompactOperator_fourierMultiplier {n : ℕ}
    (m : ℤ → Matrix (Fin n ⊕ Fin n) (Fin n ⊕ Fin n) ℂ)
    (hm : ∀ k, m (-k) = (m k).map (starRingEnd ℂ))
    (c : ℤ → ℝ) (hc : Filter.Tendsto c Filter.cofinite (nhds 0))
    (hbound : ∀ (k : ℤ) (v : Fin n ⊕ Fin n → ℂ),
      ∑ i, ‖(m k *ᵥ v) i‖ ^ 2 ≤ c k * ∑ i, ‖v i‖ ^ 2) :
    ∃ T : L2 n →L[ℝ] L2 n, IsCompactOperator T ∧
      ∀ (g : L2 n) (k : ℤ), coeff (T g) k = m k *ᵥ coeff g k := by sorry

end AsymptoticOperator
Source
Standard Fourier-multiplier fact; used for Hofer-Wysocki-Zehnder (GAFA 1995), §3, p. 285, and Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, §3.2

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