4.6.32 · D1Ordinary Differential Equations

Foundations — Convolution theorem — proof, applications

1,948 words9 min readBack to topic

This page assumes you have seen nothing. Before we can even read , we must earn every squiggle in it: what a function is, what an integral pictures, what that big with actually does, what a dummy variable is, and why "arguments that add to " is the whole trick. We build them in an order where each one leans only on the ones before it.


0. The map of what we are about to build

function f of t

area under a curve = integral

dummy variable tau

improper integral to infinity

the exponential e to the minus s t

Laplace transform F of s

shift and flip g of t minus tau

convolution f star g

Convolution Theorem

solve ODEs and integral equations

Read it top to bottom: functions and integrals feed everything; the exponential builds the Laplace transform; shifting/flipping builds convolution; the two streams meet at the theorem.


1. A function — a machine that turns a number into a number

The picture is a graph: the horizontal axis is the input , the vertical axis is the output . A curve is just "for each , how tall is ".

Figure — Convolution theorem — proof, applications

2. The integral — adding up infinitely many thin slivers

The stretched-S symbol is literally an old-fashioned "S" for Sum. The is not decoration — it tells you which variable you are sweeping and reminds you each strip has width "".

Figure — Convolution theorem — proof, applications
Recall Signed area, all cases
  • on ::: integral is positive (area above axis).
  • on part ::: that part subtracts (area below axis).
  • ::: integral is (no width, nothing to add).
  • everywhere ::: integral is .

3. The dummy variable — a name that lives only inside the integral

Picture as a pointer sweeping from the lower limit to the upper limit, tapping each strip once.


4. The improper integral — never stop adding


5. The exponential — the "shrinking weight"

Figure — Convolution theorem — proof, applications
Recall Behaviour of

in every case ()

  • ::: value is .
  • , large ::: value (decays — good for convergence).
  • ::: value is for all (no shrinking).
  • ::: value grows, integral may diverge — Laplace needs large enough.

6. The Laplace transform — reweigh a whole function into one -curve

Figure — Convolution theorem — proof, applications

7. Shift and flip: — the heart of convolution

Before convolution can make sense, we must understand what plugging into a function does to its picture.

Figure — Convolution theorem — proof, applications

8. Convolution — assembling all the earned pieces

This convolution then powers the applications: solving ODEs (see Solving Linear ODEs with Laplace Transforms) and Volterra Integral Equations, and it reappears (with different limits) in the Fourier Transform Convolution Theorem and in Transfer Functions and Impulse Response.


9. A tiny sanity computation with everything assembled


Equipment checklist

Test yourself — cover the right side of each ::: and see if you can answer instantly.

What does mean in one phrase?
A rule turning input number into exactly one output number; its graph is height-vs-.
What does picture?
The signed area under the curve between and = sum of thin strips.
What is a dummy variable like ?
A name that lives only inside the integral, labelling the current strip; renaming it changes nothing.
Why does the Laplace integral need ?
It's a weight that is at , shrinks to force convergence over , and turns products of exponentials into sums of exponents.
What is ?
The Laplace transform of : , a function in the -world (not ).
What are and ?
and .
What does do to the graph of ?
Flips it left-right, then slides it right by .
Why do the convolution arguments add to ?
; each pair of times summing to contributes to the value at .
Why is the convolution upper limit ?
Causality — for , so those slivers add zero.
What is ?
.

Connections