Math 2.0

Integral equations Iteration and the resolvent kernel Proposition

Resolvent equation for kernels

Builds on Resolvent kernelIterated kernelContinuous kernel

Statement

Let a<ba < b, let K ⁣:[a,b]×[a,b]→ℂK \colon [a, b] \times [a, b] \to \C be a continuous kernel with M=max⁡∣K∣M = \max \abs{K}, and let ρ=1/(M(b−a))\rho = 1 / (M (b - a)). For ∣λ∣<ρ\abs{\lambda} < \rho let R(x,s;λ)R(x, s; \lambda) be the resolvent kernel of KK. Then the following hold.

  1. For ∣λ∣<ρ\abs{\lambda} < \rho and all x,s∈[a,b]x, s \in [a, b], R(x,s;λ)−K(x,s)=λ∫abK(x,t)R(t,s;λ) dt=λ∫abR(x,t;λ)K(t,s) dt.R(x, s; \lambda) - K(x, s) = \lambda \int_a^b K(x, t) R(t, s; \lambda) \, dt = \lambda \int_a^b R(x, t; \lambda) K(t, s) \, dt.
  2. For ∣λ∣<ρ\abs{\lambda} < \rho, ∣μ∣<ρ\abs{\mu} < \rho and all x,s∈[a,b]x, s \in [a, b], R(x,s;λ)−R(x,s;μ)=(λ−μ)∫abR(x,t;λ)R(t,s;μ) dt.R(x, s; \lambda) - R(x, s; \mu) = (\lambda - \mu) \int_a^b R(x, t; \lambda) R(t, s; \mu) \, dt.

Remarks

Proof idea: write R=∑n≥1λn−1KnR = \sum_{n \ge 1} \lambda^{n-1} K_n with the iterated kernels and use Kn+1(x,s)=∫K(x,t)Kn(t,s) dt=∫Kn(x,t)K(t,s) dtK_{n+1}(x, s) = \int K(x, t) K_n(t, s) \, dt = \int K_n(x, t) K(t, s) \, dt; uniform convergence allows integration term by term. For part 2, multiply out the two series and use Kn+m(x,s)=∫Kn(x,t)Km(t,s) dtK_{n+m}(x, s) = \int K_n(x, t) K_m(t, s) \, dt; the coefficient identity is λk−μk=(λ−μ)∑i+j=k−1λiμj\lambda^{k} - \mu^{k} = (\lambda - \mu) \sum_{i + j = k - 1} \lambda^i \mu^j. In operator form, with Rλ=K(I−λK)−1R_\lambda = K (I - \lambda K)^{-1}, the identities read Rλ−K=λKRλ=λRλKR_\lambda - K = \lambda K R_\lambda = \lambda R_\lambda K and Rλ−Rμ=(λ−μ)RλRμR_\lambda - R_\mu = (\lambda - \mu) R_\lambda R_\mu.

Example: for K(x,s)=xsK(x, s) = x s on [0,1][0, 1], R(x,s;λ)=3xs/(3−λ)R(x, s; \lambda) = 3 x s / (3 - \lambda). Then λ∫01xt⋅3ts/(3−λ) dt=λxs/(3−λ)\lambda \int_0^1 x t \cdot 3 t s / (3 - \lambda) \, dt = \lambda x s / (3 - \lambda), and 3xs/(3−λ)−xs=λxs/(3−λ)3 x s / (3 - \lambda) - x s = \lambda x s / (3 - \lambda), as part 1 says.

Both identities stay true, by analytic continuation, for all λ\lambda and μ\mu that are not poles of the meromorphic extension of RR.

Going deeper

For a student

Part 1 is the kernel form of (I+λRλ)(I−λK)=(I−λK)(I+λRλ)=I(I + \lambda R_\lambda)(I - \lambda K) = (I - \lambda K)(I + \lambda R_\lambda) = I, which says that I+λRλI + \lambda R_\lambda inverts I−λKI - \lambda K. It is often taken as the definition of the resolvent kernel beyond the disc of convergence of the series. Part 2 is the analogue of the resolvent identity of operator theory, and it shows that RR is analytic in λ\lambda with ∂λR(x,s;λ)=∫abR(x,t;λ)R(t,s;λ) dt\partial_\lambda R(x, s; \lambda) = \int_a^b R(x, t; \lambda) R(t, s; \lambda) \, dt.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Continuous kernel concept
  2. Iterated kernel concept
  3. Resolvent kernel concept
  4. Resolvent equation for kernels statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Liouville%E2%80%93Neumann_series
About this page
TagT26WGV2PQW
URIm2://T26WGV2PQW
Kindstatement, proposition
WritingW0 stub
MSC45B05, 45P05
StatusThis copy of the site has no build data. Run m2 status T26WGV2PQW.
AboutResolvent kernel
UsesResolvent kernel, Iterated kernel, Continuous kernel

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.