Polynomial over a field
A finite sum a₀+a₁x+⋯+aₙxⁿ with coefficients in a field F. A nonzero polynomial has degree equal to its highest nonzero exponent.
REFERENCE SHEET
Factorization translates an equation into structural information about its roots.
Before this Sets & maps
A finite sum a₀+a₁x+⋯+aₙxⁿ with coefficients in a field F. A nonzero polynomial has degree equal to its highest nonzero exponent.
a is a root if p(a)=0; it has multiplicity m if (x−a)ᵐ divides p but (x−a)ᵐ⁺¹ does not.
A nonconstant polynomial that cannot be factored into two positive-degree polynomials over the specified field.
For p,d ∈ F[x] with d≠0, there are unique q,r with p=qd+r and either r=0 or deg r<deg d.
A nonzero degree-n polynomial over a field has at most n distinct roots.
Every nonconstant complex polynomial has a complex root, hence factors into linear factors over ℂ.
The roots of det(λI−A) are precisely the eigenvalues of a square matrix.
Distinct sample locations determine a unique polynomial of degree at most n−1 through n prescribed values.
01 / Compute
Compare with a binomial cube.
It is (x−1)³. The only root is 1, of multiplicity 3.
02 / Prove
Subtract them and use the root bound.
Their difference has degree at most 2 and at least 3 distinct roots. It must be the zero polynomial.
These sheets use this topic as a prerequisite.
Further reading and full-length treatments: