Mathematics · Glossary

What is content of a polynomial?

Definition 2.22 University Mathematics — Year 3 · Chapter 2 — Rings and Arithmetic

The content c(P)c(P) of a nonzero PA[X]P \in A[X] is a gcd of its coefficients (defined up to a unit); PP is primitive if c(P)A×c(P) \in A^\times. Every PA[X]P \in A[X] writes P=c(P)P1P = c(P)\,P_1 with P1P_1 primitive, and every PK[X]{0}P \in K[X]\setminus\{0\} writes P=λP1P = \lambda P_1 with λK×\lambda \in K^\times and P1A[X]P_1 \in A[X] primitive (clear denominators, then factor out the content).

Examples

Example 2.26

XnpX^n - p is irreducible over Q\Q for every prime pp and n1n \geq 1 (Eisenstein at pp): there are irreducible polynomials of every degree over Q\Q — in stark contrast with C\C (degree 11, d’Alembert–Gauss, proved in Chapter 16) and R\R (degrees 1,21, 2). The trick of shifting enlarges Eisenstein’s reach: the pp-th cyclotomic polynomial Φp=Xp1++X+1=Xp1X1\Phi_p = X^{p-1} + \dots + X + 1 = \frac{X^p - 1}{X - 1} has

Φp(X+1)=(X+1)p1X=Xp1+(p1)Xp2++(pp1),\Phi_p(X + 1) = \frac{(X+1)^p - 1}{X} = X^{p-1} + \binom{p}{1}X^{p-2} + \dots + \binom{p}{p-1},

Eisenstein at pp (p(pk)p \mid \binom pk for 0<k<p0 < k < p, and (pp1)=p≢0modp2\binom{p}{p-1} = p \not\equiv 0 \bmod p^2): Φp(X+1)\Phi_p(X+1), hence Φp\Phi_p, is irreducible over Q\Q. This is the algebraic heart of the 1717-gon story told in Chapter 4.

Read in context →