Skip to content
The book

Separable kernels and resolvent kernels

Why this is asked: Separable kernels turn integral equations into matrix problems. The resolvent kernel sums the Neumann series and gives the solution in closed form.

In one sentence

A separable kernel turns an integral equation into a finite linear system, so the whole apparatus of eigenvalues and the Fredholm alternative becomes ordinary linear algebra.

Why the exam asks it

Because it is the one case that can be solved completely by hand, so questions can ask for exact eigenvalues and explicit solutions — and because the reduction to a matrix problem is the moment the earlier linear algebra pays off.

The idea

A kernel is separable (or degenerate) if it is a finite sum of products:

K(x,t)=∑i=1nai(x) bi(t).K(x,t) = \sum_{i=1}^{n} a_i(x)\,b_i(t).

Then for the second-kind Fredholm equation y(x)=f(x)+λ∫abK(x,t)y(t) dty(x) = f(x) + \lambda\int_a^b K(x,t)y(t)\,dt,

y(x)=f(x)+λ∑i=1nai(x) ci,ci=∫abbi(t)y(t) dt.y(x) = f(x) + \lambda\sum_{i=1}^n a_i(x)\,c_i, \qquad c_i = \int_a^b b_i(t)y(t)\,dt .

The unknown function is determined by the nn numbers cic_i. Substituting back gives

ci=∫bif+λ∑j(∫biaj)cj,c_i = \int b_i f + \lambda\sum_j \left(\int b_i a_j\right)c_j,

an n×nn\times n linear system (I−λA)c=d(I - \lambda A)\mathbf{c} = \mathbf{d} with Aij=∫abbiajA_{ij} = \int_a^b b_i a_j.

So:

  • Eigenvalues of the integral equation are the λ\lambda with det⁡(I−λA)=0\det(I-\lambda A) = 0 — at most nn of them.
  • Unique solution exactly when det⁡(I−λA)≠0\det(I-\lambda A)\ne0.
  • At an eigenvalue, the Fredholm alternative in matrix form: solvable iff d\mathbf{d} is orthogonal to the null space of the transpose.

An infinite-dimensional problem has become an n×nn\times n determinant, which is why separable kernels are the ones that appear in examinations.

Worked

y(x)=f(x)+λ∫01xt y(t) dt.y(x) = f(x) + \lambda\int_0^1 x t\,y(t)\,dt .

Here n=1n=1 with a=xa=x, b=tb=t. Write c=∫01t y(t) dtc = \int_0^1 t\,y(t)\,dt, so y=f+λxcy = f + \lambda x c. Then

c=∫01tf+λc∫01t2=∫01tf+λc3,c = \int_0^1 t f + \lambda c\int_0^1 t^2 = \int_0^1 tf + \frac{\lambda c}{3},

giving c(1−λ3)=∫01tfc\left(1-\frac\lambda3\right) = \int_0^1 tf. So the single eigenvalue is λ=3\lambda = 3, and for every other λ\lambda there is a unique solution

y=f+3λx3−λ∫01tf(t) dt.y = f + \frac{3\lambda x}{3-\lambda}\int_0^1 t f(t)\,dt .

At λ=3\lambda=3 the homogeneous equation has y=xy = x as a solution, and the inhomogeneous one is solvable only when ∫01tf=0\int_0^1 tf = 0.

The resolvent kernel

Writing the solution as

y(x)=f(x)+λ∫abR(x,t;λ)f(t) dty(x) = f(x) + \lambda\int_a^b R(x,t;\lambda)f(t)\,dt

defines the resolvent RR. For the example above, R=3xt3−λR = \dfrac{3xt}{3-\lambda} — a rational function of λ\lambda with a pole exactly at the eigenvalue. That is the general picture: the resolvent is meromorphic in λ\lambda with poles at the eigenvalues, which is the same structure as (A−λI)−1(A-\lambda I)^{-1} in finite dimensions.

For a Volterra equation the resolvent is entire in λ\lambda — no poles, because there are no eigenvalues.

The resolvent also comes from the Neumann series, R=∑n≥0λnKn+1R = \sum_{n\ge0}\lambda^n K_{n+1} with KnK_n the iterated kernels, and summing that series is often the intended route when the kernel is simple.

Where intuition breaks

"A separable kernel can have infinitely many eigenvalues." At most nn, the number of terms. Rank nn gives an n×nn\times n determinant.

"The eigenvalues are those of the matrix AA." They satisfy det⁡(I−λA)=0\det(I-\lambda A)=0, so they are the reciprocals of the eigenvalues of AA. Getting that inversion wrong is the standard slip.

"Every kernel is separable." Only finite sums of products. K=extK = e^{xt} is not, though it has a separable series approximation and that is a standard route.

"The resolvent exists for all λ\lambda." It has poles at the eigenvalues — for Fredholm. For Volterra it is entire.

"A rank-1 kernel has no eigenvalue." It has exactly one, λ=1/∫b a\lambda = 1/\int b\,a, provided that integral is non-zero.

"At an eigenvalue there is no solution." There is none unless the orthogonality condition holds; when it does, there are infinitely many.

The exam's angle

  1. Spot separability and set ci=∫biyc_i = \int b_i y. The problem becomes finite immediately.
  2. Compute Aij=∫biajA_{ij} = \int b_i a_j and solve det⁡(I−λA)=0\det(I-\lambda A)=0 for the eigenvalues.
  3. Remember the reciprocal: λ\lambda eigenvalues of the equation, 1/λ1/\lambda of the matrix.
  4. Write the resolvent and check its poles against the eigenvalues as a consistency check.
  5. For Volterra, expect no poles — an entire resolvent is the signature.

The night before

  • Separable K=∑i=1nai(x)bi(t)K = \sum_{i=1}^n a_i(x)b_i(t) reduces the equation to (I−λA)c=d(I-\lambda A)\mathbf{c} = \mathbf{d}, Aij=∫biajA_{ij} = \int b_i a_j.
  • At most nn eigenvalues, given by det⁡(I−λA)=0\det(I-\lambda A)=0 — reciprocals of the eigenvalues of AA.
  • y=f+λ∫xt yy = f + \lambda\int xt\,y on [0,1][0,1]: eigenvalue λ=3\lambda=3, resolvent 3xt/(3−λ)3xt/(3-\lambda), homogeneous solution y=xy=x.
  • Resolvent RR: meromorphic in λ\lambda with poles at the eigenvalues; entire for Volterra.
  • R=∑λnKn+1R = \sum \lambda^n K_{n+1} from the Neumann series.
  • At an eigenvalue: solvable only under orthogonality, and then non-uniquely.

See it move

Separable kernels turn an integral equation into linear algebrainteractive

This visual is part of Trap Analysis

A degenerate kernel reduces the whole problem to a finite system — worked.

Unlock interactive visuals

Check yourself

The eigenvalue λ\lambda for which y(x)=λ∫01xty(t)y(x) = \lambda\int_{0}^{1} x t y(t) dt has a non-trivial solution is

More in Linear Integral Equations

Take it further

Last revised . Found a mistake? Tell us — corrections are the fastest thing we act on.

Next: Lagrangian formalism and generalised coordinates

Create a free account to keep your place and have this feed your study plan.

ShareWhatsAppTelegram

Open this in the full syllabus view · Unit 3