Chapter IV · Limits of functions of a positive integral variable
Some inequalities for powers
Hardy's algebraical lemmas, which all say that (αʳ − 1)/r increases with r, and their consequence that a chord of t ↦ tʳ lies between the tangents at its ends.
Why this matters
§74 (in Hardy’s small print) collects ten inequalities between powers. They look like a list to memorise, but they are one fact seen from several sides, and they do real work: the next lesson uses them to prove that converges, which is how the logarithm first appears; and they give for rational . Later, with derivatives, all of them become instances of the mean value theorem; here they are proved with nothing but algebra, which is exactly why they are useful at this stage.
The idea
Fix a number and look at
For it is ; for it is , which is larger because . The central claim is that increases with . Everything else in the section is a rearrangement of this.
Try this. With , move and (they move in steps of twelfths, so they stay rational). Then make less than , say .
- g(r) = (αʳ − 1)/r
- s
- r
- g(1) = α − 1
What to notice
Whatever you choose, the curve rises from left to right, so whenever . Comparing with the dashed level gives for and the reverse for . For the curve still rises, which is Hardy's statement that falls.
Precise statements
Throughout, , , and , are positive rational numbers (irrational powers have not been defined yet).
If , then
If : and . If : and .
If : . If : .
If , then
Dividing (9) by gives the picture: the slope of the chord of lies between and , which (as Chapter VI will show) are the slopes of the curve at the two ends.
Try this. With , move and and compare the three slopes in the read-out. Then try , and a negative such as .
- tʳ
- chord
- slope r yʳ⁻¹ at y
- slope r xʳ⁻¹ at x
What to notice
For the curve bends upwards and the chord is steeper than the tangent at its left end but less steep than the tangent at its right end. For the curve bends downwards and the order reverses. Negative behaves like , which is Examples XXVIII, 3.
Proofs
For a positive integer , compare with the geometric sum , then rearrange into a statement about and .
Each of the terms on the right is less than , since .
Multiply by
The geometric sum times is , so .
Rearrange
Add to both sides: the left becomes , the right . Dividing by gives , that is, .
Chain
Applying this repeatedly, whenever are positive integers. The inequality (2) is proved the same way, with every inequality reversed because .
Put both fractions over a common denominator and replace by a suitable power of a new base , so that the exponents become whole numbers.
Common denominators
Write and with positive integers . Then means .
Change the base
Let , so and . Then and .
Reduce to whole numbers
and . Since are positive integers, the integer case for gives the first inequality of (3). The second is the same argument with .
(4) and (5) are (3) with one of the exponents equal to , since . For the halves, for , and the reverse for .
Substitute in the -half of (4) to get an upper bound for ; combine with the lower bound; then put and multiply by .
An upper bound for
In put : . Multiply by : . This is (6).
Combine
With (4): for , which is (8). The case comes from (5) in the same way, giving (7).
Put
With , . Multiplying (8) by : , and . This is (9); (10) follows from (7) in the same way.
Worked examples and exercises
Verify (9) for and , and (10) for , by direct algebra.
Solution
: , and because . Multiply by .
: , and because each of lies between and , and not all are equal.
: , and , so , which is (10) since .
Show that (9) and (10) remain true if .
Solution
Swap the names: (9) for reads . Multiplying by reverses every inequality: , which is exactly (9) again, read from right to left. So (9) holds for any two distinct positive numbers , . The same argument applies to (10).
Show that (9) also holds for negative rational .
Hint
Solution
Test first: , , gives , , , and indeed .
In general let ( rational) and . Multiplying (9) by , we must show
Put . Then , , and , so the claim becomes
By (9) or (10) (or trivially if ), lies between and . Both of these exceed the left side, since (as ) and (as ); and both are less than the right side, since and . This proves (9) for negative .
Let and let be a positive rational number. Show that .
Hint
Solution
For large , (take in the definition). Suppose . By (9), applied to the larger and smaller of and , lies between and , where are the smaller and larger of the two numbers. Both lie in , so . Given , make for large . For , (10) gives in the same way . For there is nothing to prove. (Negative then follow from Theorem III.)
Check yourself
Which single statement contains inequalities (1)–(5) of §74?
The monotonicity of gives (3) directly, (4) and (5) by comparing with , and the -forms by taking . The first option is true but much weaker; the third is false for .
For : .
False. With , (5) says . Check with : .
What is the slope of the chord of from to ?
. It lies between and , as (9) says.
Hardy’s language
Summary
- For , , the quotient increases with ; this is the content of (1)–(3).
- The integer case comes from ; rational exponents reduce to integers by writing .
- Comparing with : is above for and below it for ; with the substitution this gives two-sided bounds.
- Putting : the chord slope lies between and .