The monomials form a basis of : they span every polynomial of degree of a polynomial at most , and equality of polynomials forces equality of every coefficient, proving linear independence. ThereforeThe zero polynomial is included in even though its degree of a polynomial need not be assigned an ordinary nonnegative value.
Suppose, for a contradiction, that and have no common root of a polynomial. Since the polynomial ring has no zero divisors and , the relation with not both zero forces both and to be nonzero.
By the fundamental theorem of algebra, writewhere the are distinct. For each , . The equality implies that divides . The multiplicity of a root in polynomial multiplication is the sum of its multiplicities in the factors: factor out the largest powers of and note that the two remaining factors have nonzero values at . Since , must contain .
Thus has at least roots of a polynomial counted with multiplicity of a root, so . This contradicts . ConsequentlyCounting multiplicity of a root is necessary: counting only distinct roots of a polynomial would miss repeated factors.
Use the linear mapIt is well defined because , and it is a linear map by distributivity of polynomial multiplication. If for a nonzero pair, ii would give a common root of a polynomial of and . The hypothesis therefore implies , so is injective.
By i, the domain and codomain both have dimension : a basis of the domain is for , and a basis of the codomain is . The stated finite-dimensional result makes surjective. In particular has a preimage, proving the degree bound in polynomial Bézout's identity:Indeed, injectivity also proves uniqueness of this pair under the stated degree of a polynomial bounds.
Articles by others on the same topic
There are currently no matching articles.