## Cute Proofs: The Bolzano-Weierstrauss Property.

### March 11, 2011

## Small Anecdote.

When I was going through my first proofs class it was my first year in college — needless to say, my mind wasn’t completely in the game. Because it was a Moore method class (the students would do the proofs on the board, and the students would critique it. the professors were there to help us stay on task and to provide additional criticism.) a number of students would simply copy proofs from Spivak and present them as their own — and this caused a large number of students (including myself, I’ll shamefully admit) to be in possession of a large number of proofs that they have "written" but did not understand.

For me, a notable exception was the proof of the Bolzano-Weierstrauss property. This was not only my favorite theorem at the time (and still is one of my favorites!) but it was one where I did the proof entirely by myself (on a bus, an hour before class).

Now-a-days when I am lying in bed and I’m too sleepy or too cold to move from under my covers, I like to reach around my bed and pick up a math book and read one of the sections. Recently, after cleaning my room, I had moved my Hatcher which usually sits faithfully at my bedside to the other side of the room; getting up was unthinkable, so, instead, I picked up Armstrong’s Basic Undergraduate Topology. In it, I found a slick proof of the Bolzano-Weierstrauss property that I haven’t seen before. So, I thought I’d write it up.

## The Meat and Potatoes: The Theorem.

I’ll first state the Bolzano-Weierstrauss property, and then I’ll post a few proofs for it.

**Theorem **(Bolzano-Weierstrauss Property): An infinite subset of a compact space must have a limit point.

## Proof of the Baby Version.

The first proof is a baby version: **if we instead assume that our compact set is the interval [0,1] and our total space is the reals, then we can construct an intuitive and elementary version of this proof which tests a number of good concepts in introductory analysis. **So let’s do this thang.

*Proof (assuming our space is the reals and our compact set is [0,1]). *First, I will leave it to the reader to prove that for any sequence in the reals, there is either a monotonically increasing or a monotonically decreasing subsequence. Without loss of generality, let’s assume there is a monotonically increasing subsequence. Because this sequence is monotonic, if it converges then it converges to its supremum. Because a set in the reals is compact if and only if it is closed and bounded (*this is an equivalent statement of the famed Heine-Borel theorem*) we have that the supremum is less than or equal to the upper bound, and since the set is closed it must also be in the set. Hence we have a limit point.

This set is nice and intuitive since if a student looks at a line with the points of the sequence drawn, they will be able to point out the limit point by simply noting, "these points get really close to this." The monotonic increasing part simply allows us to state this formally.

## Another Proof of the Baby Version.

**This proof will also assume that we’re working in the reals, though we can easily extend it to for any . We will assume our compact subset is the unit cube. **So in this is just ; in this is the square ; and so on.

This is actually one of my favorite proofs, and it’s called, "how to catch a lion in the desert." I outline the proof below, leaving out a few details the reader can fill in.

*Proof (again, of the baby version).* Let’s say we’re given an infinite subset of our unit cube; let’s assume without loss of generality that we are working in and our unit cube is just . First, cut our interval in half: so we now have two intervals and . If both of them had only finitely many elements of our infinite subset, then the union would as well; thus, one of these intervals has an infinite number of elements of our infinite subset. Let’s suppose it’s . Pick one element that’s in which is also in our infinite subset and call it . Again, cut in half to get and . Again, we must have an infinite number of elements in one of these halves, so pick that half and choose some random element from our infinite subset which is in that half and call this element .

Continue this process. For every -th iteration will have intervals of size and we’ll have elements where these elements are getting closer and closer to each other. In fact, the reader can prove these elements are Cauchy. Since is complete, this converges. Since our compact set is closed, it must converge to an element which is in our compact set. Thus, is a limit point of this infinite subset.

The reason this is called, "how to catch a lion in the desert," is the following game: player 1 draws a square and secretly puts a "lion" at some point in the square but does not show player 2 where the lion is. Now, player two can cut the square into any two pieces he wants and player 1 must tell him which piece the lion is on. The picture looks kind of like this:

As you can see, player 2 cut the square in half at first and player 1 crossed off the left half. Then player 2 cut the right half in two again and player 1 crossed off the bottom. Notice that this continues until player 2 has a very small space to work with (in the picture, all that remains is that little spot by the upper right corner). And, in fact, this is the exact same process we have used in the proof above. We have simply taken a single point from our subset that is in the "winning side" every time player 1 crosses off the "losing side"; this allows us to construct a sequence which quickly becomes trapped in a tight space — or, in more mathy words, the sequence is almost forced into being Cauchy. Sad.

## Armstrong’s Proof of the General Theorem.

This proof requires us only to be in a compact space — ANY compact space! This is significantly stronger than the previous two cases, but the proof is actually significantly less involved than the previous two. It really only uses the definition of a limit point which we restate here for reference:

**Definition:** For some topological space and a subset , a point is a *limit point for *if for every open set which contains the following is true: .

In other words, if we intersect an open set containing with our set , then the intersection is *not just the point *. Note further that **a limit point of a set need not be in that set.**

*Proof.* Let be a compact space and be a subset of which has no limit point. We will show that cannot possibly be infinite; in other words, we will show that if has no limit point, it must be finite. (This statement is called the *contrapositive* and it is equivalent to proving that if is infinite, then it must have a limit point. Think about this for a second.) Given a point we can find some open set which contains such that

or else we would have be a limit point of . But then consider , the union of all such sets for every . Since is compact, there exists a finite subcover; let’s call this . But each of these balls contains at most one point of (specifically, they’ll contain if or they’ll contain no points if ) and so since this set is a cover of it is also a cover of , which implies that can have no more than finitely many points. .

This proof is neat because it’s full of these nice "more advanced" techniques like using the contrapositive and the negation of the definition of limit points. At the very least, I thought it was pretty cool.

very clever. i never have seen that either.

The truth comes out!

I refused to read Spivak because I signed up for the class thinking it would be really cool, instead of everyone pretending they had came up with brilliant time honored proofs in the span of a weekend. I remember hating that class for the second two semesters but refusing to switch out on principle.

Fucking Moore’s method. Cannot be taught with grades.

We were really good the first two semesters with Luke, but then the proofs got way too hard way too fast. Sad but true. If that class didn’t have grades, I think I would’a cared less about who else had the right proofs and more about myself getting the right proofs. Damn GPA, yo.