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:

F(f(at+b))=1|a|e2Ο€isba(Ff)(sa).

As a special case of this, when a=1 we have the following "stretch theorem":

F(f(t+b))=e2Ο€isbβ‹…Ff.

In other words, shifting the input of f by b simply "costs" a factor of e2Ο€isb on the transform of f. For example, we can instantly compute

F(Ξ (t+1))=e2Ο€issinc(s).

This property can potentially save us from lots of tedious integration.

There's also the corresponding property for the inverse Fourier transform, namely

Fβˆ’1(F(s+b))=eβˆ’2Ο€itbβ‹…Fβˆ’1F.

How about the Laplace transform? Let's take a look and see!

The first shift theorem


Let's start by computing

L(f(t+b))=∫0∞f(t+b)eβˆ’tsdt=∫b∞f(u)eβˆ’(uβˆ’b)sdu(usingΒ u=t+b)=ebs∫b∞f(u)eβˆ’usdu=ebs∫b∞f(t)eβˆ’tsdt

This last integral almost looks like the Fourier transform of f, except that the lower bound is b and not 0. In order to fix this issue, let's introduce the function

ub(t)={0,0≀t<b1,tβ‰₯b

We call this the unit step function at time t=b. It's graph is simply

coming soon

We can think of ub(t) as like a "switch" that "turns on" at time t=b. In particular, note that

∫0∞ub(t)f(t)eβˆ’tsdt=∫b∞f(t)eβˆ’tsdt.

Based on our work above, we can thus conclude:

L(f(t+b))=ebsβ‹…L(ub(t)f(t)).

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:

L(ubβ‹…f)=eβˆ’bsL(f(t+b)).

Example

Consider the piecewise-defined function

f(t)={0,0≀t<1tβˆ’1,1≀t<21,2≀t

We can rewrite f(t) as a combination of its "component" functions using step functions to "turn on" and "turn off" the various components. Indeed, we claim that

f(t)=(u0(t)βˆ’u1(t))β‹…0+(u1(t)βˆ’u2(t))β‹…(tβˆ’1)+u2(t)β‹…1.

To verify this, simply note that:

We can now simplify our expression for f(t), gathering terms according to step functions. We eventually find

f(t)=u1(t)β‹…(tβˆ’1)+u2(t)β‹…(2βˆ’t).

It then follows that

Lf=L(u1β‹…(tβˆ’1))+L(u2β‹…(2βˆ’t))=eβˆ’1β‹…sL((t+1)βˆ’1)+eβˆ’2sL(2βˆ’(t+2))=eβˆ’sL(t)+eβˆ’2sL(βˆ’t)=eβˆ’s1s2βˆ’eβˆ’2s1s2.

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

L(ubβ‹…f)=eβˆ’bsL(f∣t↦t+b)

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:

Lβˆ’1(eβˆ’bsF)=ubβ‹…(Lβˆ’1F)∣t↦tβˆ’b

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

Lβˆ’1(2eβˆ’ss2+4)=Lβˆ’1(eβˆ’sβ‹…2s2+4)=u1(t)β‹…(Lβˆ’1(2s4+4))∣t↦tβˆ’1=u1(t)β‹…(sin⁑(2t))∣t↦tβˆ’1=u1(t)β‹…sin⁑(2(tβˆ’1)).

The second shift theorem


Recall that the shifting property for the inverse Fourier transform is

Fβˆ’1(F(s+b))=eβˆ’2Ο€itbβ‹…Fβˆ’1F.

We claim that we similarly have

Lβˆ’1(F(s+b))=eβˆ’btβ‹…Lβˆ’1F

To verify this, let f(t)=Lβˆ’1F, so that Lf=F, and observe

L(eβˆ’btf(t))=∫0∞eβˆ’btf(t)eβˆ’tsdt=∫0∞eβˆ’t(s+b)dt=(Lf)(s+b)=F(s+b).

This proves eβˆ’btf(t)=Lβˆ’1(F(s+b)), as claimed.

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:

Lβˆ’1F=eβˆ’btLβˆ’1(F∣s↦sβˆ’b).

I read this as "If I'm doing an inverse transform, I can step back by b before transforming if I pay the cost of a negative exponential."

Example

Consider the function F(s)=1s2+2s+2. In this form, we don't have much hope of computing its inverse transform. However, if we complete the square in the denominator, then we see that

F(s)=1(s+1)2+1,

and so if we "stepped back" by 1 we would have the function

F(sβˆ’1)=1s2+1,

whose inverse transform we do know.

With this idea in mind, using the above shifting property we can compute

Lβˆ’1F=Lβˆ’1(1s2+2s+2)=Lβˆ’1(1(s+1)2+1)=eβˆ’1β‹…tLβˆ’1(1s2+1)=eβˆ’tsin⁑(t)

Just as with the first shifting theorem, we can "reverse" this theorem to give another shifting problem for the forward transform, namely:

L(eβˆ’btβ‹…f)=(Lf)∣s↦s+b.

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

L(eβˆ’3tt4)=(L(t4))∣s↦s+3=(4!s5)∣s↦s+3=4!(s+3)5.

In summary: the four shifting results


The Shifting Theorems

We have the following shifting theorems:

  1. L(ubβ‹…f)=eβˆ’bsL(f∣t↦t+b)⇔Lβˆ’1(eβˆ’bsF)=ubβ‹…(Lβˆ’1F)∣t↦tβˆ’b
  2. Lβˆ’1F=eβˆ’btLβˆ’1(F∣s↦sβˆ’b)⇔L(eβˆ’btβ‹…f)=(Lf)∣s↦s+b

Notice that the forward transforms always involve a step forward, the inverse transforms a step back, and everything always "costs" a negative exponential.

Suggested next notes


Laplace transform IV - Convolution redux