Minimal polynomial
Named by 8 essays across 2 fields — each of them below, with the objects they name alongside it.
Every step is a square root
A line meets a line by solving a linear equation and a circle by solving a quadratic one. There is no third case, so the numbers a construction reaches can only ever double in complexity — and a doubling is a thing that can be counted.
The cube that will not double
Doubling a cube needs an edge in the ratio of the cube root of two. That number satisfies an equation of degree three, three does not divide any power of two, and the oldest open problem in geometry closes in a line.
The circle that will not square
The other three impossibilities are a number having the wrong degree. This one is a number having no degree at all — and that is a claim no finite search can establish, which makes it the one place in this field where the picture has to admit what it is not doing.
A tower whose degrees multiply
Treat a field containing another as a vector space over it, and the size of an extension becomes a dimension — one that multiplies along a tower, so that three impossible constructions become arithmetic about which numbers divide which.
On the circle and never home
Every root of unity lies on the unit circle, and so does the point (3 + 4i)/5 — yet no power of it ever returns to 1. A root of a whole-number polynomial of degree ten does the same. What forces a point home is a condition on the numbers its polynomial ties it to, and how far one of them may stray is a question open since 1933.
Seven powers in a space of six
Is √2 + ∛3 a root of some polynomial with whole-number coefficients? It lives in a field of dimension six, so its first seven powers are seven vectors in a six-dimensional space and must be dependent — and the dependency, solved exactly, is the polynomial. The same count shows every sum, product and quotient of algebraic numbers is algebraic, without ever needing a formula.
The integers a field contains
Inside the field of numbers a + b√5, the obvious integers are those with whole a and b. They are not all of them: the golden ratio has a one-half in it and satisfies x² = x + 1, a monic equation with whole coefficients, exactly as an integer should. The right integers form a lattice twice as dense as the obvious one — and a whole-number matrix proves they are closed under addition.
The sums of roots of unity that add to nothing
All n of the n-th roots of unity add to zero, and so does any regular polygon among them, turned. Those are not the only vanishing sums: six thirtieths of a turn close into a loop with no polygon in them. Which counts of roots can close at all is decided by the prime factors of n — no seven fifteenths ever add to zero — and the same question counts where the diagonals of a regular polygon cross.
Named alongside it
The objects these essays reach for when they reach for this one.
Degree of an extensionConstructible numberField extensionBasisStraightedge and compassAlgebraic integerAlgebraic numberConjugateCyclotomic polynomialDimensionIrreducible polynomialRational root theorem