Math 2.0

Operator theory Theorem

Resolvent as Laplace transform of a semigroup

Builds on Banach spaceC0-semigroupGenerator of a semigroupResolvent setLaplace transform

Statement

Let XX be a complex Banach space, and let (T(t))t≥0(T(t))_{t \ge 0} be a C0C_0-semigroup on XX with generator AA. Let M≥1M \ge 1 and ω∈ℝ\omega \in \R be constants with ∥T(t)∥≤Meωt\norm{T(t)} \le M e^{\omega t} for all t≥0t \ge 0. Then every complex λ\lambda with Re⁡λ>ω\operatorname{Re} \lambda > \omega lies in the resolvent set of AA, and for every x∈Xx \in X, (λI−A)−1x=∫0∞e−λt T(t)x dt=lim⁡r→∞∫0re−λt T(t)x dt.(\lambda I - A)^{-1} x = \int_0^\infty e^{-\lambda t} \, T(t) x \, dt = \lim_{r \to \infty} \int_0^r e^{-\lambda t} \, T(t) x \, dt. Moreover ∥(λI−A)−1∥≤M/(Re⁡λ−ω)\norm{(\lambda I - A)^{-1}} \le M / (\operatorname{Re} \lambda - \omega).

Remarks

Constants MM and ω\omega as above exist for every C0C_0-semigroup, by the uniform boundedness principle. Let R(λ)xR(\lambda) x denote the integral; it converges absolutely by the bound on ∥T(t)∥\norm{T(t)}, which also gives the norm estimate. A direct computation with the semigroup law shows 1h(T(h)−I)R(λ)x→λR(λ)x−x\frac{1}{h}(T(h) - I) R(\lambda) x \to \lambda R(\lambda) x - x as h→0+h \to 0^+, so R(λ)x∈D(A)R(\lambda) x \in D(A) and (λI−A)R(λ)x=x(\lambda I - A) R(\lambda) x = x. For x∈D(A)x \in D(A), AA commutes with the integral, so R(λ)(λI−A)x=xR(\lambda)(\lambda I - A) x = x. Example: for a square matrix AA and T(t)=etAT(t) = e^{t A}, the formula reads (λI−A)−1=∫0∞e−λtetA dt(\lambda I - A)^{-1} = \int_0^\infty e^{-\lambda t} e^{t A} \, dt when Re⁡λ\operatorname{Re} \lambda exceeds the real parts of all eigenvalues of AA.

Going deeper

For a student

The formula is the bridge between semigroups and their generators. It gives the necessity part of the Hille–Yosida theorem, and the norm bound M/(Re⁡λ−ω)M/(\operatorname{Re} \lambda - \omega) is exactly the resolvent estimate in that theorem. Conversely, one recovers T(t)T(t) from the resolvent by a complex inversion integral or by T(t)x=lim⁡n→∞(ntR(nt))nxT(t) x = \lim_{n \to \infty} \left(\frac{n}{t} R(\frac{n}{t})\right)^n x, an operator form of Post's inversion formula.

Reading path

To understand this page from the ground up, read these 41 pages in order. The foundations come first.

  1. C0-semigroup concept
  2. Element definition
  3. Extended real number line object
  4. Generator of a semigroup concept
  5. Laplace transform concept
  6. Proposition concept
  7. Real numbers object
  8. Resolvent set concept
  9. Set bounded above definition
  10. Set definition
  11. Conjunction definition
  12. Disjunction definition
  13. Implication definition
  14. Predicate definition
  15. Supremum definition
  16. Empty set object
  17. Family of sets definition
  18. Ordered pair definition
  19. Intersection definition
  20. Union definition
  21. Existential quantifier definition
  22. Universal quantifier definition
  23. Cartesian product definition
  24. Subset definition
  25. Union of a family of sets definition
  26. Uniqueness quantifier definition
  27. Binary relation definition
  28. Topological space definition
  29. Function definition
  30. Metric space definition
  31. Convergence of a sequence in a metric space definition
  32. Open ball definition
  33. Diameter of a set definition
  34. Metric topology definition
  35. Epsilon characterisation of Cauchy sequences statement
  36. Complete metric space definition
  37. Open set definition
  38. Equivalent metrics definition
  39. Equivalent norms definition
  40. Banach space definition
  41. Resolvent as Laplace transform of a semigroup statement

Further reading

  1. Web https://en.wikipedia.org/wiki/C0-semigroup
About this page
TagSXNWHN2C01
URIm2://SXNWHN2C01
Kindstatement, theorem
WritingW0 stub
MSC47D06, 47A10, 44A10
StatusThis copy of the site has no build data. Run m2 status SXNWHN2C01.
AboutC0-semigroup, Resolvent
UsesBanach space, C0-semigroup, Generator of a semigroup, Resolvent set, Laplace transform

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.