Every equation has a root: the winding proof
Appendix II, proof (A): follow the image of a square under , count how often it winds round , and trap a root in a chain of shrinking squares.
Why this matters
The fundamental theorem of algebra says that every polynomial equation
with real or complex coefficients, has at least one complex root. Dividing out a root and repeating then shows that has exactly roots counted with multiplicity. Hardy uses the theorem in several places (partial fractions, for instance) but proves it only here. As he remarks, it belongs more to analysis than to algebra: no proof can avoid continuity somewhere. This lesson gives his first proof, which is a piece of topology: it follows how often a curve winds round the origin.
(The appendix has no section numbers. The proof rests on following the argument of a complex number continuously along a path, the idea behind the many values of in Chapter X (§231).)
The idea
Let run once round a closed path in the -plane. Then runs round a closed path in the -plane. If never passes through , we can follow the angle continuously along it. When returns to its starting point the angle has changed by a whole multiple of : by times the number of times winds round . Hardy writes this change as .
Two facts make the proof go.
- A big square winds times. Far from the origin is almost , and as goes once round a big square, goes times round . So .
- A tiny square away from a root winds times. If , then on a very small square round the values all stay close to , so is a little loop near that cannot go round .
Between “big” and “tiny” the winding has to get lost somewhere, and the only places where it can be kept are near roots.
Try this. Drag the centre of the purple square and change its size. Watch the image on the right and count how many times it goes round the black dot . Then turn on the roots and compare. Try squares containing zero, one, two and all of the roots.
- square γ (drag its centre) and its image Γ
- roots of f
- Z = 0
What to notice
The winding number of always equals the number of roots inside the square. A square with no root inside has an image that may wander but never encircles . When the square is large enough to contain every root, the image winds times ( = degree), and it looks more and more like turns of a circle. If you push an edge exactly across a root, the image passes through and the count jumps.
The widget computes the winding number numerically, by following the argument of along the edges in small steps. That the count equals the number of roots inside is Hardy’s first example at the end of the appendix (Exercise 2 below). The proof of the theorem needs much less: only that the winding of a big square is not , and that it splits over sub-squares.
Precise statements
Let be a closed path in the -plane, described once in the positive (anticlockwise) sense, and suppose on . Choose a value of at the starting point and follow it continuously as describes . The total change when returns to the start is a multiple of ; it is denoted , and is the number of times the image winds round .
Let be the square with sides on , , where is so large that
Then on and .
Divide a square into four equal squares by lines parallel to the axes, and suppose on all their sides. Then
Every polynomial with , and real or complex coefficients has a root: there is a complex with .
Proofs
Factor out the leading term: with small on . The factor stays near and contributes no winding; the factor contributes turns.
Write
For , . On we have , so by the choice of and the triangle inequality, everywhere on . In particular on .
The factor does not wind
lies in the disc of radius about , which lies in the half-plane . A path in that half-plane cannot go round : its amplitude can be taken in all the way, so it returns to its initial value.
The factor winds times
As goes once round , which encloses , increases by , so increases by . The constant changes nothing.
Add the amplitudes
The amplitude of a product is the sum of the amplitudes, so . All that is needed later is that this is not .
The additivity lemma is a bookkeeping argument, and it is the heart of the method. Go round the four small squares one after another, each anticlockwise. Each side of the big square is traversed exactly once, in the right direction. Each of the four inner half-lines (the pieces of the dividing cross) is traversed twice, once in each direction, as a side of the two small squares it separates; the two changes of amplitude along it cancel. So the four increments add up to the increment round the big square.
Now the hunt. Since the four increments add up to something nonzero, at least one of them is nonzero, and we can keep that quarter. Then we divide again.
Try this. Press Subdivide repeatedly. Each time, the current square is cut into four, each quarter is labelled with its winding number , and the first quarter (in the order of the quadrants I, II, III, IV) with a nonzero label is kept. Keep the roots hidden at first and guess where the squares are heading. Then try the quintic .
- current square and its image
- its four quarters, labelled with Δ/2π
- Z = 0
What to notice
The labels of the four quarters always add up to the label of the parent square, so one of them is nonzero. The squares close in on a single point, and the read-out shows at the centre dropping towards : a root has been trapped without ever being computed. For the quintic, three roots are real, so they lie on the -axis, which is a dividing line: the images of the quarters pass through at once. Hardy assumes this never happens, because if it did a root would already have been found.
Build a nested sequence of squares , each a quarter of the previous one and each with . They shrink to a point . If were not , continuity would make on all sufficiently small squares near , a contradiction.
If a root lies on a dividing line, we are done
Throughout, suppose that no image passes through . If one ever did, some point of a side would be a root, and there would be nothing left to prove.
Choose
By the lemma, . By additivity, at least one quarter of has ; let be the first such. Repeating, we get squares of side , each inside the previous one, with for every .
The squares shrink to a point
Let have south-west corner and north-east corner . Then increases, decreases, and , so both tend to a common limit (§69); similarly . The point lies in (or on the edge of) every , and every point of is within of .
Suppose
Let . Since is continuous, there is a with whenever . Choose so large that every point of is within of .
Then
On write with , so . As in the big-square lemma, cannot wind round , and is constant. So returns to its initial value: , contradicting the choice of .
Conclude
Hence . (Incidentally is not on itself, since there.)
The structure is the same as the bisection proofs of Chapter I and Chapter V (Weierstrass’s theorem, the intermediate value theorem): a property that is “inherited by at least one half” (here “by at least one quarter”) is chased down a nested sequence of intervals or squares to a single point, and continuity at that point gives the conclusion. Here the inherited property is “the winding number is not zero”.
Exercises
Show that if and , then every root of has . Deduce that every root of has .
Hint
Hint
Solution
If then , so
So no root has . For the quintic with : and , so . (The bound is nearly sharp: the widget shows the roots, and the largest, a real root, has modulus about .)
Let be a simple closed path (one that does not cross itself), described once anticlockwise, on which has no root. Show that equals the number of roots of inside , each counted as often as it is repeated.
Hint
Hint
Solution
By the fundamental theorem, applied times, . Along , (each term followed continuously). If is inside , the vector from to turns once round as goes round , so increases by . If is outside, returns to its initial value. So (number of inside).
How much of this have we proved? For a square, or any convex path, both facts are clear: seen from an inside point , the direction of turns steadily one way and comes round once; from an outside point the whole path lies in an open half-plane through , where can be chosen continuous and single-valued. For a general simple closed path the two facts are still true, but proving them is a piece of topology (the Jordan curve theorem) that we assume rather than prove.
Why does a path lying entirely in the disc have no winding round ? Give an explicit continuous choice of on the disc.
Hint
Solution
If then . On the right half-plane the principal amplitude , with values in , is continuous. Following it along the path gives the continuous amplitude, and since it is a function of the point alone, it takes the same value at the end as at the start. So the increment is .
Let be a segment from to on which , and let be the change of as goes from to along . Show that the change from to along is , and explain how this gives the additivity lemma.
Hint
Solution
If is a continuous amplitude of at the point , , then is a continuous amplitude along the reversed segment, and its change is . (Any other continuous choice differs by a constant multiple of , which does not affect the change.) When the four small squares are described, each inner edge is described once each way, contributing ; the outer edges together make up the big square once, anticlockwise. The changes along successive pieces of a path add, so the four increments add to of the big square.
Let and be polynomials and a closed path on which . Show that and have the same number of roots inside . Use this to show that has exactly one root with .
Hint
Hint
Solution
On , and , so lies in the disc , which lies in ; as in the previous exercise it contributes no winding. Hence for equals for , and has no root on . By Exercise 2, both have the same number of roots inside. (So the result is fully proved for squares, circles and other convex paths; for a general simple closed path it rests on the topological facts assumed in Exercise 2.)
For the example, on : . So has as many roots inside the unit circle as , namely one.
Hardy uses squares only because they are easy to subdivide and to shrink. Which steps of the proof would change if we used the circle for the first path, and which property of squares is used in the hunt that circles do not have?
Solution
The big-square lemma works unchanged for the circle : there too , and increases by . The hunt, however, needs a region that can be cut into finitely many pieces of the same kind, each of diameter half (or a fixed fraction) of the original, so that the additivity argument applies again at the next stage. A square splits into four squares; a disc does not split into discs. Any shape that tiles itself (triangles, rectangles) would do.
Check yourself
For a quartic , the big square has . Its quarters have equal to , and for the first three. What is for the fourth?
The four quarter increments add up to , so the labels add up to : the fourth is . In the widget the labels always add to the parent’s label.
Why is for the big square ?
The first answer is true, but it uses the theorem we are trying to prove (it presupposes that there are roots). Large alone says nothing about winding: a large loop far from need not go round it. What matters is that is close to in ratio.
In Hardy’s hunt, the nested squares always close in on the root of largest modulus.
False. Which root is found depends on the order in which the quarters are tried (Hardy takes “the first which is not zero”) and on where the roots lie. Try different polynomials in the widget: the squares go to whichever root lies in the first quarter with nonzero winding.
In the last step, why does force for large ?
Shortness is not the point: a short loop near could still go round it. The proof needs the image to stay in a disc about that excludes , which continuity at provides. The last option assumes that winding counts roots, which is more than the proof uses.
Hardy’s language
The theorem that ‘every algebraical equation has a root’ is usually called ‘the fundamental theorem of algebra’, but it belongs more properly to analysis, since it cannot be proved without appeal somewhere to considerations of continuity.
Summary
- , the total change of round a closed path, is times the winding number of the image about ; it counts the roots inside.
- On a big square with , so .
- is additive over the four quarters, so some quarter keeps ; nested quarters shrink to a point .
- If , continuity keeps the image of a tiny square in a disc avoiding , so : contradiction. Hence .
- The pattern is the bisection argument of Chapters I and V, in two dimensions, with “winding number ” as the inherited property.