Previous Up Next
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.

10 Integral equations

In this lecture we will study the Fredholm equation defined as follows. Let the integral operator with a kernel K(x,y) defined on [a,b]×[a,b] be defined as before:

(Tφ)(x)=
b
a
K(x,y)φ(y) dy. (54)

The Fredholm equation of the first and second kinds correspondingly are:

Tφ=f     and     φ −λ Tφ=f, (55)

for a function f on [a,b]. A special case is given by Volterra equation by an operator integral operator (54) T with a kernel K(x,y)=0 for all y>x which could be written as:

(Tφ)(x)=
x
a
K(x,y)φ(y) dy. (56)

We will consider integral operators with kernels K such that ∫abab K(x,y) d xd y<∞, then by Theorem 15 T is a Hilbert–Schmidt operator and in particular bounded.

As a reason to study Fredholm operators we will mention that solutions of differential equations in mathematical physics (notably heat and wave equations) requires a decomposition of a function f as a linear combination of functions K(x,y) with “coefficients” φ. This is an continuous analog of a discrete decomposition into Fourier series.

Using ideas from the proof of Lemma 4 we define Neumann series for the resolvent:

(I−λ T)−1=I+λ T + λ2T2+⋯, (57)

which is valid for all λ<||T||−1.

Example 1 Solve the Volterra equation
    φ(x)−λ
x
0
y φ(y) dy=x2,     on  L2[0,1].
In this case I−λ T φ = f, with f(x)=x2 and:
    K(x,y)=

        y,0≤ y ≤ x;
        0,x< y ≤ 1.
Straightforward calculations shows:
    (Tf)(x)=
x
0
y· y2dy=
x4
4
,
    (T2f)(x)=
x
0
y
y4
4
dy=
x6
24
, …
and generally by induction:
    (Tnf)(x) = 
x
0
y
y2n
2n−1n!
dy=
x2n+2
2n(n+1)!
.
Hence:
    φ(x)=
0
λnTnf = 
0
λnx2n+2
2n(n+1)!
 =
2
λ
0
λn+1x2n+2
2n+1(n+1)!
 =
2
λ
(eλ x2/2−1)     for all  λ ∈ ℂ∖ {0},
because in this case r(T)=0. For the Fredholm equations this is not always the case, see Tutorial problem 29.

Among other integral operators there is an important subclass with separable kernel, namely a kernel which has a form:

K(x,y)=
n
j=1
gj(x)hj(y). (58)

In such a case:

    (Tφ)(x)=
b
a
n
j=1
gj(x)hj(y)φ(y) dy
 =
n
j=1
gj(x) 
b
a
hj(y)φ(y) dy,

i.e. the image of T is spanned by g1(x), …, gn(x) and is finite dimensional, consequently the solution of such equation reduces to linear algebra.

Example 2 Solve the Fredholm equation (actually find eigenvectors of T):
    φ(x)=
λ 
0
 cos(x+y)φ(y) dy
 =
λ 
0
 (cosxcosy − sinx siny)φ(y) dy.
Clearly φ (x) should be a linear combination φ(x)=Acos x+Bsinx with coefficients A and B satisfying to:
    A=
λ 
0
 cosy (Acosy+Bsiny) dy,
    B=
−λ 
0
 siny (Acosy+Bsiny) dy.
Basic calculus implies A=λπ A and B=−λπ B and the only nonzero solutions are:
    λ=π−1A ≠ 0B = 0
    λ=−π−1A = 0B ≠ 0

We develop some Hilbert–Schmidt theory for integral operators.

Theorem 3 Suppose that K(x,y) is a continuous function on [a,b]×[a,b] and K(x,y)=K(y,x) and operator T is defined by (54). Then
  1. T is a self-adjoint Hilbert–Schmidt operator.
  2. All eigenvalues of T are real and satisfy n λn2<∞.
  3. The eigenvectors vn of T can be chosen as an orthonormal basis of L2[a,b], are continuous for nonzero λn and
          Tφ=
    n=1
    λn ⟨ φ,vn  ⟩vn    where    φ=
    n=1
    ⟨ φ,vn  ⟩vn
Proof.
  1. The condition K(x,y)=K(y,x) implies the Hermitian property of T:
          ⟨ Tφ,ψ  ⟩=
    b
    a



    b
    a
    K(x,y)φ(y) dy


    ψ(x) dx
     =
    b
    a
    b
    a
    K(x,y)φ(y) ψ(x) dxdy
     =
    b
    a
     φ(y)


    b
    a
    K(y,x) ψ(x)
    dx


    dy
     =⟨ φ,Tψ  ⟩.
    The Hilbert–Schmidt property (and hence compactness) was proved in Theorem 15.
  2. Spectrum of T is real as for any Hermitian operator, see Theorem 2 and finiteness of ∑n λn2 follows from Hilbert–Schmidt property
  3. The existence of orthonormal basis consisting from eigenvectors (vn) of T was proved in Corollary 8. If λn≠ 0 then:
          vn(x1)−vn(x2)=λn−1((Tvn)(x1)−(Tvn)(x2))
     =
    1
    λn
    b
    a
     (K(x1,y)−K(x2,y))vn(y) dy
    and by Cauchy–Schwarz-Bunyakovskii inequality:
          
    vn(x1)−vn(x2) 
    ≤ 
    1

    λn
    ⎪⎪
    ⎪⎪
    vn⎪⎪
    ⎪⎪
    2
    b
    a

    K(x1,y)−K(x2,y) 
    dy
    which tense to 0 due to (uniform) continuity of K(x,y).
Theorem 4 Let T be as in the previous Theorem. Then if λ≠ 0 and λ−1∉σ(T), the unique solution φ of the Fredholm equation of the second kind φ−λ T φ=f is
φ=
1
⟨ f,vn  ⟩
1−λ λn
vn. (59)
Proof. Let φ=∑1an vn where an=⟨ φ,vn ⟩, then
    φ−λ Tφ=
1
an(1−λ λn) vn =f=
1
⟨ f,vn  ⟩vn
if and only if an=⟨ f,vn ⟩/(1−λ λn) for all n. Note 1−λ λn≠ 0 since λ−1∉σ(T).

Because λn→ 0 we got ∑1| an |2 by its comparison with ∑1| ⟨ f,vn ⟩ |2=||f||2, thus the solution exists and is unique by the Riesz–Fisher Theorem. □

See Exercise 30 for an example.

Theorem 5 (Fredholm alternative) Let TK(H) be compact normal and λ∈ℂ∖ {0}. Consider the equations:
     
      φ−λ Tφ=0(60)
      φ−λ Tφ=f (61)
then either
  1. the only solution to (60) is φ=0 and (61) has a unique solution for any fH; or
  2. there exists a nonzero solution to (60) and (61) can be solved if and only if f is orthogonal all solutions to (60).
Proof.
  1. If φ=0 is the only solution of (60), then λ−1 is not an eigenvalue of T and then by Lemma 6 is neither in spectrum of T. Thus I−λ T is invertible and the unique solution of (61) is given by φ=(I−λ T)−1 f.
  2. A nonzero solution to (60) means that λ−1∈σ(T). Let (vn) be an orthonormal basis of eigenvectors of T for eigenvalues (λn). By Lemma 2 only a finite number of λn is equal to λ−1, say they are λ1, …, λN, then
          (I−λ T)φ=
    n=1
    (1−λ λn)⟨ φ,vn  ⟩vn =
    n=N+1
    (1−λ λn)⟨ φ,vn  ⟩vn.
    If f=∑1f,vnvn then the identity (I−λ T)φ=f is only possible if ⟨ f,vn ⟩=0 for 1≤ nN. Conversely from that condition we could give a solution
        φ=
    n=N+1
    ⟨ f,vn  ⟩
    1−λ λn
    vn +φ0,     for any  φ0Lin(v1,…,vN),
    which is again in H because fH and λn→ 0.
Example 6 Let us consider
    (Tφ)(x)=
1
0
(2xyxy+1)φ(y) dy.
Because the kernel of T is real and symmetric T=T*, the kernel is also separable:
    (Tφ)(x)=x
1
0
(2y−1)φ(y) dy+
1
0
(−y+1)φ(y) dy,
and T of the rank 2 with image of T spanned by 1 and x. By direct calculations:
    
      T:1
1
2
      T:x
1
6
x + 
1
6
,
  or T is given by the matrix 







        
1
2
1
6
        0
1
6








According to linear algebra decomposition over eigenvectors is:
    λ1=
1
2
with vector


        1
0


,
    λ2=
1
6
with vector





        −
1
2
1





with normalisation v1(y)=1, v2(y)=√12(y−1/2) and we complete it to an orthonormal basis (vn) of L2[0,1]. Then
site search by freefind advanced

Last modified: November 6, 2024.
Previous Up Next