Abstract
Let be a system of polynomials in s variables, where . If is an isolated zero of P, then the multiplicity and its structure at can be revealed by the normal set of the quotient ring or its dual space or by certain numerical methods. In his book titled “Numerical Polynomial Algebra”, Stetter described the so-called distinguished points, which are embedded in a zero manifold of P, and the author defined their multiplicities. In this note, we will generalize the definition of distinguished points and give a more appropriate definition for their multiplicity, as well as show how to calculate the multiplicity of these points.
MSC:
55-XX
Let be a system of polynomials in s variables, where . If is an isolated zero of P, then the multiplicity and its structure at can be revealed by the normal set of the quotient ring or its dual space (cf. [1]), and a numerical method has been developed by Dayton and Zeng [2]. In [1], Stetter described the so-called distinguished points, which are embedded in a zero manifold of P, and defined their multiplicity. However, it turns out that in most of the cases, the points that display some kind of “distinguished” property do not satisfy the definitions for distinguished points. In addition, the multiplicity defined there is not quite appropriate. So in this note, we will generalize the definition of distinguished points and give a more appropriate definition for their multiplicity, as well as show how to calculate the multiplicity of these points.
Example 1.
For a polynomial f in one variable, if , where , then a is a zero of f with multiplicity m. Equivalently, if there exists a maximal set of linearly independent linear functionals evaluating at a such that and for all g, then the multiplicity of f at a is m. An obvious choice of a set of such functionals is evaluating at .
Now, we consider a perturbed equation
where t is a complex parameter. It is not too hard to see that the solutions to the equation can be expanded as a Puiseux series in t: , , where is an mth primitive root of unity converging to . Define , , where denotes the standard Newton’s kth divided difference. Apparently, the depend on t. When , the “converge” to .
On the other hand, if the zero set of the perturbed polynomial can be expanded as a Puiseux series in t— near —then the multiplicity of a is m, since this means that for each , has exactly m zeros.
For polynomials with more variables, the definition above can be generalized. The Puiseux series has long been used to derive the bound of the number of zeros for the system of polynomial equations [3,4]. We will show that the Puiseux series can be used to reveal the multiplicity of a point isolated or not.
Example 2.
Suppose that , where . It can be shown that is a zero of P with a multiplicity of four. Let
be a generic polynomial and define a perturbed system . Then for small t, there are four zeros of near . To see that, we substitute and for x and y in the following equations:
Equating the coefficients and the exponents of the lowest order terms in t yields
It is easy to see that this system has four solutions. Thus, there are four Puiseux series in t: converging to (0,0) as .
Thus, there is a one-to-one correspondence between the multiplicity and the number of Puiseux series expansions of the zero set of the perturbed system near .
Remark 1.
Write , where C is the vector containing all of the constant terms of P, and . When we derive a system of equations for solving the and the αs as in (1), the terms in H are all higher order terms and will not contribute anything. So, in the perturbation, only the constant terms are needed.
In general, we have the following:
Proposition 1.
Suppose that is an isolated zero of P. Then, there is a one-to-one correspondence between the multiplicity and the number of Puiseux series expansions of the zero set of the perturbed system near , where is a generic vector, which is the constant term of a generic polynomial .
Proof.
Assume that is a zero of P with multiplicity m. Let , and , and be the Puiseux series expansion of the solution set of and , respectively, near , where and . According to Remark 1, and . Since for each small enough, the system has exactly m distinct solutions, and ’s are distinct solutions of the system, where . □
In [1], Stetter described the following:
Definition 1
(Definition 9.13, [1]). Suppose that is a singular system of s polynomials in s variables with a d-dimensional zero manifold . For a specified near singular polynomial system,
let be such that . If , , and , then is called a simple distinguished point of .
Example 3.
Let
and . Let and . Then, , and . So, , and thus, is a simple distinguished point of .
Note that the main characteristic of these kinds of points is that they depend on . The following example shows, however, that these kinds of points do not have to be “simple”.
Example 4.
Let
Then, . It is not too hard to see that there are four curves , of , where , , and , thus converging to the points . This means for small t, the system has two solutions near . Also note that depends on the perturbation . In this case, . While for all , only two points are really “distinguished” and are dependent on the perturbation.
Motivated by the examples such as the one above, we introduce a new definition below:
Definition 2.
A generalized distinguished point with respect to under the perturbation is such that there are m () solution curves of converging to as . Also, depends on the perturbation . The multiplicity of such points with respect to this perturbation is defined as m.
In [1], Stetter also described the following:
Definition 3
(Definition 9.14, [1]). Suppose that is a singular system of s polynomials in s variables with a d-dimensional zero manifold . Points of with
are multiple distinguished points of .
Definition 4
(Definition 9.15, [1]). Suppose that is a singular system of s polynomials in s variables with a d-dimensional zero manifold , and is a multiple distinguished point of . For the sake of simplicity, we assume that all the zeros of are contained in , and z is the only distinguished point of , multiple or not. Let be the ideal of polynomials that vanish on , is a normal set (see Appendix A) of , and N is a normal set of containing . Then, z has multiplicity .
Example 5.
Let
Then, , , , and a normal set of and is . In this case, , and . So, is the multiple distinguished point of . However, a normal set N of is . Thus, . So, according to Definition 4, the multiplicity is suppose to be .
Now, let
and . It is not too hard to see that there are four curves such that , where , . It is also easy to see that they all converge to the point . Thus, the multiplicity of should be four instead of three.
Based on the observations from examples such as the one above, we will modify the definition of distinguished points and give a new approach to calculate the multiplicity.
Definition 5.
Let be a system of s polynomials with , and M is a zero manifold of . If is such that for a generic perturbation , the system has solutions near for small t, then we call a proper distinguished point of , and m is its multiplicity.
Example 6.
Let
Then, . It is not too hard to see that there are eight curves , where , , and , where u is a fourth primitive root of unity converging to the proper distinguished point . This means for small t, the system has eight solutions near . In this case, . While for all , only one point is really “distinguished” and is independent of the perturbation. So, the multiplicity of is eight.
Remark 2.
Suppose that is a proper distinguished point of ; then, if we expand the zero set of near as Puiseux series, , then each component of α is positive, and the number combinations of and α is the multiplicity.
Example 7.
Let
Then, . It is not too hard to see that there are eight curves , with and eight curves with converging to the proper distinguished point . This means for small t, the system has 16 solutions near . Thus, the multiplicity of is 16.
On the other hand, if
then, there are only eight curves , with converging to the proper distinguished point . So, the multiplicity is only eight.
Finally, why do some of the point(s) in M become “distinguished”, while the others are not? Can we find it out without making use of something “external”, such as Puiseux series? We need the following:
Definition 6.
Let I and J be two ideals. Define
Lemma 1
(Proposition 10, Section 4.4 and Lemma 8, Section 4.7, [5]). Let I, , J, and be ideals. Then,
If Q is primary and , then
Proposition 2.
Let , and . Let , and . Then, , and there exists an n so that and .
Proof.
Since for all i, then by the ascending chain condition, there exists an n so that . Since . Then, . Suppose . Since , . Let be a minimal primary decomposition for . Let , , and let . By Lemma 1, , and , . Thus, . It follows from exercise 4.10 of Chapter 4 in [5] for each , . Thus, . Now, let , and define . Since is redical, . On the other hand, . It follows from Theorem 7 of Section 4.4 in [5] that , since , . □
Example 8.
In Example 6, . Now, let us look at the subideal of generated by eliminating the variable t from the polynomials in :
It is not too hard to see that for generic c values, ’s zero set contains eight branches of curves not contained in M, which are the projections of the curves in Example 6, thus passing through . To “filter” out the curves, let . . Let . Then, the multiplicity of with respect to R is eight.
Example 9.
In Example 4, . Let
Let . Then, . The intersection of the zero set of Q and M contains two points . Let . Then, the multiplicity of with respect to R is four for .
In general, we have the following.
Theorem 1.
Let P be a system of s polynomials with s variables. Suppose that M is a zero manifold of P. Let c be a generic vector, and let , where , , , …, . Then, there exists an n so that . Denote . Suppose that is a zero of . Then, is an isolated zero of , and the multiplicity of as a zero of R is the same as the multiplicity of as a distinguished point of P. In addition, if is independent of c, then is a proper distinguished point of P; otherwise, it is a generalized distinguished point of P.
Proof.
According to Proposition 2, . However, the only points in are the end points of the curves , where . There are only finitely many of them, so they are isolated. Suppose that the multiplicity of as an isolated zero of R is m. Let and . For each t, consists of isolated points. Since the multiplicity of as a zero of is m, for small t, there are m points of the zero set of near . Thus, by definition, the multiplicity of as a distinguished point of P is m. □
Example 10.
Let , where . Let and . Then,
where . The multiplicity of as an isolated zero of is 16, and so is the multiplicity of as a distinguished point of .
Author Contributions
Conceptualization, X.W.; methodology, X.W.; software, X.W.; validation, X.W.; formal analysis, X.W.; investigation, X.W.; resources, X.W.; data curation, X.W.; writing—original draft preparation, X.W.; writing—review and editing, W.L.; visualization, X.W.; supervision, X.W.; project administration, X.W. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Conflicts of Interest
The authors declare no conflict of interest.
Appendix A
Definition A1.
A set of monomials , where and , is called closed if
Definition A2.
Let I be a polynomial ideal and be the quotient ring. A closed set of monomials is a normal set of I if the monomials in form a basis of .
References
- Stetter, H. Numerical Polynomial Algebra; Society for Industrial and Applied Mathematics (SIAM): Philadelphia, PA, USA, 2004. [Google Scholar] [CrossRef]
- Dayton, B.; Zeng, Z. Computing the multiplicity structure in solving polynomial systems. In Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation, Beijing, China, 24–27 July 2005; pp. 116–123. [Google Scholar]
- Bernshtein, D.N. The number of roots of a system of equations. Funct. Anal. Appl. 1975, 9, 183–185. [Google Scholar] [CrossRef]
- Huber, B.; Sturmfels, B. A Polyhedral Method for Solving Sparse Polynomial Systems. Math. Comput. 1995, 64, 1541–1555. [Google Scholar] [CrossRef]
- Cox, D.; Little, J.; O’shea, D.; Sweedler, M. Ideals, Varieties, and Algorithms; Springer: New York, NY, USA, 1991. [Google Scholar]
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/).