Chapter II · Functions of real variables
Solving equations with graphs
Splitting an equation as f(x) = φ(x) so that its roots are where two easy graphs cross, and using the shapes of the graphs to count the roots.
Why this matters
Most equations cannot be solved by a formula: , , . But we can often say how many roots there are and roughly where, by writing the equation as with two functions whose graphs we know, and looking at where the graphs cross. That is §30. It is more than a drawing trick: arguments about counting crossings, made rigorous, are the intermediate value theorem and Rolle’s theorem of Chapters V and VI.
The idea
If the curves and meet at a point with abscissa , then , so is a root. Conversely every root gives such a meeting point. The art lies in the split. For , take (a fixed curve) and (a line you can move with and ). Counting roots becomes asking how many times a line can cut a known curve.
Try this. Choose . With odd, move from positive to negative and then move ; with even, move across . Then choose and try , , and .
- intersections and their abscissae (the roots)
What to notice
For odd and the line slopes downwards while rises, so they cross exactly once. For odd and there are three crossings or one, with two at the moment of tangency. For even the line cuts the cup-shaped curve twice when and twice or not at all when . The equation has , , and roots for those values of : the line leaves the strip at , so only the humps of the sine curve inside can be cut.
Precise statements
The real roots of are exactly the abscissae of the points where the graphs of and meet.
This is a restatement of what a graph is, so there is nothing to prove. The work is always in counting the meeting points. Here are two cases where the counting can be done completely now.
Let . The roots of are the abscissae of the intersections of with the line . There are two, one or none according as is positive, zero or negative.
For every , . Hence the equation has the single root .
Proofs
Intersections correspond to roots by the principle; then count them by completing the square, which is the algebra behind “the line cuts, touches or misses the parabola”.
Translate
A point is on both curves when and , so its abscissa satisfies , i.e. . Conversely a root gives the common point .
Complete the square
is equivalent to .
Count
If there are two roots ; if , one (the line touches the parabola); if , none, since a square is never negative (the line passes below the parabola).
For small positive , compare the half-chord with the arc in a circle of radius : a chord is shorter than its arc. For larger it is enough that . Negative follow by symmetry.
In a circle of radius , take an arc subtending the angle at the centre. Its length is and its chord has length . A straight segment is shorter than any other path between its ends, so , that is ; and here. (Hardy assumes the geometry of arcs at this stage; Chapters VII and IX make it rigorous.)
Then .
by the previous cases, since is odd.
Conclude
So when , and : the only root is . In the picture, the line meets the sine curve at the origin and nowhere else.
The same comparison gives the other counts. For with , every root has , because otherwise; each positive hump lying in that range is cut twice if the line is below the top of the hump, and the first hump once more (besides ). Count them for in the exercise below. The next example shows roots appearing and disappearing in pairs as a line slides.
Try this. Choose . Start at , then move slowly up past about , and on towards .
- intersections and their abscissae (the roots)
What to notice
For small there are three roots. As grows, two of them merge (the line becomes tangent to the curve) and vanish, leaving one; when approaches the pair is born again. The count only changes at tangencies, where two roots coincide.
Worked examples and exercises
Solve graphically, and then exactly: , , .
Hint
Solution
meets at and (indeed ). gives and . , i.e. , gives and . A careful drawing gives one or two correct decimals; the formula gives the rest.
Using the curves and , verify Hardy’s table for the number of real roots of : for even, two or none if , two if ; for odd, one if , three or one if . Give a numerical example of each case.
Hint
Hint
Solution
odd, . is increasing and strictly decreasing, so their difference is strictly increasing: at most one root. It is negative for large negative and positive for large positive (the leading term dominates), so the graphs do cross: exactly one root. Example: , root .
odd, . The line now rises. It can cut the S-shaped curve three times (when it passes close to the origin) or once (when it is far above or below); two exactly at a tangency, which the table ignores. Examples: has roots ; has the single root .
even, . The line passes through , which is above the curve’s point , while far out on both sides the curve is above the line. So there is a crossing on each side of , and by convexity no more: exactly two. Example: , roots and .
even, . The line passes below the origin; it may cut the curve twice or miss it (touching it at a tangency). Examples: has roots and ; has none.
Show that has infinitely many roots, whatever and are.
Hint
Solution
On each interval , runs (increasing) from values below any given number near the left end to values above any given number near the right end, while the line stays between two fixed numbers on . So is negative near the left end of and positive near the right end, and the unbroken curve must cross the line somewhere in . (That an unbroken graph which changes sign must cross the axis is the intermediate value theorem of Chapter V.) There are infinitely many intervals , so infinitely many roots.
Determine the number of roots of , and .
Hint
Hint
Solution
: positive roots lie in , within the first hump, which is cut once: . Total .
: the first hump gives one positive root (). The second positive hump is with top at , where the line is at : two roots ( and ). Total .
: the humps with have tops at , where the line is at most : two roots each, in all. For the hump starts at , and on the sine is at most while the line is above : no roots. With the first hump’s one root, there are positive roots and in total. (The widget confirms all three counts.)
Show that if is small and positive (say ) the equation has three roots, and that the same is true for small negative . Explain how the number of roots varies with .
Hint
Hint
Solution
At : , , , so , , are roots, and the line crosses the curve (does not touch it) at each. The roots must lie where the line is in the band , i.e. , a window half a period long, so there are only a few.
Sliding the line slightly (small ) moves each crossing slightly without destroying it, so there are still three roots: for they are about , and . The number can only change when the line becomes tangent to the curve, which needs slope : the slope of is (Chapter VI), so , giving and in . The corresponding values of are with . So there are three roots when , two at , and one when . Because the curve has period , replacing by shifts the whole picture by ; the pattern repeats, with three roots whenever is within of a multiple of and one root otherwise (apart from the tangent cases).
Check yourself
How many real roots does have?
Three positive roots (one in the first hump, two in the hump around , where the line is still below ), three negative ones by symmetry, and : seven.
How many real roots has ?
is odd and : increases and decreases, so they cross exactly once (near ). A fifth-degree equation has at most five real roots, but here the shapes allow only one.
A carefully drawn graph proves that two curves meet only at the intersections we can see.
False. A drawing shows a finite window at finite resolution; crossings may be off the page or too close together to separate. The counts in this lesson rest on arguments about the shapes (monotonic, convex, bounded, periodic), with the picture as a guide.
As a parameter varies continuously, the number of roots of typically changes
Transversal crossings move a little when the curves move a little, so they persist. A pair is created or destroyed at a tangency, as in . Roots can also escape through the edge of a window or into an asymptote, but tangency is the typical way.
Hardy’s language
Summary
- To solve graphically, split it as with easy graphs; the roots are the abscissae of the intersections.
- Count roots by reasoning about shapes: a rising and a falling graph cross at most once; a line meets a convex curve at most twice; a bounded curve meets a line only in a bounded window.
- for , so only at ; has , , , roots for , , , .
- As parameters move, roots appear and disappear in pairs at tangencies.