Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 3.19

Open
QAlgorithms.Papers.Independent.Intakenext100.P35.proposition_3_19

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

prove2quantum

For t≥0t\ge0t≥0 let φt(z)=z(1+z)−1e−t/z\varphi_t(z)=z(1+z)^{-1}e^{-t/z}φt​(z)=z(1+z)−1e−t/z, a Laplace transform of a finite complex measure. There are positive constants and thresholds greater than one such that, for all sufficiently large ttt,

∥φt∥HP≲t,∥φt∥B≍log⁡t.\|\varphi_t\|_{\mathrm{HP}}\lesssim t,\qquad\|\varphi_t\|_{\mathcal B}\asymp\log t.∥φt​∥HP​≲t,∥φt​∥B​≍logt.

Only the Besov comparison is two-sided. These scalar bounds motivate the inverse-generator estimate.

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

/-- Proposition 3.19, arXiv:2202.03143v1, PDF page(s) 17. -/
theorem proposition_3_19
:
    (∀ t : ℝ, 0 ≤ t → LM (phiSymbol t)) ∧
    (∃ C T : ℝ, 0 < C ∧ 1 < T ∧ ∀ t : ℝ, T ≤ t →
      hpSize (phiSymbol t) ≤ ENNReal.ofReal (C * t)) ∧
    (∃ c C T : ℝ, 0 < c ∧ 0 < C ∧ 1 < T ∧ ∀ t : ℝ, T ≤ t →
      ENNReal.ofReal (c * Real.log t) ≤ bSize (phiSymbol t) ∧
      bSize (phiSymbol t) ≤ ENNReal.ofReal (C * Real.log t)) := by sorry

end QAlgorithms.Papers.Independent.Intakenext100.P35

end
Source
Bounded functional calculi for unbounded operators, arXiv:2202.03143v1, PDF p. 17, Proposition 3.19
Read-back

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

For real ttt, define the total function ϕt:C→C\phi_t:\mathbb C\to\mathbb Cϕt​:C→C by ϕt(z)=zz+1e−t/z\phi_t(z)=\frac{z}{z+1}e^{-t/z}ϕt​(z)=z+1z​e−t/z, with complex division by zero interpreted as zero, so in particular ϕt(0)=ϕt(−1)=0\phi_t(0)=\phi_t(-1)=0ϕt​(0)=ϕt​(−1)=0. Say that a function hhh has a Laplace representation if there exist a finite measure μ\muμ on R\mathbb RR, with μ((−∞,0))=0\mu((-\infty,0))=0μ((−∞,0))=0, and a μ\muμ-integrable function w:R→Cw:\mathbb R\to\mathbb Cw:R→C such that h(z)=∫e−ztw(t) dμ(t)h(z)=\int e^{-zt}w(t)\,d\mu(t)h(z)=∫e−ztw(t)dμ(t) for every Re⁡z>0\operatorname{Re}z>0Rez>0. Let H(h)H(h)H(h) be the infimum, in [0,∞][0,\infty][0,∞], of ∫∣w∣ dμ\int|w|\,d\mu∫∣w∣dμ over all such representations, with the infimum of an empty collection equal to infinity, and define

N(h)=sup⁡Re⁡z>0∣h(z)∣+∫0∞sup⁡b∈R∣h′(a+ib)∣ da.N(h)=\sup_{\operatorname{Re}z>0}|h(z)| +\int_0^\infty\sup_{b\in\mathbb R}|h'(a+ib)|\,da.N(h)=Rez>0sup​∣h(z)∣+∫0∞​b∈Rsup​∣h′(a+ib)∣da.

Then ϕt\phi_tϕt​ has a Laplace representation for every t≥0t\ge0t≥0, including t=0t=0t=0; there exist real constants C>0C>0C>0 and T>1T>1T>1 such that H(ϕt)≤CtH(\phi_t)\le CtH(ϕt​)≤Ct for every t≥Tt\ge Tt≥T; and there exist real constants c>0c>0c>0, C>0C>0C>0, and T>1T>1T>1 such that clog⁡t≤N(ϕt)≤Clog⁡tc\log t\le N(\phi_t)\le C\log tclogt≤N(ϕt​)≤Clogt for every t≥Tt\ge Tt≥T. The inequalities involving HHH and NNN are inequalities in the extended nonnegative reals, with real right-hand sides embedded by taking their nonnegative parts, and the constants in the two existence statements are chosen separately.

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