Heine–Borel theorem

From testwiki
Jump to navigation Jump to search

Template:Short description

Template:Distinguish

In real analysis in mathematics, the Heine–Borel theorem, named after Eduard Heine and Émile Borel, states:

For a subset S of Euclidean space ℝn, the following two statements are equivalent:

The theorem is sometimes also called the Borel–Lebesgue lemma.

History

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 every continuous function on a closed and bounded interval is uniformly continuous. Peter Gustav Lejeune 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.[1] He used this proof in his 1852 lectures, which were published only in 1904.[1] Later Eduard Heine, Karl Weierstrass and Salvatore 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. Pierre Cousin (1895), Lebesgue (1898) and Schoenflies (1900) generalized it to arbitrary covers.[2]

Proofs

Proof 1

If a set is compact, then it must be closed.

Let S be a subset of ℝn. Observe first the following: if a is a limit point of S, then any finite collection C of open sets, such that each open set U∈C is disjoint from some neighborhood VU of a, fails to be a cover of S. Indeed, the intersection of the finite family of sets VU is a neighborhood W of a in ℝn. Since a is a limit point of S, W must contain a point x in S. This x∈S is not covered by the family C, because every U in C is disjoint from VU and hence disjoint from W, which contains x.

If S is compact but not closed, then it has a limit point a∉S. Consider a collection C′ consisting of an open neighborhood N(x) for each x∈S, chosen small enough to not intersect some neighborhood Vx of a. Then C′ is an open cover of S, but any finite subcollection of C′ has the form of C discussed previously, and thus cannot be an open subcover of S. This contradicts the compactness of S. Hence, every limit point of S is in S, so S is closed.

The proof above applies with almost no change to showing that any compact subset S of a Hausdorff topological space X is closed in X.

If a set is compact, then it is bounded.

Let S be a compact set in ℝn, and Ux a ball of radius 1 centered at x∈ℝn. Then the set of all such balls centered at x∈S is clearly an open cover of S, since ∪x∈SUx contains all of S. Since S is compact, take a finite subcover of this cover. This subcover is the finite union of balls of radius 1. Consider all pairs of centers of these (finitely many) balls (of radius 1) and let M be the maximum of the distances between them. Then if Cp and Cq are the centers (respectively) of unit balls containing arbitrary p,q∈S, the triangle inequality says:

d(p,q)≤d(p,Cp)+d(Cp,Cq)+d(Cq,q)≤1+M+1=M+2.

So the diameter of S is bounded by M+2.

Lemma: A closed subset of a compact set is compact.

Let K be a closed subset of a compact set T in ℝn and let CK be an open cover of K. Then U=ℝn∖K is an open set and

CT=CK∪{U}

is an open cover of T. Since T is compact, then CT has a finite subcover CT′, that also covers the smaller set K. Since U does not contain any point of K, the set K is already covered by CK′=CT′∖{U}, that is a finite subcollection of the original collection CK. It is thus possible to extract from any open cover CK of K a finite subcover.

If a set is closed and bounded, then it is compact.

If a set S in ℝn is bounded, then it can be enclosed within an n-box

T0=[−a,a]n

where a>0. By the lemma above, it is enough to show that T0 is compact.

Assume, by way of contradiction, that T0 is not compact. Then there exists an infinite open cover C of T0 that does not admit any finite subcover. Through bisection of each of the sides of T0, the box T0 can be broken up into 2n sub n-boxes, each of which has diameter equal to half the diameter of T0. Then at least one of the 2n sections of T0 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 T1.

Likewise, the sides of T1 can be bisected, yielding 2n sections of T1, at least one of which must require an infinite subcover of C. Continuing in like manner yields a decreasing sequence of nested n-boxes:

T0⊃T1⊃T2⊃…⊃Tk⊃…

where the side length of Tk is (2a)/2k, which tends to 0 as k tends to infinity. Let us define a sequence (xk) such that each xk is in Tk. This sequence is Cauchy, so it must converge to some limit L. Since each Tk is closed, and for each k the sequence (xk) is eventually always inside Tk, we see that L∈Tk for each k.

Since C covers T0, then it has some member U∈C such that L∈U. Since U is open, there is an n-ball B(L)⊆U. For large enough k, one has Tk⊆B(L)⊆U, but then the infinite number of members of C needed to cover Tk can be replaced by just one: U, a contradiction.

Thus, T0 is compact. Since S is closed and a subset of the compact set T0, then S is also compact (see the lemma above).

