Semigroups of Linear Operators

Sheree L. LeVarge

December 4, 2003

Abstract

This paper will serve as a basic introduction to semigroups of linear operators. It

will define a semigroup in the context of a physical problem which will serve to motivate
further (elementary) theoretical development of linear semigroups including the Hille-
Yosida Theorem. Applications and examples will also be discussed.

1 Introduction

Before defining what a semigroup is, one needs to recognize their global importance. Of course
their importance cannot be fully realized until we have a clear definition and developed theory.
However, in general, semigroups can be used to solve a large class of problems commonly known
as evolution equations. These types of equations appear in many disciplines including physics,
chemistry, biology, engineering, and economics. They are usually described by an initial value
problem (IVP) for a differential equation which can be ordinary or partial. When we view the
evolution of a system in the context of semigroups we break it down into transitional steps
(i.e. the system evolves from state A to state B, and then from state B to state C). When
we recognize that we have a semigroup, instead of studying the IVP directly, we can study
it via the semigroup and its applicable theory. The theory of linear semigroups is very well
developed [1]. For example, linear semigroup theory actually provides necessary and sufficient
conditions to determine the well-posedness of a problem [3]. There is also theory for nonlinear
semigroups which this paper will not address. This paper will focus on a special class of linear
semigroups called C0 semigroups which are semigroups of strongly continuous bounded linear
operators. The theory of these semigroups will be presented along with some examples which
tend to arise in many areas of application.

2 What is a Semigroup?

Let’s begin with the most basic notion of a semigroup.

2.1 Definition (Semigroup) -

A semigroup is a set S coupled with a binary operation ∗ (∗: S × S → S) which is associative.

That is, ∀ x, y, z ∈ S, (x∗y)∗z = x∗(y ∗z). Associativity can also be realized as F (F (x, y), z) =
F (x, F (y, z)) where F (x, y) serves as the mapping from S × S to S [4].

1
A semigroup, unlike a group, need not have an identity element e such that x ∗ e = x, ∀x ∈ S.
Further, a semigroup need not have an inverse. Therefore, many problems which can be solved
with semigroups can only be solved in the forward direction (e.g. forward in time).

2.2 Simple Examples

Some of the simplest examples of semigroups are:

2S = R ∗ = addition
S = M2×2 (R) ∗ = matrix multiplication
where M2×2 (R) = the set of 2 × 2 matrices with real entries [4].

While we have introduced the most general definition of a semigroup, this paper will focus on
semigroups of linear operators. In particular, it will provide definitions, theory, examples, and
applications of semigroups of linear operators (linear semigroups).

2.3 A More Concrete Example

To motivate the results about linear semigroups, consider the physical state of a system which is
evolving with time (according to some physical law) as given by the following IVP (or abstract
Cauchy problem):
d
u(t) = A[u(t)] (t ≥ 0) (1)
dt
u(0) = f
where u(t) describes the state at time t which changes in time at a rate given by the function
A. The solution of (1) is given by:
u(t) = eAt f. (2)

A natural first question to ask is, “Is (1) well posed?” A well posed problem is one whose
solution exists and is unique. Semigroup theory can determine when a problem is well posed
and in order to use the theory, we need to know that we have a semigroup. So to continue with
(2), let T operate on u as follows:
T (t) : u(s) → u(t + s). (3)

If we assume that A does not depend on time, then T (t) is independent of s [3]. The solution,
u(t + s) at time t + s, can be computed as T (t + s) acting on f . Likewise, if we painstakingly
break down the process into two steps we have:

1st Step: T (s)(f ) = u(s)

2nd Step: T (t)(u(s)) = T (t)(T (s)(f )) = u(t + s) = T (t + s)(f ).

2.4 The Semigroup Property

By transitionally breaking down the process of evolution, it is evident that we can reach the
state of the system at time t + s by either going directly from the initial condition to the state

2
at time t + s or by allowing the state to evolve over s time units (taking a snapshot), and then
allowing it to evolve t more time units. Here the T (·) is acting like a transition operator [1].
The uniqueness of the solution gives reveals the semigroup property which is given by:

T (t + s) = T (t)T (s) (t, s > 0). (4)

