Next Article in Journal
On Some Sequence Spaces via q-Pascal Matrix and Its Geometric Properties
Next Article in Special Issue
Parallel Subgradient-like Extragradient Approaches for Variational Inequality and Fixed-Point Problems with Bregman Relatively Asymptotical Nonexpansivity
Previous Article in Journal
A Human-like Inverse Kinematics Algorithm of an Upper Limb Rehabilitation Exoskeleton
Previous Article in Special Issue
A Mathematical Theoretical Study of a Coupled Fully Hybrid (k, Φ)-Fractional Order System of BVPs in Generalized Banach Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On Primary Decomposition of Hermite Projectors

Department of Mathematics and Statistics, University of South Florida, 4202 East Fowler ave, CMC 342, Tampa, FL 33620, USA
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(9), 1658; https://doi.org/10.3390/sym15091658
Submission received: 13 February 2023 / Revised: 21 April 2023 / Accepted: 22 April 2023 / Published: 28 August 2023
(This article belongs to the Special Issue Functional Analysis, Fractional Operators and Symmetry/Asymmetry)

Abstract

:
An ideal projector on the space of polynomials C [ x ] = C [ x 1 , , x d ] is a projector whose kernel is an ideal in C [ x ] . Every ideal projector P can be written as a sum of ideal projectors P ( k ) such that the intersection of their kernels ker P ( k ) is a primary decomposition of the ideal ker P . In this paper, we show that P is a limit of Lagrange projectors if and only if each P ( k ) is. As an application, we construct an ideal projector P whose kernel is a symmetric ideal, yet P is not a limit of Lagrange projectors.

1. Introduction

Let C [ x ] = C [ x 1 , , x d ] denote the algebra of polynomials in d variables with complex coefficients. A projector P on C [ x ] is a linear idempotent operator on C [ x ] . Such a projector is called an ideal projector if ker P is an ideal in C [ x ] . An ideal projector is called a Lagrange projector if ker P is a radical ideal in C [ x ] . If the range of P is N-dimensional, then P is a Lagrange projector if and only if there exist N distinct points x 1 , , x N C d such that
ker P = { f C [ x ] : f ( x 1 ) = = f ( x N ) = 0 }
or equivalently
( P f ) ( x j ) = f ( x j )
for all j = 1 , , N and all f C [ x ] . The last equivalence shows that Lagrange projectors interpolate at nodes x 1 , , x N and therefore present a natural extension of the classical Lagrange interpolation theory to the multivariate setting.
The notion of an ideal projector was first introduced by Birkhoff in [1]. Since then, it was further studied, and connections to different branches of mathematics were explored (see [2,3,4,5,6,7,8,9,10,11]). In this paper, we consider exclusively finite dimensional ideal projectors.
In one variable, every Hermite interpolation projector is the limit of a sequence of classical Lagrange interpolation projectors. That allows us to extend the definition of the Hermite interpolation projectors to the multivariate setting as follows.
Definition 1.
An ideal projector P is called a Hermite projector if there exist a sequence of Lagrange projectors P n on the range of P such that
P n f P f
for every f C [ x ] . We do not specify type of convergence because P n f and P f belong to the same finite-dimensional space; hence, all forms of convergence are equivalent.
In one variable setting, the ideal projectors are the same as classical Hermite projectors (see for example [10]). The natural question arises as to whether, in the multivariate setting, the same is true, i.e., is any ideal projector necessarily a limit of Lagrange projectors? Rather surprisingly, the resulting answer is positive in two variables (cf. [4]) but negative in three or more variables (cf. [12]). The question of a description of those ideal projectors that are Hermite was raised by Carl de Boor in [3]. Some partial results regarding this question were obtained in [8,9] and, in the very different language of algebraic geometry, in [13,14]. In this paper, we make a contribution to this problem by examining the primary decomposition of Hermite projectors.
Every finite-dimensional ideal projector P can be written as a finite (direct) sum of ideal projectors P ( k )
P = P ( 1 ) P ( 2 ) P ( m ) ,
where P ( k ) are ideal projectors such that the ideals ker P ( k ) form the primary decomposition of the ideal ker P . That is
ker P = k = 1 m ker P ( k )
and, for each P ( k ) , the variety
V ( ker P ( k ) ) : = { x C d : f ( x ) = 0 , for all f ker P ( k ) }
consists of exactly one point.
The main result of this paper is
Theorem 1.
P is Hermite if and only if each P ( k ) is Hermite.
Based on the above theorem, as an application, we will show the existence of a symmetric ideal projector (in three or more variables) that is not Hermite (see Theorem 7). Finally, we will showcase some problems in matrix theory (see Problem 2) that are related to the main result.

2. Preliminaries

Let C [ x ] denote the algebraic dual of C [ x ] , i.e., the space of all linear functionals on C [ x ] . For an ideal J C [ x ] , let V ( J ) denote the affine variety associated with J:
V ( J ) : = { x C d : f ( x ) = 0 , for all f J } .
The ideal J has a finite codimension (0-dimensional) if and only if the set V ( J ) is finite (cf. [15]). Moreover, V ( J ) dim ( C [ x ] / J ) and V ( J ) = dim ( C [ x ] / J ) if and only if the ideal J is radical i.e.,
J = { f : f ( x ) = 0 , for all V ( J ) } .
Let J denote a subspace of C [ x ] of all functionals that vanish on J. Hence
dim J = dim ( C [ x ] / J ) .
For x C d , we use δ x C [ x ] to denote the point evaluation functional:
δ x ( f ) = f ( x ) .
It is easy to see that for any N-dimensional Lagrange interpolation projector P, the variety V ( ker P ) is consisting of exactly N distinct points. Assuming V ( ker P ) = { x 1 , , x N } , we have
ker P = s p a n { δ x 1 , , δ x N } .
Below, we will review relations between ideal projectors and the sequence of commuting matrices.
Let P be an N-dimensional ideal projector and let G be its range. Hence, C [ x ] = G ker P and ker P is an ideal of codimension N in C [ x ] . Thus, C [ x ] / ker P is an N-dimensional algebra. For each coordinate x j of x , we define a multiplication operator ( N × N matrix) M j : C [ x ] / ker P C [ x ] / ker P associated with P by
M j [ f ] = [ x j f ]
where [ · ] represents a class equivalence in C [ x ] / ker P . The set ( M 1 , , M d ) forms a sequence of commuting matrices that are associated with the projector P. In fact, such a sequence uniquely defines P (see [4] for details). The matrices M j represent the operators defined on G by
M j ( f ) = P ( x j f ) .
The matrices M 1 , , M d were introduced by Hans Stetter (cf. [11,16,17]) who discovered the main relation between common eigenvalues (eigentuples) of these matrices and the variety V ( ker P ) .
Definition 2.
A d-tuple of complex numbers ( λ 1 , , λ d ) is called an eigentuple for ( M 1 , , M d ) if there exists a non-zero vector u C N such that
M j u = λ j u , j = 1 , , N .
Let σ ( M 1 , , M d ) denote the set of all eigentuples of the commuting matrices ( M 1 , , M d ) .
Theorem 2
([17]).  σ ( M 1 , , M d ) = V ( ker P ) .
Theorem 3
(cf. [4]). Suppose that we have a sequence of ideal projectors P n onto the same space G and let ( M 1 ( n ) , , M d ( n ) ) be multiplication operators associated with P n while ( M 1 , , M d ) is the multiplication operators on G associated with P. Then, P n P if and only if ( M 1 ( n ) , , M d ( n ) ) ( M 1 , , M d ) .
Next, we prove an extension of Theorem 5.2.1 in Artin [18] to the set of commuting matrices. Our proof is substantially different than the one presented there.
Theorem 4.
Let ( M 1 ( n ) , , M d ( n ) ) and ( M 1 , , M d ) be a d-tuple of operators on an N-dimensional space G. Assume that ( M 1 ( n ) , , M d ( n ) ) ( M 1 , , M d ) . Then, the sets σ ( M 1 n , , M d n ) are uniformly bounded and all accumulation points of σ ( M 1 n , , M d n ) are in σ ( M 1 , , M d ) .
Proof. 
Let ( λ 1 ( n ) , , λ d ( n ) ) σ ( M 1 n , , M d n ) , hence
M j ( n ) u n = λ j ( n ) u n , j = 1 , , d .
Assume without loss of generality that u n = 1 . Then
λ j ( n ) = λ j ( n ) u n = M j ( n ) u n M j ( n )
and since M j ( n ) converges, the norms M j ( n ) are uniformly bounded, which proves the first part of the theorem. Now, passing to a subsequence if necessary, we may assume that λ j ( n ) λ j . Then, M j ( n ) u n = λ j ( n ) u n . The sequence ( u n ) is uniformly bounded in a finite-dimensional space G; hence, it is compact. Passing to a subsequence if necessary, we may assume that u n u G and u = 1 . Finally, since ( M 1 ( n ) , , M d ( n ) ) are finite-dimensional operators, the convergence is uniform. Therefore
λ j ( n ) u n = M j ( n ) u n M j u .
In addition, λ j ( n ) u n λ j u , hence ( λ j ) σ ( M 1 , , M d ) . □
Combining the above with the Theorem 2, we obtain:
Corollary 1.
Let P be an N-dimensional Hermite projector and P n be a sequence of Lagrange projectors such that P n P . If V ( ker P ) = { x 1 , x 2 , , x N } and V ( ker P n ) = { x 1 ( n ) , x 2 ( n ) , , x N ( n ) } . Then, there exists a constant C such that | x k ( n ) | C for all k and n. Additionally, x 1 , x 2 , , x K are the only possible limit points of the set n V ( ker P n ) .
Now, we will recollect a few facts regarding the convergence of ideal projectors. The main idea is that such a convergence depends only on their respective kernels. For more details and proofs, see [12].
Theorem 5
(cf. [12]). Let P n and P be ideal projectors onto a finite-dimensional space G C [ x ] . Then, P n P if and only if for every functional F ker P , there exists a sequence of functionals F n ker P n such that F n F in the weak- topology. i.e.,
F n f F f , f o r a l l f C [ x ] .
If each P n is a Lagrange projector, then ker P n is spanned by N point evaluation functionals δ x 1 ( n ) , , δ x N ( n ) , and each F n can be written as their linear combination. Using the above theorem, we obtain the following.
Corollary 2.
An N-dimensional ideal projector P is Hermite if and only if every F ker P is the weak- limit of linear combinations of N point evaluation functionals. That is, there exists sets X n C d , each consisting of N distinct points such that for every F ker P
F ( f ) = lim n x X n a x ( n ) δ x ( f ) = lim n x X n a x ( n ) f ( x )
for some coefficients a x ( n ) and for all f C [ x ] .

