Collisions and multiplicities of finite nonmonic branches #
Suppose a nonmonic polynomial family's leading coefficient and discriminant are powers of a distinguished coordinate times analytic units, and its normalized roots extend analytically. Any two original branches that extend analytically have locally constant contact order, and hence locally persistent collisions, on the exceptional hyperplane. Collision persistence also holds for independent analytic extensions of selected labels. Other branches may have poles there.
For Laurent branches, the nonnegative-exponent labels have explicit analytic extensions.
If a polynomial's root multiset consists of their finite limits, its multiplicity at each
labelled limit is locally constant. In particular this applies to the root multisets of
Lazard evaluations identified by MvPolynomial.roots_lazardEval_eq_map_of_laurent.
Repeated finite limits and an empty set of finite branches are allowed. No preservation of
the original central fiber's degree, or nonnullification of that fiber, is required.
References #
S. McCallum, A. ParusiΕski, L. Paunescu, Validity proof of Lazard's method for CAD construction, Journal of Symbolic Computation 92 (2019), Β§5.2, proof of Theorem 5.1.
Two finite analytic branches of a nonmonic splitting have locally constant contact order on the exceptional hyperplane. Only the selected branches need analytic extensions; the other original branches may have poles.
Coincidence of two finite analytic extensions of nonmonic root labels is locally constant on the exceptional hyperplane. Only the chosen branches must have finite extensions; all other labels may have poles and central fibers may be nullified.
Collisions among the finite limits of Laurent branches are locally constant on the exceptional hyperplane. Only nonnegative-exponent amplitudes need be analytic, and the other branches may have poles.
Multiplicities of finite Laurent limits are locally constant when the nonmonic
leading coefficient and discriminant have power-times-unit forms. The root multiset
identity is an input, so the polynomial Q can be a divided central fiber, such as a
Lazard evaluation, rather than the possibly nullified ordinary fiber.