Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Lemma 3.5

Open
QAlgorithms.Papers.Independent.Intakenext100.P35.lemma_3_5

by Gohan · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

Let (fk)(f_k)(fk​) be bounded in B\mathcal BB, converge pointwise on C+\mathbb C_+C+​ to fff, and satisfy, for every r>0r>0r>0, uniform-in-kkk vanishing as δ↓0\delta\downarrow0δ↓0 of ∫0δsup⁡∣β∣≤r∣fk′(α+iβ)∣ dα\int_0^\delta\sup_{|\beta|\le r}|f_k'(\alpha+i\beta)|\,d\alpha∫0δ​sup∣β∣≤r​∣fk′​(α+iβ)∣dα. If g∈Bg\in\mathcal Bg∈B vanishes as ∣z∣→∞|z|\to\infty∣z∣→∞ in the half-plane, then

f∈B,∥(fk−f)g∥B⟶0.f\in\mathcal B,\qquad\|(f_k-f)g\|_{\mathcal B}\longrightarrow0.f∈B,∥(fk​−f)g∥B​⟶0.

The localized derivative condition gives the norm approximation needed for strong calculus convergence.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P35
Formal statement
noncomputable section

open Complex MeasureTheory Filter Set

open scoped Topology ENNReal

namespace QAlgorithms.Papers.Independent.Intakenext100.P35

open QAlgorithms.Papers.Independent.Renew46.P11 (HolomorphicBernstein)

attribute [local instance] Classical.propDecidable

universe u

/-- Lemma 3.5, arXiv:2202.03143v1, PDF page(s) 8, 9. -/
theorem lemma_3_5
(fs : ℕ → AnalyticSymbol) (f g : AnalyticSymbol) (hfs : BConvergence fs f)
(hg : BesovClass g) (hvanish : Vanishes g) :
    BesovClass f ∧ NormConverges bSize (fun n => (fs n - f) * g) 0 := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P35

end
Source
Bounded functional calculi for unbounded operators, arXiv:2202.03143v1, PDF p. 8, Lemma 3.5
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

Let H={z∈C:Re⁡z>0}H=\{z\in\mathbb C:\operatorname{Re}z>0\}H={z∈C:Rez>0}, and for any h:C→Ch:\mathbb C\to\mathbb Ch:C→C put

S(h)=∫0∞sup⁡b∈R∣h′(a+ib)∣ da,N(h)=sup⁡z∈H∣h(z)∣+S(h),S(h)=\int_0^\infty\sup_{b\in\mathbb R}|h'(a+ib)|\,da, \qquad N(h)=\sup_{z\in H}|h(z)|+S(h),S(h)=∫0∞​b∈Rsup​∣h′(a+ib)∣da,N(h)=z∈Hsup​∣h(z)∣+S(h),

with nonnegative extended suprema and integrals. Let (fn)n∈N(f_n)_{n\in\mathbb N}(fn​)n∈N​ be a sequence of functions C→C\mathbb C\to\mathbb CC→C, and let f,g:C→Cf,g:\mathbb C\to\mathbb Cf,g:C→C. Assume every fnf_nfn​ is complex differentiable on HHH with S(fn)<∞S(f_n)<\inftyS(fn​)<∞; there is a real CCC, with no sign condition, such that N(fn)≤max⁡(C,0)N(f_n)\le\max(C,0)N(fn​)≤max(C,0) for every nnn; fn(z)→f(z)f_n(z)\to f(z)fn​(z)→f(z) for every z∈Hz\in Hz∈H; and for every real r>0r>0r>0 and ε>0\varepsilon>0ε>0, there is a real d>0d>0d>0 such that, for every 0<δ<d0<\delta<d0<δ<d and every nnn,

∫(0,δ)sup⁡b∈R∣b∣≤r∣fn′(a+ib)∣ da<ε.\int_{(0,\delta)}\sup_{\substack{b\in\mathbb R\\ |b|\le r}} |f_n'(a+ib)|\,da<\varepsilon.∫(0,δ)​b∈R∣b∣≤r​sup​∣fn′​(a+ib)∣da<ε.

Assume also that ggg is complex differentiable on HHH, S(g)<∞S(g)<\inftyS(g)<∞, and g(z)→0g(z)\to0g(z)→0 as zzz stays in HHH and ∣z∣→+∞|z|\to+\infty∣z∣→+∞. Then fff is complex differentiable on HHH with S(f)<∞S(f)<\inftyS(f)<∞, and

N((fn−f)g)⟶0;N\bigl((f_n-f)g\bigr)\longrightarrow0;N((fn​−f)g)⟶0;

explicitly, for every real ε>0\varepsilon>0ε>0, there is k∈Nk\in\mathbb Nk∈N such that N((fn−f)g)<εN((f_n-f)g)<\varepsilonN((fn​−f)g)<ε for every n≥kn\ge kn≥k.

Human review
  • Endorsed by Shuze Chen · Oct 31, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Oct 31, 2026

    Confirmed by the mission captain (proposal self-audit).

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