3. The Main Result

The main goal is to prove Theorem 1. One side is easy to establish and can be shown as follows. Let P be an N-dimensional ideal projector and assume that ker P has a primary decomposition
ker P = j = 1 m J j
where the ideals J j have codimensions equal to N j , respectively. Since
ker P = J j
we have j = 1 M N j = N . Take any F ker P . Then, F = j = 1 m F j for some F j J j . If each J j is the kernel of a Hermite projector then, by Corollary 2, there exists sets X n j C d consisting of N j distinct points such
F j = lim n x X n j a x ( n ) δ x
It follows that
F = j = 1 m F j = lim n j = 1 m x X n j a x ( n ) δ x = lim n x X n j b x ( n ) δ x
and therefore, F is a weak-⋆ limit of a linear combination of N point evaluations. By Corollary 2, P is Hermite.
The main result of this section is a proof of the converse statement. The main idea is as follows. Assume P is Hermite, P = P ( 1 ) P ( 2 ) P ( m ) and ker P has a primary decomposition ker P = j = 1 m ker P ( j ) . By Corollary 2, there exists sets X n C d such that (6) holds. Let V ( ker P ( 1 ) ) = { y } . We will decompose X n = Y n Z n so that all accumulation points of n N Z n are away from y . For every functional F ker P (in particular, every functional F ker P 1 ), we have
F ( f ) = lim n x Y n a x ( n ) f ( x ) + x Z n a x ( n ) f ( x ) ,
for some coefficients a x ( n ) and for all f C [ x ] . The main part of the proof is to show that the above implies that
F ( f ) = lim n x Y n a x ( n ) f ( x ) .
Thus, in (7), we can eliminate all point evaluations that do not accumulate at y , and the number of points remaining is equal to N 1 = dim ker P 1 . Hence, by Corollary 2, the projector P 1 is Hermite.
To carry the proof in detail, we need a few preliminary results. First, we will produce a multivariate analog of Lagrange fundamental polynomials that seems to be new.
Proposition 1.
Let Y be a finite set of m points in C d and take z C d such that Y and z lie in the interior of a ball B C d of radius R. Let
r = min { y z : y Y } > 0 .
Then, there exists a constant C ( R , r ) and polynomial ω ( x ) = ω Y , z C [ x ] of degree at most m such that
ω ( z ) = 1 , ω ( y ) = 0 , f o r a l l y Y
and
ω B C ( R , r ) = 2 R r 2 m .
(here, ω B denotes the supremum of the polynomial ω over the ball B C d ).
Proof. 
Let < u , v > denote the Hermitian inner product in the space C d . Consider the following polynomial
ω ( x ) = y Y < x y , z y > y Y z y 2
Since < x y , z y > is a linear polynomial in C [ x ] , ω ( x ) is a polynomial of degree at most m. Clearly, ω ( y ) = 0 for all y Y and ω ( z ) = 1 .
Since x , y , z lie in a ball of radius R
y Y < x y , z y > y Y | | x y | | · | | z y | | ( 2 R ) 2 m .
Additionally
y Y z y 2 r 2 m .
Combining these two inequalities together yields ω B 2 R r 2 m .
We will also need the following lemma.
Lemma 1.
Let ( u 1 ( n ) , , u m ( n ) ) and ( γ 1 ( n ) , , γ m ( n ) ) be two sequences in C m such that
γ j ( n ) 1 a n d j = 1 m u j ( n ) ( γ j ( n ) ) k 0 , a s n
for all k = 1 , , m . Then, j = 1 m u j ( n ) 0 as n .
Proof. 
By induction on m, if m = 1 , then u 1 ( n ) γ 1 ( n ) 0 and γ 1 ( n ) 1 immediately implies that u 1 ( n ) 0 .
Assume that the statement is true for a fixed m. Now, we need to show that the statement is true for m + 1 . Take any ( u 1 ( n ) , , u m + 1 ( n ) ) and ( γ 1 ( n ) , , γ m + 1 ( n ) ) such that γ j ( n ) 1 for j = 1 , , m + 1 and
j = 1 m + 1 u j ( n ) ( γ j ( n ) ) k 0 as n , for all k = 1 , , m + 1 .
The goal is to show that j = 1 m + 1 u j ( n ) 0 . Since γ m + 1 ( n ) 1 , from the above, we obtain
γ m + 1 ( n ) j = 1 m + 1 u j ( n ) ( γ j ( n ) ) k = j = 1 m + 1 u j ( n ) ( γ j ( n ) ) k γ m + 1 ( n ) 0 ,
for k = 1 , , m . Hence
j = 1 m u j ( n ) ( γ m + 1 ( n ) γ j ( n ) ) ( γ j ( n ) ) k = j = 1 m + 1 u j ( n ) ( γ j ( n ) ) k γ m + 1 ( n ) j = 1 m + 1 u j ( n ) ( γ j ( n ) ) k + 1 0 ,
for all k = 1 , , m . Setting u ˜ j ( n ) = u j ( n ) ( γ m + 1 ( n ) γ j ( n ) ) the above gives
j = 1 m u ˜ j ( n ) ( γ j ( n ) ) k 0 for all k = 1 , , m .
By the inductive assumption applied to ( u ˜ 1 ( n ) , , u ˜ m ( n ) ) and ( γ 1 ( n ) , , γ m ( n ) ) , we conclude that j = 1 m u ˜ j ( n ) 0 . Hence
j = 1 m u j ( n ) γ j ( n ) γ m + 1 ( n ) j = 1 m u j ( n ) = j = 1 m u j ( n ) ( γ j ( n ) γ m + 1 ( n ) ) = j = 1 m u ˜ j ( n ) 0 .
Setting k = 1 in (10), we obtain
j = 1 m u j ( n ) γ j ( n ) γ m + 1 ( n ) u m + 1 ( n ) = j = 1 m + 1 u j ( n ) γ j ( n ) 0 .
Combining these two gives
γ m + 1 ( n ) j = 1 m + 1 u j ( n ) = j = 1 m u j ( n ) γ j ( n ) γ m + 1 ( n ) j = 1 m u j ( n ) j = 1 m u j ( n ) γ j ( n ) γ m + 1 ( n ) u m + 1 ( n ) 0 .
Since γ m + 1 ( n ) 1 , we conclude that j = 1 m + 1 u j ( n ) 0 as required. □
We are now ready for the proof of the main theorem.
Theorem 6.
Let P be a Hermite projector onto an N-dimensional space G C [ x ] . Suppose that
P = P ( 1 ) P ( 2 ) P ( m )
where P ( k ) are ideal projectors such that the ideals ker P ( k ) form the primary decomposition of the ideal ker P
ker P = k = 1 m ker P ( k ) .
Then, each P ( k ) is Hermite.
Proof. 
We will start with P ( 1 ) . Assume that V ( ker P ) = { u 1 , u m } and ker P ( m ) = { u m } . Since P is Hermite, by Corollary 2, for every functional F ker P
F ( f ) = lim n x X n a x ( n ) δ x ( f ) = lim n x X n a x ( n ) f ( x )
for every f C [ x ] . In particular, if F j = 1 m 1 ker P ( j ) , then due to (12), F ker P and hence (13) holds. By Corollary 1, the sets X n lie in some ball in C d of radius R and { u 1 , u m } are the only accumulation points of n X n . Partition the points X n = Y n Z n so that for every sequence x n Z n , we have
x n u m
and, for sufficiently large n, the points x n Y n are arbitrarily close to the set { u 1 , u m 1 } . In particular,
x n u m r > 0 , for some r and for all x n Y n .
We rewrite (13) as
F ( f ) = lim n x Y n a x ( n ) f ( x ) + x Z n a x ( n ) f ( x ) ,
where the points in Y n and Z n satisfy (15) and (14), respectively. Now, let p be a polynomial in j = 1 m 1 ker P ( j ) such that p ( u m ) = 1 . Such a polynomial exists since, otherwise, every polynomial in j = 1 m 1 ker P ( j ) would vanish at u m and hence u m V ( j = 1 m 1 ker P ( j ) ) = { u 1 , , u m 1 } . Next, consider polynomials
h k , n = ( p · ω Y n , u m ) k f
for k = 1 , , m where ω Y n , u m is defined as in Proposition 1, and f is arbitrary. Since p is in the ideal j = 1 m 1 ker P ( j ) so are h k , n , hence F ( h k , n ) = 0 . By the same proposition and by (14), these polynomials are uniformly bounded and belong to a finite-dimensional space of polynomials of degree ( m m + deg p ) + deg f . Thus, the convergence (16) on this space is uniform, and (16) gives
lim n x Y n a x ( n ) h k , n ( x ) + x Z n a x ( n ) h k , n ( x ) = F ( h k , n ) = 0 .
Furthermore, since ω Y n , u m vanishes on Y n , it follows that
lim n x Z n a x ( n ) ( p ( x ) · ω Y n , u m ( x ) ) k f ( x ) = lim n x Z n a x ( n ) h k , n ( x ) = 0 ,
for k = 1 , m . Finally, since u m is the limit point of Z n
lim n p ( x n ) · ω Y n , u m ( x n ) = 1 whenever x n Z n .
Setting γ n = p ( x n ) · ω Y n , u m ( x n ) for x n Z n and applying Lemma 1, we conclude that
lim n x Z n a x ( n ) f ( x ) = 0
Thus, we eliminate the points that accumulate at u m from the sum in (16). Since this implies (6) holds for P ( 1 ) P ( m 1 ) , we can repeat this procedure, eliminating all points from X n in the sum (13) that accumulates at u m 1 , , u 2 . We arrive at the sequences of sets X n ( 1 ) = { x 1 ( n ) , , x N n ( 1 ) ( n ) } X n that have an accumulation point at u 1 such that every F in ker P ( 1 )
F ( f ) = lim n x X n ( 1 ) a x ( n ) δ x ( f ) = lim n x X n ( 1 ) a x ( n ) f ( x ) .
Thus, for sufficiently large n, the dimension of this space must be greater or equal to the dimension of the space ker P ( 1 ) . Hence X n ( 1 ) dim ker P ( 1 ) . Repeating this procedure for the rest of the points u j V ( ker P ) , we will obtain a disjoint partition of X n :
X n = j = 1 m X n ( j )
such that for every F ker P ( j )
F ( f ) = lim n x X n ( j ) a x ( n ) δ x ( f ) = lim n x X n ( j ) a x ( n ) f ( x )
and
X n ( j ) dim ker P ( j ) .
However, for every n
j = 1 m X n ( j ) = N = j = 1 m dim ker P ( j ) .
Hence, for sufficiently large n, we have X n ( j ) = dim ( ker P ( j ) ) . By Corollary 2, we obtain that each P ( j ) is Hermite. □

