Math 2.0

Integral equations Fredholm equations and Fredholm theory Lemma

Hadamard's inequality in Fredholm theory

Builds on Hadamard's inequalityContinuous kernelFredholm determinantFredholm minorsEntire function

Statement

Let a<ba < b, let K ⁣:[a,b]×[a,b]→ℂK \colon [a, b] \times [a, b] \to \C be a continuous kernel, and let M=max⁡∣K∣M = \max \abs{K}. Then for every n≥1n \ge 1 and all x1,…,xn,y1,…,yn∈[a,b]x_1, \dots, x_n, y_1, \dots, y_n \in [a, b], ∣det⁡[K(xi,yj)]i,j=1n∣≤nn/2Mn.\abs{\det[K(x_i, y_j)]_{i,j=1}^{n}} \le n^{n/2} M^n. Consequently, the nn-th coefficient cn=1n!∫[a,b]ndet⁡[K(xi,xj)] dxc_n = \frac{1}{n!} \int_{[a, b]^n} \det[K(x_i, x_j)] \, dx of the Fredholm determinant satisfies ∣cn∣≤nn/2 Mn(b−a)nn!,\abs{c_n} \le \frac{n^{n/2} \, M^n (b - a)^n}{n!}, and the series ∑n(−1)ncnλn\sum_n (-1)^n c_n \lambda^n converges for every λ∈ℂ\lambda \in \C.

Remarks

The first bound is Hadamard's inequality for the matrix [K(xi,yj)][K(x_i, y_j)]: each column has nn entries of modulus at most MM, so its Euclidean norm is at most nM\sqrt{n} M. Integrating over [a,b]n[a, b]^n gives the bound on cnc_n. By Stirling's formula n!≥(n/e)nn! \ge (n/e)^n, so ∣cnλn∣≤(eM(b−a)∣λ∣)n/nn/2\abs{c_n \lambda^n} \le \left(e M (b - a) \abs{\lambda}\right)^n / n^{n/2}, and the nn-th root of this tends to 00. Hence the radius of convergence is infinite, and DD is an entire function.

The same argument, applied to matrices of size n+kn + k, shows that the series defining the Fredholm minors converge for every λ\lambda, uniformly in the fixed points.

The crude bound ∣det⁡∣≤n! Mn\abs{\det} \le n! \, M^n, from expanding the determinant into n!n! products, is not enough: it only gives ∣cn∣≤(M(b−a))n\abs{c_n} \le (M (b - a))^n and hence convergence for ∣λ∣<1/(M(b−a))\abs{\lambda} < 1 / (M (b - a)). The factor nn/2n^{n/2} instead of n!n! is what makes the whole theory work for every λ\lambda.

Going deeper

For a student

Fredholm needed exactly this estimate to show that his determinant and minors are entire functions of λ\lambda. Without it, his formulas would only work near λ=0\lambda = 0, where the Neumann series already does the job.

Reading path

To understand this page from the ground up, read these 19 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. Determinant concept
  3. Entire function concept
  4. Fredholm determinant concept
  5. Fredholm minors concept
  6. Norm concept
  7. Orthogonal vectors concept
  8. Positive semidefinite matrix concept
  9. Vector space definition
  10. Inner product definition
  11. Linear combination definition
  12. Linear subspace definition
  13. Orthogonal vectors definition
  14. Linear independence definition
  15. Linear span definition
  16. Orthonormal family definition
  17. Gram–Schmidt process concept
  18. Hadamard's inequality statement
  19. Hadamard's inequality in Fredholm theory statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Hadamard%27s_inequality
About this page
Tag9NZ9CXC8FY
URIm2://9NZ9CXC8FY
Kindstatement, lemma
WritingW0 stub
MSC45B05, 15A45
StatusThis copy of the site has no build data. Run m2 status 9NZ9CXC8FY.
AboutFredholm determinant
UsesHadamard's inequality, Continuous kernel, Fredholm determinant, Fredholm minors, Entire function

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.