16.2 Compact Sets
A set of real numbers is said to be covered by a collection of open sets, when every element of is contained in at least one member of . (The members of can contain numbers outside of as well as those in .)
is said to compact, if, for every covering of by open sets, is covered by some finite set of members of . A significant fact about a covering by open intervals is: if a point lies in an open set it lies in an open interval in and is a positive distance from the boundary points of that interval.
We will now prove, just for fun, that a bounded closed set of real numbers is compact. The argument does not depend on how distance is defined between real numbers as long as it makes sense as a distance.
Open sets of real numbers are each unions of disjoint open intervals on the real line. We can consider a covering of by open sets to be a covering by their open intervals. Each open set in the covering containing the number has an open interval in it containing . Thus a covering of by open sets is actually a covering by open intervals as well.
Any interval in the covering of by that is contained in the union of other intervals in , is redundant in and can be removed from it and the rest of will still be a cover.
Every closed set of real numbers is a collection of disjoint closed intervals. For example, the collection of intervals and for all positive and the number , is a closed set. The minimum number in is and the maximum is . Here the number must be in it because it is a limit point of sequences of other of its numbers.
We can provide an explicit cover for by the following infinite collection of open intervals:
To prove this claim we make use of several facts: first, if a sequence of numbers in is infinite, it must have at least one limit point in since is closed and bounded. Second, if a number is covered by an open set , then contains numbers both smaller and larger than . Finally, an open set containing a limit point of a sequence of distinct numbers must contain an infinite number of those numbers.
We can prove this result by actually constructing a finite set of open intervals that cover . To do so we set to be the smallest number in , and let be the smallest number in greater than that is in no member of that contains .
can be a lower boundary point of (as will happen for all but one encountered in the example above,) or it can be in the middle of or on the upper boundary of a closed interval of .
We will define an open interval containing inductively starting with the largest value of as follows:
If is the smallest number in its interval in then let be the largest number in smaller than , and let be any open interval in containing both and .
Otherwise, let be any number in that is smaller than (and not equal to) . By definition of there is an open interval in containing both and , and let any such open interval be .
By construction, contains only one of the 's, namely . Thus it can contain no limit point of 's by our third fact above. This means that the ’s, and 's are finite in number. Also the 's cover . Thus the 's are a finite sizes covering of by open intervals.
In the example above. the 's are numbers of the form from until a value for for which is approximately , with a similar number of positive 's, for a total of roughly 's all together.
Exercises:
1. Prove the claim above that the 's defined cover .
2. Show that the finite set of open intervals chosen from the members of by the construction above
contains the fewest open intervals possible in a cover of by open intervals.
We provide the example and construction above to give you intuition about what this result means. The usual simple proof involves breaking any closed set in half choosing a number in S, and repeating these actions on a half of which requires an infinite number of members of to be covered. At each stage the size of the new is half of that of the old , and at least one of the halves must need an infinite number of members of to be covered if does. The sequence of numbers chosen must, if infinite, have a limit point , and with any open interval covering , will contain all points in our sequence whose interval has length less than the smaller of and ; and that will be larger than the length of our interval at some stage, and all subsequent members of our sequence will be inside and covered by it. (This is exactly what happens at in the example.) This means that the later 's require only one member of to be covered. And one is very finite. An advantage of this proof is that it works as well for an dimensional space whose elements are -tuples of real numbers, exactly as it works for real numbers. (This argument is repeated in detail below.)
We have been discussing these various concepts in the context of real numbers, but they can also be defined in many other contexts. The definition of limit requires a definition of distance, but given such a definition, the concepts of closed, open, sequentially compact, complete and compact are also defined. Sets of points in which a distance between any pair of them is defined is said to be metric.
The concepts open closed and compact mentioned here can also be defined when there is no metric, by specification of which subsets of the whole set are open.
In a metric space for any distance d we define the d neighborhood of a point to consist of all elements of whose distance from is strictly less than . Any open set in is a union of neighborhoods of its elements each intersected with .
Suppose a closed bounded subset of a finite dimensional space S is covered by open sets. Then it is covered by neighborhoods contained in those sets as well. We will argue that it must be covered by a finite collection of those neighborhoods, hence by a finite number of those open sets.
If is dimensional , we can cut into a finite size grid of n-cubes (by which we mean sets of points whose length in any direction is at most some constant, and if is necessarily infinite the number of members of that are needed to cover least one of the -cubes must be infinite as well. We choose a point in any such -cube, reduce attention to that -cube and repeat these cut and choose steps. The resulting sequence of elements must converge to some point , whose cover must still require an infinite number of neighborhoods. But a single point can be covered by one neighborhood, which, by this argument tells us that an infinite number of neighborhoods never were required.
An argument like that proves that a closed and bounded set in is compact for any finite dimensional space defined over the real numbers.
When there is no metric strange things can happen. Suppose we have the integers, or rational numbers or real numbers, (with no definition of distance among them) and the closed sets consist of all finite sets. That means the open sets are all sets of elements that lack only a finite number of elements.
In any such space of points and definition of open sets, all sets are compact!
Given any set , and any cover of by open sets, and any open set in that cover, can miss only a closed set which means a finite set, say , of elements of . These can be covered by at most open sets in the cover of , which means that there is a cover of by at most open sets that are in the original cover.
Thus compact sets need not, in general, be closed or bounded with these definitions.
A definition of open sets in a set of points is called a topology.
The subject considered above, called point set topology, was studied extensively in the century in an effort to make calculus rigorous. It contains many interesting results of which what is above is a tiny and random sample.