Function Spaces in Differential Equations
Function Spaces in Differential Equations
Thomas Götz
goetz@uni-koblenz.de
0
Remark
Linear spaces are also called vector spaces, their elements are
called vectors.
The real field R can be replaced by the complex field C mutatis
mutandis (with the necessary changes).
In the sequel we will just consider the real case and point out
structural differences between the real and complex case if
needed.
Note, that the symbol 0 denotes several different objects, the
scalar number zero 0 P R and the zero vector 0 P V .
We have not defined the multiplication of vectors!
Example
For n P N and v1 , . . . , vn P R, the n–tupels
v “ pv1 , . . . , vn q,
CpΩq :“ tf : Ω Ñ R : f is continuous on Ωu
1.5
0.5
0
0 0.5 1 1.5 2
Remark
Recall, that a function f : Ω Ñ R is called (sequentially) continuous
in a point x P Ω, if for all sequences pxn qnPN Ă Ω with lim xn “ x it
holds that lim f pxn q “ f pxq “ f plim xn q.
A function f is called continuous on Ω, if it is continuous for all
x P Ω.
We also write xn Ñ x instead of lim xn “ limnÑ8 xn “ x.
Theorem 1.1
The sets C k pΩ; Rq for k P N arbitrary and C 8 pΩ; Rq are linear spaces.
Their zero vector is the zero function 0 : Ω Ñ R defined by 0pxq “ 0
for all x P Ω and the negative vector ´f is defined by
p´f qpxq “ ´f pxq for x P Ω.
To show that C k pΩq is a linear space, we have to show, that the sum
of two k–times cont. diff’able functions is again k–times cont.
diff’able. And that the same holds true for scalar multiples of a
k–times cont. diff’able function.
This should be clear from your calculus courses.
α1 v1 ` . . . αn vn “ 0 always implies α1 “ 0 “ ¨ ¨ ¨ “ αn .
Example
dim Rn “ n.
How to prove this?
Example
dim Rn “ n.
Proof.
We consider the vectors e1 “ p1, 0, . . . , 0q, e2 “ p0, 1, 0, . . . , 0q, . . . ,
en “ p0, . . . , 0, 1q and their linear combination α1 e1 ` ¨ ¨ ¨ ` αn en . If
the linear combination equals 0 we get
0 “ α1 e1 ` ¨ ¨ ¨ ` αn en
“ pα1 , 0, . . . , 0q ` p0, α2 , 0, . . . , 0q ` ¨ ¨ ¨ ` p0, . . . , 0, αn q
“ pα1 , α2 , . . . , αn q
Example
dim C 0 pra, bsq “ 8.
Example
dim C 0 pra, bsq “ 8.
Proof.
Set fk pxq :“ x k for k P N. Let α0 , . . . αk P R.
We consider the linear combination α0 f0 ` . . . αk fk “ 0 in Cpra, bsq
and get α0 ` α1 x ` ¨ ¨ ¨ ` αn x n “ 0 for all x P ra, bs.
Hence by the fundamental theorem of algebraa we get
α0 “ 0 “ ¨ ¨ ¨ “ αn .
Definition 1.4
Let V be a linear space and U, W Ă V be subsets and α P R.
We call U a subspace, if U is itself a linear space.
We define
U ` W :“ tu ` w : u P U and w P W u ,
αU :“ tαu : u P Uu ,
U ˆ W :“ tpu, w q : u P U and w P W u ,
}u}
}u ` v }
Example
Consider the vector space Rn and
}v }1 :“ ni“1 |vi |
ř
bř
n 2
}v }2 :“ i“1 |vi |
}v }8 :“ maxni“1 |vi |.
The three above are norms on Rn .
How to show this?
Example
Consider the vector space Rn and
}v }1 :“ ni“1 |vi |
ř
bř
n 2
}v }2 :“ i“1 |vi |
}v }8 :“ maxni“1 |vi |.
The three above are norms on Rn .
Proof.
We just show triangle inequality for }¨}1 . Let u, v P Rn . Then
n
ÿ n
ÿ
}u ` v }1 “ |ui ` vi | ď |ui | ` |vi | triangle inequality in R
i“1 i“1
ÿn n
ÿ
“ |ui | ` |vi | “ }u}1 ` }v }1
i“1 i“1
Proof.
Since 0 ď pa ˘ bq2 “ a2 ˘ 2ab ` b 2 we get for all a, b P R
˘2ab ď a2 ` b 2
dÿ dÿ
2
We define a :“ xi { xj and b :“ yi { yj2 and sum over i.
j j
Then
¨ ˛2 ¨ ˛2
ř
2xi yi
i ˝ b xi ‚ ` ˝ b yi ‚
ÿ
˘2ab “ ˘ bř bř ď ř 2 ř 2
2 2
j xj ¨ j yj i j xj j yj
ř 2 ř 2
x y
ď ři i2 ` ři i2 “ 1 ` 1 “ 2
j xj j yj
Proof continued.
Therefore ˜ ¸1{2 ˜ ¸1{2
n
ÿ n
ÿ n
ÿ
˘ xi yi ď xj2 ¨ yj2
i“1 j“1 j“1
Example
Let V “ Cpra, bs; Rq for a, b P R, a ă b. Then
}f }8 :“ max |f pxq|
xPra,bs
Example
Let V “ C 1 pra, bs; Rq for a ă b. Then
}f } :“ }f }8 ` }f 1 }8
defines a norm.
Remark
Formally limnÑ8 }un ´ u} “ 0 is defined as:
For all ε ą 0, there exists an index N P N such that }un ´ u} ď ε for
all indices n ě N.
With the mathematical quantors, this reads as
@ε ą 0 DN P N : }un ´ u} ď ε @n ě N.
Example
Let un pxq :“ x n be a sequence in Cpr0, 1sq and consider the
maximum–norm.
# Then the sequence does not converge to
0 x ă1,
ϕpxq :“
1 x “ 1.
Why that?
1
x4
0.9
x8
0.8 x 50
0.7
0.6
0.5
0.4
0.3
0.2
0.1
0
0 0.2 0.4 0.6 0.8 1
Example
Let un pxq :“ x n be a sequence in Cpr0, 1sq and consider the
maximum–norm.
# Then the sequence does not converge to
0 x ă1,
ϕpxq :“
1 x “ 1.
Proof.
}un ´ ϕ}8 “ maxxPr0,1s |x n ´ ϕpxq| “ max0ăxă1 x n .
Choosing n P N fixed, we can pick a point x close to 1 such that
x n ą ε for any given ε. Therefore the sequence does not
converge.
Example
Consider again the same space Cpr0, 1sq but now endowed with the
ş1
norm }u}1 “ 0 |upxq| dx. Then, for the same sequence un pxq “ x n as
before we get
un pxq “ x n Ñ 0
Example
Consider again the same space Cpr0, 1sq but now endowed with the
ş1
norm }u}1 “ 0 |upxq| dx. Then, for the same sequence un pxq “ x n as
before we get
un pxq “ x n Ñ 0
Proof.
ż1 ż1
1
}un ´ 0}1 “ |un pxq| dx “ x n dx “ Ñ0
0 0 n`1
Example
Consider again the same space Cpr0, 1sq but now endowed with the
ş1
norm }u}1 “ 0 |upxq| dx. Then, for the same sequence un pxq “ x n as
before we get
un pxq “ x n Ñ 0
Proof.
ż1 ż1
1
}un ´ 0}1 “ |un pxq| dx “ x n dx “ Ñ0
0 0 n`1
Remark
Convergence of a sequence can depend on the chosen norm!
Theorem 2.2
Let pV , }¨}q be a normed space and let un , vn , u, v P V and αn , α P R.
Assume un Ñ u and vn Ñ v . Then
1 The limit is unique, i.e. if lim un “ u and lim un “ ũ, then u “ ũ.
Proof. ad 1.
Assume two limits u and ũ of the same sequence pun qnPN . Then
Hence u “ ũ.
Th. Götz (UKO) Function Spaces 30 / 64
2 Normed spaces
Theorem 2.2
Let pV , }¨}q be a normed space and let un , vn , u, v P V and αn , α P R.
Assume un Ñ u and vn Ñ v . Then
1 The limit is unique, i.e. if lim un “ u and lim un “ ũ, then u “ ũ.
Proof. ad 2 & 3.
(2) Since }un ´ u} Ñ 0, the real sequence }un ´ u} is bounded, let’s
say by R, i.e. }un ´ u} ď R for all n P N. Then for all n P N
}un ´ um } ă ε @n, m ě N .
Theorem 2.3
In a normed space every convergent sequence is a Cauchy sequence.
but ...
Theorem 2.3
In a normed space every convergent sequence is a Cauchy sequence.
Remark
Not every Cauchy sequence is also convergent.
Theorem 2.3
In a normed space every convergent sequence is a Cauchy sequence.
Remark
Not every Cauchy sequence is also convergent.
Example
The spaces pR, |¨|q, pC, |¨|q (both equipped with the usual absolute
value as norms) and pRn , }¨}8 q, pCn , }¨}8 q are Banach spaces.
Example
Let Ω “ ra, bs be a compact (closed and bounded) interval. Then
pCpΩq, }¨}8 q is a Banach space.
The convergence fn Ñ f as n Ñ 8 in CpΩq means
}fn ´ f }8 “ max |fn pxq ´ f pxq| Ñ 0 as n Ñ 8.
aďxďb
Example
Let Ω “ ra, bs be a compact (closed and bounded) interval. Then
pCpΩq, }¨}8 q is a Banach space.
The convergence fn Ñ f as n Ñ 8 in CpΩq means
}fn ´ f }8 “ max |fn pxq ´ f pxq| Ñ 0 as n Ñ 8.
aďxďb
Proof.
Let pfn qnPN Ă CpΩq be a Cauchy sequence, i.e.
}fn ´ fm }8 “ max |fn pxq ´ fm pxq| ă ε for all n, m ě N
aďxďb
Proof ctd.
Therefore let ε ą 0 Then there exists some δ ą 0 such that
|fn pxq ´ fn py q| ă ε{3 for all |x ´ y | ă δ and all n P N since all
sequence elements fn are continuous functions. Choose a y such that
|x ´ y | ă δ. Then there exists an index Ñ P N such that
ε ε
|fn pxq ´ f pxq| ă and |fn py q ´ f py q| ă
3 3
for n ě Ñ since both real sequences pfn pxqq and pfn py qq converge.
Therefore
Theorem 2.4
Let B be a Banach space and let pun qnPN Ă B be a Cauchy sequence
which has a convergent subsequence punk qkPN , i.e. unk Ñ u for
k Ñ 8. Then the entire sequence converges to u, i.e. un Ñ u as
n Ñ 8.
Think about a proof.
Theorem 2.4
Let B be a Banach space and let pun qnPN Ă B be a Cauchy sequence
which has a convergent subsequence punk qkPN , i.e. unk Ñ u for
k Ñ 8. Then the entire sequence converges to u, i.e. un Ñ u as
n Ñ 8.
Proof.
Let ε ą 0. Since pun q is a Cauchy sequence, there exists N such that
}un ´ um } ă ε{2 for all n, m ě N. Since the subsequence punk q
converges to u, there exists an index k large enough, such that
nk ě N and }unk ´ u} ă ε{2. Hence
Example
Consider pCpΩq, }¨}8 q for Ω “ r0, 1s and the sequence un pxq “ x n .
Then un is no Cauchy sequence, since
› › ˇ ˇ
}un ´ u2n }8 “ ›x n ´ x 2n ›8 “ max ˇx n ´ x 2n ˇ
0ďxď1
Example
On the spaces Rn and Cn the Euclidean (standard) scalar product
ÿ
xx, y y “ xi yi for Rn
ÿ
xx, y y “ xi yi for Cn
xei , ej y “ 0
xx, ei y “ xi .
Example
On Cpra, bsq we consider
żb
xf , g y :“ f pxq g pxq dx
a
Example
On Cpra, bsq we consider
żb
xf , g y :“ f pxq g pxq dx
a
Proof.
Assume f ‰ 0, then there exists a ξ P ra, bs with f pξq ą 0 (wlog).
Since f is continuous, there exists an entire interval rξ ´ δ, ξ ` δs,
where f ą 0. What, if ξ “ a or ξ “ b?
Therefore ż b ż ξ`δ
xf , f y “ f pxq2 dx ě f pxq2 dx ą 0.
a ξ´δ
Proof.
Let v ‰ 0. Then
0 ď xu ´ αv , u ´ αv y “ xu, uy ´ αxu, v y ´ α rxv , uy ´ αxv , v ys
Lemma 3.2
Each inner product x¨, ¨y defines a norm via
a
}v } “ xv , v y
Lemma 3.2
Each inner product x¨, ¨y defines a norm via
a
}v } “ xv , v y
Proof.
Let u, v P V . Then
Example
The finite–dimensional spaces Rn and Cn with their standard scalar
products and induced norms
ÿ ÿ
Rn : xx, y y “ xi yi }x}22 “ xi2
ÿ ÿ 2
Cn : xx, y y “ xi yi }x}22 “ |xi |
Example
The linear space Cpra, bsq with the inner product and norm
żb
xf , g y “ f pxq g pxq dx
a
ˆż b ˙1{2
2
}f }2 “ f pxq dx
a
We will see later on, that it is not complete, i.e. there are Cauchy
sequences that do not converge.
|apu, v q| ď d ¨ }u} ¨ }v } .
We call ap¨, ¨q
symmetric, iff apu, v q “ apv , uq
positive, iff 0 ď apu, uq
strongly positive, if there exists a constant c ą 0 such that
c ¨ }u}2 ď apu, uq .
Th. Götz (UKO) Function Spaces 47 / 64
3 Hilbert Spaces
Theorem 3.3
Let V be a normed space with inner product x¨, ¨y. Then the inner
product is continuous, i.e. un Ñ u and vn Ñ v imply
xun , vn y Ñ xu, v y.
Theorem 3.3
Let V be a normed space with inner product x¨, ¨y. Then the inner
product is continuous, i.e. un Ñ u and vn Ñ v imply
xun , vn y Ñ xu, v y.
Proof.
Since pvn qnPN is bounded, it follows from Schwarz inequality that
Remark
The inner product of a Hilbert space is continuous.
Remark
The inner product of a Hilbert space is continuous.
Theorem 3.4
Let ap¨, ¨q be a bounded bilinear form on a normed linear space. Then
ap¨, ¨q is continuous.
Theorem 3.5
Let H be a Hilbert space with inner product x¨, ¨y. Let v1 , ¨ ¨ ¨ P Hz t0u
be pairwise orthogonal, i.e. xvi , vj y “ 0 for i ‰ j and vi ‰ 0. Then
the vectors (or any finite subset of them) are linearly independent.
Theorem 3.5
Let H be a Hilbert space with inner product x¨, ¨y. Let v1 , ¨ ¨ ¨ P Hz t0u
be pairwise orthogonal, i.e. xvi , vj y “ 0 for i ‰ j and vi ‰ 0. Then
the vectors (or any finite subset of them) are linearly independent.
Proof.
Consider a linear combination α1 v1 ` ¨ ¨ ¨ ` αn vn “ 0. Choose one vj
with j arbitrary and we get
0 “ xvj , 0y “ xvj , α1 v1 ` ¨ ¨ ¨ ` αn vn y
“ α1 xvj , v1 y ` ¨ ¨ ¨ ` αn xvj , vn y “ αj xvj , vj y
“ αj }vj }2
Definition 4.1
Let V be a normed space. For u0 P V and ε ą 0 we define
Bε pu0 q :“ tu P V : }u ´ u0 } ă εu
ε
u
Bε puq
Th. Götz (UKO) Function Spaces 53 / 64
4 Some Topology
Remark
The empty set H and the entire space V are open and closed at the
same time!
There exists subsets, that are neither open nor closed.
Remark
In some literature, the notation Br puq refers to the closed ball of
radius r around u, i.e.
Br puq “ tv P V : }u ´ v } ď r u .
Theorem 4.1
Let V be a normed space and M Ă V . The following are equivalent
1 M is closed.
Theorem 4.1
Let V be a normed space and M Ă V . The following are equivalent
1 M is closed.
Theorem 4.1
Let V be a normed space and M Ă V . The following are equivalent
1 M is closed.
Definition 4.2
Let M Ă V be a subset of a normed space V . We define
span M = smallest linear subspace of V containing M
M = smallest closed set in V containing M
M̊ = largest open set in V also contained in M
BM “ MzM̊ as the boundary of M
A point u P V is called an interior, boundary or exterior point of M,
iff u P M̊, u P BM or u P pV ˚zMq.
Remark
č
M“ tC closed and M Ă C u
C ĂV
ď
M̊ “ tO open and O Ă Mu
OĂV
A set is convex if for any two points also the line joining those two
points belongs to M.
M not convex!
Lemma 4.2
Let (V , }¨}q be a normed space. Then
1 The ε–ball Bε pU0 q is convex for any u0 P V and ε ą 0.
Lemma 4.2
Let (V , }¨}q be a normed space. Then
1 The ε–ball Bε pU0 q is convex for any u0 P V and ε ą 0.
Proof.
1 Let v , w P Bε pu0 q and 0 ď α ď 1. Then
2 Exercise.
Definition 4.4
Let V be a normed space.
A subspace U Ă V is called a closed subspace, if U vis a
subspace and a closed set.
For a subset M Ă V we define
§ co M = smallest convex subset in V containing M, the
convex hull.
§ co M = smallest closed convex set in V containing M.
Theorem 4.3
M is compact, iff it is relatively compact and closed.
Proof as an Exercise.
Example
Let M be a subset of Rn , Cn with the norm |¨| in R, C or }¨}8 in
Rn , Cn for n ě 2.
Then M is relatively compact, iff it is bounded.
In 1d the proof is a classical result from calculus.
Example
Let M be a subset of Rn , Cn with the norm |¨| in R, C or }¨}8 in
Rn , Cn for n ě 2.
Then M is relatively compact, iff it is bounded.
Proof for R.
Let M be bounded and let pun qnPN Ă M. Then, due to the
Bolzano–Weierstraß Theorema , there exists a convergent
subsequence.
Now assume M relatively compact. Suppose M is not bounded.
Then there exists a sequence pun qnPN Ă M s.t. }un } ě n. Since M is
relatively compact, this sequence should have a convergent
subsequence which has to be bounded. Contradiction.
a
Any bounded sequence in R has a convergent subsequence. Proof
uses nested intervals.
Remark
Finite–dimensional normed spaces are Banach spaces!
Let V be a finite–dimensional normed space.
1 Let U Ă V be a subspace. Then U is closed.