Proof without Choice

The theorem can be proved without the use of the axiom of choice. First we prove

Template:Math theorem

Proof: Let 𝒰 be an open cover of I. Consider the set

E={x∈[0,1]∣[0,x] is covered by a finite subcover of 𝒰}.

It is nonempty and bounded. Thus, b:=sup⁡(E) exists as a finite number. We claim b=1. Suppose otherwise; then b<1. Since 𝒰 is a cover, b is in some U∈𝒰. By the definition of sup, there is some x in E with [x,b]⊂U. Then for b′>b close to b,

[0,b′]=[0,x]∪[x,b′]

is covered by a finite subcover of 𝒰; i.e., b′∈E, contradicting that b is an upper bound of E. Hence, b=1. Then, by a similar argument, b=1 is in E. ◻

The theorem now follows easily. Indeed, by Tychonoff's theorem for finite products, the standard cube In is compact (the full version of the theorem is equivalent to the axiom of choice, but the theorem for finite products is much easier and does not use Choice.[3]) Since cubes are homeomorphic to each other, arbitrary cubes are compact and each closed bounded set is contained in some cube; thus, compact. Finally, it is not hard to see the converse (a compact set in ℝn is closed and bounded) without the axiom of choice.[4] ◻

We also have, still not assuming the axiom choice:[5] Template:Math theorem

Indeed, "compact" implies "sequentially compact", without Choice, as follows. Given a sequence xi in a compact set in ℝn, take Ei={xj∣j≥i}‾. The family Ei,i≥1 has the finite intersection property and so has nonempty intersection by compactness. Let x∈∩iEi. Then let Um be the open ball with center at x and of radius 1/m. Since U1 intersects {xj∣j≥1}, let i1 be the least integer such that xi1 is in U1, possible since ℕ is well-ordered. Then let i2 be the least integer such that i2>i1 and xi2 is in U2, and so on. The sequence xik is a convergent subsequence then. ◻

Note the above version implies the Bolzano–Weierstrass theorem, that a bounded sequence in ℝn has a convergent sequence.

With the axiom of choice, the converse of the above theorem holds. Indeed, clearly, "sequentially compact" implies "closed". Also, if the set is unbounded, then clearly we can construct a sequence xi in the set such that |xi−xj|≥1 for j<i; in particular, the sequence has no convergent sequence. This step uses the axiom of choice (or more precisely countable choice).

Without the axiom of choice, the converse of the above theorem can fail; in fact, there is a model of ZF in which ℝ has a sequentially compact subset that is neither closed nor bounded.[6]

Generalization

The Heine–Borel theorem is somewhat subsumed in the following more general result.

Template:Math theorem

The usual Heine–Borel theorem follows from the above since a set in ℝn is bounded if and only if it is totally bounded.[7]

In general, given a sequence xn, each point in the intersection

∩n{xm∣m≥n}‾

is called a cluster point.[8] In other words, a point is a cluster point of xn if each neighborhood of that point contains infinitely many (possibly repeated) terms in the sequence. For a metric space, a sequence has a convergent subsequence if and only if it has a cluster point.[9] Thus, the statement (2) above is equivalent to saying each sequence has a cluster point.

Proof: (1) ⇒ (2) clear (cf. Template:Section link). (2) ⇒ (3): if S⊂X is an infinite subset, by the axiom of choice, it contains a countable subset whose limit points are among the limit points of S. Thus, we can assume S={xn∣n∈ℕ} is countable. Then, by (2), xn has a cluster point, which is a limit point of S.

(3) ⇒ (4): First, X is complete since a Cauchy sequence has a limit by (3). Next, assume X is not totally bounded; i.e., there is some ϵ>0 with the property that no finite number of open balls of radius ϵ covers X. Then, recursively, choose a sequence xn such that

xn∉B(x1,ϵ)∪⋯∪B(xn−1,ϵ).

Then the set S={xn∣n} is infinite and has no limit point.

(4) ⇒ (1) is by adapting an argument of Bourbaki.[10] We shall show a family F of closed subsets of X with the finite intersection property (i.e., each finite subset of F has nonempty intersection) has nonempty intersection. Consider the set of all families of subsets of X with the finite intersection property, ordered by set inclusion. Clearly, the hypothesis of Zorn's lemma is satisfied and so it has a maximal element M that contains F. We note M has the property

  • If X=S1∪⋯∪Sn for some sets Sj's, then Sj∈M for some j.

