Abstract
We begin with a degree m real homogeneous polynomial in n indeterminants and bound the distance from a given n-dimensional real vector to the real vanishing of the homogeneous polynomial. We then apply these bounds to the real homogeneous polynomial associated with a nonzero m-order n-dimensional weakly symmetric tensor which has zero as an eigenvalue. We provide “nested spheres” conditions to bound the distance from a given n-dimensional real vector to the nearest zero eigenvector.
MSC:
15A18; 15A69
1. Introduction
Let be the real field, and we consider an m-order n-dimensional tensor consisting of entries in :
We denote the space of all m-order n dimensional tensor real tensors by .
To an n-vector , real or complex, we define the n-vector:
We denote the n-vector .
The following were first introduced and studied by Qi and Lim [,,,].
Definition 1.
Let . A pair is called an eigenvalue–eigenvector (or simply eigenpair) of if they satisfy the equation
We call an H-eigenpair if they are both real.
Definition 2.
Let . A pair is called an E-eigenvalue and E-eigenvector (or simply E-eigenpair) of if they satisfy the equation
We call a Z-eigenpair if they are both real.
The notion of weakly symmetric tensors was first introduced in [].
Definition 3.
is called weakly symmetric if the associated homogeneous polynomial
satisfies . In the tensor notation, according to [], the homogeneous polynomial is also denoted by .
Although this definition is not as intuitive as symmetric tensors, it nevertheless provides the same desired variational (extremal) property as symmetric tensors. It should also be noted that, for , symmetric matrices and weakly symmetric matrices coincide. However, it is shown in [] that a symmetric tensor is necessarily weakly symmetric for , but the converse is not true in general. Furthermore, if is weakly symmetric, by homogeneity, it satisfies the familiar Euler’s identity:
where denotes the standard inner product on .
Both H-eigenvalues and Z-eigenvalues of a given tensor have found numerous applications in numerical multilinear algebra, image processing, higher order Markov chains, and spectral hypergraph theory. In particular, it is a well-known fact (e.g., []) that the extremal Z-eigenvalues correspond to the constrained extremal values of on the unit sphere . However, most theoretical as well as numerical developments, refs. [,,,,,] have been dedicated to finding the extremal eigenvalues and eigenvectors, and very little attention has been given to the zero eigenvalue and its eigenvectors. However, it is important not to overlook the importance of the zero eigenvectors, since positive semi-definite (PSD) tensors must take on zero eigenpairs. From a practical standpoint, for large values of m or n, finding real solutions to a high-degree multivariate polynomial system may not be feasible. In particular, as the degree m increases, even solving a single multivariate polynomial equation becomes both time-consuming and costly. With this in mind, we endeavor to provide reasonable upper and lower bounds on the distance from a given initial point with to the nearest zero eigenvector of without using high-power computer software.
Throughout the paper, we shall always assume our tensor is nonzero and weakly symmetric. Our paper is organized as follows. In Section 2, we begin by considering a more general problem concerning the real vanishing of a degree m real homogeneous polynomial f in n indeterminants. We provide the lower bound of the distance from a given point e outside to . This lower bound is completely determined by the combinatorial nature of the coefficients of f itself. In Section 3, we establish an upper bound, based on the analytic and algebraic nature of the f, on the distance from a given initial point e outside to . In Section 4, we establish the connection between the real zeros of the associated homogeneous polynomial and the zero eigenvectors of a nonzero m-order n-dimensional weakly symmetric tensor . We first examine the basic topological structure of as well as the critical point set . We then provide both upper and lower bounds on the distance from a given initial point e with to the nearest zero Z-eigenvector. In Section 5, we give a variety of examples to demonstrate how the upper and lower bounds work.
2. Lower Bound for the Distance to the Real Vanishing
For simplicity, we shall only work with real homogeneous polynomials. We first establish some notational convention, which will be used throughout the rest of this paper. We denote the standard Euclidean norm on by , the standard unit ball in by , and the standard unit sphere by , i.e.,
Let be a positive integer, we denote by the set of all real homogenous polynomials of degree d in the indeterminants . Let . Since is continuous, we denote the uniform norm of f on by . Furthermore, we denote
to be the real vanishing of f, which is always a closed subset of . The goal of this section is to bound the distance from a point outside to from below.
Lemma 1.
Let with . Then, there exists a constant such that
Namely, .
Proof.
Let with be a multi-index such that . We write
in terms of different monomials. Let be the largest monomial coefficient in absolute value. Since there are at most nonzero different monomials in , our assertion follows. □
Lemma 2.
Let with . Then, there exists a constant such that for all x, ,
Proof.
Let . Since is convex, by the mean value theorem, there exists a point c along the line segment for , joining x and y such that
By the Cauchy–Schwarz inequality, we have:
We now compute:
We set , it follows that for all , as required. Our assertion now follows. □
Let . Let be such that . Suppose , then for any , Lemma 2 yields that
Since is closed and bounded, it is compact; hence, we can define
as the Euclidean distance from e to and , then, we have:
Theorem 1.
Let . Let be such that . Assume that , then .
3. Upper Bound for the Distance to the Real Vanishing
In this section, we endeavor to establish a nontrivial upper bound for the distance to from a given point. Fix and let , since , there exists a unique geodesic (a great circle ) on joining e and x on . From differential geometry, we know a geodesic is distance minimizing from a given point e until reaching its conjugate point, which in this case, is the antipodal point . This means that the arc length of the great circle joining x to e is the spherical distance between them. Consequently, the two distinct lines and can be at most -spherical distance apart, so projectively speaking, the Euclidean distance between and is at most , which is a trivial upper bound.
Surprisingly, a nontrivial upper bound is a much more challenging task. We will need additional tools from a special class of polynomials, known as hyperbolic polynomials. The existing literature on both real stable and hyperbolic polynomials is vast. For a more in-depth reading on this topic, we refer the interested reader to [,]. However, to be more self-contained, we introduce the following definitions.
Definition 4.
A nonzero polynomial is called real stable if it has no zeros in , i.e., It is a well-known fact that a nonzero polynomial is real stable if and only if, for all and , the polynomial is real rooted.
Definition 5.
A degree d homogeneous polynomial is called hyperbolic in direction if and the univariate polynomial for every is real rooted, i.e., it has only real zeros.
The study of hyperbolic polynomials dated back to Grding and Hurwitz’s time and has since been playing a vital role in hyperbolic programming [,]. To help visualize the notion of hyperbolicity, by considering the restriction of on the line originating from x parallel to the fixed direction e, we insist that is real rooted.
Some of the most noteworthy examples of hyperbolic polynomials are as follows:
Example 1.
The Lorentzian quadratics is hyperbolic in direction .
Example 2.
Let . The degree k symmetric polynomial for is hyperbolic in direction .
Example 3.
Let for be a linear form, then their product is hyperbolic in direction e as long as e is not a common zero to all .
Example 4.
Let denote the real vector space of all real symmetric matrices. The determinant function is hyperbolic in direction , the identity matrix.
Example 5.
Let be a finite graph, then the matching polynomial of G is real stable, and hence hyperbolic in any direction .
A very important property of hyperbolic polynomials states that, if are both hyperbolic in direction e, then so is their product . Moreover, an algorithm in polynomial time, based on Newton’s identities, can be used to check the real rootedness of a given polynomial due to the following result:
Theorem (Hermite-Sylvester).
A polynomial is real rooted if and only if the Hermitian matrix H with is a positive semi-definite (PSD) matrix.
We now return to the upper bound estimate. In [], a similar upper bound was found by M. Shub for complex homogeneous polynomials. However, since we are only concerned with the real zeros of a homogeneous polynomial, the original argument must be accordingly modified to suit the needs of real solutions.
Theorem 2.
Let . Assume . Let be such that . If is hyperbolic in the direction e, then the Euclidean distance from the nearest zero of f on the unit sphere to e is at most , where
Proof. 
Without loss of generality, by rotation if necessary, we may adjust and . For any , we can write for and . Then, the homogeneous polynomial takes on the form
where is of homogeneous degree i for in the remaining indeterminants. Clearly, , so we may instead consider the monic polynomial
where for .
Let is the nearest zero of f from e. Let s be the arc-length of the geodesic (great circle) joining e and ; then, has no real zeros inside the double cone , whose central symmetry axis is in the direction e of the radius in the hyperplane defined by , as illustrated in the figure below.