The semigroup property (4) of the family of functions, {T (t); t ≥ 0}, is a composition (not a
multiplication). Notice that T (0) is the identity operator (I) (i.e. there is no transition at time
zero and the initial data exists) [3].

2.5 More Properties

Now that we have seen the fundamental semigroup property, we want to understand how A
(which governs the evolution of the system) and T relate to one another. We will first examine
the scalar case. Two observations which may be preliminary indicators of the relationship are
given as follows:
T (t)(f ) = T (t)(u(0)) = u(t) = eAt f (5)
d
T (t)(f ) = A(T (t)(f )). (6)
dt

Notice that u(t) = T (t)(f ) solves (1) and suggests that:

T (t)(f ) = eAt f (7)

where A is the derivative of T (t). In addition, each T (t) : f → eAt f is a continuous operator
on R, (or in an infinite dimensional setting, a Banach space X), which indicates the continuous
dependence of u(t) on f [3]. The initial data f should belong to the domain of A.

Upon inspection of (7), we have the following results:

i. T (t) exhibits the semigroup property as in (4),

ii. T (t) is a continuous function,
iii. T (0)f = f ,
iv. T (t) : R → R is linear provided A is linear.

Again, since we are interested in linear semigroups, we will assume that A is linear. These
observations bring forth the notion of C0 semigroups.

3 C0 Semigroups

Now that semigroups have been introduced in the framework of a physical problem, we should
formally define a C0 semigroup; a term which was introduced by Hille [3]. Generally we say
that a C0 semigroup is a strongly continuous one parameter semigroup of a bounded linear
operator on a Banach Space X.

3
3.1 Definition (C0 Semigroup) -

A C0 semigroup (or strongly continuous semigroup) is a family, T = {T (t) | t ∈ R+ }, of

bounded linear operators from X to X satisfying:

i. T (t + s) = T (t)T (s) ∀ t, s ∈ R+ ,

ii. T (0) = I, the identity operator on X, and

iii. limt→0+ T (t)f → f for each f ∈ X with respect to the norm on X [1].

The continuity condition given by (iii) arises naturally as we do not want our physical system
in (1) to breakdown in time due to small measurement errors in the initial state (for example).
From now on throughout this paper, the word semigroup will mean C0 semigroup. A more
careful inspection of the definition of semigroup may provoke the following question, “Can one
replace (iii) by the condition:
lim kT (t) − Ik = 0 (8)
t↓0

where k · k denotes the norm on X?” The answer is, NO! Semigroups that satisfy the property
given in (8) are called uniformly continuous semigroups of bounded linear operators. The
condition given in (8) is too strong for strongly continuous semigroups [1]. Uniformly continuous
semigroups are thus a subset of strongly continuous semigroups. This paper will focus on the
larger set of semigroups but will (as necessary) comment on the smaller set.

3.2 Some Questions

Now that we have an official definition of a semigroup, we want to answer the following three
questions which attempt to unveil the relationship between T (t) and A:

Q1. Given the semigroup T (t), how can we find the operator A in eAt f ?
Q2. Which operators A give rise to which semigroups?

Q3. Given A, how can we construct the corresponding semigroup T (t)?

The next section will address the answers to these questions.

4 Semigroup Generation

In this section we will explore the generation of semigroups. This will reveal the connection
between A in (1) and T (t) in (3). We will first examine the answer to (Q1) as in the previous
section. To motivate this, (7) suggests that ”T (t) = etA .” Notice that:

T ′ (t) = AetA = AT (t)

d
and T ′ (0) = A. So perhaps we can obtain A by A = dt T (t)|t=0 . This leads to the following
definition.

4
4.1 Definition (Generator) -

Let T be a semigroup. The (infinitesimal) generator of T , denoted by A, is given by the

equation:
T (t)f − f
Af = lim+ At f = lim+ (9)
t→0 t→0 t
where the limit is evaluated in terms of the norm on X and f is in the domain of A iff this
limit exists [1].

So, according to (9), the generator A is obtained by differentiating the semigroup T . From this
we see that u(·) = T (·)f solves (1). This answers (Q1).

4.2 On the Nature of A

