3.9 Polynomials

Definition and structure

A polynomial is an algebraic expression built from variables, coefficients, and non-negative integer exponents, all combined with addition or subtraction. In the context of number theory and abstract algebra, polynomials aren't just tools for graphing curves. They're algebraic objects with deep structural properties that mirror (and extend) the behavior of integers.

Polynomial expressions

The general form of a polynomial in one variable is:

$a_nx^n + a_{n-1}x^{n-1} + \cdots + a_1x + a_0$

Each $a_i$ is a coefficient (which can be any real number, or more generally, an element of whatever ring or field you're working over). Each term pairs a coefficient with a non-negative integer power of the variable. Only addition, subtraction, and multiplication appear; division by a variable is not allowed.

Degree of a polynomial

The degree is the highest power of the variable that appears with a nonzero coefficient. For example, $3x^4 - x + 7$ has degree 4.

The degree tells you a lot:

• It caps the maximum number of roots: a degree-$n$ polynomial has at most $n$ roots (over any field).
• Odd-degree polynomials with real coefficients always have at least one real root, because their end behavior forces the graph to cross the x-axis.
• Degree also determines how the polynomial behaves under operations like multiplication (degrees add) and addition (degree is at most the larger of the two).

Leading coefficient

The leading coefficient is the coefficient attached to the highest-degree term. In $-5x^3 + 2x - 1$, the leading coefficient is $-5$.

For polynomial functions, the leading coefficient controls end behavior:

• Even degree, positive leading coefficient: the graph rises on both ends.
• Even degree, negative leading coefficient: the graph falls on both ends.
• Odd degree, positive leading coefficient: falls left, rises right.
• Odd degree, negative leading coefficient: rises left, falls right.

Standard form

A polynomial is in standard form when its terms are arranged in descending order of degree, with like terms already combined. Writing polynomials this way makes it easy to read off the degree and leading coefficient at a glance, and it's the expected format for performing long division and comparing polynomials.

Types of polynomials

Polynomials are classified by degree. Each type has distinct behavior in terms of roots, graph shape, and the methods you use to analyze it.

Linear polynomials

These are degree-1 polynomials: $ax + b$ where $a \neq 0$. They graph as straight lines and have exactly one root, found by solving $x = -b/a$. The slope-intercept form $y = mx + b$ is the most familiar version.

Quadratic polynomials

Degree-2 polynomials take the form $ax^2 + bx + c$. Their graphs are parabolas. The number of real roots depends on the discriminant $b^2 - 4ac$:

• Positive discriminant → two distinct real roots
• Zero discriminant → one repeated real root
• Negative discriminant → no real roots (two complex conjugate roots)

The quadratic formula gives the roots directly: $x = \frac{-b \pm \sqrt{b^2 - 4ac}}{2a}$

Vertex form $a(x - h)^2 + k$ is useful for graphing, where $(h, k)$ is the vertex of the parabola.

Cubic polynomials

Degree-3 polynomials: $ax^3 + bx^2 + cx + d$. Because they have odd degree, they always cross the x-axis at least once, guaranteeing at least one real root. They can have one real root and two complex roots, or three real roots. Their graphs have a characteristic S-shape (or reversed S).

Higher-degree polynomials

Degree 4 and above. As the degree increases, the graph can have more turning points (up to $n - 1$ for degree $n$) and more roots (up to $n$). The analysis gets harder, but the same structural principles apply.

Operations with polynomials

Polynomial operations follow rules that closely parallel integer arithmetic. This parallel is one of the key ideas connecting polynomials to number theory and abstract algebra.

Addition and subtraction

Combine like terms (terms with the same variable and exponent) by adding or subtracting their coefficients. The degree of the result is at most the larger degree of the two inputs.

For example: $(3x^2 + 2x - 1) + (x^2 - 5x + 4) = 4x^2 - 3x + 3$

Addition of polynomials is both commutative and associative.

Multiplication of polynomials

Multiply by distributing every term in one polynomial across every term in the other, then combine like terms. The degree of the product equals the sum of the degrees of the factors.

For two binomials, the FOIL method (First, Outer, Inner, Last) is a shortcut:

$(2x + 3)(x - 1) = 2x^2 - 2x + 3x - 3 = 2x^2 + x - 3$

Division of polynomials

Just as dividing integers gives a quotient and remainder, dividing polynomials works the same way. Given polynomials $f(x)$ and $d(x)$ (with $d(x) \neq 0$), there exist unique polynomials $q(x)$ and $r(x)$ such that:

$f(x) = d(x) \cdot q(x) + r(x)$

where the degree of $r(x)$ is less than the degree of $d(x)$. This is the division algorithm for polynomials, and it's directly analogous to the division algorithm for integers.

The Remainder Theorem is a useful consequence: when you divide $f(x)$ by $(x - a)$, the remainder is simply $f(a)$.

Polynomial long division

This algorithm mirrors long division with numbers:

1. Arrange both dividend and divisor in standard form (descending degree). Include placeholder terms with coefficient 0 for any missing degrees.
2. Divide the leading term of the dividend by the leading term of the divisor. Write the result as the first term of the quotient.
3. Multiply the entire divisor by that quotient term and subtract the result from the dividend.
4. Bring down the next term and repeat from step 2.
5. Stop when the degree of the remaining expression is less than the degree of the divisor. That expression is the remainder.

Synthetic division is a streamlined shortcut that works when the divisor is a linear factor of the form $(x - a)$.

Factoring polynomials

Factoring breaks a polynomial into a product of simpler polynomials. Think of it as the polynomial version of prime factorization for integers. It's essential for finding roots, simplifying expressions, and understanding polynomial structure.

Common factor method

Always start here. Identify the greatest common factor (GCF) of all terms and factor it out.

For example: $6x^3 + 9x^2 = 3x^2(2x + 3)$

The GCF can include numbers, variables, and their lowest powers.

Grouping method

This works well for polynomials with four or more terms:

1. Group terms into pairs (or groups) that share a common factor.
2. Factor out the GCF from each group.
3. If a common binomial factor appears across the groups, factor it out.

Example: $x^3 + 3x^2 + 2x + 6 = x^2(x + 3) + 2(x + 3) = (x^2 + 2)(x + 3)$

Difference of squares

Any expression of the form $a^2 - b^2$ factors as:

$a^2 - b^2 = (a + b)(a - b)$

Both terms must be perfect squares, and the operation between them must be subtraction. Note that a sum of squares $a^2 + b^2$ does not factor over the real numbers.

Sum and difference of cubes

These have their own formulas worth memorizing:

• Sum of cubes: $a^3 + b^3 = (a + b)(a^2 - ab + b^2)$
• Difference of cubes: $a^3 - b^3 = (a - b)(a^2 + ab + b^2)$

A mnemonic: the sign in the binomial factor matches the original sign; the middle term of the trinomial factor has the opposite sign.

Roots and zeros

A root (or zero) of a polynomial $f(x)$ is any value $r$ such that $f(r) = 0$. Roots are where the graph crosses or touches the x-axis, and finding them is one of the central problems in algebra.

Finding roots algebraically

The method depends on the polynomial:

• Degree 1: Solve directly. $ax + b = 0 \Rightarrow x = -b/a$.
• Degree 2: Factor, complete the square, or use the quadratic formula.
• Degree 3 and 4: Try factoring, the rational root theorem, or (for cubics) Cardano's formula. Degree-4 polynomials have a general formula too, but it's rarely used by hand.
• Degree 5+: No general formula exists (a deep result from Galois theory). You rely on numerical methods like Newton's method, or strategic factoring.

Rational root theorem

If a polynomial has integer coefficients, any rational root $p/q$ (in lowest terms) must satisfy:

• $p$ divides the constant term $a_0$
• $q$ divides the leading coefficient $a_n$

This gives you a finite list of candidates to test. For $2x^3 - 3x + 1$, the possible rational roots are $\pm 1, \pm 1/2$. You then check each by substitution or synthetic division.

Complex roots

When a polynomial with real coefficients has complex roots, they always come in conjugate pairs: if $a + bi$ is a root, then $a - bi$ is too. This means a real polynomial of odd degree must have at least one real root (since complex roots pair off, leaving an odd one out).

Vieta's formulas connect roots to coefficients. For a quadratic $x^2 + bx + c$ with roots $r_1, r_2$: the sum $r_1 + r_2 = -b$ and the product $r_1 \cdot r_2 = c$. Similar relationships hold for higher degrees.

Fundamental theorem of algebra

Every non-constant polynomial with complex coefficients has at least one complex root. A direct consequence: a degree-$n$ polynomial has exactly $n$ complex roots when counted with multiplicity.

This theorem guarantees that polynomials over $\mathbb{C}$ factor completely into linear factors. Over $\mathbb{R}$, the best you can do is factor into linear and irreducible quadratic factors.

Polynomial functions

When you treat a polynomial as a function $f(x)$, you can study its graph, behavior, and applications to modeling.

Graphing polynomial functions

To sketch a polynomial function:

1. Find the y-intercept by evaluating $f(0)$.
2. Find the x-intercepts (roots) by solving $f(x) = 0$.
3. Determine end behavior from the degree and leading coefficient.
4. Plot a few additional points and connect them with a smooth curve. Polynomial graphs have no sharp corners or breaks.

The multiplicity of a root matters for the graph: at a root with odd multiplicity the graph crosses the x-axis, while at a root with even multiplicity it touches and bounces back.

End behavior

End behavior describes what happens to $f(x)$ as $x \to +\infty$ and $x \to -\infty$. Only the leading term matters:

Turning points and extrema

A turning point is where the graph switches from increasing to decreasing (local maximum) or decreasing to increasing (local minimum). A degree-$n$ polynomial has at most $n - 1$ turning points.

Finding exact turning points requires calculus (setting the derivative equal to zero). For this course, you mainly need to know the upper bound on their count and how they relate to the polynomial's degree.

Polynomial inequalities

To solve an inequality like $f(x) > 0$:

1. Find all real roots of $f(x) = 0$.
2. Plot these roots on a number line, dividing it into intervals.
3. Test a point in each interval to determine the sign of $f(x)$ there.
4. Select the intervals that satisfy the inequality.

This sign chart method works because polynomials are continuous, so they can only change sign at their roots.

Applications of polynomials

Modeling real-world situations

Polynomials show up in many modeling contexts:

• Projectile motion: The height of a thrown object follows a quadratic $h(t) = -\frac{1}{2}gt^2 + v_0t + h_0$, where $g$ is gravitational acceleration, $v_0$ is initial velocity, and $h_0$ is initial height.
• Economics: Revenue, cost, and profit functions are often modeled as polynomials. A firm's cost function might be cubic to capture increasing then decreasing marginal costs.
• Population models: Higher-degree polynomials can approximate growth patterns over bounded time intervals.

Optimization problems

Finding maximum or minimum values of polynomial functions is a core application. For quadratics, the vertex gives the optimum directly. For higher degrees, calculus techniques (derivatives) are typically needed. Classic examples include maximizing the area enclosed by a fixed perimeter, or minimizing material cost for a container of fixed volume.

Polynomial interpolation

Given a set of $n + 1$ data points, there's a unique polynomial of degree at most $n$ passing through all of them. Lagrange interpolation constructs this polynomial explicitly. This technique is used in numerical analysis, computer graphics (smooth curve fitting), and anywhere you need to reconstruct a function from sampled data.

Error-correcting codes

Polynomials play a central role in coding theory. Reed-Solomon codes encode data as polynomial evaluations and use the algebraic structure of polynomials to detect and correct transmission errors. These codes are used in QR codes, CDs, DVDs, and deep-space communication. The connection between polynomial arithmetic and error correction is one of the most elegant applications of abstract algebra.

Advanced polynomial concepts

These topics connect polynomial theory directly to abstract algebra, which is the broader context for this unit.

Polynomial rings

A polynomial ring $R[x]$ is the set of all polynomials with coefficients from a ring $R$, equipped with the usual addition and multiplication. For example, $\mathbb{Z}[x]$ is the ring of polynomials with integer coefficients.

Polynomial rings inherit many properties from their coefficient ring. If $R$ is commutative, so is $R[x]$. If $R$ is an integral domain (no zero divisors), then $R[x]$ is too. This structure lets you study polynomials using the same tools you use for integers and other algebraic objects.

Irreducible polynomials

An irreducible polynomial over a field $F$ is one that cannot be factored into polynomials of lower degree with coefficients in $F$. This is the polynomial analogue of a prime number.

Whether a polynomial is irreducible depends on the field. For instance, $x^2 + 1$ is irreducible over $\mathbb{R}$ but factors as $(x + i)(x - i)$ over $\mathbb{C}$.

Eisenstein's criterion provides a sufficient condition for irreducibility over $\mathbb{Q}$: if there's a prime $p$ that divides every coefficient except the leading one, divides the constant term, but $p^2$ does not divide the constant term, then the polynomial is irreducible over $\mathbb{Q}$.

Irreducible polynomials are essential for constructing finite fields (e.g., $GF(2^8)$, used in AES encryption).

Cyclotomic polynomials

The $n$-th cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial over $\mathbb{Q}$ whose roots are the primitive $n$-th roots of unity. The polynomial $x^n - 1$ factors as a product of cyclotomic polynomials:

$x^n - 1 = \prod_{d \mid n} \Phi_d(x)$

For example, $x^6 - 1 = \Phi_1(x)\Phi_2(x)\Phi_3(x)\Phi_6(x)$.

Cyclotomic polynomials connect number theory, algebra, and complex analysis. They appear in the study of finite fields, coding theory, and even in proofs about the distribution of primes.

Polynomial algorithms

Efficient computation with polynomials is a major topic in computational algebra:

• Fast Fourier Transform (FFT): Multiplies two degree-$n$ polynomials in $O(n \log n)$ time instead of the naive $O(n^2)$, by converting to point-value representation and back.
• Berlekamp-Massey algorithm: Finds the shortest linear recurrence (equivalently, the minimal polynomial) for a given sequence.
• Gröbner basis algorithms: Solve systems of multivariate polynomial equations, generalizing Gaussian elimination from linear to polynomial systems.

These algorithms have practical applications in signal processing, cryptography, and computer algebra systems.