Inmathematics, themultiplicity of a member of amultiset is the number of times it appears in the multiset. For example, the number of times a givenpolynomial has aroot at a given point is the multiplicity of that root.
The notion of multiplicity is important to be able to count correctly without specifying exceptions (for example,double roots counted twice). Hence the expression, "counted with multiplicity".
If multiplicity is ignored, this may be emphasized by counting the number ofdistinct elements, as in "the number of distinct roots". However, whenever aset (as opposed to multiset) is formed, multiplicity is automatically ignored, without requiring use of the term "distinct".
Inprime factorization, themultiplicity of a prime factor is its-adic valuation. For example, the prime factorization of theinteger60 is
the multiplicity of the prime factor2 is2, while the multiplicity of each of the prime factors3 and5 is1. Thus,60 has four prime factors allowing for multiplicities, but only three distinct prime factors.
Let be afield and be apolynomial in one variable withcoefficients in. An element is aroot of multiplicity of if there is a polynomial such that and. If, thena is called asimple root. If, then is called amultiple root.
For instance, the polynomial has 1 and −4 asroots, and can be written as. This means that 1 is a root of multiplicity 2, and −4 is a simple root (of multiplicity 1). The multiplicity of a root is the number of occurrences of this root in the complete factorization of the polynomial, by means of thefundamental theorem of algebra.
If is a root of multiplicity of a polynomial, then it is a root of multiplicity of thederivative of that polynomial, unless thecharacteristic of the underlying field is a divisor ofk, in which case is a root of multiplicity at least of the derivative.
Thediscriminant of a polynomial is zero if and only if the polynomial has a multiple root.
Thegraph of apolynomial functionf touches thex-axis at the real roots of the polynomial. The graph istangent to it at the multiple roots off and not tangent at the simple roots. The graph crosses thex-axis at roots of odd multiplicity and does not cross it at roots of even multiplicity.
A non-zero polynomial function is everywherenon-negative if and only if all its roots have even multiplicity and there exists an such that.
For an equation with a single variable solution, the multiplicity is if
In other words, the differential functional, defined as the derivative of a function at, vanishes at for up to. Those differential functionals span a vector space, called theMacaulay dual space at,[1] and its dimension is the multiplicity of as a zero of.
Let be a system of equations of variables with a solution where is a mapping from to or from to. There is also a Macaulay dual space of differential functionals at in which every functional vanishes at. The dimension of this Macaulay dual space is the multiplicity of the solution to the equation. The Macaulay dual space forms the multiplicity structure of the system at the solution.[2][3]
For example, the solution of the system of equations in the form of with
is of multiplicity 3 because the Macaulay dual space
is of dimension 3, where denotes the differential functional applied on a function at the point.
The multiplicity is always finite if the solution is isolated, is perturbation invariant in the sense that a-fold solution becomes a cluster of solutions with a combined multiplicity under perturbation in complex spaces, and is identical to the intersection multiplicity on polynomial systems.
Inalgebraic geometry, the intersection of two sub-varieties of an algebraic variety is a finite union ofirreducible varieties. To each component of such an intersection is attached anintersection multiplicity. This notion islocal in the sense that it may be defined by looking at what occurs in a neighborhood of anygeneric point of this component. It follows that without loss of generality, we may consider, in order to define the intersection multiplicity, the intersection of twoaffines varieties (sub-varieties of an affine space).
Thus, given two affine varietiesV1 andV2, consider anirreducible componentW of the intersection ofV1 andV2. Letd be thedimension ofW, andP be any generic point ofW. The intersection ofW withdhyperplanes ingeneral position passing throughP has an irreducible component that is reduced to the single pointP. Therefore, thelocal ring at this component of thecoordinate ring of the intersection has only oneprime ideal, and is therefore anArtinian ring. This ring is thus afinite dimensional vector space over the ground field. Its dimension is the intersection multiplicity ofV1 andV2 atW.
This definition allows us to stateBézout's theorem and its generalizations precisely.
This definition generalizes the multiplicity of a root of a polynomial in the following way. The roots of a polynomialf are points on theaffine line, which are the components of the algebraic set defined by the polynomial. The coordinate ring of this affine set is whereK is analgebraically closed field containing the coefficients off. If is the factorization off, then the local ring ofR at the prime ideal is This is a vector space overK, which has the multiplicity of the root as a dimension.
This definition of intersection multiplicity, which is essentially due toJean-Pierre Serre in his bookLocal Algebra, works only for the set theoretic components (also calledisolated components) of the intersection, not for theembedded components. Theories have been developed for handling the embedded case (seeIntersection theory for details).
Letz0 be a root of aholomorphic functionf, and letn be the least positive integer such that thenth derivative off evaluated atz0 differs from zero. Then thepower series off aboutz0 begins with thenth term, andf is said to have a root of multiplicity (or “order”) n. Ifn = 1, the root is called a simple root.[4]
We can also define the multiplicity of thezeroes andpoles of ameromorphic function. If we have a meromorphic function take theTaylor expansions ofg andh about a pointz0, and find the first non-zero term in each (denote the order of the termsm andn respectively) then ifm = n, then the point has non-zero value. If then the point is a zero of multiplicity If, then the point has a pole of multiplicity
{{cite book}}
: CS1 maint: multiple names: authors list (link)