Thus far, we have seen two types of linear semigroups, uniformly and strongly continuous
semigroups. So in regard to (Q2), we pose the question, “Which operators A give rise to
these two different types of semigroups?” Interestingly, we have yet to discuss what type of
operator A is. In particular, is A a bounded (nice!) or unbounded (not so nice!) operator? Of
course, as it almost always turns out, interesting problems are more difficult to work with. So in
general, for most applications, A will be an unbounded operator. In fact, the difference between
uniformly continuous and strongly continuous semigroups is just the nature of A. Precisely,
A is the generator of a uniformly continuous semigroup T iff A is a bounded operator. So, if
T is strongly continuous and fails to be uniformly continuous, then T will have an unbounded
generator A [1], [2]. The fact that A can be unbounded in a setting such as that in (1) should
d
not be startling since we may initially associate A with the operator dx which we know is
unbounded. This does not do (Q2) justice, and we will return to this question as we develop
further.

4.3 On the Nature of T (t)

To examine (Q3), recall (7). It (i.e. (7)) should not be a clear fact at this time as it has not
been rigorously proved. However, what should be clear is that the exponential in (7) may play
a role in uncovering T (t) from A. Therefore, we need to understand the exponential function
in (perhaps) one of the following contexts:

P∞ (tA)n
i. eAt = n=0 n!

−n
ii. limn→∞ 1 − tA
n
 
1
iii. eAt = L−1 λ−A for λ > Re(A)

where L−1 denotes the inverse Laplace transform [3]. Furthermore, now that we know that
the boundedness of A determines the type (continuity) of the semigroup generated, we should
answer this question in the context of bounded/unbounded operators. Let’s look at the easier
(bounded) case first. This leads us to the following theorem where we view the exponential as
a power series as in (i).

5
4.4 Theorem -

Let A be a bounded operator from X to X. Then,

∞
( )
tA
X (tA)n +
T = T (t) = e = :t∈R (10)
n=0
n!

is a uniformly continuous semigroup.

Proof -

Since A is bounded we know kAk < ∞ and thus

∞
X (tA)n
n=0
n!

converges for each t ≥ 0 to the bounded linear operator T (t). We know the semigroup property
(4) holds since

∞
! ∞

∞
X (t)i X (s)j =
X (t + s)k
 .
i=0
i! j=0
j! k!
k=0

Clearly T (0) = I. Finally, to distinguish T (t) as uniformly continuous semigroup:

∞ ∞ n
X (tA)n X t kAkn
kT (t) − Ik = ≤ = etkAk − 1
n=1
n! n=1
n!

and etkAk − 1 → 0+ as t → 0 and the proof is complete [2].



It should be noted, and it is not hard to show, that A is in fact the gererator of T (t) [5].
So we have answered (Q3) in the context of a bounded generator A in which case given A,
we construct the semigroup T (t) as T (t) = etA . Therefore, for a bounded generator A, the
suggestion in (7) is true. Furthermore, the map t → T (t) = etA is differentiable. But how
can we construct the semigroup when A is unbounded? Furthermore, getting back to (Q2),
what properties does A possess to make it a generator of strongly continuous semigroups? The
answer to this question lies deeply within the “mother theorem” of linear semigroups called the
Hille-Yosida Theorem. We will devote the entire next section to building up to and presenting
this theorem.

5 Hille-Yosida Theorem

The previous section showed us the basic results for bounded generators and their uniformly
continuous semigroups. In this section, we are forced to look at unbounded generators to
investigate many “interesting” problems. It would be convenient to use the approach we took
for bounded generators which was using the power series for etA . However, convergence of this

6
series is not likely when A is unbounded. Recall that it remains to be shown what (exactly)
makes A a generator of a semigroup and, once that is shown, how do we recover the semigroup
T (t) from the generator? Let’s first address the question of what A is, exactly.

5.1 Notes on Resolvents

Ultimately we are looking for relationships between A and T (t). In doing so, one may stumble
upon a connection between T (t) and the resolvent operator of A. Recall the resolvent set of
A is given by ρ(A) and is the set of complex numbers λ for which λI − A is invertible. The
resolvent of A is a family of bounded linear operators which is denoted by R(λ, A) and is given
by R(λ, A) = (λI − A)−1 where λ ∈ ρ(A). To see its connection to T (t), consider the following:
Z ∞
1
= e−λt etA dt
λ−A 0

