Polynomials

The well-behaved family — finite sums of powers, the workhorse of approximation.

Suggested next → Equations & Variables · MATH · T3

The brief

Among all the functions mathematics deals with, polynomials are the ones it can handle without flinching — a finite sum of a variable raised to whole-number powers, and nothing more. You can add them, multiply them, divide them, differentiate and integrate them, and hunt for their roots, all by rules a schoolchild can follow. No other class of function is so completely tractable. And yet — this is the quiet miracle — they are not some small or special corner of the subject: any continuous curve, however wild, can be approximated as closely as you please by a polynomial. For two thousand years they have been the language mathematics reaches for whenever it wants to stop describing a function and actually compute with it.

A polynomial's degree — the highest power it contains — is its single most telling number, because it fixes how many roots the polynomial has. This is the Fundamental Theorem of Algebra, which the young Gauss proved in 1799: a polynomial of degree n has exactly n roots, provided you are willing to allow complex numbers. Real polynomials may have no real roots at all — x² + 1 never touches zero — but step into the complex plane and the missing roots are always waiting, precisely n of them. The complex numbers are, in this exact sense, the place where polynomials become whole. Knowing the roots exist, however, is not the same as finding them. For degrees up to four there are formulas — the familiar quadratic formula and its more monstrous cousins for cubics and quartics — that grind the coefficients into the answers. The natural expectation was that the pattern simply continues. It does not. Évariste Galois, dead in a duel at twenty, proved that from the fifth degree onward no such formula can exist — not because none has yet been found, but because the very symmetry among a general equation's roots forbids one. It was among the first times mathematics proved a thing impossible rather than merely hard. Set against these limits is the gift that makes polynomials indispensable: Weierstrass showed that any continuous function on an interval, however jagged, can be matched to any accuracy you like by a polynomial. The unruly universe of functions can always be tamed, piece by piece, by the one family we know how to handle exactly.

Why nowThat approximating power is why polynomials run quietly beneath so much technology. The smooth curves of every font and vector graphic are stitched together from short polynomial arcs. The Reed–Solomon codes that let a scratched CD, a smudged QR code, or a faint signal from deep space still be read correctly work by treating the data as the coefficients of a polynomial and sampling it at extra points, so that a few corrupted values can be reconstructed from the rest. The lattice-based cryptography now being standardized to withstand quantum computers is, underneath, arithmetic on polynomials. They remain the bridge between algebra, which handles them exactly, and analysis, which uses them to approximate everything else.