Eigenvalue
Named by 33 essays across 7 fields — each of them below, with the objects they name alongside it.
The directions a map leaves alone
Almost every arrow comes out of a transformation pointing somewhere else. A few come out pointing exactly where they went in, only longer or shorter. Those few decide nearly everything the map does.
The number that says how much room is left
A linear map takes the unit square to a parallelogram. The area of that parallelogram is one number, it is computable from the four entries of the matrix, and almost everything the determinant is used for is a restatement of that sentence.
The polynomial whose roots are the stretches
Finding the directions a map leaves alone means finding the numbers at which it crushes something to nothing. Those numbers are the roots of one quadratic, and everything the map does is written in its two coefficients.
The same map in a better basis
Measured along its own invariant directions, a linear map stops shearing and becomes two independent stretches. Nothing about the map has changed; the grid it is described against has.
Symmetry forces a right angle
A matrix equal to its own reflection across the diagonal always has real stretches and always has perpendicular directions to stretch along. Neither is true of matrices in general, and both follow from one line of algebra.
The exponential of a square
The series for e makes perfect sense with a matrix in it. What comes out solves a system of equations the way the ordinary exponential solves one, and a skew matrix exponentiates into a rotation with no trigonometry anywhere.
How long until it forgets
The essays before this one settle where a chain ends up and how much time it spends there, and none of them asks how long the settling takes. That question has an exact answer, it is a single number, and it is the only thing any practical use of a chain depends on.
One sign decides which curve
The general quadratic in two variables has six coefficients and draws a conic. Which of the four it draws is settled by a single combination of three of them, and the other three cannot change the answer however they are chosen.
A matrix that counts the returns
Draw a map straight through the cycle 0 → 1/3 → 1 and its two pieces carry each other in a fixed pattern: the left piece only across the right, the right across both. The orbits' words are then walks on a two-node graph, and the number of points that come back after n steps is the trace of that graph's matrix to the nth power — 1, 3, 4, 7, 11, 18 — each one checked by solving for the points exactly.
Nearly the most means nearly round
A shape that holds almost as much as a circle of the same perimeter must almost be a circle. Bonnesen made that exact: the ring between a convex shape's largest inscribed circle and smallest enclosing circle is never wider than √(L² − 4πA)/π. Three quite different shapes holding 99% of the circle's area all have rings under 9.55 wide, and not one of 200 random convex shapes breaks the bound.
Half the cube and √n neighbours
Choose more than half the corners of an n-dimensional cube, any way at all, and some chosen corner has at least √n chosen neighbours. That statement about a cube settled a thirty-year question about how sensitive a truth function must be to its inputs, and its proof is a matrix of plus and minus ones whose square is n times the identity. A search over every choice for the 4-cube finds the bound exactly: nine corners, and some corner always has two chosen neighbours.
Discs that fence in the eigenvalues
Draw one disc for each row of a square matrix, centred on the diagonal entry, with a radius equal to the sum of the sizes of everything else in that row. Every eigenvalue lies inside one of the discs, and a group of discs set apart from the rest holds exactly as many eigenvalues as it has discs. Nothing is solved to find them.
The highest point on the sphere is an eigenvalue
For a symmetric matrix, walk a unit arrow over every direction and record the value of xᵀAx. The highest value reached is the largest eigenvalue, the lowest is the smallest, and every eigenvalue in between is a saddle height, a minimum of maxima. From that one description comes a theorem no formula for the roots could give: delete a row and its column, and every eigenvalue of what is left sits between two of the original's.
A geometric series whose ratio is a matrix
1 + r + r² + … adds to 1/(1 − r) when r is smaller than one. Put a matrix in place of r and the same formula holds, with the inverse matrix in place of the fraction — but what must be smaller than one is not the matrix's size. It is its largest eigenvalue. A matrix whose eigenvalues are 0.9 and 0.8 can stretch vectors ten times over before its powers begin to shrink, and the series still converges, after a detour the eigenvalues say nothing about.
Two numbers decide the flow
A linear system in the plane has four coefficients, and what its solutions do forever afterwards — spiral in, race out, swing round, or split along two lines — is decided by two of the numbers made from them. The plane of trace against determinant is a complete map of the possibilities, and the only places it cannot decide are the lines where it changes its mind.
The matrix that has no logarithm
Every square matrix has an exponential, and a matrix exponential is always invertible. The converse fails, and it fails in a way that can be read straight off the eigenvalues — a real matrix with eigenvalues −1 and −2 is no exponential at all, while minus the identity is the exponential of a whole continuum of matrices that do not even commute with each other.
The narrowest door sets the pace
How fast a chain forgets is an eigenvalue, and nobody can compute the eigenvalues of a chain worth studying. Cheeger's inequality trades the eigenvalue for a picture — the narrowest door in the state space — and pins the one between the square of the other and twice it. Both ends of that range are reached, on graphs small enough to search completely.
Two graphs the eigenvalues cannot tell apart
A graph's matrix has eigenvalues, and they count a surprising amount of the drawing: its edges, its triangles, every closed walk of every length. They do not count everything. A star with four arms and a square beside a lone point have the same eigenvalues exactly, although one of them is in two pieces — and on six points ten of the 156 graphs have a twin of this kind.
As many points as two steps allow
In a graph where every point has d neighbours and every point is within two steps of every other, there can be at most d² + 1 points — one, its d neighbours, and d(d − 1) more reached through them. Graphs that meet the bound exactly are rare to the point of absurdity. The pentagon does it for d = 2, the Petersen graph for d = 3, a fifty-point graph found in 1960 for d = 7, and an eigenvalue argument proves there is nothing else — except possibly one graph with 3,250 points and 57 neighbours each, which nobody has found or ruled out.
When a table of moves came from steady rates
A process that jumps between states at constant rates, watched once a year, produces a table of yearly moves that is the exponential of its rates. Most tables that anyone could write down are not — a random three-state table is only about one time in twenty-three — and the few that are can have two different sets of rates behind them, but only once the process has forgotten where it started.
Three sides and four are proved
Among all shapes of a given area, the disc has the smallest lowest eigenvalue. Among triangles it is the equilateral one, among quadrilaterals the square — both proved by sliding chords to an axis. For five sides the regular pentagon wins every computation, every nudge raises its value by the square of the nudge, and there is still no proof.
An urn forgets its start only below one half
Let each draw from an urn add balls of both colours in fixed amounts, and the long run depends on a single ratio of two eigenvalues. Below one half the urn behaves like a coin, its fluctuations spread like the square root of the draws and settle into a bell. Above one half the first few draws decide most of the outcome, the spread grows faster, and the shape that results is not a bell and depends on how the urn began.
The signs no completion can change
A quadratic in several variables can be completed square by square in many orders, and each order hands back different coefficients. What no order changes is how many come out positive and how many negative — and that count, read off a completion of A − tI, says how many eigenvalues lie below t without finding a single one.
A threshold no average can see
Damp the random Fibonacci sequence — add or subtract β times the term before last, by a coin — and somewhere between β = 0.6 and β = 0.8 almost every run stops shrinking and starts growing. The switch is at β ≈ 0.70258. The average of the squares, which can be computed exactly, grows for every β there is, so the one number that decides the sequence's fate is invisible to the one number anybody can compute.
Two chaotic orbits made to agree
Chaos means two copies of a system started a hair apart soon have nothing in common. Couple them — let each take a fraction ε of its next step from the other — and above a definite strength they agree to every digit for ever, while each stays exactly as chaotic as before. The strength needed is read off the same number that measured the chaos: the Lyapunov exponent.
What a missing string of digits leaves behind
Strike from the harmonic series every term whose denominator contains 42 and the rest adds up to 228.45. Strike out 99 instead and it adds up to 253.28. The difference is not about which numbers are lost but about waiting: 99 overlaps itself, so it takes 110 random digits on average to turn up where 42 takes 100, and the sum is almost exactly ln 10 times that wait.
A ring of clocks settles into a twist
Put identical oscillators round a ring, each pulled only by its neighbours, and start them at random. They always lock — every one ends at the same frequency — but most of the time not in step: the angles wind round the ring a whole number of times and stay wound. The winding number a random start chooses is spread like a bell whose width grows like the square root of the ring, and only coupling to about a third of the ring makes full synchrony certain.
Eigenvalues that keep their distance
Fill a large symmetric matrix with independent random numbers and its eigenvalues do something no list of independent numbers does: they refuse to crowd together. The reason is a count of conditions in a two-by-two matrix, and its consequences — a semicircle, gaps that vanish at nought, a spectrum almost as rigid as a lattice — reach from heavy nuclei to the zeros of the zeta function.
The route round that rates cannot avoid
A table of yearly moves between states came from steady rates only if it is the exponential of a rate matrix. With two states that is true of half of all tables, with three of one in twenty-four, with four of about one in two thousand, and of none of 400,000 tables drawn at random with five. Even a table that is nine parts staying put fails more and more often as states are added, and always for one reason: rates that carry 1 to 2 and 2 to 3 also carry 1 to 3, and a table whose direct move is rarer than that route round cannot have come from them.
The sizes at which a sentence can come true
Write a sentence about a relation and ask for which numbers of points some relation makes it true. "Every two points have exactly one common neighbour" comes true at every odd size and no even one, and every graph that satisfies it is a windmill of triangles. "Every two players are both beaten by some third" fails for every tournament of two to six players and holds from seven on. A search can settle one size at a time; only a proof settles all of them, and the two sentences need different kinds.
Three arrows in and three out
Put an arrow on every edge of the cubic grid so that every point has three arrows in and three out. On the square grid the same question — two in, two out — has an exact answer, found by Elliott Lieb in 1967: about 1.5396 arrangements per point. On the cubic grid nobody knows the answer. Pauling's guess of 2.5 is a proven lower bound, and exact counts on prisms of the grid come down towards it from above — 2.794, 2.682, 2.587 as the cross-section widens — without reaching it.
Six lines all at one angle
Take the six long diagonals of an icosahedron: every pair meets at the same angle. Squaring each line into the matrix that projects onto it removes every sign and leaves a table no vector can kill, so at most d(d + 1)/2 lines can do this in d dimensions. The bound is reached at 2, 3, 7 and 23, and at no other dimension anyone can find.
A table that never reaches π
Fill a square table with 1/1, 1/2, 1/3 along the rows, each row starting one place further on. Every row is a piece of the harmonic series, and yet the table stretches no vector by as much as π. At a thousand rows the stretch is 2.42, at a trillion it is near 2.94, and one integral explains both the number and the failure to arrive.
Named alongside it
The objects these essays reach for when they reach for this one.
MatrixDeterminantEigenvectorExhaustive searchTraceMatrix exponentialBasisCharacteristic polynomialLogarithmMarkov chainQuadratic formStability