where A ∈ R and λ ∈ C with Re(λ) > A [3]. This gives rise to the operator version:
Z ∞
R(λ, A)f = e−λt T (t)f dt
0

which is valid provided λ > 0 [3]. So the resolvent operator can be thought of as the Laplace

−n
transform of the semigroup. Furthermore, in light of viewing etA as limn→∞ 1 − tA n , we
can re-write this expression as:
" −1 #n   −1 n
tA tA n n
e = lim 1− = lim I −A . (11)
n→∞ n n→∞ t t

So imbedded within this formula for etA is the resolvent operator (λI − A)−1 where λ = nt .
Before we proceed further with resolvent sets (which we will return to later), we will introduce
corollaries and theorems that will lead up to the Hille-Yosida Theorem.

5.2 Theorem -

Let T (t) be a semigroup. There exist constants ω ∈ R and M ≥ 1 such that the following
holds:
kT (t)k ≤ M eωt for 0 ≤ t < ∞. (12)

Proof -

Choose a constant M ≥ 1 such that kT (t)k ≤ M for all 0 ≤ t ≤ 1. Let ω = logM . Then for
each t > 0 and if n is the least integer ≥ t then:
n
! n      n
X t Y t t
kT (t)k = T = T = T ≤ M n ≤ M t+1 = M eωt
n n n
k=1 k=1

completing the proof.

7
5.3 Corollary -

If T (t) is a semigroup then for each f ∈ X, t → T (t)f is a continuous function from R+ to X.

Proof -

Let t, h ≥ 0 and f ∈ X. Then we have:

kT (t + h)f − T (t)f k = kT (t)T (h)f − T (t)f k ≤ kT (t)kkT (h)f − f k ≤ M eωt kT (h)f − f k

and for t ≥ h ≥ 0 we have:

kT (t − h)f − T (t)f k = kT (t − h)f − T (t − h + h)f k = kT (t − h)f − T (t − h)T (h)f k

≤ kT (t − h)kkf − T (h)f k ≤ M eωt kf − T (h)f k

by (12). Thus we have continuity [5].



5.4 Theorem -

Let T (t) be a semigroup generated by A. Then the following hold:

i) For each f ∈ D(A),

T (t)f ∈ D(A) (domain of A) and AT (t)f = T (t)Af ∀t ≥ 0 (13)

ii) For each f ∈ D(A) and T (t)f ∈ D(A),

d
T (t)f = AT (t)f = T (t)Af. (14)
dt

Proof -

i) Let f ∈ D(A) and fix t ≥ 0. Then, for s > 0, As as in (Def. 4.1) and using T (s)T (t) =
T (t)T (s) = T (s + t):

(T (s)T (t)f − T (t)f ) (T (t)T (s)f − T (t)f ) (T (s)f − f )

As T (t)f = = = T (t) . (15)
s s s

As s → 0+ , the right hand side of (15) converges to T (t)(Af ) (Def. 4.1) since f ∈ D(A) and
T (t) is continuous on X. Therefore,

lim As T (t)f = T (t)Af

s→0+

which gives T (t)f ∈ D(A) and AT (t)f = T (t)Af as desired [1].

8
ii) Let f ∈ D(A) and h > 0. Consider the right-hand limit,

(T (t + h)f − T (t)f ) T (t)T (h)f − T (t)f )

lim = lim
h→0+ h h→0+ h
 
(T (h) − I)
= lim+ T (t)f = AT (t)f = T (t)Af
h→0 h

since T (t)f ∈ D(A) by (i) [1].

Consideration of the appropriate left-hand limit can be found in [5].


5.5 Theorem -

Let T (t) be a semigroup generated by A. Then the following hold:

i) For each f ∈ X,

t+h
1
Z
lim T (s)f ds = T (t)f. (16)
h→0 h t

ii) For each f ∈ X,

Z t Z t 
T (s)f ds ∈ D(A) and A T (s)f ds = T (t)f − f. (17)
0 0

