Math 2.0

statement proposition

Laplace transform of a derivative

Statement

Let f:[0,∞)→Cf : [0, \infty) \to \mathbb{C} be continuously differentiable, and let M,aM, a be real constants with ∣f(t)∣≤Meat|f(t)| \le M e^{a t} for all t≥0t \ge 0. Let FF be the Laplace transform of ff. Then for each s∈Cs \in \mathbb{C} with Re⁡s>a\operatorname{Re} s > a, the Laplace transform of f′f' converges at ss and L{f′}(s)=sF(s)−f(0).\mathcal{L}\{f'\}(s) = s F(s) - f(0).

Remarks

Proof: integration by parts gives ∫0Tf′(t)e−st dt=f(T)e−sT−f(0)+s∫0Tf(t)e−st dt\int_0^T f'(t) e^{-st}\, dt = f(T) e^{-sT} - f(0) + s \int_0^T f(t) e^{-st}\, dt. The term f(T)e−sTf(T) e^{-sT} tends to 00 for Re⁡s>a\operatorname{Re} s > a. Applied twice, under the same hypotheses on ff and f′f': L{f′′}(s)=s2F(s)−sf(0)−f′(0)\mathcal{L}\{f''\}(s) = s^2 F(s) - s f(0) - f'(0). This rule is the basis of solving initial value problems with the Laplace transform. The initial values enter the transformed equation directly.

Explanations

L1 human

Differentiation in time becomes multiplication by ss after the transform, with a correction by the initial value. So a differential equation becomes an algebraic equation for FF.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

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

What this needs

To read this node, read these 3 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Function concept
  2. Laplace transform definition
  3. Laplace transform of a derivative statement

What depends on this

1 node uses this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Laplace_transform, Transform of a function's derivative
  2. Web https://en.wikipedia.org/wiki/Laplace_transform, Properties and theorems