Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 4.14

Open
QAlgorithms.Papers.Independent.Intakenext100.P35.theorem_4_14

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

prove2quantum

The span of constants and resolvents rλr_\lambdarλ​, Re⁡λ>0\operatorname{Re}\lambda>0Reλ>0, is dense in Ds\mathcal D_sDs​ for every s>−1s>-1s>−1. However, for s>0s>0s>0,

B‾∥⋅∥Ds∞≠Ds∞.\overline{\mathcal B}^{\|\cdot\|_{\mathcal D_s^\infty}}\ne\mathcal D_s^\infty.B∥⋅∥Ds∞​​=Ds∞​.

The second assertion uses the stronger bounded-subalgebra norm, not the Ds\mathcal D_sDs​ norm.

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

/-- Theorem 4.14, arXiv:2202.03143v1, PDF page(s) 23. -/
theorem theorem_4_14
:
    (∀ s : ℝ, -1 < s → ∀ f, D s f →
      NormClosure (ResolventSpan hp hp true) (dSize s) f) ∧
    (∀ s : ℝ, 0 < s → ∃ f, DBounded s f ∧ ¬ NormClosure BesovClass (dBoundedSize s) f) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P35

end
Source
Bounded functional calculi for unbounded operators, arXiv:2202.03143v1, PDF p. 23, Theorem 4.14
Read-back

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

Let H={z∈C:Re⁡z>0}\mathbb H=\{z\in\mathbb C:\operatorname{Re}z>0\}H={z∈C:Rez>0}. For a global function u:C→Cu:\mathbb C\to\mathbb Cu:C→C, define

Vs(u)=∫0∞∫Ras(a2+b2)(s+1)/2∣u(a+ib)∣ db da,ds(u)=∣u∞∣+Vs(u′),ds b(u)=sup⁡z∈H∣u(z)∣+Vs(u′),V_s(u)=\int_0^\infty\int_{\mathbb R} \frac{a^s}{(a^2+b^2)^{(s+1)/2}}|u(a+ib)|\,db\,da, \quad d_s(u)=|u_\infty|+V_s(u'), \quad d_s^{\,b}(u)=\sup_{z\in\mathbb H}|u(z)|+V_s(u'),Vs​(u)=∫0∞​∫R​(a2+b2)(s+1)/2as​∣u(a+ib)∣dbda,ds​(u)=∣u∞​∣+Vs​(u′),dsb​(u)=z∈Hsup​∣u(z)∣+Vs​(u′),

where u∞u_\inftyu∞​ is the limit of u(t)u(t)u(t) as real t→+∞t\to+\inftyt→+∞, or zero if no such limit exists, and the nonnegative integrals and suprema take values in [0,∞][0,\infty][0,∞]. Say that Ds(u)D_s(u)Ds​(u) holds when uuu is holomorphic on H\mathbb HH, (a,b)↦u′(a+ib)(a,b)\mapsto u'(a+ib)(a,b)↦u′(a+ib) is almost everywhere strongly measurable for Lebesgue measure on (0,∞)×R(0,\infty)\times\mathbb R(0,∞)×R, and Vs(u′)<∞V_s(u')<\inftyVs​(u′)<∞. For every real s>−1s>-1s>−1 and every f:C→Cf:\mathbb C\to\mathbb Cf:C→C satisfying Ds(f)D_s(f)Ds​(f), the following approximation holds: for every ε>0\varepsilon>0ε>0, there exist a global function R:C→CR:\mathbb C\to\mathbb CR:C→C, a natural number nnn, complex numbers c0,cj,λjc_0,c_j,\lambda_jc0​,cj​,λj​ for 0≤j<n0\le j<n0≤j<n, with each λj∈H\lambda_j\in\mathbb Hλj​∈H, such that

R(z)=c0+∑j=0n−1cjλj+z(z∈H),ds(R−f)<ε.R(z)=c_0+\sum_{j=0}^{n-1}\frac{c_j}{\lambda_j+z} \quad(z\in\mathbb H), \qquad d_s(R-f)<\varepsilon.R(z)=c0​+j=0∑n−1​λj​+zcj​​(z∈H),ds​(R−f)<ε.

The case n=0n=0n=0 is allowed and gives a constant on H\mathbb HH; no condition on RRR outside H\mathbb HH is imposed by the displayed representation. In addition, for every real s>0s>0s>0, there exists a global fff satisfying Ds(f)D_s(f)Ds​(f) and sup⁡z∈H∣f(z)∣<∞\sup_{z\in\mathbb H}|f(z)|<\inftysupz∈H​∣f(z)∣<∞ for which approximation by Besov-class functions fails in ds bd_s^{\,b}dsb​: explicitly, there is an ε>0\varepsilon>0ε>0 such that every global function ggg holomorphic on H\mathbb HH with

∫0∞sup⁡b∈R∣g′(a+ib)∣ da<∞\int_0^\infty\sup_{b\in\mathbb R}|g'(a+ib)|\,da<\infty∫0∞​b∈Rsup​∣g′(a+ib)∣da<∞

satisfies ds b(g−f)≥εd_s^{\,b}(g-f)\ge\varepsilondsb​(g−f)≥ε.

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