iii) For each f ∈ D(A),

Z t Z t
T (t)f − T (s)f = T (τ )Af dτ = AT (τ )f dτ. (18)
S s

Proof -

i) The proof of (16) follows from the continuity of t → T (t) given in Corollary 5.3 [5].

ii) Let f ∈ X and h > 0. Then,

t
T (h) − I t 1 t
Z  Z Z
Ah T (s)f ds = T (s)f ds = (T (h) − I)T (s)f ds.
0 h 0 h 0
Then, by the semigroup property,

t t
1 1
Z Z
(T (h) − I)T (s)f ds = (T (s + h)f − T (s)f ) ds
h 0 h 0

9
which gives:

t+h t t+h h
1 1 1 1
Z Z Z Z
T (s′ )f ds′ − T (s)f ds = T (s)f ds − T (s)f ds. (19)
h h h 0 h t h 0

Letting h → 0+ and applying the Fundamental Theorem of Calculus to (19) yields T (t)f −
T (0)f = T (t)f − f which proves (ii) [1].

iii) The proof of (18) follows from integrating (14) from s to t [5].


Recall that our goal is to describe the A’s that generate the T (t)’s. The following theorem is a
precursor to the Hille-Yosida Theorem and provides some additional information pertinent to
our goal.

5.6 Theorem -

If A is the generator of a semigroup T (t), then D(A) is dense in X and A is a closed operator.

Proof -

First, to show that D(A) is dense in X, we must show that D(A) = X. Take f an arbitrary
element of X and let ft be given by:

t
1
Z
ft = T (s)f ds
t 0

By part (ii) of Theorem 5.5, ft ∈ D(A) and furthermore, part (i) of the same theorem gives:

t
1
Z
ft = T (s)f ds → T (0)f = f as t → 0+
t 0

Thus, f = limn→∞ f n1 ⊂ D(A) where f was chosen arbitrarily so that D(A) = X[1].

It remains to be shown that A is a closed operator. Recall that A closed means if fn ∈ D(A),
fn → f , and Afn → g, then f ∈ D(A) and Af = g. So let {fn }∞ n=1 ⊂ D(A) with fn → f and
Afn → g as n → ∞. By part (iii) of Theorem 5.5, we have:

Z t
T (t)fn − fn = T (s)Afn ds (20)
0

for each n ≥ 1 and t > 0. By Theorem 5.2, we have kT (s)k ≤ Ceωt where C is a constant.
Therefore,

10
 Z t Z t Z t Z t
T (s)Afn ds − T (s)gds ≤ kT (s)kkAfn − gkds ≤ C kAfn − gkds
0 0 0 0
≤ CtkAfn − gk → 0 as n→∞
So, letting n → ∞ in (20) yields
Z t
T (t)f − f = T (s)gds
0
t
T (t)f − f 1
Z
= T (s)gds
t t 0
T (t)f − f 1 t
Z
lim = lim T (s)gds
t→0 + t t→0+ t 0
At f = g.
Therefore, by Def. 4.1, we conclude that f ∈ D(A) and Af = g. Thus A is closed [3].


5.7 Theorem -

A semigroup is uniquely determined by its generator.

Proof -

Let T and S be two semigroups having the same generator A. Let f ∈ D(A) and let t > 0.
Define u : [0, t] → X by u(s) = T (s)S(t − s)f . Then,

du(s)
= T (s)(−A)S(t − s)f + T (s)AS(t − s)f = 0
ds

giving u = constant on [0, t]. Therfore, since u is constant,

T (t)f = u(t) = u(0) = S(t)f.

Thus, T = S [3].


Now that we have introduced some elementary theory, we will introduce a defintion which we
will use in the Hille-Yosida Theorem since the details become much easier to work with.

5.8 Definition (Semigroup of Contractions) -

A semigroup T (t) is a semigroup of contractions when M = 1 and ω = 0 in (12) [5]. That is,
kT (t)k ≤ 1.

As stated in [3], “Roughly speaking, for most purposes it is enough to consider only contraction
semigroups.” For a full explanation see [3]. So, without further anticipation, we will present
the Hille-Yosida Theorem.

11
5.9 Theorem (Hille-Yosida Theorem) -