Fix and let . We now study the univariate polynomial
By assumption, since is hyperbolic in direction e, is real rooted with all real zeros inside the double cone of radius , whose central symmetry axis is in the direction . According to Vietá’s formula, the coefficient is precisely the ith symmetric function of the roots, since all roots are real and inside the cone of radius r, we have
It follows that
If , then
It is a straightforward calculus exercise to see that
This implies
We now return to the Euclidean distance between e and . Note that is precisely the length of the cord connecting e and with the prescribed arc length s, and it is therefore easy to see
which implies
or equivalently,
This completes the proof. □
Although is not directly computed via the coefficients of f itself, it is not difficult to obtain by available constrained optimization methods, for instance De Lathauwer et al. [] and Kofidas and Regalia [], or using the MaxValue and MinValue commands provided directly by Mathematica [].
Combining the results of Theorems 1 and 2, we have the following “nested spheres” estimate:
Corollary 1.
Let . Assume . Let be such that . Then
- .
- If in addition, is hyperbolic in direction e, then .
4. The Zero Eigenvectors of a Nonzero Weakly Symmetric Tensor
In this section, we turn our attention to the problem of locating the nearest zero Z-eigenvector of a nonzero weakly symmetric tensor from a given point. We shall henceforth assume that is weakly symmetric and has zero as a Z-eigenvalue.
Given an initial point and assuming has zero eigenvectors, we would like to afford both lower and upper bounds on the Euclidean distance from e to the nearest zero Z-eigenvector of .
In order to make an easier transition from real homogeneous polynomials to real weakly symmetric tensors, we begin by analyzing the critical points of a homogeneous polynomial . We denote by
the set of critical points of f. It is worth noting that both and are closed and path-connected with . To see that is path-connected, clearly and observe that for any , we have for all , and thus, the whole line . Similarly, since
we have that is also closed and path-connected. We see that follows from the fact .
In multivariate calculus, given a differentiable function , a point is said to be a critical point of f if . Furthermore, p is said to be a non-degenerate critical point of f if the Hessian matrix of f at p is nonsingular. Following the famous Morse’s Lemma, all non-degenerate critical points are isolated; that is, if p is a non-degenerate critical point of f, then there exists a neighborhood of p, which contains no other critical points of f. Furthermore, a non-degenerate critical point is a local maximum, or a local minimum, or a saddle point of the function f.
Given a nonzero weakly symmetric tensor , let be its associated homogeneous polynomial. Since is always a critical point of , if is non-degenerate, then must be an isolated point in . Since is path-connected, we have . This implies that has only the trivial solution; hence, 0 must not be a Z (or H)-eigenvalue of . This observation directs our attention to the case where is a degenerate critical point of .
Example 6.
The classical example of the “monkey saddle” defined by , whose only critical point is at , happens to be a degenerate critical point. However, since is the only critical point, has only the trivial solution.
Example 6 shows a degenerate, yet isolated, critical point that still fails to be a candidate for zero eigenvectors. Suppose is a non-isolated critical point of (and therefore necessarily degenerates), then there exists , i.e., , i.e., is a Z (or H-) eigenvector of 0. Hence, 0 must be a Z (or H-)eigenvalue of .
Putting these observations together, we reach the following conclusion:
Proposition 1.
Let be a weakly symmetric tensor with associated homogeneous polynomial . The following are equivalent:
- 0 is a Z (or H)-eigenvalue of .
- is a non-isolated critical point of .
- .
We note that, when is a non-isolated critical point of , it is still possible to have as supported by the following example.
Example 7.
Consider
It is easy to see that consists of four lines: , , and . However, consists of only the coordinate axes and .
Under the framework of tensors, we have the following alternative lower bounds on the distance from a given point with to the nearest zero Z-eigenvector of .
Lemma 3.
Let be weakly symmetric with the associated homogeneous polynomial . Then, there exists a constant such that
Namely, .
Proof.
By definition,
We set
the largest entry in absolute value of , then all , we have
□
Lemma 4.
Let be weakly symmetric with associated homogeneous polynomial . Then, there exists a constant such that for all x, ,
Proof.
The proof is similar to Lemma 2. We have the following alternative form of
where . Let . Since is convex, by the mean value theorem, there exists a point c along the line segment for , joining x and y such that
By the Cauchy–Schwarz Inequality, we have:
Since
we have:
It follows that
We set , and it yields:
Thus,
which completes the proof. □
Then we immediately have the following consequence.
Corollary 2.
Let be weakly symmetric with the associated homogeneous polynomial . Let . Assume . Let , then
In conjunction with Theorem 1, we also have:
Corollary 3.
Let be weakly symmetric with the associated homogeneous polynomial . Let . Assume that , then .
Since is closed and bounded, it is compact; there must be a point such that , which is the nearest zero of on the unit sphere to e. Projectively speaking, the distance from the line to is at least .
We end this section by improving upon this lower bound. First, we introduce another constant as follows.
Let be given as above. Since each partial derivative for is a degree homogeneous polynomial of , using Lemma 1, we can define in the same fashion constants for . Now, we set
Theorem 3.
Let be weakly symmetric with the associated homogeneous polynomial . Assume that is a non-isolated critical point of . Let , then the Euclidean distance from the nearest zero Z-eigenvector of on the unit sphere to e is at least , where
Proof.
For any , we have:
It follows from Lemma 2, for ,
Since , we have:
Hence,
i.e.,
Suppose . Then, . This implies
On the other hand, since , we obtain by the Cauchy–Schwarz inequality that
Consequently,
as required. Lastly, since is compact, the Euclidean distance from the nearest zero Z-eigenvector of on the unit sphere to e is attained at some with . □
Remark 1.
The main difference between Corollary 3 and Theorem 3 is that Corollary 3 gives a lower bound for the distance to the nearest real zero of with the unit length from e, whereas Theorem 3 gives a lower bound for the distance to the nearest zero Z-eigenvector of with the unit length from e. It turns out, as seen by various examples in §5, the lower bound in Theorem 3 tends to be sharper than given in Corollary 3.
We now rephrase Theorem 2 as follows:
Theorem 4.
Let be weakly symmetric with the associated homogeneous polynomial . Assume that . Let . If is hyperbolic in direction e, then the Euclidean distance from the nearest zero of on the unit sphere to e is at most , where
Similarly to Corollary 1, we now have:
Corollary 4.
Let be weakly symmetric with the associated homogeneous polynomial . Assume that is a non-isolated critical point of . Let . Then,
- .
- If, in addition, is hyperbolic in direction e, then .
Remark 2.
In fact, a similar strategy is frequently adopted in single variable calculus. In order to find the inflection points of a smooth real-valued function f, we first find the real zeros of and then apply the first or second derivative test to check whether they are truly inflection points.
5. Some Examples
In this section, we will examine the upper and lower bounds obtained in previous sections via a collection of examples of distinct nature.
Example 8.
Let be the weakly symmetric tensor whose associated homogeneous polynomial is
Clearly, . Furthermore, since is a product of hyperbolic polynomials in direction , it is itself a hyperbolic polynomial in direction . Additionally, since it is a perfect square, it is automatically a PSD tensor. By direct calculation, we see that:
The zero Z-eigenvectors are
We see that
It is also clear, by symmetry, that and is hyperbolic in the direction ; hence, the exact same conclusion holds for the initial point .
Example 9.
Let be the weakly symmetric tensor whose associated homogeneous polynomial is
Clearly, . Furthermore, since is a product of hyperbolic polynomials in direction , it is itself a hyperbolic polynomial in direction , but it is not PSD.
On the other hand, it is easy to check is also hyperbolic in direction :
which has all real roots and . We compute to see that
Using Wolfram’s software Mathematica 10.2 [], we find that the zero Z-eigenvectors are
We now compare to
see the figure below

