- Heine–Borel theorem
In the
topology ofmetric space s the Heine–Borel theorem, named afterEduard Heine andÉmile Borel , states:For a
subset "S" ofEuclidean space R"n", the following two statements are equivalent:
*"S" is closed and bounded
*everyopen cover of "S" has a finite subcover, that is, "S" is compact.In the context of
real analysis , the former property is sometimes used as the defining property of compactness. However, the two definitions cease to be equivalent when we consider subsets of more generalmetric space s and in this generality only the latter property is used to define compactness. In fact, the Heine–Borel theorem for arbitrary metric spaces reads::A subset of a
metric space is compact if and only if it is complete andtotally bounded .History and motivation
The history of what today is called the Heine–Borel theorem starts in the 19th century, with the search for solid foundations of real analysis. Central to the theory was the concept of
uniform continuity and the theorem stating that everycontinuous function on a closed interval is uniformly continuous.Dirichlet was the first to prove this and implicitly he used the existence of a finite subcover of a given open cover of a closed interval in his proof. He used this proof in his 1862 lectures, which were published only in 1904. LaterEduard Heine ,Karl Weierstrass andSalvatore Pincherle used similar techniques.Émile Borel in 1895 was the first to state and prove a form of what is now called the Heine–Borel theorem. His formulation was restricted to countable covers.Lebesgue (1898) and Schoenflies (1900) generalized it to arbitrary covers.Proof
"If a set is compact, then it must be closed."
Let a set "S" be compact. A finite collection "C" of open sets which do not intersect at least one neighborhood of an accumulation point vec a cannot be an open cover of "S", because the intersection of those neighborhoods not met forms an open set, which contains a point in "S" not covered by "C".
Consider a collection "C’" consisting of a neighborhood N(vec x) for each vec x in S. If "S" is not closed then it has an accumulation point not in "S", call it vec a,'. Then choose (when constructing "C’"), for each vec x in S, an N(vec x) in C' which is small enough to not intersect some neighborhood of vec a,'. Then any subcover of "C"' has the form of "C" discussed previously, an thus cannot be an open subcover of "S". This contradicts the compactness of "S". Thus every accumulation point of "S" is in "S", so "S" is closed.
"If a set is compact, then it is bounded."
Why? Consider the open balls centered upon a common point, with any radius. This can cover any set, because all points in the set are some distance away from that point. Any finite subcover of this cover must be bounded, because it will bound it within the largest open ball within that subcover. Therefore, any set covered by this subcover must also be bounded.
"If a set is closed and bounded, then it is compact."
If a set "S" in mathbb{R}^n is bounded, then it can be enclosed within an "n"-box:a_1, b_1] imes [a_2, b_2] imes ... imes [a_n, b_n] where a_k < b_k ; a_k, b_k in mathbb{R} for k in 1, ..., n . Call this "n"-box "T"0.
Through bisection of each of the sides of "T"0, "T"0 can be broken up into 2^n sub "n"-boxes, each of which has 1/2^n the size of "T"0.
Assume, by way of contradiction, that "T"0 is not compact. Then, given an infinite open cover "C" of "T"0, at least one of the 2^n sections of "T"0 must require an infinite subcover of "C" (otherwise "C" itself would have a finite subcover, by uniting together the finite covers of the sections), call this section "T"1.
Likewise "T"1 's sides can be bisected, yielding 2^n sections of "T"1, at least one of which must require an infinite subcover of "C". Continuing in like manner yields a decreasing sequence of nested "n"-boxes::T_0 supset T_1 supset T_2 supset ... supset T_k supset ... whose length, when projected onto a given "xj"-axis is b_j - a_j)/2^k , which tends to 0 as k o infty .
Then:T_0 cap T_1 cap T_2 cap ... cap T_k cap ... e varnothing , (Cantor’s Intersection Theorem)but instead contains some point vec p in T_0 . Since "C" covers "T"0, then it has some member U in C such that vec p in U . Since "U" is open, there is an "n"-ball B(vec p) subseteq U . For large enough "n", T_n subseteq B(vec p) subseteq U , but then the infinite number of members of "C" needed to cover "Tn" can be replaced by just one: "U", a contradiction.
Thus, "T" is compact. Since "S" is closed and a subset of the compact set "T", then by the lemma (below) it is also compact.
"A closed subset of a compact set is compact."
Let "K" be a closed subset of a compact set "T" in mathbb{R}^n . Let C_K be an infinite open cover of "K". If C_K also covers "T", then since "T" is compact, then C_K has a finite subcover, and we are done.
Otherwise ar{K} = mathbb{R}^n setminus K is an open set containing points in "T" not covered by C_K . Let :C_T = C_K cup {ar{K}} be an open cover of "T". Since "T" is compact, then C_T has a finite subcover C_T'. Since ar{K} covers points in "T" not covered by C_K , then ar{K} in C_T' . Thus C_T' = C_K' cup {ar{K}} where C_K' must be a finite subcover of C_K . Since ar{K} does not cover K subset T , then C_K' e varnothing , so C_K has a finite subcover.
Generalizations
The theorem does not hold as stated for general metric spaces. A metric space (or
topological vector space ) is said to have the Heine-Borel property if every closed and bounded subset is compact. Many metric spaces fail to have the Heine-Borel property. For instance, the metric space ofrational number s (or indeed any incomplete metric space) fails to have the Heine-Borel property. Complete metric spaces may also fail to have the property. For instance, no infinite-dimensionalBanach space has the Heine-Borel property.The theorem can be generalized to arbitrary metric spaces by strengthening the conditions required for compactness::A subset of a metric space is compact if and only if it is complete and
totally bounded .This generalisation also applies totopological vector space s and, more generally, touniform space s.Here is a sketch of the "⇒"-part of the proof, in the context of a general metric space, according to
Jean Dieudonné :
# It is obvious that any compact set "E" is totally bounded.
# Let ("x""n") be an arbitraryCauchy sequence in "E"; let "F""n" be the closure of the set { "x""k" : "k" ≥ "n" } in "E" and "U""n" := "E" − "F""n". If the intersection of all "F""n" were empty, ("U""n") would be an open cover of "E", hence there would be a finite subcover ("U""n""k") of "E", hence the intersection of the "F""n""k" would be empty; this implies that "F""n" is empty for all "n" larger than any of the "n""k", which is a contradiction. Hence, the intersection of all "F""n" is not empty, and any point in this intersection is an accumulation point of the sequence ("x""n").
# Any accumulation point of a Cauchy sequence is a limit point ("x""n"); hence any Cauchy sequence in "E" converges in "E", in other words: "E" is complete.A proof of the "<="-part can be sketched as follows:
# If "E" were not compact, there would exist a cover ("U"l)l of "E" having no finite subcover of "E". Use the total boundedness of "E" to define inductively a sequence of balls ("B""n") in "E" with
#* the radius of "B""n" is 2−"n";
#* there is no finite subcover ("U"l∩"B""n")l of "B""n";
#* "B""n"+1 ∩ "B""n" is not empty.
# Let "x""n" be the center point of "B""n" and let "y""n" be any point in "B""n"+1 ∩ "B""n"; hence we have "d"("x""n"+1, "x""n") ≤ "d"("x""n"+1, "y""n") + "d"("y""n", "x""n") ≤ 2−"n"−1 + 2−"n" ≤ 2−"n"+1. It follows for "n" ≤ "p" < "q": "d"("x""p", "x""q") ≤ "d"("x""p", "x""p"+1) + ... + "d"("x""q"−1, "x""q") ≤ 2−"p"+1 + ... + 2−"q"+2 ≤ 2−"n"+2. Therefore, ("x""n") is a Cauchy sequence in "E", converging to some limit point a in "E", because "E" is complete.
# Let I_0 be an index such that mbox{ }_{U_{I_0 contains "a"; since ("x""n") converges to "a" and mbox{ }_{U_{I_0 is open, there is a large "n" such that the ball "B""n" is a subset of mbox{ }_{U_{I_0 - in contradiction to the construction of "B""n".The proof of the "=>" part easily generalises to arbitrary uniform spaces, but the proof of the "<=" part is more complicated and is equivalent to the ultrafilter principle [ [http://www.math.vanderbilt.edu/~schectex/ccc/excerpts/equivuf2.gifUF24] , p. 506. ] , a strong form of the
axiom of choice . (Already, in general metric spaces, the "<=" direction requires theAxiom of dependent choice .)See also
*
Bolzano-Weierstrass theorem Notes
References
*
*External links
*
Wikimedia Foundation. 2010.