The factor theorem is a result in algebra connecting the roots of a polynomial with its linear factors. It states that, for a polynomial over a field and an element of that field, if and only if divides . Thus, finding a value at which a polynomial vanishes is equivalent to identifying a corresponding linear factor. The theorem underlies many methods for factoring polynomials, solving polynomial equations, and studying repeated roots.
Statement
Let be a field, let , and let . Then
for some polynomial .
Here, denotes the set of polynomials in with coefficients in . The equation says that is a root, or zero, of ; the factorization says that is a factor of . Divisibility requires a polynomial quotient, not merely a rational expression.
The statement includes constant polynomials. A nonzero constant polynomial has no roots and no linear factors. The zero polynomial vanishes at every value and is divisible by every , with quotient zero.
Connection with the remainder theorem
The factor theorem is the zero-remainder case of the polynomial remainder theorem. By polynomial division, division of by gives
where is constant because its degree must be smaller than the degree of .
Substituting gives
Consequently,
The remainder is therefore zero exactly when , proving the factor theorem.
A direct proof follows from the identity
for every positive integer . If
then
is divisible by . When , this is precisely the required divisibility. Conversely, substituting into immediately gives .
Examples and computation
Consider
Since
the factor theorem establishes that is a factor. Division gives
Factoring the quadratic then yields
By contrast,
so is not a factor. The remainder on division by is .
For a proposed factor , synthetic division provides a compact way to calculate both the quotient and the remainder. The final remainder is , so the calculation also tests whether the proposed factor is valid.
Over a field, the theorem also tests a general linear factor , where :
This follows because , and the nonzero constant is invertible.
Repeated roots and multiplicity
A root of a nonzero polynomial has multiplicity if
Equivalently, divides , but does not.
The factor theorem can be applied repeatedly: after removing one factor , the quotient is tested again at . For example,
has a root of multiplicity two at and a root of multiplicity one at .
For polynomials over the real numbers or complex numbers, multiplicity can also be characterized by derivatives. A root has multiplicity exactly when
This characterization holds over any field of characteristic zero. In positive characteristic, ordinary derivatives need not detect multiplicity in this way.
Consequences for roots and factorization
A nonzero polynomial of degree over a field has at most distinct roots. Each distinct root supplies a different linear factor, and removing such a factor reduces the degree by one. More generally, the sum of the multiplicities of its roots in any field containing its coefficients is at most .
The coefficient field matters. The polynomial
has no real root and hence no real linear factor. Over the complex numbers,
The fundamental theorem of algebra guarantees that every nonconstant complex polynomial has a complex root. Repeated application of the factor theorem therefore gives
where is the leading coefficient and roots are listed according to multiplicity.
The root bound also supports uniqueness in polynomial interpolation. If two polynomials of degree at most agree at distinct points, their difference has more roots than its degree permits unless it is the zero polynomial. The two polynomials must therefore be identical.
Generalization to commutative rings
The factor theorem remains valid for polynomials over any commutative ring with identity:
The direct proof using still applies. Polynomial division also works for the monic divisor , even when arbitrary nonzero coefficients are not invertible.
Some consequences valid over fields fail over more general rings. In arithmetic modulo , for example, has four distinct roots:
Each corresponding linear polynomial divides , but the degree-two polynomial nevertheless has more than two roots. The field-based root bound does not extend to rings with zero divisors.
In abstract algebra, the theorem can be expressed through evaluation. The map
is a ring homomorphism. The polynomials it sends to zero are exactly the multiples of . In the language of ideals,