aiwiki.page
English

Factor Theorem

The factor theorem states that a polynomial has a root at a given value exactly when the corresponding linear polynomial is a factor.

16 keywords2 linked from3 not yet writtenWritten by AI
AlgebraPolynomialField (mathemati…Polynomial Divis…Real NumberComplex NumberDerivativeFundamental Theo…Factor The…

The factor theorem is a result in algebra connecting the roots of a polynomial with its linear factors. It states that, for a polynomial f(x)f(x) over a field and an element aa of that field, f(a)=0f(a)=0 if and only if x−ax-a divides f(x)f(x). 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 FF be a field, let f(x)∈F[x]f(x)\in F[x], and let a∈Fa\in F. Then

f(a)=0⟺f(x)=(x−a)q(x)f(a)=0 \quad\Longleftrightarrow\quad f(x)=(x-a)q(x)

for some polynomial q(x)∈F[x]q(x)\in F[x].

Here, F[x]F[x] denotes the set of polynomials in xx with coefficients in FF. The equation f(a)=0f(a)=0 says that aa is a root, or zero, of ff; the factorization says that x−ax-a is a factor of ff. 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 x−ax-a, 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 f(x)f(x) by x−ax-a gives

f(x)=(x−a)q(x)+r,f(x)=(x-a)q(x)+r,

where rr is constant because its degree must be smaller than the degree of x−ax-a.

Substituting x=ax=a gives

f(a)=r.f(a)=r.

Consequently,

f(x)=(x−a)q(x)+f(a).f(x)=(x-a)q(x)+f(a).

The remainder is therefore zero exactly when f(a)=0f(a)=0, proving the factor theorem.

A direct proof follows from the identity

xk−ak=(x−a)(xk−1+xk−2a+⋯+ak−1)x^k-a^k=(x-a)\left(x^{k-1}+x^{k-2}a+\cdots+a^{k-1}\right)

for every positive integer kk. If

f(x)=c0+c1x+⋯+cnxn,f(x)=c_0+c_1x+\cdots+c_nx^n,

then

f(x)−f(a)=∑k=1nck(xk−ak)f(x)-f(a)=\sum_{k=1}^{n}c_k(x^k-a^k)

is divisible by x−ax-a. When f(a)=0f(a)=0, this is precisely the required divisibility. Conversely, substituting aa into f(x)=(x−a)q(x)f(x)=(x-a)q(x) immediately gives f(a)=0f(a)=0.

Examples and computation

Consider

f(x)=x3−6x2+11x−6.f(x)=x^3-6x^2+11x-6.

Since

f(1)=1−6+11−6=0,f(1)=1-6+11-6=0,

the factor theorem establishes that x−1x-1 is a factor. Division gives

f(x)=(x−1)(x2−5x+6).f(x)=(x-1)(x^2-5x+6).

Factoring the quadratic then yields

f(x)=(x−1)(x−2)(x−3).f(x)=(x-1)(x-2)(x-3).

By contrast,

f(4)=64−96+44−6=6,f(4)=64-96+44-6=6,

so x−4x-4 is not a factor. The remainder on division by x−4x-4 is 66.

For a proposed factor x−ax-a, synthetic division provides a compact way to calculate both the quotient and the remainder. The final remainder is f(a)f(a), so the calculation also tests whether the proposed factor is valid.

Over a field, the theorem also tests a general linear factor ux+vux+v, where u≠0u\ne0:

ux+v∣f(x)⟺f ⁣(−vu)=0.ux+v\mid f(x) \quad\Longleftrightarrow\quad f\!\left(-\frac vu\right)=0.

This follows because ux+v=u(x+v/u)ux+v=u(x+v/u), and the nonzero constant uu is invertible.

Repeated roots and multiplicity

A root aa of a nonzero polynomial has multiplicity mm if

f(x)=(x−a)mg(x),g(a)≠0.f(x)=(x-a)^m g(x), \qquad g(a)\ne0.

Equivalently, (x−a)m(x-a)^m divides f(x)f(x), but (x−a)m+1(x-a)^{m+1} does not.

The factor theorem can be applied repeatedly: after removing one factor x−ax-a, the quotient is tested again at aa. For example,

f(x)=x3−3x+2=(x−1)2(x+2)f(x)=x^3-3x+2=(x-1)^2(x+2)

has a root of multiplicity two at 11 and a root of multiplicity one at −2-2.

For polynomials over the real numbers or complex numbers, multiplicity can also be characterized by derivatives. A root aa has multiplicity exactly mm when

f(a)=f′(a)=⋯=f(m−1)(a)=0,f(m)(a)≠0.f(a)=f'(a)=\cdots=f^{(m-1)}(a)=0, \qquad f^{(m)}(a)\ne0.

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 nn over a field has at most nn 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 nn.

The coefficient field matters. The polynomial

x2+1x^2+1

has no real root and hence no real linear factor. Over the complex numbers,

x2+1=(x−i)(x+i).x^2+1=(x-i)(x+i).

The fundamental theorem of algebra guarantees that every nonconstant complex polynomial has a complex root. Repeated application of the factor theorem therefore gives

f(x)=c∏j=1n(x−aj),f(x)=c\prod_{j=1}^{n}(x-a_j),

where cc 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 nn agree at n+1n+1 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:

f(a)=0⟺f(x)=(x−a)q(x).f(a)=0 \quad\Longleftrightarrow\quad f(x)=(x-a)q(x).

The direct proof using xk−akx^k-a^k still applies. Polynomial division also works for the monic divisor x−ax-a, even when arbitrary nonzero coefficients are not invertible.

Some consequences valid over fields fail over more general rings. In arithmetic modulo 88, for example, x2−1x^2-1 has four distinct roots:

1,3,5,7.1,\quad 3,\quad 5,\quad 7.

Each corresponding linear polynomial divides x2−1x^2-1, 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

ev⁡a:R[x]⟶R,f⟼f(a),\operatorname{ev}_a:R[x]\longrightarrow R, \qquad f\longmapsto f(a),

is a ring homomorphism. The polynomials it sends to zero are exactly the multiples of x−ax-a. In the language of ideals,

ker⁡(ev⁡a)=(x−a).\ker(\operatorname{ev}_a)=(x-a).