4. Some Applications

The first application of the main theorem is to show the existence of a symmetric ideal projector (in three or more variables) that is not Hermite.
Definition 3.
An ideal J in C [ x ] is called symmetric if for any polynomial p ( x 1 , , x d ) in J and for any permutation σ on the set { 1 , , d } , the polynomial p ( x σ ( 1 ) , , x σ ( d ) ) is also in J. An ideal projector P is called symmetric if ker P is a symmetric ideal.
Theorem 7.
In three or more variables, there exists a finite-dimensional symmetric ideal projector that is not Hermite.
Proof. 
The result follows from the existence of a finite-dimensional non-Hermite ideal projector Q such that ker Q is primary, i.e., V ( ker Q ) consists of one point. We chose such Q so that V ( ker Q ) = { ( 1 , 2 , , d ) } . Now, for every permutation σ, consider the ideal Q σ with ker Q σ = { p ( x σ ( 1 ) , , x σ ( d ) ) : p ( x 1 , , x d ) ker Q } . Then, clearly, the ideal
J : = σ ker Q σ
is a symmetric ideal and (20) is a primary decomposition of this ideal. Let P be an ideal projector with ker P . Then, P is a symmetric ideal projector. If P was a Hermite projector, then, by the Theorem 6, Q would also be Hermite, which gives us a contradiction. □
Problem 1.
Does there exist a non-Hermite ideal projector P such that P is symmetric and V ( ker P ) = { 0 } , i.e., ker P is primary?
Our second application concerns linear algebra. A sequence of commuting N × N matrices ( M 1 , , M d ) is called simultaneously diagonalizable if there exists an N × N matrix S such that the matrices ( S 1 M 1 S , , S 1 M d S ) are diagonal matrices. We have the following.
Theorem 8
([12]). Let P be an ideal projector. Then, P is a Lagrange projector if and only if the sequence of matrices M P = ( M 1 , , M d ) associated with P by (4) is simultaneously diagonalizable. The ideal projector P is Hermite if and only if the sequence of matrices ( M 1 , , M d ) associated with P by (4) is a limit of a sequence ( M 1 ( n ) , , M d ( n ) ) of simultaneously diagonalizable matrices.
Commuting matrices that are limits of simultaneously diagonalizable matrices have received a fair amount of attention (cf. [13,19,20]). The following result was proved in [5]:
Theorem 9.
Let P be an ideal projector onto the N-dimensional subspace V and let
P = P ( 1 ) P ( 2 ) P ( m )
be the primary decomposition of P. Then,
(i) 
M P has a unique (up to order of blocks) block diagonalization M P = d i a g ( M ( j ) ) consisting of m blocks and m is the maximal number of blocks in any block-diagonalization of M P .
(ii) 
Each block M ( j ) defines a distinct primary ideal.
ker P ( j ) = { p C [ x ] : p ( M ( j ) ) = 0 }
Under the assumptions of the above, we can set M ( j ) = ( M 1 ( j ) , , M d ( j ) ) (where all M 1 ( j ) , , M d ( j ) have the same size) and M P = ( M 1 , , M d ) where
M j = M j ( 1 ) 0 0 0 M j ( 2 ) 0 0 0 M j ( m ) , for j = 1 , , d .
Observe that M P = ( M 1 , , M d ) defines a sequence of commuting matrices.
It is clear that if each sequence M ( j ) = ( M 1 ( j ) , , M d ( j ) ) is a limit of simultaneously diagonalizable matrices ( M 1 , n ( j ) , , M d , n ( j ) ) , then M P is a limit of simultaneously diagonalizable matrices. Our main Theorem 6 asserts that the converse is also true. That is, if M P is a limit of simultaneously diagonalizable matrices, then the sequences of maximal blocks M ( j ) are also limits of simultaneously diagonalizable sequences. This leads to an interesting question about the extension of this result to an arbitrary commuting block-diagonal sequence of matrices.
Problem 2.
Let M = ( M 1 , , M d ) be a sequence of commuting matrices such that each M j is block diagonal, i.e., of the form of (21). Let M ( j ) = ( M 1 ( j ) , , M d ( j ) ) be of the same size and commute. Suppose that M is a limit of simultaneously diagonalizable matrices. Does it imply that each sequence M ( j ) is a limit of simultaneously diagonalizable matrices?
Remark 1.
In the language of algebraic geometry, the ideals that serve as kernels of Hermite projectors are called "smoothable" (cf. [14]). Hence, the main result of this paper formulated in this language says that an ideal J is smoothable if and only if every ideal in the primary decomposition of J is smoothable.