This example will be referenced later in this section.
Example 10.
Let be the weakly symmetric tensor whose associated homogeneous polynomial is
In order to check whether is hyperbolic in direction , we compute:
So has all real roots and . It is clear . We use Mathematica [] to find . We also have:
A direct elimination shows the zero Z-eigenvectors are
whose distance .
Contrasting to the previous examples, the current tensor has order 3, so it cannot be PSD. It is also true that is not hyperbolic in any other direction.
Example 11.
Let
Then, and , satisfying
Let be the weakly symmetric tensor whose associated homogeneous polynomial is . It is straightforward to see
which is real rooted, hence is hyperbolic in the direction . In addition, by Mathematica [], we find that . We also have:
and the zero Z-eigenvectors are
It is evident that the nearest zero Z-eigenvector to is with .
Example 12.
Let be the weakly symmetric tensor whose associated homogeneous polynomial is
This is not a PSD tensor. However, if we choose , then it is easy to see . We use Mathematica [] to find that . Since is a product of the hyperbolic polynomials in direction e, it is also hyperbolic in direction e. This immediately becomes
Using Mathematica [], we find the zero Z-eigenvectors to be:
It turns out
From this, we can see the upper bound in fact encloses all the points for projectively, while is the nearest to e, as shown in the figure below.

