Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.16

Open
QAlgorithms.Papers.Independent.Intakenext100.P35.theorem_3_16

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

prove2quantum

Let AAA satisfy GSF, f∈Bf\in\mathcal Bf∈B, and λ∈C\lambda\in\mathbb Cλ∈C. Eigenvectors of AAA and eigenfunctionals of its Banach transpose with eigenvalue λ\lambdaλ remain eigenvectors and eigenfunctionals of f(A)f(A)f(A) with eigenvalue f(λ)f(\lambda)f(λ). Unit approximate eigenvectors have the same property. Also f(σ(A))⊂σ(f(A))f(\sigma(A))\subset\sigma(f(A))f(σ(A))⊂σ(f(A)). If A∈Sect⁡(π/2−)A\in\operatorname{Sect}(\pi/2-)A∈Sect(π/2−), then

σ(f(A))∪{f(∞)}=f(σ(A))∪{f(∞)}.\sigma(f(A))\cup\{f(\infty)\}=f(\sigma(A))\cup\{f(\infty)\}.σ(f(A))∪{f(∞)}=f(σ(A))∪{f(∞)}.

All five clauses describe the spectral behavior of the B-calculus.

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 3.16, arXiv:2202.03143v1, PDF page(s) 14, 15. -/
theorem theorem_3_16
{X : Type u} [NormedAddCommGroup X] [NormedSpace ℂ X] [CompleteSpace X]
(A : DenseClosedGraphOperator X) (hA : GSF A) (f : AnalyticSymbol) (hf : BesovClass f) (lam : ℂ) :
    (∀ x : X, (x, lam • x) ∈ A.graph →
      bOperator A f x = extension hp f lam • x) ∧
    (∀ ell : X →L[ℂ] ℂ, TransposeEigen A lam ell →
      ∀ x : X, ell (bOperator A f x) = extension hp f lam * ell x) ∧
    (∀ xs ys : ℕ → X, (∀ n, (xs n, ys n) ∈ A.graph ∧ ‖xs n‖ = 1) →
      Tendsto (fun n => ‖ys n - lam • xs n‖) atTop (𝓝 0) →
      Tendsto (fun n => ‖bOperator A f (xs n) - extension hp f lam • xs n‖)
        atTop (𝓝 0)) ∧
    (lam ∈ operatorSpectrum A → extension hp f lam ∈ spectrum ℂ (bOperator A f)) ∧
    (SectorialBelow A → spectrum ℂ (bOperator A f) ∪ {infinityValue f} =
      (extension hp f) '' operatorSpectrum A ∪ {infinityValue f}) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P35

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

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

