Laplace Convolution Theorem: Multiply Transforms

By Vegard Gjerde • Based on Masterful Learning • 10 min read • Published
laplace-convolution-theorem differential-equations math learning-strategies

Laplace Convolution Theorem turns a time-domain convolution (f∗g)(t)(f*g)(t) into the product F(s)G(s)F(s)G(s) in the transform domain. The equality is exact: F(s)G(s)F(s)G(s) is the transform of the time-domain convolution, and it applies when F(s)=L{f(t)}F(s)=\mathcal{L}\{f(t)\}, G(s)=L{g(t)}G(s)=\mathcal{L}\{g(t)\}, and the convolution is defined. The fast failure check is whether the time-domain expression is a convolution, not ordinary multiplication.

Unisium hero image titled Laplace Convolution Theorem showing the principle equation and a conditions card.
The convolution theorem changes L{(f∗g)(t)}\mathcal{L}\{(f*g)(t)\} into F(s)G(s)F(s)G(s), so a time-domain integral structure becomes multiplication in the transform domain.

On this page: The Principle | Conditions | Failure Modes | EE Questions | Retrieval Practice | Practice Ground | Solve a Problem | Related Guides | FAQ


The Principle

The move: replace the Laplace transform of a time-domain convolution by the product of the individual Laplace transforms.

The invariant: the transform-domain product represents the same time-domain convolution, but the convolution integral has become algebraic multiplication.

Pattern:

L{(f∗g)(t)}=F(s)G(s)\mathcal{L}\{(f*g)(t)\}=F(s)G(s)
Legal routeIllegal route
L{(f∗g)(t)}⟹F(s)G(s)\mathcal{L}\{(f*g)(t)\}\Longrightarrow F(s)G(s)L{f(t)g(t)}⟹̸F(s)G(s)\mathcal{L}\{f(t)g(t)\}\not\Longrightarrow F(s)G(s)

The illegal route looks close because both expressions contain ff and gg. The theorem is about convolution, not pointwise multiplication.


Conditions of Applicability

Condition: F(s)=L{f(t)}F(s)=\mathcal{L}\{f(t)\}; G(s)=L{g(t)}G(s)=\mathcal{L}\{g(t)\}; convolution defined

This guide uses the ordinary one-sided Laplace-transform setting for differential equations, where

(f∗g)(t)=∫0tf(τ)g(t−τ) dτ.(f*g)(t)=\int_0^t f(\tau)g(t-\tau)\,d\tau.

Before applying, check: confirm that the expression inside the transform is a convolution of the same two functions whose transforms are F(s)F(s) and G(s)G(s).

If the condition is violated: the product F(s)G(s)F(s)G(s) may represent a different time-domain object, or no licensed convolution theorem step at all.

  • The theorem sends convolution in time to multiplication in the transform domain.
  • It does not say L{f(t)g(t)}=F(s)G(s)\mathcal{L}\{f(t)g(t)\}=F(s)G(s).
  • If you start from a product F(s)G(s)F(s)G(s) and return to time, the inverse move is a convolution.
  • This guide builds on Laplace Transform Definition and usually appears before an inverse-transform step like Inverse Laplace Transform Relation.

Want the complete framework behind this guide? Read Masterful Learning.


Common Failure Modes

Failure mode: treat ordinary multiplication f(t)g(t)f(t)g(t) as if it were convolution -> the product F(s)G(s)F(s)G(s) is attached to the wrong time-domain structure.

Debug: look for the convolution integral, or the notation (f∗g)(t)(f*g)(t), before multiplying transforms.


Elaborative Encoding

Use these questions to build deep understanding. (See Elaborative Encoding for the full method.)

Within the Principle

  • What does (f∗g)(t)(f*g)(t) mean in the one-sided Laplace setting, and where does the upper limit tt appear?
  • Why does the transform-domain result use multiplication even though the time-domain expression is an integral?

For the Principle

  • What check tells you whether a time-domain expression is eligible for the convolution theorem?
  • How would the step change if you were given F(s)G(s)F(s)G(s) and asked to return to a time-domain expression?