The following example shows that, even though may not be hyperbolic in any direction e, the upper bound provided by Theorem 4 may still remain valid.
Example 13.
Let be the weakly symmetric tensor whose associated homogeneous polynomial is
It is clear
We now show that is not hyperbolic in any direction . We compute:
Solving for t, Mathematica yields:
However, . Thus, is really rooted if and only if , which is impossible.
On the other hand, since , . Furthermore, the zero Z-eigenvectors are
Thus, .
We experimented with several other examples where is not hyperbolic in any obvious direction e; however, the upper bound still held. For this reason, we end this section by proposing the following procedure which may lead to promising outcomes.
[Procedure] Given a nonzero m-order n-dimensional weakly symmetric tensor with the associated homogeneous polynomial . Define the index set
- Case 1.
- Suppose .
- Step 1.1. Let be the least index. It is clear that , where with the only 1 in the -th coordinate. We then compute using Theorem 3.
- Step 1.2. Check whether is hyperbolic in direction . If it is, we then compute using Theorem 5. Consequently, the nearest possible zero Z-eigenvector is nested in between the two spheres centered at of radii and , respectively.
- Step 1.3. Repeat Step 1.2 with any other direction for all subsequent indices . If is also hyperbolic in direction , we then compute for each such j using Theorem 5. Consequently, the nearest possible zero Z-eigenvector is nested in between the two spheres centered at of radii and , respectively. Putting these spheres of different sizes together, we have projectively located many if not all of the zero Z-eigenvectors. We refer to Example 9 for a detailed demonstration.
- Step 1.4. If is not hyperbolic in direction for any , it is inconclusive. However, we can still compute , but only use it as a possible upper bound with caution, as demonstrated in Examples 13 and 14.
- Case 2.
- Suppose .
- Step 2.1. If there is an obvious choice such that , then we can normalize e if necessary and use this as our initial point and follow the outlined steps 1.1 and 1.2 as given above. Otherwise, we move to the following step.
- Step 2.2. Applying the shifted symmetric higher-order power method (SS-HOPM), as provided by Kolda and Mayo [], we choose a parameter large enough such that
- Step 2.3. Starting with the initial point , the SS-HOPM will converge to some such that . As a consequence, ; hence, .
- Step 2.4. We now use in place of as in Step 1.1 and proceed in a similar fashion to find as well as .
- Step 2.5. We choose analogous to in Step 1.3 and proceed in a similar fashion to find as well as . We continue this process until there is no more orthogonal vector left, at which point, we can locate many if not all of the zero Z-eigenvectors projectively.
We demonstrate the above procedure as follows.
Example 14.
Let be the weakly symmetric tensor whose associated homogeneous polynomial is
Clearly, and . However, by choosing , . It is easy to check
has all real roots: , , , and . Hence, is hyperbolic in direction . We normalize to be the unit vector , then . Next, we calculate to see that
It is not difficult to see that the zero Z-eigenvectors are
The nearest zero Z-eigenvector to e is , which satisfies . Next, if we choose , then
The nearest zero Z-eigenvector to is , which satisfies . Hence, the nested spheres of inner radius and outer radius centered at e and projectively encompass all zero Z-eigenvectors, as can be seen in the figure below.