A linear unbounded operator A is the generator of a (C0 ) semigroup iff:

i. A is a closed operator,
ii. A has dense domain (D(A)),
iii. for each λ > 0, λ ∈ ρ(A), and
iv. kR(λ, A)k ≤ λ1 .

The Hille-Yosida Theorem is very powerful as it gives us both necessary and sufficient condi-
tions. While the proof of this theorem is quite difficult and lengthy, the theorem itself provides
a much more justified answer to (Q2) as it describes A’s character in further detail. We will
prove the necessity to provide some insight into the theorem. The the proof of sufficiency will
not be provided but can be found in [2], [3], and [5]. To achieve sufficiency, a more extensive
background (in the form of lemmas) is required. In addition, the insight gained from proving
sufficiency will not be put to full use as this paper will not rigorously discuss exactly how we
view T (t) as an exponential.

Proof (Hille-Yosida Theorem)

Necessity. The proofs of (i) and (ii) are given by Theorem 5.6. To prove (iii), notice that
for each λ > 0, {e−λt T (t) : t ∈ R} is a semigroup of contractions whose generator is computed
by,

e−λt T (t)f − f −λe−λt T (t)f + e−λt Af

lim = lim = −λf + Af (21)
t→0+ t t→0+ 1
using L’Hôpital’s Rule which gives the generator as A − λI with domain D(A). Applying (17)
to this semigroup gives:
Z t
−λt
−e T (t)f + f = (λI − A) e−λs T (s)f ds f ∈ X
0
Z t
−λt
−e T (t)f + f = e−λs T (s)(λI − A)f ds f ∈ D(A)
0

R∞
Letting t → ∞ A we know 0 e−λs T (s)f ds ∈ D(A) since A is closed. This result, together
with the dominated convergence theorem give:
Z ∞
f = (λI − A) e−λs T (s)f ds f ∈ X
0
Z ∞
−λs
f = e T (s)(λI − A)f ds f ∈ D(A)
0
Z ∞
(λI − A)−1 f = e−λs T (s)f ds f ∈ X, λ > 0.
0

So we conclude that (λI − A) : D(A) → X is 1 − 1 (i.e. bijective) and (λI − A)−1 is a bounded
linear operator on X and we have λ ∈ ρ(A). This proves (iii).

12
To prove (iv),
∞
kf k
Z
kR(λ, A)k = k(λI − A)−1 f k ≤ e−λs kT (s)kkf kds ≤ f ∈ X, λ > 0.
0 λ
Thus, the proof of necessity is complete [3].


One should notice that the resolvent of A is the Laplace Transform of the semigroup. ?Co-
incidently? we should expect to obtain the semigroup by inverting Laplace transform (which
is one way to view etA ). Probably not coincidence. So while the Hille-Yosida theorem fills in
some of the gaps, one perplexing one remains.

5.10 The Missing Link

One missing link remains. We have seen to how to get from T (t) to A via semigroup differen-
tiation:
T (t)f − f
Af = lim .
t→0 + t
We have also seen how to manuever from the A to its resolvent (which can be reversed) as:

R(λ, A) = (λI − A)−1

A = λ − R(λ, A)−1

and also from T (t) to the resolvent of A as:

Z ∞
R(λ, A) = e−λt T (t)dt. (22)
0

More, importantly, we would like to touch on the answer to (Q3) in which we are supposed to
reconstruct T (t) from A. In this section, we will provide results in the absence of rigor to give
the reader an idea of how this can be accomplished. Recall that when A is bounded, we had
P∞ n
T (t) = etA = n=0 (tA) n! . To handle the case of A unbounded, we can try to approximate A
by a sequence {An }n∈N of bounded operators and hope that:

etA = lim etAn .

n→∞

One such approximation of A, termed the Yosida approximation, is given by:

Aλ = λAR(λ, A) = λ2 R(λ, A) − λI.

Interestingly, T (t)f = limλ→∞ etAλ f for f ∈ X [5]. Therefore, in some sense, a strongly contin-
uous semigroup with generator A is obtained as the limit of a sequence of uniformly continuous
semigroups generated by the bounded linear operators given by the Aλ ’s.

