Reproducing kernel Hilbert space

From Free net encyclopedia

In functional analysis (a branch of mathematics), a reproducing kernel Hilbert space is a function space in which pointwise evaluation is a continuous linear functional. Equivalently, they are spaces that can be defined by reproducing kernels. The subject was originally and simultaneously developed by Nachman Aronszajn (1907-1980) and Stephan Bergman (1895-1987) in 1950.

In this article we assume that Hilbert spaces are complex. This is because many of the examples of reproducing kernel Hilbert spaces are spaces of analytic functions. Also recall the sesquilinearity convention: the inner product is linear in the second variable.

Let X be an arbitrary set and H a Hilbert space of complex-valued functions on X. H is a reproducing kernel Hilbert space iff the linear map

<math> f \mapsto f(x) </math>

from H to the complex numbers is continuous for any x in X. By the Riesz representation theorem, this implies that for given x there exists an element K_x of H with the property that:

<math> f(x) = \langle K_x, f \rangle \quad \forall f \in H \quad (*)</math>

The function

<math> K(x,y) \equiv K_x(y) </math>

is called a reproducing kernel for the Hilbert space. In fact, K is uniquely determined by the above condition (*).

For example, when X is finite and H consists of all complex-valued functions on X, then an element of H can be represented as an array of complex numbers. If the usual inner product is used, then K_x is the function whose value is 1 at x and 0 everywhere else.

In other contexts, (*) amounts to saying

<math>f(x)=\int_X K(x,y) f(y)\,dy</math>

for every f, where X is often the real numbers or Rⁿ.

Bergman kernel

The Bergman kernel is defined for open sets D in Cⁿ. Take the Hilbert H space of square-integrable functions, for the Lebesgue measure on D, that are holomorphic functions. The theory is non-trivial in such cases as there are such functions, which are not identically zero. Then H is a reproducing kernel space, with kernel function the Bergman kernel; this example, with n = 1, was introduced by Bergman in 1922.