Indeed, suppose no Sj is in M. Since each M∪{Sj} does not have the finite intersection property, we have Tj∩Sj=∅ for some intersections Tj of finite subsets of M. Then

∅≠∩jTj⊂∩j(X−Sj),

meaning Sj's do not cover X.

Now, since X is totally bounded, for each integer n>0, M contains an open ball Bn of radius 1/n by the above property. For each n, let xn be in B1∩⋯∩Bn, which is possible by the finite intersection property. For m≥n, xm,xn are both in Bn. Hence, the sequence xn is Cauchy and, by completeness, it converges to a limit x. For each ϵ>0, we have:

Bn⊂B(x,ϵ)

if n is large enough. Indeed, for y in Bn,

d(y,x)≤d(y,xn)+d(xn,x)<2/n+d(xn,x)<ϵ

if n is large. Hence, for such n, ∅≠Bn∩S⊂B(x,ϵ)∩S for S in M. That is, x is in S‾ for each S in M. A fortiori, x∈∩F then. ◻

The proof of (4) ⇒ (1) above in fact shows the following more general result for uniform spaces; indeed, Bourbaki's original argument was for uniform spaces.

Template:Math theorem

Heine–Borel property

The Heine–Borel theorem does not hold as stated for general metric and topological vector spaces, and this gives rise to the necessity to consider special classes of spaces where this proposition is true. These spaces are said to have the Heine–Borel property.

In the theory of metric spaces

A metric space (X,d) is said to have the Heine–Borel property if each closed, bounded[11] set in X is compact.

Many metric spaces fail to have the Heine–Borel property, such as the metric space of rational numbers (or indeed any incomplete metric space). Complete metric spaces may also fail to have the property; for instance, no infinite-dimensional Banach spaces have the Heine–Borel property (as metric spaces). Even more trivially, if the real line is not endowed with the usual metric, it may fail to have the Heine–Borel property.

A metric space (X,d) has a Heine–Borel metric which is Cauchy locally identical to d if and only if it is complete, σ-compact, and locally compact.Template:Sfn

In the theory of topological vector spaces

A topological vector space X is said to have the Heine–Borel propertyTemplate:Sfn (R.E. Edwards uses the term boundedly compact spaceTemplate:Sfn) if each closed bounded[12] set in X is compact.[13] No infinite-dimensional Banach spaces have the Heine–Borel property (as topological vector spaces). But some infinite-dimensional Fréchet spaces do have, for instance, the space C∞(Ω) of smooth functions on an open set Ω⊂ℝnTemplate:Sfn and the space H(Ω) of holomorphic functions on an open set Ω⊂ℂn.Template:Sfn More generally, any quasi-complete nuclear space has the Heine–Borel property. All Montel spaces have the Heine–Borel property as well.

See also

Notes

Template:Reflist

References

  1. ↑ 1.0 1.1 Template:Cite journal
  2. ↑ Template:Cite arXiv
  3. ↑ Template:Harvnb: "That is why we gave a separate treatment of the finite case, which does not depend on the axiom of choice."
  4. ↑ Note: the standard proof that a compact set in a Hausdorff space is closed uses the axiom of choice implicitly but that proof can be modified to avoid Choice.
  5. ↑ Template:Harvnb
  6. ↑ Template:Harvnb
  7. ↑ Template:Harvnb
  8. ↑ Template:Harvnb
  9. ↑ Template:Harvnb; the reference is for a first countable space but a metric space is first countable.
  10. ↑ Template:Harvnb
  11. ↑ A set B in a metric space (X,d) is said to be bounded if it is contained in a ball of a finite radius, i.e. there exists a∈X and r>0 such that B⊆{x∈X∣d(x,a)≤r}.
  12. ↑ A set B in a topological vector space X is said to be bounded if for each neighborhood of zero U in X there exists a scalar λ such that B⊆λ⋅U.
  13. ↑ In the case when the topology of a topological vector space X is generated by some metric d this definition is not equivalent to the definition of the Heine–Borel property of X as a metric space, since the notion of bounded set in X as a metric space is different from the notion of bounded set in X as a topological vector space. For instance, the space 𝒞∞[0,1] of smooth functions on the interval [0,1] with the metric d(x,y)=∑k=0∞12k⋅maxt∈[0,1]|x(k)(t)−y(k)(t)|1+maxt∈[0,1]|x(k)(t)−y(k)(t)| (here x(k) is the k-th derivative of the function x∈𝒞∞[0,1]) has the Heine–Borel property as a topological vector space but not as a metric space.