Author Contributions

Conceptualization, B.S., L.S. and B.T.; investigation, B.S., L.S. and B.T.; methodology, B.S., L.S. and B.T.; writing—original draft preparation, B.S., L.S. and B.T.; writing—review and editing, B.S., L.S. and B.T. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

The authors would like to express their gratitude to Jaroslaw Buczynski for many fruitful discussions concerning the subject of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Birkhoff, G. The Algebra of Multivariate Interpolation, in Constructive Approaches to Mathematical Models; Coman, C.V., Fix, G.J., Eds.; Academic Press: New York, NY, USA, 1979; pp. 345–363. [Google Scholar]
  2. de Boor, C.; Ron, A. On polynomial ideals of finite codimension with applications to box spline theory. J. Math. Anal. Appl. 1991, 158, 168–193. [Google Scholar] [CrossRef]
  3. de Boor, C. Ideal interpolation. In Approximation Theory XI, Gatlinburg 2004; Chui, C.K., Neamtu, M., Schumaker, L., Eds.; Nashboro Press: Brentwood, TN, USA, 2005; pp. 59–91. [Google Scholar]
  4. de Boor, C.; Shekhtman, B. On the pointwise limits of bivariate Lagrange projectors. Linear Algebra Appl. 2008, 429, 311–325. [Google Scholar] [CrossRef]
  5. McKinley, T.; Shekhtman, B. On simultaneous block-diagonalization of cyclic sequences of commuting matrices. Linear Multilinear Algebra 2010, 58, 245–256. [Google Scholar] [CrossRef]
  6. Sauer, T. Polynomial Interpolation, Ideal And Approximation Order Of Multivariate Refinable Functions. Proc. Am. Math. Soc. 2002, 130, 3335–3347. [Google Scholar] [CrossRef]
  7. Sauer, T. Polynomial interpolation in several variables: Lattices, differences, and ideals. In Multivariate Approximation and Interpolation; Buhmann, M., Hausmann, W., Jetter, K., Schaback, W., Stöckler, J., Eds.; Elsevier: Amsterdam, The Netherlands, 2006; pp. 189–228. [Google Scholar]
  8. Shekhtman, B. On the limits of Lagrange projectors. Constr. Approx. 2009, 29, 293–301. [Google Scholar] [CrossRef]
  9. Shekhtman, B. On one class of Hermite projector. Constr. Approx. 2016, 44, 297–311. [Google Scholar] [CrossRef]
  10. Shekhtman, B. Ideal Interpolation, Translations to and from Algebraic Geometry. In Approximate Commutative Algebra, “Texts and Monographs in Symbolic Computation”; Robbiano, L., Abbott, J., Eds.; Springer: Wien, Austria, 2009; pp. 163–189. [Google Scholar]
  11. Stetter, H.J. Matrix eigenproblems at the heart of polynomial system solving. Sigsam Bull. 1995, 30, 22–25. [Google Scholar] [CrossRef]
  12. Shekhtman, B. On perturbations of ideal complements. In Banach Spaces and Their Applications in Analysis; Randrianantonina, B., Randrianantonina, N., Eds.; De Gruyter: Berlin, Germany; New York, NY, USA, 2007; pp. 413–422. [Google Scholar]
  13. Guralnick, R.; Sethurman, B. Commuting pairs and triplets of matrices and related varieties. Linear Algebra Appl. 2000, 310, 139–148. [Google Scholar] [CrossRef]
  14. Miller, E.; Sturmfels, B. Combinatorial Commutative Algebra (Graduate Texts in Mathematics, 227); Springer: New York, NY, USA, 2005. [Google Scholar]
  15. Cox, D.; Little, J.; O’Shea, D. Using Algebraic Geometry, Graduate Texts in Mathematics; Springer: New York, NY, USA; Berlin/Heidelberg, Germany, 1997. [Google Scholar]
  16. Auzinger, W.; Stetter, H. An elimination algorithm for the computation of all zeros of a system of multivariate polynomial equations. In Proceedings of the International Conference on Numerical Mathematics, Singapore, 31 May–4 June 1988; Birkhäuser: Basel, Switzerland, 1988; Volume 86, pp. 12–30. [Google Scholar]
  17. Stetter, H.J. Numerical Polynomial Algebra; SIAM: Philadelphia, PA, USA, 2004. [Google Scholar]
  18. Artin, M. Algebra, 2nd ed.; Pearson: Boston, MA, USA, 2011. [Google Scholar]
  19. Guralnick, R. A note on commuting pairs of matrices. Linear Multilinear Algebra 1992, 31, 71–75. [Google Scholar] [CrossRef]
  20. Sivic, K. On varieties of commuting triplets. Linear Algebra Appl. 2008, 428, 2006–2029. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Shekhtman, B.; Skrzypek, L.; Tuesink, B. On Primary Decomposition of Hermite Projectors. Symmetry 2023, 15, 1658. https://doi.org/10.3390/sym15091658

AMA Style

Shekhtman B, Skrzypek L, Tuesink B. On Primary Decomposition of Hermite Projectors. Symmetry. 2023; 15(9):1658. https://doi.org/10.3390/sym15091658

Chicago/Turabian Style

Shekhtman, Boris, Lesław Skrzypek, and Brian Tuesink. 2023. "On Primary Decomposition of Hermite Projectors" Symmetry 15, no. 9: 1658. https://doi.org/10.3390/sym15091658

APA Style

Shekhtman, B., Skrzypek, L., & Tuesink, B. (2023). On Primary Decomposition of Hermite Projectors. Symmetry, 15(9), 1658. https://doi.org/10.3390/sym15091658

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop