Math 2.0

Integral equations Iteration and the resolvent kernel Theorem

Liouville–Neumann series

Builds on Integral equation of the second kindContinuous kernelIterated kernelWeierstrass M-testNeumann series

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 KnK_n be its iterated kernels. Let f ⁣:[a,b]→ℂf \colon [a, b] \to \C be continuous and let λ∈ℂ\lambda \in \C with ∣λ∣M(b−a)<1\abs{\lambda} M (b - a) < 1. Then the series φ(x)=f(x)+∑n=1∞λn∫abKn(x,s)f(s) ds\varphi(x) = f(x) + \sum_{n=1}^{\infty} \lambda^n \int_a^b K_n(x, s) f(s) \, ds converges absolutely and uniformly on [a,b][a, b]. Its sum φ\varphi is the unique continuous solution of the integral equation of the second kind φ(x)=f(x)+λ∫abK(x,s)φ(s) ds,x∈[a,b].\varphi(x) = f(x) + \lambda \int_a^b K(x, s) \varphi(s) \, ds, \quad x \in [a, b].

Remarks

Proof idea: ∣Kn∣≤Mn(b−a)n−1\abs{K_n} \le M^n (b - a)^{n-1}, so the nn-th term is bounded by max⁡∣f∣⋅(∣λ∣M(b−a))n\max \abs{f} \cdot (\abs{\lambda} M (b - a))^n, and the Weierstrass M-test gives uniform convergence. Substituting the series into the equation and integrating term by term shows that φ\varphi is a solution. If ψ\psi is a second continuous solution, then max⁡∣φ−ψ∣≤∣λ∣M(b−a)max⁡∣φ−ψ∣\max \abs{\varphi - \psi} \le \abs{\lambda} M (b - a) \max \abs{\varphi - \psi}, so φ=ψ\varphi = \psi. This is the Neumann series (I−λK)−1=∑n≥0λnKn(I - \lambda K)^{-1} = \sum_{n \ge 0} \lambda^n K^n for the integral operator on continuous functions with the maximum norm.

Example: for K=1K = 1 on [0,1][0, 1] and ∣λ∣<1\abs{\lambda} < 1, all Kn=1K_n = 1, and the series gives φ=f+λ1−λ∫01f\varphi = f + \frac{\lambda}{1 - \lambda} \int_0^1 f. The condition on λ\lambda cannot be dropped in general: for λ=1\lambda = 1 the equation φ=f+∫01φ\varphi = f + \int_0^1 \varphi has no solution when ∫01f≠0\int_0^1 f \ne 0. For Volterra kernels the bound improves to ∣Kn(x,s)∣≤Mn(x−s)n−1/(n−1)!\abs{K_n(x, s)} \le M^n (x - s)^{n-1} / (n-1)!, and the series converges for every λ\lambda.

Going deeper

For a student

The partial sums of the series are the iterates φ0=f\varphi_0 = f, φk=f+λKφk−1\varphi_{k} = f + \lambda K \varphi_{k-1} of the method of successive approximations. Collecting the terms gives the resolvent kernel R=∑n≥1λn−1KnR = \sum_{n \ge 1} \lambda^{n-1} K_n and the formula φ=f+λ∫Rf\varphi = f + \lambda \int R f. The series in λ\lambda converges for ∣λ∣\abs{\lambda} below the smallest absolute value of a characteristic value of KK, and for all λ\lambda if there is none. Beyond that disc one needs Fredholm determinants or the theory of compact operators.

Reading path

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

  1. Banach space concept
  2. Continuous kernel concept
  3. Continuous linear map concept
  4. Element definition
  5. Extended real number line object
  6. Integral equation of the second kind concept
  7. Invertible operator concept
  8. Iterated kernel concept
  9. Operator norm concept
  10. Proposition concept
  11. Real numbers object
  12. Sequence definition
  13. Set bounded above definition
  14. Set definition
  15. Conjunction definition
  16. Disjunction definition
  17. Implication definition
  18. Predicate definition
  19. Real sequence definition
  20. Subsequence definition
  21. Supremum definition
  22. Empty set object
  23. Family of sets definition
  24. Ordered pair definition
  25. Intersection definition
  26. Union definition
  27. Existential quantifier definition
  28. Universal quantifier definition
  29. Bounded sequence definition
  30. Cauchy sequence definition
  31. Geometric sequence definition
  32. Limit of a sequence definition
  33. Monotone sequence definition
  34. Series definition
  35. Cartesian product definition
  36. Subset definition
  37. Union of a family of sets definition
  38. Uniqueness quantifier definition
  39. Cauchy sequences are bounded statement
  40. Every sequence has a monotone subsequence statement
  41. Sum of a finite geometric series statement
  42. Monotone convergence theorem for sequences statement
  43. Convergent sequence definition
  44. Pointwise convergence definition
  45. Squeeze theorem statement
  46. Partial sum definition
  47. Binary relation definition
  48. Topological space definition
  49. Bolzano–Weierstrass theorem statement
  50. Uniform convergence definition
  51. The sequence r^n tends to zero for |r| < 1 example
  52. Convergent series definition
  53. Function definition
  54. Uniform convergence on a set definition
  55. Cauchy criterion for sequences statement
  56. A series of nonnegative terms converges iff its partial sums are bounded statement
  57. Series of functions definition
  58. Sum of a series definition
  59. Comparison test statement
  60. Metric space definition
  61. Uniformly Cauchy sequence of functions definition
  62. Geometric series example
  63. Convergence of a sequence in a metric space definition
  64. Open ball definition
  65. Weierstrass M-test statement
  66. Diameter of a set definition
  67. Metric topology definition
  68. Epsilon characterisation of Cauchy sequences statement
  69. Open set definition
  70. Complete metric space definition
  71. Equivalent metrics definition
  72. Equivalent norms definition
  73. Banach space definition
  74. Absolutely convergent series in a Banach space converge statement
  75. Neumann series statement
  76. Liouville–Neumann series statement

Where this leads

3 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Liouville%E2%80%93Neumann_series
About this page
TagH1HWSWME6B
URIm2://H1HWSWME6B
Kindstatement, theorem
WritingW0 stub
MSC45B05, 45L05
StatusThis copy of the site has no build data. Run m2 status H1HWSWME6B.
AboutIntegral equation of the second kind, Iterated kernel
UsesIntegral equation of the second kind, Continuous kernel, Iterated kernel, Weierstrass M-test, Neumann series
Same as

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

Used by