Boundary Nevanlinna-Pick interpolation via reduction and augmentation (Q636770)

From the text: The authors present an elementary solution of a version of the Nevanlinna-Pick interpolation problem with boundary interpolation nodes and boundary target values. The problem is to construct functions in either the Schur class \(\mathcal S\) or the Pick class \(\mathcal P\) subject to finitely many interpolation conditions on the values of the function and its first derivative at points on the boundary of its domain of analyticity. \textit{R. Nevanlinna}, in his original paper [``Kriterien für die Randwerte beschränkter Funktionen'', Math. Zeitschr. 13, 1--9 (1922; JFM 48.0322.02)] on the problem, gave a simple recursive technique based on a theorem of Julia to determine whether a boundary interpolation problem is solvable, and if so, to describe all solutions. The method is analogous to ``Schur reduction'' for the standard Nevanlinna-Pick problem. The elementary reduction technique of Julia and Nevanlinna has the virtue that it assumes only a good first course in complex analysis. It does not require any operator theory or even the notion of Hilbert space, and so may be particularly suitable for working engineers. In this paper, the authors show that the technique can indeed be used to prove Sarason's solvability criterion, and furthermore to parametrize all solutions of Problems \(\partial NP\mathcal P\) and \(\partial NP\mathcal S\) (Sarason's terminology) in a straightforward and concrete way. Nevanlinna's Satz I own parametrization is marred by an oversight, which the authors correct. They also remove an unnecessary restriction (distinctness of the interpolation values) and incorporate the condition for indeterminateness. It transpires that the parametrization problem is more delicate and even more interesting than Nevanlinna realized.