The least solution for the polynomial interpolation problem (Q811503): Difference between revisions

We consider the following problem: given a subspace \(\Lambda\) of the dual \(\Pi'\) of the space \(\Pi\) of \(s\)-variate polynomials, find a space \(P\subset\Pi\) which is correct for \(\Lambda\) in the sense that each continuous linear functional on \(\Lambda\) can be interpolated by a unique \(p\in P\). We provide a map, \(\Lambda\mapsto\Lambda_ \downarrow\subset\Pi\), which we call the least map, that involves this interpolation problem and give a comprehensive discussion of its properties. This least solution, \(\Lambda_ \downarrow\), is a homogeneous space and is shown to have minimal degree among all possible solutions. It is the unique minimal degree solution which is dual (in a natural sense) to all minimal degree solutions. It also interacts nicely with various maps applied to \(\Lambda\), such as convolution, translation, change of variables, and, particularly, differentiation. Our approach is illustrated by detailed examples, concerning finite- dimensional \(\Lambda\)'s spanned by point-evaluations or line integrals. Methods which facilitate the identification of the least solution are established. The paper is complemented by a further paper of the authors, in which an algorithmic approach for obtaining \(\Lambda_ \downarrow\) is presented whose computational aspects are detailed.