In complex analysis, given initial data consisting of points in the complex unit disc and target data consisting of points in , the Nevanlinna–Pick interpolation problem is to find a holomorphic function that interpolates the data, that is for all ,
subject to the constraint for all .
Georg Pick and Rolf Nevanlinna solved the problem independently in 1916 and 1919 respectively, showing that an interpolating function exists if and only if a matrix defined in terms of the initial and target data is positive semi-definite.
Setting , this inequality is equivalent to the statement that the matrix given by
that is the Pick matrix is positive semidefinite.
Combined with the Schwarz lemma, this leads to the observation that for , there exists a holomorphic function such that and if and only if the Pick matrix
The Nevanlinna-Pick Theorem
The Nevanlinna-Pick theorem states the following. Given , there exists a holomorphic function such that if and only if the Pick matrix
The generalization of the Nevanlinna-Pick theorem became an area of active research in operator theory following the work of Donald Sarason on the Sarason interpolation theorem. Sarason gave a new proof of the Nevanlinna-Pick theorem using Hilbert space methods in terms of operator contractions. Other approaches were developed in the work of L. de Branges, and B. Sz.-Nagy and C. Foias.
Because of this, the Pick matrix can be rewritten as
This description of the solution has motivated various attempts to generalise Nevanlinna and Pick's result.
The Nevanlinna–Pick problem can be generalised to that of finding a holomorphic function that interpolates a given set of data, where R is now an arbitrary region of the complex plane.
M. B. Abrahamse showed that if the boundary of R consists of finitely many analytic curves (say n + 1), then an interpolating function f exists if and only if
is a positive semi-definite matrix, for all λ in the n-torus. Here, the Kλs are the reproducing kernels corresponding to a particular set of reproducing kernel Hilbert spaces, which are related to the set R. It can also be shown that f is unique if and only if one of the Pick matrices has zero determinant.
Pick's original proof concerned functions with positive real part. Under a linear fractional Cayley transform, his result holds on maps from the disc to the disc.
- Agler, Jim; John E. McCarthy (2002). Pick Interpolation and Hilbert Function Spaces. Graduate Studies in Mathematics. AMS. ISBN 0-8218-2898-3.
- Abrahamse, M. B. (1979). "The Pick interpolation theorem for finitely connected domains". Michigan Math. J. 26 (2): 195–203. doi:10.1307/mmj/1029002212.
- Tannenbaum, Allen (1980). "Feedback stabilization of linear dynamical plants with uncertainty in the gain factor". Int. Journal Control. 32 (1): 1–16. doi:10.1080/00207178008922838.