As previously suggested in (11), one may also accomplish this task of going from A to T (t) by:
 −n h n  n in
t
T (t)f = lim I − A f = lim R ,A f for f ∈ X
n→∞ n n→∞ t t

as given in [5]. This method uses form (ii) of the exponential formula given in Sec. 4.3 coupled
with the resolvent set. Therefore, despite the lack of rigor, this section gives the reader an idea
of how we view T (t) as an exponential.

13
6 Applications and Examples

As was stated at the beginning of the paper, recognizing problems to which semigroup theory
can be applied to is important as the theory accompanying semigroups can be a powerful
tool. In fact semigroup theory can determine if a problem is well-posed. This gives rise to the
following Theorem.

6.1 Theorem (Well Posed Theorem) -

The IVP given by (1) (with A being linear) is well posed iff A is the generator of a semigroup
T . In this case the unique solution of (1) is given by u(t) = T (t)(f ) for f in the domain of A [3].

This turns out to be quite important as it provides both necessary and sufficient conditions
to determine if a problem is well-posed. We will now introduce some examples of semigroups.
Many examples fall into the categories of: translations, fractional integration, harmonic func-
tions, stochastic processes, difussion equations and ergodic theory [4]. We will look at three
examples.

6.2 The Heat Equation

We are interested in using our knowledge of semigroups in a slightly more concrete example. In
particular, we will look at the solution of the heat equation and show it is given by a semigroup.
In this setting, let X = Lp (R), 1 ≤ p < ∞. Recall that the heat equation as given by:

ut = uxx −∞≤x≤∞ (23)

u(x, 0) = f.

Using Fourier Transform methods, the solution to (23) can be written as

Z ∞
1 (x−y)2
u(x, t) = √ e− 4t f (y)dy. (24)
4πt −∞

(s)2
The heat kernel is given by Kt (s) = √ 1 e− 4t and we can write the solution to the heat
4πt
equation as a convolution:

u(x, t) = Kt ∗ f. (25)

So the solution of (23) is a semigroup on X written as

∞
1
Z
−(s−r)2
T (t)f (s) = e 4t f (r)dr t > 0, x ∈ R, and f ∈ X (26)
4πt −∞

and we set T (0) = I. This ((26)) is called the Gauss-Weierstrass semigroup. To show it
satisfies the semigroup property we must show:

T (a + b)f (s) = T (a)T (b)f (s). (27)

14
Symbolically, T (a + b)f (s) is given by:

T (a + b)f (s) = Ka+b ∗ f (s). (28)

Likewise, symbolically writing T (a)T (b)f (s) we have:

T (a)T (b)f (s) = T (a)[Kb ∗ f (s)] = Ka ∗ [Kb ∗ f (s)] = [Ka ∗ Kb ] ∗ f (s) (29)

since the operation of convolution is associative. Therefore, to show that (27) holds, it suffices
to show that
Ka+b (x) = Ka ∗ Kb (x) (30)

which is equivalent to showing:

∞
1 1 1
Z
−x2 −x2 −(x−y)2
p e 4(a+b) =√ √ e 4a e 4b dy. (31)
4π(a + b) 4πa 4πb −∞

Although this requires many manipulations, we will go through the argument to prove that we
do in fact have a semigroup.
Working with the right-hand side of (31) (without the constant) gives:

Z Z Z
−[y 2 (a+b)−2axy+x2 a] −x2 a 2 2xa −x2 xa 2 x2 a
4ab [y− a+b ] + 4b(a+b)
−(a+b)
4ab [y − a+b y]
−(a+b)
e 4ab dy = e 4ab e dy = e 4b e dy
R R R
Z Z Z √ 2
−x2 x2 a xa 2 −x2 −(a+b) 2 −x2 − a+b
4ab [y− a+b ] 4ab u
−(a+b)
=e 4b e 4b(a+b) e dy = e 4(a+b) e 4ab u du = e 4(a+b) e du
R R R

  q
xa a+b
where u = y − a+b . Now making the change of variables t = 4ab u we have:
r Z r
−x2 ab 2 −x2 abπ
e 4(a+b) 2 e−t dt = e 4(a+b) 2
a+b R a+b

