Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Section 3 Application 4: Cayley powers and their B norms

Open
QAlgorithms.Papers.Independent.Intakenext100.P35.cayley_logarithmic

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

prove2quantum

For V(z)=(z−1)/(z+1)V(z)=(z-1)/(z+1)V(z)=(z−1)/(z+1), its scalar Besov norms satisfy

∥Vn∥B≍log⁡n(n→∞).\|V^n\|_{\mathcal B}\asymp\log n\qquad(n\to\infty).∥Vn∥B​≍logn(n→∞).

If −A-A−A generates a bounded C0-semigroup on a Hilbert space, then ∥V(A)n∥≤CA∥Vn∥B\|V(A)^n\|\le C_A\|V^n\|_{\mathcal B}∥V(A)n∥≤CA​∥Vn∥B​ for every n≥0n\ge0n≥0, and consequently ∥V(A)n∥=O(log⁡n)\|V(A)^n\|=O(\log n)∥V(A)n∥=O(logn). The source leaves optimality of the operator bound open; no operator lower bound or power boundedness is asserted.

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

/-- Section 3 Application 4: Cayley powers and their B norms, arXiv:2202.03143v1, PDF page(s) 16. -/
theorem cayley_logarithmic
:
    (∃ c C : ℝ, 0 < c ∧ 0 < C ∧ ∃ N : ℕ, 2 ≤ N ∧ ∀ n : ℕ, N ≤ n →
      ENNReal.ofReal (c * Real.log n) ≤ bSize (fun z => scalarCayley z ^ n) ∧
      bSize (fun z => scalarCayley z ^ n) ≤ ENNReal.ofReal (C * Real.log n)) ∧
    (∀ (X : Type u) [NormedAddCommGroup X] [NormedSpace ℂ X] [CompleteSpace X],
      ∀ A : DenseClosedGraphOperator X, HilbertGenerator A →
      (∃ C : ℝ, 0 < C ∧ ∀ n : ℕ,
        ENNReal.ofReal ‖operatorCayley A ^ n‖ ≤
          ENNReal.ofReal C * bSize (fun z => scalarCayley z ^ n)) ∧
      (∃ C : ℝ, 0 < C ∧ ∃ N : ℕ, 2 ≤ N ∧ ∀ n : ℕ, N ≤ n →
        ‖operatorCayley A ^ n‖ ≤ C * Real.log n)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P35

end
Source
Bounded functional calculi for unbounded operators, arXiv:2202.03143v1, PDF p. 16, Section 3 Application 4: Cayley powers and their B norms
Read-back

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

For a total symbol h:C→Ch:\mathbb C\to\mathbb Ch:C→C, put H={z:Re⁡z>0}H=\{z:\operatorname{Re}z>0\}H={z:Rez>0} and define its extended nonnegative size by

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

where the integral is the extended nonnegative Lebesgue integral and ofReal⁡(r)=max⁡(r,0)\operatorname{ofReal}(r)=\max(r,0)ofReal(r)=max(r,0). Put c(z)=(z−1)/(z+1)c(z)=(z-1)/(z+1)c(z)=(z−1)/(z+1), using total complex division, so c(−1)=0c(-1)=0c(−1)=0. The declaration asserts, first, that there exist real constants c0,C0>0c_0,C_0>0c0​,C0​>0 and a natural number N≥2N\ge2N≥2 such that every natural number n≥Nn\ge Nn≥N satisfies

ofReal⁡(c0log⁡n)≤b(z↦c(z)n)≤ofReal⁡(C0log⁡n).\operatorname{ofReal}(c_0\log n)\le b\bigl(z\mapsto c(z)^n\bigr) \le\operatorname{ofReal}(C_0\log n).ofReal(c0​logn)≤b(z↦c(z)n)≤ofReal(C0​logn).

Second, let XXX be any complex Banach space and let AAA be given by a closed complex linear subspace GA⊆X×XG_A\subseteq X\times XGA​⊆X×X that is single valued and has dense domain. Suppose there exists a complex inner product on XXX whose induced complex normed-space structure equals the given one, and there exists a family of bounded complex linear maps Tt:X→XT_t:X\to XTt​:X→X, indexed by all real ttt, such that T0=IT_0=IT0​=I, Ts+t=TsTtT_{s+t}=T_sT_tTs+t​=Ts​Tt​ whenever s,t>0s,t>0s,t>0, there exists M≥0M\ge0M≥0 with ∥Tt∥≤M\|T_t\|\le M∥Tt​∥≤M for all t≥0t\ge0t≥0, and t↦Ttxt\mapsto T_txt↦Tt​x is continuous on both (0,∞)(0,\infty)(0,∞) and [0,∞)[0,\infty)[0,∞) for every x∈Xx\in Xx∈X. Suppose this family also satisfies, for every x,y∈Xx,y\in Xx,y∈X,

(x,y)∈GA⟺lim⁡t↓0Ttx−xt=−y.(x,y)\in G_A \quad\Longleftrightarrow\quad \lim_{t\downarrow0}\frac{T_tx-x}{t}=-y.(x,y)∈GA​⟺t↓0lim​tTt​x−x​=−y.

Let RA(1)R_A(1)RA​(1) be a selected bounded complex linear map RRR satisfying (Rx,x−Rx)∈GA(Rx,x-Rx)\in G_A(Rx,x−Rx)∈GA​ for every xxx and R(x+y)=xR(x+y)=xR(x+y)=x for every (x,y)∈GA(x,y)\in G_A(x,y)∈GA​, or the zero map if no such RRR exists, and put CA=I−2RA(1)C_A=I-2R_A(1)CA​=I−2RA​(1). Then there exists a real constant C>0C>0C>0 such that, for every n∈Nn\in\mathbb Nn∈N,

ofReal⁡∥CAn∥≤ofReal⁡(C) b(z↦c(z)n),\operatorname{ofReal}\|C_A^n\| \le\operatorname{ofReal}(C)\,b\bigl(z\mapsto c(z)^n\bigr),ofReal∥CAn​∥≤ofReal(C)b(z↦c(z)n),

and there also exist a real constant C′>0C'>0C′>0 and N′∈NN'\in\mathbb NN′∈N with N′≥2N'\ge2N′≥2 such that ∥CAn∥≤C′log⁡n\|C_A^n\|\le C'\log n∥CAn​∥≤C′logn for every n≥N′n\ge N'n≥N′. Operator powers use composition, and the comparison quantified over every nnn includes n=0n=0n=0, when both the operator power and the scalar function power are identities. The space XXX may be the zero space; the semigroup conditions impose no requirements on negative times.

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