Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 3.18

Open
QAlgorithms.Papers.Independent.Intakenext100.P35.theorem_3_18

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

prove2quantum

Suppose −A-A−A generates either a bounded C0-semigroup on a Hilbert space or a bounded holomorphic C0-semigroup on a Banach space. Let f,f′∈Bf,f'\in\mathcal Bf,f′∈B. For x∈D(A)x\in D(A)x∈D(A),

lim⁡t↓0f(tA)x−f(0)xt=f′(0)Ax.\lim_{t\downarrow0}\frac{f(tA)x-f(0)x}{t}=f'(0)Ax.t↓0lim​tf(tA)x−f(0)x​=f′(0)Ax.

Conversely, when f′(0)≠0f'(0)\ne0f′(0)=0, existence of this limit for x∈Xx\in Xx∈X implies x∈D(A)x\in D(A)x∈D(A) and the displayed identity. In particular f′(0)=−1f'(0)=-1f′(0)=−1 identifies the natural right derivative with −A-A−A. This extends the generator derivative beyond the exponential symbol.

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.18, arXiv:2202.03143v1, PDF page(s) 16. -/
theorem theorem_3_18
{X : Type u} [NormedAddCommGroup X] [NormedSpace ℂ X] [CompleteSpace X]
(A : DenseClosedGraphOperator X) (hA : HilbertGenerator A ∨ SectorialBelow A)
(f : AnalyticSymbol) (hf : BesovClass f) (hdf : BesovClass (deriv f)) :
    (∀ x y : X, (x, y) ∈ A.graph →
      Tendsto (fun t : ℝ => (t : ℂ)⁻¹ •
        (bOperator A (fun z => f ((t : ℂ) * z)) x - zeroValue f • x))
        (𝓝[>] 0) (𝓝 (zeroValue (deriv f) • y))) ∧
    (zeroValue (deriv f) ≠ 0 → ∀ x : X,
      (∃ v : X, Tendsto (fun t : ℝ => (t : ℂ)⁻¹ •
        (bOperator A (fun z => f ((t : ℂ) * z)) x - zeroValue f • x))
        (𝓝[>] 0) (𝓝 v)) →
      ∃ y : X, (x, y) ∈ A.graph ∧
        Tendsto (fun t : ℝ => (t : ℂ)⁻¹ •
          (bOperator A (fun z => f ((t : ℂ) * z)) x - zeroValue f • x))
          (𝓝[>] 0) (𝓝 (zeroValue (deriv f) • y))) ∧
    (zeroValue (deriv f) = -1 → ∀ x y : X,
      ((x, y) ∈ A.graph ↔
        Tendsto (fun t : ℝ => (t : ℂ)⁻¹ •
          (bOperator A (fun z => f ((t : ℂ) * z)) x - zeroValue f • x))
          (𝓝[>] 0) (𝓝 (-y)))) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P35

end
Source
Bounded functional calculi for unbounded operators, arXiv:2202.03143v1, PDF p. 16, Theorem 3.18
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 either that XXX admits a complex inner-product-space structure inducing its specified complex normed-space structure and there exists a uniformly bounded family T(t)T(t)T(t) for t≥0t\ge0t≥0, with T(0)=IT(0)=IT(0)=I, T(s+t)=T(s)T(t)T(s+t)=T(s)T(t)T(s+t)=T(s)T(t) for s,t>0s,t>0s,t>0, continuous trajectories on [0,∞)[0,\infty)[0,∞), and (x,y)∈A(x,y)\in A(x,y)∈A exactly when (T(t)x−x)/t→−y(T(t)x-x)/t\to-y(T(t)x−x)/t→−y as t↓0t\downarrow0t↓0; or that there is 0≤θ<π/20\le\theta<\pi/20≤θ<π/2 with ΣA⊆Sθ‾\Sigma_A\subseteq\overline{S_\theta}ΣA​⊆Sθ​​ and, for every θ<ψ<π\theta<\psi<\piθ<ψ<π, a constant Cψ≥0C_\psi\ge0Cψ​≥0 such that ∥zRA(z)∥≤Cψ\lVert zR_A(z)\rVert\le C_\psi∥zRA​(z)∥≤Cψ​ for all z∈Sπ−ψz\in S_{\pi-\psi}z∈Sπ−ψ​, where S0S_0S0​ is the positive real axis and Sη={z≠0:∣arg⁡z∣<η}S_\eta=\{z\ne0:|\arg z|<\eta\}Sη​={z=0:∣argz∣<η} when η≠0\eta\ne0η=0. Let f:C→Cf:\mathbb C\to\mathbb Cf:C→C be such that both fff and its complex derivative f′f'f′ are holomorphic on the open right half-plane and, for h=fh=fh=f and h=f′h=f'h=f′, ∫0∞sup⁡b∣h′(a+ib)∣ da<∞\int_0^\infty\sup_b|h'(a+ib)|\,da<\infty∫0∞​supb​∣h′(a+ib)∣da<∞. For any hhh, let h0h_0h0​ be its limit along positive real numbers tending to 000, if it exists, and 000 otherwise; define h∞h_\inftyh∞​ analogously along positive real numbers tending to infinity. Define BA(h)B_A(h)BA​(h) by choosing a bounded operator BBB satisfying, for every x,ℓx,\ellx,ℓ, almost everywhere strong measurability and absolute integrability of a ℓ(RA(a−ib)2x)h′(a+ib)a\,\ell(R_A(a-ib)^2x)h'(a+ib)aℓ(RA​(a−ib)2x)h′(a+ib), together with ℓ(Bx)=h∞ℓ(x)−2π∫0∞∫Ra ℓ(RA(a−ib)2x)h′(a+ib) db da\ell(Bx)=h_\infty\ell(x)-\frac2\pi\int_0^\infty\int_{\mathbb R}a\,\ell(R_A(a-ib)^2x)h'(a+ib)\,db\,daℓ(Bx)=h∞​ℓ(x)−π2​∫0∞​∫R​aℓ(RA​(a−ib)2x)h′(a+ib)dbda, and use 000 if no such operator exists. Put c=(f′)0c=(f')_0c=(f′)0​ and

Δtx=BA(z↦f(tz))x−f0xt.\Delta_t x=\frac{B_A(z\mapsto f(tz))x-f_0x}{t}.Δt​x=tBA​(z↦f(tz))x−f0​x​.

Then Δtx→cy\Delta_t x\to cyΔt​x→cy as t↓0t\downarrow0t↓0 for every (x,y)∈A(x,y)\in A(x,y)∈A. If c≠0c\ne0c=0, then for every x∈Xx\in Xx∈X, existence of any limit Δtx→v∈X\Delta_t x\to v\in XΔt​x→v∈X as t↓0t\downarrow0t↓0 implies that there exists yyy with (x,y)∈A(x,y)\in A(x,y)∈A and Δtx→cy\Delta_t x\to cyΔt​x→cy. If c=−1c=-1c=−1, then for all x,y∈Xx,y\in Xx,y∈X,

(x,y)∈A⟺Δtx⟶−y(t↓0).(x,y)\in A\quad\Longleftrightarrow\quad\Delta_t x\longrightarrow-y\quad(t\downarrow0).(x,y)∈A⟺Δt​x⟶−y(t↓0).

The values f0f_0f0​ and ccc use the stated limit-or-zero convention; they are not defined by evaluating fff or f′f'f′ at 000.

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