{
  "id": "factor-theorem",
  "title": "Factor Theorem",
  "lang": "en",
  "source_lang": "en",
  "summary": "The factor theorem states that a polynomial has a root at a given value exactly when the corresponding linear polynomial is a factor.",
  "category": "mathematics",
  "subcategory": "algebra",
  "type": "concept",
  "aliases": [],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/factor-theorem/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/factor-theorem/",
      "json": "https://aiwiki.page/zh/factor-theorem.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "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)\\) over a field and an element \\(a\\) of that field, \\(f(a)=0\\) if and only if \\(x-a\\) divides \\(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."
    },
    {
      "heading": "Statement",
      "text": "Let \\(F\\) be a field, let \\(f(x)\\in F[x]\\), and let \\(a\\in F\\). Then\n\n\\[f(a)=0 \\quad\\Longleftrightarrow\\quad f(x)=(x-a)q(x)\\]\n\nfor some polynomial \\(q(x)\\in F[x]\\).\n\nHere, \\(F[x]\\) denotes the set of polynomials in \\(x\\) with coefficients in \\(F\\). The equation \\(f(a)=0\\) says that \\(a\\) is a root, or zero, of \\(f\\); the factorization says that \\(x-a\\) is a factor of \\(f\\). Divisibility requires a polynomial quotient, not merely a rational expression.\n\nThe 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-a\\), with quotient zero."
    },
    {
      "heading": "Connection with the remainder theorem",
      "text": "The factor theorem is the zero-remainder case of the polynomial remainder theorem. By polynomial division, division of \\(f(x)\\) by \\(x-a\\) gives\n\n\\[f(x)=(x-a)q(x)+r,\\]\n\nwhere \\(r\\) is constant because its degree must be smaller than the degree of \\(x-a\\).\n\nSubstituting \\(x=a\\) gives\n\n\\[f(a)=r.\\]\n\nConsequently,\n\n\\[f(x)=(x-a)q(x)+f(a).\\]\n\nThe remainder is therefore zero exactly when \\(f(a)=0\\), proving the factor theorem.\n\nA direct proof follows from the identity\n\n\\[x^k-a^k=(x-a)\\left(x^{k-1}+x^{k-2}a+\\cdots+a^{k-1}\\right)\\]\n\nfor every positive integer \\(k\\). If\n\n\\[f(x)=c_0+c_1x+\\cdots+c_nx^n,\\]\n\nthen\n\n\\[f(x)-f(a)=\\sum_{k=1}^{n}c_k(x^k-a^k)\\]\n\nis divisible by \\(x-a\\). When \\(f(a)=0\\), this is precisely the required divisibility. Conversely, substituting \\(a\\) into \\(f(x)=(x-a)q(x)\\) immediately gives \\(f(a)=0\\)."
    },
    {
      "heading": "Examples and computation",
      "text": "Consider\n\n\\[f(x)=x^3-6x^2+11x-6.\\]\n\nSince\n\n\\[f(1)=1-6+11-6=0,\\]\n\nthe factor theorem establishes that \\(x-1\\) is a factor. Division gives\n\n\\[f(x)=(x-1)(x^2-5x+6).\\]\n\nFactoring the quadratic then yields\n\n\\[f(x)=(x-1)(x-2)(x-3).\\]\n\nBy contrast,\n\n\\[f(4)=64-96+44-6=6,\\]\n\nso \\(x-4\\) is not a factor. The remainder on division by \\(x-4\\) is \\(6\\).\n\nFor a proposed factor \\(x-a\\), synthetic division provides a compact way to calculate both the quotient and the remainder. The final remainder is \\(f(a)\\), so the calculation also tests whether the proposed factor is valid.\n\nOver a field, the theorem also tests a general linear factor \\(ux+v\\), where \\(u\\ne0\\):\n\n\\[ux+v\\mid f(x) \\quad\\Longleftrightarrow\\quad f\\!\\left(-\\frac vu\\right)=0.\\]\n\nThis follows because \\(ux+v=u(x+v/u)\\), and the nonzero constant \\(u\\) is invertible."
    },
    {
      "heading": "Repeated roots and multiplicity",
      "text": "A root \\(a\\) of a nonzero polynomial has multiplicity \\(m\\) if\n\n\\[f(x)=(x-a)^m g(x), \\qquad g(a)\\ne0.\\]\n\nEquivalently, \\((x-a)^m\\) divides \\(f(x)\\), but \\((x-a)^{m+1}\\) does not.\n\nThe factor theorem can be applied repeatedly: after removing one factor \\(x-a\\), the quotient is tested again at \\(a\\). For example,\n\n\\[f(x)=x^3-3x+2=(x-1)^2(x+2)\\]\n\nhas a root of multiplicity two at \\(1\\) and a root of multiplicity one at \\(-2\\).\n\nFor polynomials over the real numbers or complex numbers, multiplicity can also be characterized by derivatives. A root \\(a\\) has multiplicity exactly \\(m\\) when\n\n\\[f(a)=f'(a)=\\cdots=f^{(m-1)}(a)=0, \\qquad f^{(m)}(a)\\ne0.\\]\n\nThis characterization holds over any field of characteristic zero. In positive characteristic, ordinary derivatives need not detect multiplicity in this way."
    },
    {
      "heading": "Consequences for roots and factorization",
      "text": "A nonzero polynomial of degree \\(n\\) over a field has at most \\(n\\) 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 \\(n\\).\n\nThe coefficient field matters. The polynomial\n\n\\[x^2+1\\]\n\nhas no real root and hence no real linear factor. Over the complex numbers,\n\n\\[x^2+1=(x-i)(x+i).\\]\n\nThe fundamental theorem of algebra guarantees that every nonconstant complex polynomial has a complex root. Repeated application of the factor theorem therefore gives\n\n\\[f(x)=c\\prod_{j=1}^{n}(x-a_j),\\]\n\nwhere \\(c\\) is the leading coefficient and roots are listed according to multiplicity.\n\nThe root bound also supports uniqueness in polynomial interpolation. If two polynomials of degree at most \\(n\\) agree at \\(n+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."
    },
    {
      "heading": "Generalization to commutative rings",
      "text": "The factor theorem remains valid for polynomials over any commutative ring with identity:\n\n\\[f(a)=0 \\quad\\Longleftrightarrow\\quad f(x)=(x-a)q(x).\\]\n\nThe direct proof using \\(x^k-a^k\\) still applies. Polynomial division also works for the monic divisor \\(x-a\\), even when arbitrary nonzero coefficients are not invertible.\n\nSome consequences valid over fields fail over more general rings. In arithmetic modulo \\(8\\), for example, \\(x^2-1\\) has four distinct roots:\n\n\\[1,\\quad 3,\\quad 5,\\quad 7.\\]\n\nEach corresponding linear polynomial divides \\(x^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.\n\nIn abstract algebra, the theorem can be expressed through evaluation. The map\n\n\\[\\operatorname{ev}_a:R[x]\\longrightarrow R, \\qquad f\\longmapsto f(a),\\]\n\nis a ring homomorphism. The polynomials it sends to zero are exactly the multiples of \\(x-a\\). In the language of ideals,\n\n\\[\\ker(\\operatorname{ev}_a)=(x-a).\\]"
    }
  ],
  "links": [
    "algebra",
    "polynomial",
    "field-mathematics",
    "polynomial-division",
    "real-number",
    "complex-number",
    "derivative",
    "fundamental-theorem-of-algebra",
    "interpolation",
    "ring-mathematics",
    "abstract-algebra",
    "homomorphism",
    "ideal-ring-theory"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}