MATH319 Slides

85 Lerch’s Uniqueness Theorem

Theorem

Suppose that f and g satisfy (E) and that there exists s0 such that

(f)(s)=(g)(s)  (s>s0).

Then f(x)=g(x) for all x>0.

There is an inversion formula, credited to Bromwich, which is rather hard to use. So if one knows that F(λ) occurs as (f)(λ) for some f, then the best way to find f is by comparing F with known Laplace transforms in tables.