by evaluating the Gaussian integral. Now in order to show (31) we need to verify that:
r
1 abπ 1
p =2 √ √ .
4π(a + b) a + b 4πa 4πb

By simple calulation of the above, we see that (31) holds and the semigroup property is verified
for the heat equation.

6.3 Poisson Semigroup

We introduce the Poisson semigroup within the space X = Lp (R), 1 ≤ p < ∞. For t > 0,
define T (t) on X by:

1 ∞
Z
t
T (t)f (x) = f (y)dy x ∈ R and f ∈ X.
π −∞ t2 + (x − y)2

15
We have T (t)f = Pt ∗ f where the kernel is given as:
1 t
Pt (x) = .
π t2 + x2

We can evaluate the Fourier transform of Pt , denoted by F, as:

1 ∞
Z
t
(FPt )(x) = eixu du.
π −∞ t + u2
2

This can be evaluated using standard contour integration methods and the Residue Theorem.
Using the Residue Theorem:

t eiux t e−tx 1 −xt

lim = = e
π u→it u + it π 2it 2πi

which gives (FPt )(x) = e−xt for x ≥ 0. To account for x ∈ R, (FPt )(x) = e−|x|t . So for f ∈ X,
we have:
(F(T (t)f ))(x) = e−|x|t (Ff )(x) x ∈ R.

Since e−|x|s e−|x|t = e−|x|(s+t) , the semigroup property is satisfied. The Poisson semigroup
arises
 2 in many instances
 since the kernel, Pt x, is a fundamental solution to Laplace’s equation
∂ u ∂2u
∂x2 + ∂t2 = 0 in the region {(x, t)|x ∈ R, t > 0}.

6.4 Translation Semigroups

Now we will introduce a class of semigroups called translation semigroups. In this setting, let
X = C0 ([0, ∞)) be the Banach space of functions f which are continuous on [0, ∞) (continuous
on the right at 0) and for which f (x) → M < ∞ as x → ∞ with respect to the sup norm. For
t ≥ 0, define T (t) on X by:

(T (t)f )(x) = f (x + t).

Here the operator T (t) translates the function f ∈ C0 to the left by t units and forms a
semigroup. The semigroup property is satisfied as translation by t + s units is the same as
a translation by t units followed by a translation by s units. Also, T (0) = I is satisfied.
Furthermore, limt→0+ T (t)f = f since:

lim sup kf (x + t) − f (x)k = 0.

t→0+ x

In addition, our translation semigroup forms a contraction semigroup since kT (t)f k = kf k

which gives kT (t)k = 1.

6.5 What Can’t Semigroups Do?

This section is intended to provide a short “list” of where (specifically) semigroups arise. This
list should serve as evidence of how semigroups make their mark in many disciplines.

16
 1. Feller Markov Processes
2. Conrol Theory
3. Population Growth Models
4. Linear Transport (Boltzmann) Equations
5. Delay Differential Equations
6. Integro-Differential Equations

These are just to name a few. To conclude, evolution equations arise in many disciplines of
science. An abstract way to study and dissect these equations is through semigroups. Using
semigroups is advantageous as the associated theory is quite rich. Studying semigroups, as I
have for this paper, heighten your awareness of their prevalence throughout applied mathemat-
ics.

7 References

[1] Belleni-Morante, A. and A. McBride. Applied Nonlinear Semigroups, Mathematical Meth-

ods in Practice, John Wiley & Sons, Chichester, 1998.

[2] Engel, K. and R. Nagel. One-Parameter Semigroups for Linear Evolution Equations, Grad-
uate Texts in Mathematics, Springer, New York, 1995.

[3] Goldstein, J. Semigroups of Linear Operators and Applications, Oxford U. Press, New York,
1985.

[4] Hille, E. What is a Semi-group?, in Studies in Real and Complex Analysis (pp 55 - 66)
by Hirschman, Vol 3, Mathematical Association of America, Prentice-Hall, Englewood Cliffs,
1965.

[5] Pazy, A. Semigroups of Linear Operators and Applications to Partial Differential Equations,
Applied Mathematical Sciences, Springer-Verlag, New York, 1983.

17