Laplace transform III - The Shifting Theorems
With the Fourier transform, we had the stretch-and-shift property that made computing Fourier transforms of slightly modified functions very easy, namely:
As a special case of this, when
In other words, shifting the input of
This property can potentially save us from lots of tedious integration.
There's also the corresponding property for the inverse Fourier transform, namely
How about the Laplace transform? Let's take a look and see!
The first shift theorem
Let's start by computing
This last integral almost looks like the Fourier transform of
We call this the unit step function at time
coming soon
We can think of
Based on our work above, we can thus conclude:
As currently written, this property doesn't look like it would be very helpful to us. After all, none of our "Fab Four" Laplace transforms involves a unit step function, so we are unlikely to ever know the Laplace transform on the right-hand side.
However, we can flip things around a bit and turn this into a more useful equality, namely:
Example
Consider the piecewise-defined function
We can rewrite
To verify this, simply note that:
takes the value on the interval and the value everywhere else takes the value on the interval and the value everywhere else takes the value on the interval and the value everywhere else
We can now simplify our expression for
It then follows that
We can also reverse this shifting property to give a formula for inverse Laplace transforms. First, let's express the original shifting property a little more suggestively, as
I like to read this as, "If you are transforming a step function times a known function, you can trade out the step function at the cost of a negative exponential term, and then transform the original function after first stepping forward by the step."
We can now reverse this rule to obtain the following:
In words, "If you are transforming back and see a negative exponential function, you can trade out the exponential for a step function and then transform back the original function, but remember to step back after you do."
Example
Using the above reverse shifting property, we can compute
The second shift theorem
Recall that the shifting property for the inverse Fourier transform is
We claim that we similarly have
To verify this, let
This proves
Before seeing an example, I would like to rewrite this shifting property in a way I find more helpful in real life, using similar notation to the previous one:
I read this as "If I'm doing an inverse transform, I can step back by
Example
Consider the function
and so if we "stepped back" by
whose inverse transform we do know.
With this idea in mind, using the above shifting property we can compute
Just as with the first shifting theorem, we can "reverse" this theorem to give another shifting problem for the forward transform, namely:
In word, "If you are computing a forward transform and see a negative exponential, you can just transform the function next to it, so long as you step forward after you do."
For example, we can use this to compute
In summary: the four shifting results
We have the following shifting theorems:
Notice that the forward transforms always involve a step forward, the inverse transforms a step back, and everything always "costs" a negative exponential.