Multivariate Lagrange interpolation and polynomials of one quaternionic variable
Abstract
This paper considers the extension of classical Lagrange interpolation in one real or complex variable to “polynomials of one quaternionic variable”. To do this we develop some aspects of the theory of such polynomials. We then give a number of related multivariate polynomial interpolation schemes for and with good geometric properties, and some aspects of least interpolation and of Kergin interpolation.
Key Words: quaternions, quaternionic polynomials, Lagrange interpolation, Lagrange polynomials, Newton form, Kergin interpolation, least interpolation, quaternionic equiangular lines.
AMS (MOS) Subject Classifications: primary 12E15, 41A05, 41A10, 41A63,
secondary 12E10, 16D10.
1 Introduction
The quaternions are a celebrated extension of the field of complex numbers to a noncommutative associative algebra over the real numbers (a skew-field) with elements
and (see [Rod14] for the basic theory of , which is assumed)
The Lagrange interpolant to a function at distinct points in or is the unique polynomial of degree matching the values of at these points, which can be given explicitly as
(1.1) |
Formally, the above formula makes sense for points in , giving an interpolant. However, due to the noncommutativity of the quaternions, the Lagrange polynomials depend on the order in which the product is evaluated. This is the first indication that the quaternionic polynomials of degree (as a right -module) might have a dimension greater than (depending on how they are defined). To resolve this impasse one could
-
•
Look for an interpolant from a fixed -dimensional subspace of quaternionic polynomials of degree .
-
•
Seek a “best” choice of Lagrange polynomials for given interpolation points, which would implicitly define an -dimensional subspace of interpolants that is related to the geometry of the points.
The first approach has been considered by [Bol15], which we discuss in the next section. Our approach is the second. The essential features of each are (respectively):
-
•
Interpolation is not possible for all configurations of points. The condition for unique interpolation and the interpolation space are not translation invariant. The Lagrange polynomials may have zeros which are not interpolation points. It is possible to develop a Newton form and notion of divided difference.
-
•
Interpolation is possible for all configurations of points, and the interpolation space depends continuously on the points. The interpolant is translation invariant. The Lagrange polynomials can be chosen to be zero only at the interpolation points, and a Newton form can be developed.
We want polynomials and functions of a quaternionic variable to be an “-vector space”. To do this, we view such spaces a right -module (and co-opt the language of linear algebra). Linear maps (which are technically -homomorphisms) then act on the left, with the usual algebra of matrices then extending in the obvious way (cf. [Rod14]). The Lagrange interpolant, as defined above, is an -linear map, since
2 Lagrange interpolation from
Bolotnikov [Bol15], [Bol20] uses the formal polynomials in
on which a left and right evaluation at are defined by
For as right vector space, left evaluation is linear but right evaluation is not.
The (left) Lagrange interpolation of [Bol15] is from the -dimensional subspace of polynomials of degree in to left evaluation at points in . Let us consider an example, to see the nature of this interpolation.
Example 2.1
There is a unique linear interpolant to a function at any distinct points given by the Lagrange polynomial formula
Now we consider interpolation at the three points . Up to a scalar, the quadratic Lagrange polynomial from which is zero at and is
while those given by the Lagrange polynomial formula are
We note that is zero at all quaternions with , equivalently, , , e.g., , whereas and are zero precisely at , and they are not the same polynomial since . The theory of [Bol15] is based on the Euclidean algorithm for the associative multiplication on given by
As an example, the “root” of gives a “linear factor” as follows
Note that has as a left root, i.e., , but not (which is a right root).
Two quaternions and are said to be similar (the term equivalent is used in [Bol15]) if for some nonzero . This is equivalent to and . Hence are similar and and either of are not.
The left point evaluations , , are -linear functionals on the right vector space . These span a left vector space, with linear dependencies given by following:
Lemma 2.1
To see this in play, we consider left quadratic Lagrange interpolation from .
Example 2.2
We seek a quadratic polynomial which left Lagrange interpolates a function at distinct points , i.e.,
Gauss elimination gives the row echelon form
and so there is a unique interpolant to every if and only if
It is easily seen that equality above is equivalent to taking in (2.2), i.e.,
The Gauss elimination argument above shows that a necessary condition for left (or right) Lagrange interpolation by a polynomial in of degree to any to distinct points in is that no three of the points are similar. This is in fact sufficient.
Theorem 2.1
([Bol15] Theorem 3.3) Left (or right) Lagrange interpolation from the polynomials of degree in to points in is uniquely possible if and only if the no three of the points are similar, i.e., have the same modulus and real part.
Corollary 2.1
For a set the linear functionals given by
are -linearly independent if and only if no three of them are similar.
Proof: If three of the points are similar, then we have the nontrivial linear dependency (2.3). Conversely, suppose that no three points are similar. Take a linear combination
and apply both sides of this to the unique Lagrange interpolant to the function which is zero at all the points in , except , to conclude that .
These results were developed from the notion of -independence [Lam86], [LL88], i.e., the set of points is (left) -independent (polynomial independent) if the linear functionals above are linearly independent, or, equivalently, there is a subspace of of dimension from which unique (left) Lagrange interpolation is possible. This has recently been explored in the multivariate setting [MPnK19], [Mar20].
Corollary 2.2
There is a unique quadratic left Lagrange interpolant from to the distinct points if and only if the points are not all similar. The condition for the points to be similar can be expressed as
(2.4) |
A symmetric form of (2.4) can be obtained by evaluating the symmetrised form of the linear dependence (2.3) at .
The condition for unique left Lagrange interpolation is not translation invariant, except for some real translations or interpolation to less than three points. For example, quadratic interpolation at is not possible, but it is possible at (since ). In a similar vein, the polynomials of degree in when viewed as functions are not translation invariant, e.g.,
for some , if and only if is real.
Since there is a unique one-dimensional subspace of polynomials of degree in whose left evaluation at points (with no three similar) is zero, a Newton form for (left) Lagrange interpolation can be developed.
3 Quaternionic polynomials
It is now time to understand the nature of the quaternionic polynomials, viewed as functions , obtained from the formula (1.1) for the Lagrange polynomials. These involve polynomials of the form
which [Sud79] calls a quaternionic monomial of degree . We define the -span of these monomials to be the homogeneous polynomials of degree , and the polynomials of degree to be the -span of the homogeneous polynomials of degrees . These definitions extend to multivariate polynomials , where each occurrence of in the formula for a monomial is replaced by some coordinate .
It is clear from the definitions, that the quaternionic polynomials are a graded ring, i.e., the product of homogeneous polynomials of degrees and is a homogeneous polynomial of degree . To understand the dimensions of these spaces, we write as
and observe (see [Sud79]) that
(3.5) | ||||
(3.6) | ||||
(3.7) | ||||
(3.8) |
Hence are homogeneous monomials (in ), as are and , i.e.,
Every monomial of degree can be written as a homogeneous polynomial of degree in the (real) variables with quaternionic coefficients. The monomials in are linearly independent over by the usual argument (of taking Taylor coefficients), and so we have
(3.9) |
(3.10) |
In particular, the vector spaces of constant, linear and quadratic polynomials of a single quaternionic variable have dimensions and , respectively. This contrasts sharply with the real and complex cases, where the dimensions are and .
Example 3.1
In view of (3.5), a basis for the linear polynomials is given by . There is a unique linear Lagrange interpolant to any five points , which are affinely independent as points in . An explicit formula for the Lagrange interpolant can be obtained by solving the “linear system”
for in the skew-field . The corresponding Lagrange polynomials are the barycentric coordinates for the interpolation points. If the points are taken to be , then the interpolant can be written as
From this a (multivariate) Bernstein interpolant could be developed, if desired.
As is evident from this example, Lagrange interpolation from is essentially interpolation from , with the additional feature that formulas can be developed using a single quaternionic variable , or two complex variables , where
(3.11) |
We now consider interpolation from subspaces of that are a quaternionic analogue of the holomorphic functions. A function is said to be regular if it is in the kernel of the Cauchy-Feuter operator , i.e.,
and to be harmonic if
If is regular, then it is harmonic. The dimensions of and , the regular and harmonic homogeneous polynomials of degree , are
Example 3.2
The harmonic polynomial is not regular, since
A basis for (the right -vector space) is given by .
An explicit basis , for is given in [Sud79], where
Here
so for , , , . But is not regular. Interchanging and in the formula (presumably a typo), gives , and the basis
The product of regular functions is not (in general) regular, since
However, multiplying the basis of Example 3.2 by , to get , we have
so that the average is regular. In this way, [Sud79] gives a basis for consisting of symmetrised products of the linear regular polynomials , where the factors occur times, .
Though the (Feuter) regular polynomials are a proper subspace of the quaternionic polynomials (which share some aspects of holomorphic polynomials, but not that power series, since is not regular), we do not readily see a practical way to interpolate from them. There has recently been considerable interest in Cullen-regular functions [GS07], which do have power series expansions (around 0 or a real centre), and so correspond to the -dimensional subspace of formal polynomials in , which we have already discussed.
4 Multivariate Lagrange interpolation
We now consider interpolation methods derived from (1.1). As already discussed, this is essentially multivariate polynomial interpolation to functions .
Example 4.1
The order in which the factors of are calculated is important. For , , , we might take “” to be
This is not at , and so care must be taken with the order of multiplication in (1.1). Natural choices for the multiplication order are to evaluate each quotient first (with right scalar multiplication), or to take the product of the numerators, and then right multiply this by the inverse of its value at , in concrete terms for for three points either of
Either of the choices for computing suggested above give
-
•
A unique linear Lagrange interpolation operator to any points from the -dimensional subspace of , where the Lagrange polynomials have precisely zeros.
-
•
The operator depends continuously on the interpolation points.
-
•
It could be “symmetrised” to obtain an operator which doesn’t depend on the ordering of the points (though the Lagrange polynomials might now have additional zeros).
In this vein, we now define a generic polynomial of degree which is zero at points. For points , let
where is the symmetric group. This polynomial of degree is zero at the points , and (by construction) does not depend on their ordering.
We now present two possible choices for the Lagrange polynomials:
(4.12) |
provided that , and
(4.13) |
where the factors above are multiplied in the order (or any fixed order). Both are independent of the point ordering, and depend continuously on the points. Let be the corresponding Lagrange interpolation operator
for the points , which does not depend on their ordering. We have
-
•
The interpolation operator depends continuously on the points .
-
•
The interpolation space depends continuously on the points .
-
•
The interpolation operator is translation invariant, i.e.,
We compare this Lagrange interpolation with the two most prominent multivariate generalisations of univariate Lagrange interpolation, where the interpolation points are not in some predetermined geometric configuration.
Kergin interpolation [MM80] interpolates function values at points in by a polynomial of degree , with other “mean-value” interpolation conditions (see [Wal97]) that depend continuously on the points also matched. Here the interpolation space is fixed, and hence depends continuously on the points. Kergin interpolation has also been extended to (see [Fil97]). Using the identifications , one can defined a Kergin interpolation to functions from the whole space (with additional interpolation conditions). The explicit formulas for Kergin interpolation involve derivatives of (the operator is defined for -functions), and are not as easily computed as ours.
Least interpolation [dBR92] is a very general method, which seeks an interpolation space of dimension to the points , which has polynomials of lowest (least) degree. It has many nice properties that include the continuity properties listed above, but there is no explicit formula. It could be applied to functions in the same way that Kergin interpolation can be. It might even be possible to develop a least interpolation for “polynomials in ”, once such a theory is developed. The least interpolation has the advantage that polynomials of low degree are used. In particular, the Lagrange polynomials are a partition of unity, i.e.,
For the Lagrange polynomials that we have proposed, this may not be the case. Indeed, the set of all possible “nice” Lagrange polynomials for , i.e, those polynomials of degree , with and not depending on the order of the points, form an affine subspace of , from which we have suggested two choices. It may be that requiring, in addition, the partition of unity property, gives a unique choice, but we have not pursued this.
Since our Lagrange interpolation is effectively interpolation to functions , we can define an interpolation operator to functions in the natural way, i.e.,
and is the points viewed as a subset of . Heuristically, the real Lagrange polynomials are more likely to be “nice”, e.g., form a partition of unity, have no extra zeros, or coincide for both choices, since there is the “commutativity relation”
In a similar way, one could define a Lagrange interpolation operator to functions , by using the Cayley-Dickson construction (3.11).
It is also possible to develop Lagrange interpolants through a Newton form (either for functions or ), and an associated theory of divided differences. For example, if is a Lagrange interpolant at , then
gives a Lagrange interpolant to at the points , and a “divided difference” . Choices for could include or (for ). The map is an -linear functional. We have not invesigated its divided difference type properties any further.
5 Concluding remarks
This work came about when investigating tight frames and spherical designs for (see [Wal18], [Wal20]). It soon became apparent that the theory of quaternionic polynomials of one and several variables is involved, and not widely known. There is considerable work in at least two different directions. One is a formal (algebraic) approach dating back to [Ore33], [Lam86], where point evaluation and multiplication of polynomials are appropriately defined, and the other views the polynomials as functions, with the usual point evaluation and (pointwise) multiplication.
Here we have shown that
- •
-
•
Lagrange interpolation methods with some geometric properties, e.g., translation invariance, are essentially multivariate polynomial interpolation methods.
-
•
Many basic questions about quaternionic polynomials of one (and several) variables remain, e.g., the existence of Lagrange polynomials with no extra zeros which form a partition of unity.
Functions of quaternionic variables have long been used in physics, and geometric design (cf. [FGMS19]). We hope this paper gives some insight into polynomials of one or more quaternionic variables, and their use in interpolation and cubature (spherical designs).
References
- [Bol15] Vladimir Bolotnikov. Polynomial interpolation over quaternions. J. Math. Anal. Appl., 421(1):567–590, 2015.
- [Bol20] Vladimir Bolotnikov. Lagrange interpolation over division rings. Comm. Algebra, 48(9):4065–4084, 2020.
- [dBR92] Carl de Boor and Amos Ron. The least solution for the polynomial interpolation problem. Math. Z., 210(3):347–378, 1992.
- [FGMS19] Rida T. Farouki, Graziano Gentili, Hwan Pyo Moon, and Caterina Stoppato. Minkowski products of unit quaternion sets. Adv. Comput. Math., 45(3):1607–1629, 2019.
- [Fil97] Lars Filipsson. Complex mean-value interpolation and approximation of holomorphic functions. J. Approx. Theory, 91(2):244–278, 1997.
- [GS07] Graziano Gentili and Daniele C. Struppa. A new theory of regular functions of a quaternionic variable. Adv. Math., 216(1):279–301, 2007.
- [Lam86] T. Y. Lam. A general theory of Vandermonde matrices. Exposition. Math., 4(3):193–215, 1986.
- [LL88] T. Y. Lam and A. Leroy. Vandermonde and Wronskian matrices over division rings. J. Algebra, 119(2):308–336, 1988.
- [Mar20] Umberto Martínez-Peñas. Theory and applications of linearized multivariate skew polynomials. arXiv e-prints, page arXiv:2001.01273, January 2020.
- [MM80] Charles A. Micchelli and Pierre Milman. A formula for Kergin interpolation in . J. Approx. Theory, 29(4):294–296, 1980.
- [MPnK19] Umberto Martínez-Peñas and Frank R. Kschischang. Evaluation and interpolation over multivariate skew polynomial rings. J. Algebra, 525:111–139, 2019.
- [Ore33] Oystein Ore. Theory of non-commutative polynomials. Ann. of Math. (2), 34(3):480–508, 1933.
- [Rod14] Leiba Rodman. Topics in quaternion linear algebra. Princeton Series in Applied Mathematics. Princeton University Press, Princeton, NJ, 2014.
- [Sud79] A. Sudbery. Quaternionic analysis. Math. Proc. Cambridge Philos. Soc., 85(2):199–224, 1979.
- [Wal97] Shayne Waldron. Integral error formulæ for the scale of mean value interpolations which includes Kergin and Hakopian interpolation. Numer. Math., 77(1):105–122, 1997.
- [Wal18] Shayne F. D. Waldron. An introduction to finite tight frames. Applied and Numerical Harmonic Analysis. Birkhäuser/Springer, New York, 2018.
- [Wal20] Shayne Waldron. Tight frames over the quaternions and equiangular lines. preprint, 1 2020.