Between Principles

Generate an Example

  • Write one legal convolution-transform step and one near miss where a student incorrectly transforms f(t)g(t)f(t)g(t) as F(s)G(s)F(s)G(s).

Retrieval Practice

Answer from memory, then click to reveal and check. (See Retrieval Practice for the full method.)

State the move in one sentence: _____Transform a time-domain convolution into the product of the two individual Laplace transforms.
Write the canonical pattern: _____L{(f∗g)(t)}=F(s)G(s)\mathcal{L}\{(f*g)(t)\}=F(s)G(s)
State the canonical condition: _____F(s)=L{f(t)}; G(s)=L{g(t)}; convolution definedF(s)=\mathcal{L}\{f(t)\};\, G(s)=\mathcal{L}\{g(t)\};\, \text{convolution defined}

Practice Ground

Use these exercises to build move-selection fluency. (See Self-Explanation for how to learn from worked examples.)

Procedure Walkthrough

Starting from L{(et∗sin⁡t)(t)}\mathcal{L}\{(e^t*\sin t)(t)\}, apply the theorem and reach a product of transforms.

StepExpressionOperation
0L{(et∗sin⁡t)(t)}\mathcal{L}\{(e^t*\sin t)(t)\}Start with a stated convolution inside the Laplace transform.
1L{et}L{sin⁡t}\mathcal{L}\{e^t\}\mathcal{L}\{\sin t\}Apply the convolution theorem.
21s−1⋅1s2+1\frac{1}{s-1}\cdot \frac{1}{s^2+1}Substitute the known transforms.
31(s−1)(s2+1)\frac{1}{(s-1)(s^2+1)}Write the product as one transform-domain expression.

Drills

Forward Step

Apply the convolution theorem once. Assume F(s)=L{f(t)}F(s)=\mathcal{L}\{f(t)\}, G(s)=L{g(t)}G(s)=\mathcal{L}\{g(t)\}, and the convolution is defined.

L{(f∗g)(t)}\mathcal{L}\{(f*g)(t)\}
Reveal

The convolution transforms to

F(s)G(s).F(s)G(s).

Apply the theorem once. Assume the condition holds, L{e2t}=1s−2\mathcal{L}\{e^{2t}\}=\frac{1}{s-2}, and L{cos⁡t}=ss2+1\mathcal{L}\{\cos t\}=\frac{s}{s^2+1}.

L{(e2t∗cos⁡t)(t)}\mathcal{L}\{(e^{2t}*\cos t)(t)\}
Reveal

Use the theorem on the convolution:

L{e2t}L{cos⁡t}=1s−2⋅ss2+1.\mathcal{L}\{e^{2t}\}\mathcal{L}\{\cos t\} =\frac{1}{s-2}\cdot \frac{s}{s^2+1}.

Reject or complete the step. Assume F(s)=L{f(t)}F(s)=\mathcal{L}\{f(t)\} and G(s)=L{g(t)}G(s)=\mathcal{L}\{g(t)\}.

L{f(t)g(t)}⟹F(s)G(s)\mathcal{L}\{f(t)g(t)\}\Longrightarrow F(s)G(s)
Reveal

Reject the step. The expression is ordinary multiplication in time, not convolution. The theorem licenses

L{(f∗g)(t)}=F(s)G(s),\mathcal{L}\{(f*g)(t)\}=F(s)G(s),

not L{f(t)g(t)}=F(s)G(s)\mathcal{L}\{f(t)g(t)\}=F(s)G(s).


Apply the theorem and substitute table transforms. Assume the convolution is defined.

L{(1∗t)(t)}\mathcal{L}\{(1*t)(t)\}
Reveal

Since L{1}=1s\mathcal{L}\{1\}=\frac{1}{s} and L{t}=1s2\mathcal{L}\{t\}=\frac{1}{s^2},

L{(1∗t)(t)}=1s⋅1s2=1s3.\mathcal{L}\{(1*t)(t)\}=\frac{1}{s}\cdot\frac{1}{s^2}=\frac{1}{s^3}.

Which inputs are eligible for the convolution theorem? Assume all named transforms exist when the input is structurally eligible.

A. L{(f∗g)(t)}\mathcal{L}\{(f*g)(t)\}
B. L{f(t)g(t)}\mathcal{L}\{f(t)g(t)\}
C. L{∫0teτsin⁡(t−τ) dτ}\mathcal{L}\left\{\int_0^t e^\tau\sin(t-\tau)\,d\tau\right\}

Reveal

A and C are eligible. C is the convolution (et∗sin⁡t)(t)(e^t*\sin t)(t) written as an integral. B is a pointwise product, not a convolution.


Action Labels

What was done between these two steps? Assume the condition holds.

L{(f∗g)(t)}⟹F(s)G(s)\mathcal{L}\{(f*g)(t)\} \quad \Longrightarrow \quad F(s)G(s)
Reveal

The Laplace Convolution Theorem was applied: the transform of a time-domain convolution became the product of the two individual transforms.


What condition licenses this transition?

L{(et∗sin⁡t)(t)}⟹1s−1⋅1s2+1\mathcal{L}\{(e^t*\sin t)(t)\} \quad \Longrightarrow \quad \frac{1}{s-1}\cdot\frac{1}{s^2+1}
Reveal

The condition is that 1s−1=L{et}\frac{1}{s-1}=\mathcal{L}\{e^t\}, 1s2+1=L{sin⁡t}\frac{1}{s^2+1}=\mathcal{L}\{\sin t\}, and the convolution (et∗sin⁡t)(t)(e^t*\sin t)(t) is defined.


A student claims this transition uses the convolution theorem. What is wrong?

L{tsin⁡t}⟹L{t}L{sin⁡t}\mathcal{L}\{t\sin t\} \quad \Longrightarrow \quad \mathcal{L}\{t\}\mathcal{L}\{\sin t\}
Reveal

The input is the product tsin⁡tt\sin t, not the convolution (t∗sin⁡t)(t)(t*\sin t)(t). The convolution theorem does not split ordinary products.


Name the move in this chain. Assume the condition holds.

∫0t(t−τ)eτ dτ⟹L{∫0t(t−τ)eτ dτ}⟹1s2⋅1s−1\int_0^t (t-\tau)e^\tau\,d\tau \quad \Longrightarrow \quad \mathcal{L}\left\{\int_0^t (t-\tau)e^\tau\,d\tau\right\} \quad \Longrightarrow \quad \frac{1}{s^2}\cdot\frac{1}{s-1}
Reveal

The final transition uses the Laplace Convolution Theorem after recognizing the integral as (t∗et)(t)(t*e^t)(t).


Transition Identification

Where does the convolution theorem enter this chain?

(1∗sin⁡t)(t)=∫0tsin⁡(t−τ) dτ⟹L{(1∗sin⁡t)(t)}⟹1s⋅1s2+1(1*\sin t)(t)=\int_0^t \sin(t-\tau)\,d\tau \quad \Longrightarrow \quad \mathcal{L}\{(1*\sin t)(t)\} \quad \Longrightarrow \quad \frac{1}{s}\cdot\frac{1}{s^2+1}
Reveal

It enters in the second transition, where the transform of the convolution becomes the product of the individual transforms.


What is missing from this worked chain?

L{(f∗g)(t)}⟹F(s)G(s)\mathcal{L}\{(f*g)(t)\} \quad \Longrightarrow \quad F(s)G(s)
Reveal

The chain is missing the condition check. It should state that F(s)=L{f(t)}F(s)=\mathcal{L}\{f(t)\}, G(s)=L{g(t)}G(s)=\mathcal{L}\{g(t)\}, and the convolution is defined before multiplying the transforms.


Backward Step

Return the product to the time domain as a convolution. Assume L{et}=1s−1\mathcal{L}\{e^t\}=\frac{1}{s-1} and L{sin⁡t}=1s2+1\mathcal{L}\{\sin t\}=\frac{1}{s^2+1}.

