Matpic
mathematics, in pictures
Concept

Roots — where it appears

The values at which a polynomial takes the value zero. Their number is bounded by the degree, and over the complex numbers there are exactly that many when multiplicity is counted, which is the fundamental theorem of algebra.

Named by 11 essays across 2 fields — each of them below, with the objects they name alongside it.

Completing the square, as a square. An x by x square with the strip split in half and laid along two sides, leaving a square hole of side 1.5. Filling the hole costs 2.25 and buys a perfect square.

Completing the square, by completing a square

The step everybody is taught as an algebraic trick is a literal instruction about a literal square. There is a corner missing, its size is forced, and paying for it is the whole method.

algebra · Completing the square The image of four circles, turning 0 to 3 times. The polynomial applied to circles of four radii, each image drawn as a closed loop with the origin marked, and the number of times the loop goes round it.

A loop that cannot miss the middle

Feed a circle into a polynomial and a closed loop comes out. A small circle gives a loop that does not enclose the origin; a large one gives a loop that goes round it as many times as the degree. Something has to happen in between, and that something is a root.

algebra · Polynomial roots 3 roots, and the two numbers the coefficients already knew. The roots of a degree-3 polynomial, found numerically, with the point they average to. That average, and their product, are readable straight off the coefficients without finding the roots at all.

What the coefficients already know

Finding the roots of a polynomial is hard and often impossible in closed form. Reading off their sum, their product and how many of them are real is none of those things — those numbers are sitting in the coefficients, and no root-finding is required to get at them.

algebra · Polynomial roots Every quadratic is a point. The plane of monic quadratics x² + px + q with p across and q up. The parabola q = p²/4 divides it: the region below, shaded, holds the equations with two real roots, the curve itself the ones with a repeated root, and the region above the ones with none. 5 equations are marked and labelled.

Where two roots run into each other

Put every quadratic equation at a point of a plane, one coordinate per coefficient. Each possible root becomes a straight line there, every one of those lines touches the same parabola, and that parabola is the discriminant — the crease where the plane of roots is folded onto the plane of equations.

algebra · Completing the square The powers of 4 roots, added: 1, −1, 4, −5. For k from 1 to 4, the k-th powers of the roots of a degree-4 polynomial drawn as arrows placed tip to tail. Each walk ends on the real axis at a whole number, the k-th power sum, which the coefficients determine.

Every power sum, from the coefficients alone

Raise the roots of a polynomial to the k-th power and add them. However the roots turn, the total is a whole number when the coefficients are, and Newton's identities produce it from the coefficients one step at a time — no root is ever found. Run the rule on x³ − x − 1 and out comes Perrin's sequence, whose terms know which numbers are prime, nearly.

algebra · Polynomial roots The roots of the derivative inside the hull of the roots. Three polynomials of degree five, each drawn as its roots with their convex hull shaded, and the four roots of its derivative marked. Every root of the derivative lies inside the hull.

The roots of the slope stay inside

Mark the roots of a polynomial in the complex plane and stretch a band around them. However the roots are arranged, the roots of the derivative land inside the band — never outside, never on a new frontier. The reason is a balance of pushes, the same reason makes the derivative of a cubic mark the foci of an ellipse nobody asked for, and a question about how far inside the roots must sit has been open since 1958.

algebra · Polynomial roots Counting the real roots of x⁵ − 5x³ + x² + 3x − 1 with Euclid's algorithm. Above, the graph of a polynomial over an interval with its real roots marked; below, a step function counting sign changes in the polynomial's Sturm chain, which drops by one at each root; beside them the chain of polynomials listed.

The remainders that count the roots

Run Euclid's algorithm on a polynomial and its derivative, flipping the sign of each remainder, and write down the signs of the whole chain at any point. The number of sign changes drops by exactly one each time the point passes a real root — so the roots in any interval can be counted, exactly, without finding a single one.

geometry · Euclidean algorithm The roots of random polynomials of degree 30 and 100: few are real. degree 30: 2 real roots at -2.335, -1.074; degree 100: 2 real roots at -0.327, 0.994.

Almost none of the roots are real

Pick the coefficients of a polynomial of degree a thousand at random, each one an independent draw from the bell curve, and ask how many of its thousand roots are real. The answer is about five. Mark Kac found in 1943 that the average grows only like (2/π) ln n, and the reason can be read off the real line itself: the real roots crowd towards +1 and −1 and spread evenly on a logarithmic scale of distance from them.

algebra · Polynomial roots The roots of every polynomial of degree 11 with coefficients ±1. 22528 roots; radii from 0.500 to 2.000; 42% within 0.1 of the unit circle.

Random roots crowd onto the circle

The roots of a random polynomial are not scattered across the plane. They gather within about 1/n of the unit circle, and their directions spread evenly round it. Paul Erdős and Pál Turán proved in 1950 that this is not a fact about randomness at all: any polynomial whose coefficients are all of roughly one size has roots whose directions are nearly even, and the inequality says exactly how nearly, in terms of nothing but the coefficients.

algebra · Polynomial roots The proof of Descartes' rule, one term at a time. Four stacked graphs: a four-term polynomial with three positive roots, and the three polynomials obtained by dividing out a power of x and differentiating, each with one fewer term, one fewer sign change and one fewer positive root.

What the signs allow

Descartes' rule reads the signs of a polynomial's coefficients and bounds its positive roots by how often they change — a bound set by the number of terms, not the degree, and proved by nothing more than Rolle's theorem. Each count the rule allows can be had. But not every pair of counts, positive and negative, that the rule allows together can be had together: the first combination that never occurs is at degree four, and the list of impossible ones is still being worked out.

geometry · Euclidean algorithm Two curves with five crossings: x⁶ + (44/31)y³ − y and its mirror. Two curves in the positive quadrant, each the zero set of a trinomial, crossing at five marked points.

Five where four were promised

In one unknown, a polynomial with three terms has at most two positive roots, whatever its degree. The natural guess for two equations in two unknowns, each with three terms, was two times two: four. It is wrong. Bertrand Haas found two such equations in 2002 whose curves cross five times in the positive quadrant, all five crowded within a tenth of one corner, and five turned out to be the most there can ever be.

geometry · Euclidean algorithm

Named alongside it

The objects these essays reach for when they reach for this one.

PolynomialComplex numbersDerivativeSymmetric functionCoefficientCompleting the squareDegreeDescartes rule of signsDiscriminantExact arithmeticLogarithmQuadratic polynomials

All concepts