Let XXX be a complex Banach space and let AAA have a closed, single-valued complex linear graph with dense domain. Define RA(z)R_A(z)RA​(z) to be a chosen bounded operator satisfying (RA(z)x,x−zRA(z)x)∈A(R_A(z)x,x-zR_A(z)x)\in A(RA​(z)x,x−zRA​(z)x)∈A for every xxx and RA(zx+y)=xR_A(zx+y)=xRA​(zx+y)=x for every (x,y)∈A(x,y)\in A(x,y)∈A, or 000 if none exists, and put ΣA={λ:no such operator exists at −λ}\Sigma_A=\{\lambda:\text{no such operator exists at }-\lambda\}ΣA​={λ:no such operator exists at −λ}. Assume ΣA⊆{Re⁡z≥0}\Sigma_A\subseteq\{\operatorname{Re}z\ge0\}ΣA​⊆{Rez≥0} and sup⁡a>0a∫R∣ℓ(RA(a+ib)2x)∣ db<∞\sup_{a>0}a\int_{\mathbb R}|\ell(R_A(a+ib)^2x)|\,db<\inftysupa>0​a∫R​∣ℓ(RA​(a+ib)2x)∣db<∞ for every xxx and bounded complex linear functional ℓ\ellℓ. Let f:C→Cf:\mathbb C\to\mathbb Cf:C→C be holomorphic on the open right half-plane with ∫0∞sup⁡b∣f′(a+ib)∣ da<∞\int_0^\infty\sup_b|f'(a+ib)|\,da<\infty∫0∞​supb​∣f′(a+ib)∣da<∞, and let λ∈C\lambda\in\mathbb Cλ∈C be arbitrary. Let f∞f_\inftyf∞​ be the positive-real-axis limit at infinity if it exists, and 000 otherwise. Define BA(f)B_A(f)BA​(f) by choosing a bounded operator BBB for which, for every x,ℓx,\ellx,ℓ, the kernel a ℓ(RA(a−ib)2x)f′(a+ib)a\,\ell(R_A(a-ib)^2x)f'(a+ib)aℓ(RA​(a−ib)2x)f′(a+ib) is almost everywhere strongly measurable and absolutely integrable on (0,∞)×R(0,\infty)\times\mathbb R(0,∞)×R, and ℓ(Bx)=f∞ℓ(x)−2π∫0∞∫Ra ℓ(RA(a−ib)2x)f′(a+ib) db da\ell(Bx)=f_\infty\ell(x)-\frac2\pi\int_0^\infty\int_{\mathbb R}a\,\ell(R_A(a-ib)^2x)f'(a+ib)\,db\,daℓ(Bx)=f∞​ℓ(x)−π2​∫0∞​∫R​aℓ(RA​(a−ib)2x)f′(a+ib)dbda, or by setting BA(f)=0B_A(f)=0BA​(f)=0 if no such operator exists. Define Ef(z)=f(z)E_f(z)=f(z)Ef​(z)=f(z) when Re⁡z>0\operatorname{Re}z>0Rez>0; otherwise, define Ef(z)E_f(z)Ef​(z) to be a chosen limit of fff as its argument approaches zzz within the open right half-plane, or 000 if no such limit exists. Then BA(f)x=Ef(λ)xB_A(f)x=E_f(\lambda)xBA​(f)x=Ef​(λ)x for every xxx with (x,λx)∈A(x,\lambda x)\in A(x,λx)∈A; for every bounded complex linear functional ℓ\ellℓ satisfying ℓ(y)=λℓ(x)\ell(y)=\lambda\ell(x)ℓ(y)=λℓ(x) whenever (x,y)∈A(x,y)\in A(x,y)∈A, one has ℓ(BA(f)x)=Ef(λ)ℓ(x)\ell(B_A(f)x)=E_f(\lambda)\ell(x)ℓ(BA​(f)x)=Ef​(λ)ℓ(x) for every xxx; and, for every pair of sequences xn,yn∈Xx_n,y_n\in Xxn​,yn​∈X with (xn,yn)∈A(x_n,y_n)\in A(xn​,yn​)∈A, ∥xn∥=1\lVert x_n\rVert=1∥xn​∥=1, and ∥yn−λxn∥→0\lVert y_n-\lambda x_n\rVert\to0∥yn​−λxn​∥→0, one has ∥BA(f)xn−Ef(λ)xn∥→0\lVert B_A(f)x_n-E_f(\lambda)x_n\rVert\to0∥BA​(f)xn​−Ef​(λ)xn​∥→0. Also, λ∈ΣA\lambda\in\Sigma_Aλ∈ΣA​ implies Ef(λ)∈σ(BA(f))E_f(\lambda)\in\sigma(B_A(f))Ef​(λ)∈σ(BA​(f)), where the latter is the usual spectrum of a bounded operator. Finally, suppose there exists 0≤θ<π/20\le\theta<\pi/20≤θ<π/2 such that ΣA⊆Sθ‾\Sigma_A\subseteq\overline{S_\theta}ΣA​⊆Sθ​​ and, for every θ<ψ<π\theta<\psi<\piθ<ψ<π, some Cψ≥0C_\psi\ge0Cψ​≥0 satisfies ∥zRA(z)∥≤Cψ\lVert zR_A(z)\rVert\le C_\psi∥zRA​(z)∥≤Cψ​ for every z∈Sπ−ψz\in S_{\pi-\psi}z∈Sπ−ψ​, where S0=(0,∞)⊂CS_0=(0,\infty)\subset\mathbb CS0​=(0,∞)⊂C and Sη={z≠0:∣arg⁡z∣<η}S_\eta=\{z\ne0:|\arg z|<\eta\}Sη​={z=0:∣argz∣<η} for η≠0\eta\ne0η=0. Then

σ(BA(f))∪{f∞}=Ef(ΣA)∪{f∞}.\sigma(B_A(f))\cup\{f_\infty\}=E_f(\Sigma_A)\cup\{f_\infty\}.σ(BA​(f))∪{f∞​}=Ef​(ΣA​)∪{f∞​}.

The eigenvector and functional assertions allow zero vectors and zero functionals; the approximate-vector assertion requires unit vectors. For Re⁡z<0\operatorname{Re}z<0Rez<0, the filter of approach within the open right half-plane is trivial, so the choice used in Ef(z)E_f(z)Ef​(z) is unconstrained by a limit condition.

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