Chapter IV · Limits of functions of a positive integral variable
Weierstrass’s theorem by bisection
A second proof that every bounded infinite set has a point of accumulation, in which the nested intervals of repeated bisection give two monotone sequences with a common limit.
Why this matters
In §19 Hardy proved Weierstrass’s theorem: every bounded set with infinitely many points has at least one point of accumulation. That proof used a Dedekind section directly. §71 gives a second proof by repeated bisection, now that monotone sequences are available. The method is worth more than the theorem: the same halving argument proves the intermediate value theorem and the Heine–Borel theorem in Chapter V, and it is the standard way to turn “infinitely many” into “a definite point”.
The idea
Let be a set with infinitely many points, all inside an interval . Cut in half. The two halves together contain infinitely many points of , so at least one half does (two finite sets have a finite union). Keep such a half; if both qualify, keep the left one, so that the rule is definite. Now cut that half in two, and repeat for ever. Each interval is half the previous one and still contains infinitely many points of .
Try this. Press Step a few times and watch the kept interval. Then Play, and read the note under each step that says which half was kept and why.
- earlier intervals
- current interval
- points of the set
What to notice
The intervals are nested and their lengths halve every time, so they close in on a single point. That point is a point of accumulation: however small an interval around it you draw, one of the kept intervals fits inside, and that kept interval holds infinitely many points of the set.
What is new in §71 is how we know that the intervals close in on a point at all. Write the -th interval as . Because each new interval lies inside the old one, the left ends can only move right (or stay), and the right ends can only move left (or stay). So is an increasing sequence and a decreasing one, and both stay within . That is exactly the situation of Monotone sequences.
Try this. Increase the number of halvings from to and watch the two rows of dots. Try each of the four sets.
- Pₖ, left ends (never decrease)
- Qₖ, right ends (never increase)
- their common limit T
What to notice
The blue dots (left ends) never go down and the ochre dots (right ends) never go up; the gap between them halves at every step. Two monotone bounded sequences must converge, and since their difference tends to they converge to the same point .
Precise statements
If a set of real numbers is bounded and contains infinitely many points, then has at least one point of accumulation: a point such that every interval with contains infinitely many points of .
The proof rests on one lemma, which is worth stating separately because it is used again and again.
Let be closed intervals with . Then and tend to the same limit , and for every .
Proofs
The left ends form an increasing sequence bounded above, the right ends a decreasing sequence bounded below. Each converges by §69; the difference of the limits is the limit of the differences, which is .
The ends are monotone and bounded
means and . Also and for every .
Both converge
increases and is bounded above by , so for some (Cor. 1 of §69). Likewise decreases and is bounded below by , so .
The limits agree
by the rule for differences of limits (Limits of sums, products and quotients).
lies in every interval
By Cor. 3 of §69, an increasing sequence is at most its limit: . Similarly .
Halve an interval containing again and again, always keeping a half with infinitely many points of . The nested intervals shrink to a point by the lemma, and every neighbourhood of swallows one of them.
Start
is bounded, so it lies in some interval , which therefore contains infinitely many points of .
Halve and keep
Given containing infinitely many points of , split it at its midpoint. If both halves contained only finitely many points of , so would their union . So at least one half contains infinitely many; take the left one if it does, otherwise the right one, and call it . Its length is .
Shrink to a point
The lengths tend to (since , they are at most ). By the lemma, and , with .
is a point of accumulation
Let . Choose with . Since and the interval is shorter than , every point of is within less than of , so . The smaller interval contains infinitely many points of , so the larger one does too.
Compare the two proofs. The first (§19) builds a section of the reals and appeals to Dedekind’s theorem directly. The second appeals to it indirectly, through the monotone sequence theorem, which was itself proved with Dedekind’s theorem. Some form of completeness is unavoidable: in the rational numbers the theorem is false. The decimal approximations to form a bounded infinite set of rationals whose only point of accumulation among the reals is , so among the rationals it has none.
Worked examples and exercises
Let and start with . Carry out three halvings with Hardy’s rule (prefer the left half), and identify the point of accumulation found.
Solution
contains , infinitely many: keep it. contains : keep it. : keep it. In general and , so . Indeed is the only point of accumulation of (the points themselves are isolated).
Let , with points of accumulation and . Starting from , which point does Hardy’s rule find? Which would the rule “prefer the right half” find? Could a rule ever find a point that is not a point of accumulation?
Solution
The first left half contains the infinitely many points for odd , so it is kept, and from then on the intervals close in on . Preferring the right half gives first and leads to . Every rule finds a point of accumulation, because the proof never used which half was chosen, only that the chosen half contains infinitely many points. Different rules may find different points of accumulation.
Give an example of nested closed intervals whose ends converge to different limits, and say which hypothesis of the lemma fails. Then give nested open intervals with that have no point in common.
Solution
are nested, with and ; the lengths tend to , not . Every point of lies in all of them. For open intervals, take : they are nested and their lengths tend to , but no number lies in all of them, since fails to be below once , and is in none. The common limit of the ends, , is not in any of the open intervals. Closedness is what puts inside every interval (step 4 of the lemma).
Check yourself
In §71, why does the sequence of left ends converge?
An increasing sequence bounded above converges (§69). The lengths tending to is what makes the two limits agree, and that the point is a point of accumulation is the conclusion, not a reason.
If each half of an interval contains only finitely many points of , the whole interval contains only finitely many points of .
True: the union of two finite sets is finite. This is why at least one half of an interval containing infinitely many points must itself contain infinitely many.
Starting from , what is the length of the interval after halvings?
Each halving divides the length by , so the length is .
Hardy’s language
Summary
- Repeated bisection, always keeping a half with infinitely many points, gives nested intervals of length .
- The left ends increase and the right ends decrease; both are bounded, so both converge (§69), and the shrinking lengths force a common limit .
- Every neighbourhood of contains a whole kept interval, hence infinitely many points of : is a point of accumulation.
- The nested interval argument is a general tool; it will prove the intermediate value and Heine–Borel theorems in Chapter V.