Author Contributions
Conceptualization, K.P. and T.Z.; methodology, K.P. and T.Z.; writing—original draft preparation, K.P. and T.Z.; writing—review and editing, K.P. and T.Z. 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.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Lim, L.H. Singular values and eigenvalues of tensors, A variational approach. In Proceedings of the 1st IEEE International Workshop on Computational Advances of Multi-Tensor Adaptive Processing, Le Gosier, France, 13–15 December 2005; pp. 129–132. [Google Scholar]
- Qi, L. Eigenvalues of a real supersymmetric tensor. J. Symbolic Comput. 2005, 40, 1302–1324. [Google Scholar] [CrossRef]
- Qi, L. Eigenvalues and invariants of tensors. J. Math. Anal. Appl. 2007, 325, 1363–1377. [Google Scholar] [CrossRef]
- Qi, L.; Sun, W.; Wang, Y. Numerical multilinear algebra and its applications. Front. Math. 2007, 2, 501–526. [Google Scholar] [CrossRef]
- Chang, K.; Pearson, K.; Zhang, T. On eigenvalue problems of real symmetric tensors. J. Math. Anal. Appl. 2009, 350, 416–422. [Google Scholar] [CrossRef]
- Chang, K.; Pearson, K.; Zhang, T. Some variational principles of the Z-eigenvalues for nonnegative tensors. Linear Algebra Appl. 2013, 438, 4166–4182. [Google Scholar] [CrossRef]
- Chang, K.C.; Qi, L.; Zhang, T. A survey on the spectral theory of nonnegative tensors. Numer. Linear Algebra Appl. 2013, 20, 891–912. [Google Scholar] [CrossRef]
- Hu, S.; Qi, L. Convergence of a second order Markov chain. Appl. Math. Comput. 2014, 241, 183–192. [Google Scholar] [CrossRef][Green Version]
- Kolda, T.; Mayo, J. Shifted power method for computing tensor eigenpairs. SIAM J. Matrix Anal. Appl. 2011, 34, 1095–1124. [Google Scholar] [CrossRef]
- Liu, Y.; Zhou, G.; Ibrahim, N.F. An always convergent algorithm for the largest eigenvalue of an irreducible nonnegative tensor. J. Comput. Appl. Math. 2010, 235, 286–292. [Google Scholar] [CrossRef]
- Ng, M.; Qi, L.; Zhou, G. Finding the largest eigenvalue of a nonnegative tensor. SIAM J. Matrix Anal. Appl. 2010, 31, 1090–1099. [Google Scholar] [CrossRef]
- Bauschke, H.H.; Güler, O.; Lewis, A.S.; Sendov, H.S. Hyperbolic polynomials and convex analysis. Can. J. Math. 2001, 53, 470–488. [Google Scholar] [CrossRef]
- Pemantle, R. Hyperbolicity and Stable Polynomials in Combinatorics and Probability. Available online: https://www2.math.upenn.edu/~pemantle/papers/hyperbolic.pdf (accessed on 1 July 2023).
- Shub, M. On the distance to the zero set of a homogeneous polynomial. J. Complexity 1989, 5, 303–305. [Google Scholar] [CrossRef][Green Version]
- De Lathauwer, L.; De Moor, B.; Vandewalle, J. On the best rank-1 and rank-(R1, R2, ⋯,RN) approximation of higher-order tensor. SIAM J. Matrix Anal. Appl. 2000, 21, 1324–1342. [Google Scholar] [CrossRef]
- Kofidis, E.; Regalia, P.A. On the best rank-1 approximation of higher-order supersymmetric tensors. SIAM J. Matrix Anal. Appl. 2002, 23, 863–884. [Google Scholar] [CrossRef]
- Wolfram Research, Inc. Mathematica Online; Wolfram Research, Inc.: Champaign, IL, USA, 2023; Available online: https://www.wolfram.com/ (accessed on 1 July 2023).
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. |
© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).