L−1{1(s−1)(s2+1)}\mathcal{L}^{-1}\left\{\frac{1}{(s-1)(s^2+1)}\right\}
Reveal

Factor the product into two known transforms:

1(s−1)(s2+1)=1s−1⋅1s2+1.\frac{1}{(s-1)(s^2+1)}=\frac{1}{s-1}\cdot\frac{1}{s^2+1}.

So the inverse transform is the convolution

(et∗sin⁡t)(t).(e^t*\sin t)(t).

Solve a Problem

Apply what you’ve learned with Problem Solving.

Problem: Starting from 1s2(s+1)\frac{1}{s^2(s+1)}, return to a time-domain convolution using Laplace Convolution Theorem.

Full solution
StepExpressionMove
01s2(s+1)\frac{1}{s^2(s+1)}Start from a transform-domain product candidate.
11s2⋅1s+1\frac{1}{s^2}\cdot\frac{1}{s+1}Factor the expression into two known transform factors.
2L{t}L{e−t}\mathcal{L}\{t\}\mathcal{L}\{e^{-t}\}Identify each factor as a Laplace transform.
3L{(t∗e−t)(t)}\mathcal{L}\{(t*e^{-t})(t)\}Use the convolution theorem backward to identify the product as a convolution transform.
4L−1{1s2(s+1)}=(t∗e−t)(t)\mathcal{L}^{-1}\left\{\frac{1}{s^2(s+1)}\right\}=(t*e^{-t})(t)Return to the time-domain convolution.


FAQ

What is Laplace Convolution Theorem?

Laplace Convolution Theorem is the rule L{(f∗g)(t)}=F(s)G(s)\mathcal{L}\{(f*g)(t)\}=F(s)G(s). It says that convolution in the time domain becomes multiplication in the Laplace-transform domain.

When is Laplace Convolution Theorem valid?

It is valid when F(s)=L{f(t)}F(s)=\mathcal{L}\{f(t)\}, G(s)=L{g(t)}G(s)=\mathcal{L}\{g(t)\}, and the convolution (f∗g)(t)(f*g)(t) is defined. In ordinary one-sided Laplace work, that convolution is ∫0tf(τ)g(t−τ) dτ\int_0^t f(\tau)g(t-\tau)\,d\tau.

Is convolution the same as multiplying functions?

No. Multiplication gives f(t)g(t)f(t)g(t) at the same time value. Convolution combines shifted values through an integral, so L{f(t)g(t)}\mathcal{L}\{f(t)g(t)\} is not generally F(s)G(s)F(s)G(s).

Why is the theorem useful in differential equations?

It lets you recognize some transform-domain products as time-domain convolutions, especially after algebraic solution steps produce products of known transforms. That makes it a bridge between transform-table algebra and time-domain solution forms.

Can I use the theorem backward?

Yes, when the conditions are met. If F(s)F(s) and G(s)G(s) are the transforms of f(t)f(t) and g(t)g(t), then L−1{F(s)G(s)}=(f∗g)(t)\mathcal{L}^{-1}\{F(s)G(s)\}=(f*g)(t).


How This Fits in Unisium

Within the differential equations subdomain, Unisium treats this as a condition-first transform move: identify convolution structure, verify the two matching transforms, and only then multiply in the ss domain. The Unisium Study System pairs that habit with retrieval practice, self-explanation, and compact problem-solving chains so the theorem becomes a selectable move rather than a table entry memorized in isolation.

Ready to practice differential equations with structure? See Unisium’s 14-day free trial or explore the complete framework in Masterful Learning.

Masterful Learning book cover

Masterful Learning

The book behind these guides: a study system for physics, math, & programming built on retrieval, connection, explanation, and problem solving.

Ready to apply this strategy?

Unisium turns these evidence-based techniques into guided study sessions for math and physics. Places are limited during early access. Check current availability to start a trial; joining the mailing list is optional.

See plans and availability Read More Guides

Already have access? Sign in