Compact space

From testwiki
Jump to navigation Jump to search

Template:Redirect Template:Short description

Per the compactness criteria for Euclidean space as stated in the Heine–Borel theorem, the interval Template:Math is not compact because it is not bounded. The interval Template:Math is not compact because it is not closed (but bounded). The interval Template:Math is compact because it is both closed and bounded.

In mathematics, especially general topology and mathematical analysis, compactness is a property of a space that makes it behave in many ways like a finite set.[1] For instance, on a finite set every infinite sequence must take some value infinitely often, by the pigeonhole principle. For subsets of Euclidean space, the analogous statement is sequential compactness: a set is compact if and only if every infinite sequence in the set has a subsequence that converges to a point of the set. Likewise, whereas every real-valued function on a finite set is bounded and attains its maximum and minimum, every continuous real-valued function on a compact space has these properties. For compact subsets of Euclidean space, this is the extreme value theorem.

Another basic property of finite sets is that every cover of a finite set by subsets has a finite subcover: one may choose, for each point of the finite set, a member of the cover containing it. The corresponding topological property is used to define compactness: a topological space is compact if every open cover has a finite subcover. In metric spaces this is equivalent to several other formulations, including sequential compactness, though these equivalences can fail in more general topological spaces. Thus every sequence in the closed unit interval Template:Math has a convergent subsequence with limit in Template:Math, whereas this fails for spaces such as the open interval Template:Math and the real line. For subsets of Euclidean space, compactness is equivalent to being closed and bounded, by the Heine–Borel theorem. The property of compactness often allows local information to be combined into global conclusions. The term compact set may refer either to a compact topological space or, more commonly, to a subset of a topological space that is compact in the subspace topology.

Compactness was formally introduced by Maurice Fréchet in 1906 in work generalizing the Bolzano–Weierstrass theorem from sets of points to spaces of functions. Later, Pavel Alexandrov and Pavel Urysohn developed the open-cover formulation that is now standard in topology. Compactness plays a central role throughout mathematics; for example, continuous real-valued functions on compact spaces attain maxima and minima, and major results such as the Arzelà–Ascoli theorem and the Peano existence theorem depend on compactness.

Historical development

In the 19th century, several disparate mathematical properties were understood that would later be seen as consequences of compactness. On the one hand, Bernard Bolzano (1817) had been aware that any bounded sequence of points (in the line or plane, for instance) has a subsequence that must eventually get arbitrarily close to some other point, called a limit point. Bolzano's proof relied on the method of bisection: the sequence was placed into an interval that was then divided into two equal parts, and a part containing infinitely many terms of the sequence was selected. The process could then be repeated by dividing the resulting smaller interval into smaller and smaller parts—until it closes down on the desired limit point. The full significance of Bolzano's theorem, and its method of proof, would not emerge until almost 50 years later when it was rediscovered by Karl Weierstrass.[2]

In the 1880s, it became clear that results similar to the Bolzano–Weierstrass theorem could be formulated for spaces of functions rather than just numbers or geometrical points. The idea of regarding functions as themselves points of a generalized space dates back to the investigations of Giulio Ascoli and Cesare Arzelà.[3] The culmination of their investigations, the Arzelà–Ascoli theorem, was a generalization of the Bolzano–Weierstrass theorem to families of continuous functions, the precise conclusion of which was that it was possible to extract a uniformly convergent sequence of functions from a suitable family of functions. The uniform limit of this sequence then played precisely the same role as Bolzano's "limit point". Towards the beginning of the twentieth century, results similar to that of Arzelà and Ascoli began to accumulate in the area of integral equations, as investigated by David Hilbert and Erhard Schmidt. For a certain class of Green's functions coming from solutions of integral equations, Schmidt had shown that a property analogous to the Arzelà–Ascoli theorem held in the sense of mean convergence – or convergence in what would later be dubbed a Hilbert space. This ultimately led to the notion of a compact operator as an offshoot of the general notion of a compact space. It was Maurice Fréchet who, in 1906, had distilled the essence of the Bolzano–Weierstrass property and coined the term compactness to refer to this general phenomenon (he used the term already in his 1904 paper[4] which led to the famous 1906 thesis).

However, a different notion of compactness altogether had also slowly emerged at the end of the 19th century from the study of the continuum, which was seen as fundamental for the rigorous formulation of analysis. In 1870, Eduard Heine showed that a continuous function defined on a closed and bounded interval was in fact uniformly continuous. In the course of the proof, he made use of a lemma that from any countable cover of the interval by smaller open intervals, it was possible to select a finite number of these that also covered it. The significance of this lemma was recognized by Émile Borel (1895), and it was generalized to arbitrary collections of intervals by Pierre Cousin (1895) and Henri Lebesgue (1904). The Heine–Borel theorem, as the result is now known, is another special property possessed by closed and bounded sets of real numbers.

This property was significant because it allowed for the passage from local information about a set (such as the continuity of a function) to global information about the set (such as the uniform continuity of a function). This sentiment was expressed by Template:Harvtxt, who also exploited it in the development of the integral now bearing his name. Ultimately, the Russian school of point-set topology, under the direction of Pavel Alexandrov and Pavel Urysohn, formulated Heine–Borel compactness in a way that could be applied to the modern notion of a topological space. Template:Harvtxt showed that the earlier version of compactness due to Fréchet, now called (relative) sequential compactness, under appropriate conditions followed from the version of compactness that was formulated in terms of the existence of finite subcovers. It was this notion of compactness that became the dominant one, because it was not only a stronger property, but it could be formulated in a more general setting with a minimum of additional technical machinery, as it relied only on the structure of the open sets in a space.

Basic examples

Any finite space is compact; a finite subcover can be obtained by selecting, for each point, an open set containing it. A nontrivial example of a compact space is the (closed) unit interval Template:Closed-closed of real numbers. If one chooses an infinite number of distinct points in the unit interval, then there must be some accumulation point among these points in that interval. For instance, the odd-numbered terms of the sequence Template:Nowrap get arbitrarily close to 0, while the even-numbered ones get arbitrarily close to 1. The given example sequence shows the importance of including the boundary points of the interval, since the limit points must be in the space itself—an open (or half-open) interval of the real numbers is not compact. It is also crucial that the interval be bounded, since in the interval Template:Closed-open, one could choose the sequence of points Template:Nowrap, of which no sub-sequence ultimately gets arbitrarily close to any given real number.

In two dimensions, closed disks are compact since for any infinite number of points sampled from a disk, some subset of those points must get arbitrarily close either to a point within the disc, or to a point on the boundary. Likewise, a circle in the plane is compact (easily seen by its being closed and bounded). However, an open disk is not compact, because a sequence of points can tend to the boundary—without getting arbitrarily close to any point in the interior. Likewise, spheres are compact, but a sphere missing a point is not since a sequence of points can still tend to the missing point, thereby not getting arbitrarily close to any point within the space. Lines and planes are not compact, since one can take a set of equally-spaced points in any given direction without approaching any point.

Definitions

Various definitions of compactness may apply, depending on the level of generality. A subset of Euclidean space in particular is compact if and only if it is closed and bounded. This implies, by the Bolzano–Weierstrass theorem, that any infinite sequence from the set has a subsequence that converges to a point in the set. Various equivalent notions of compactness, such as sequential compactness and limit point compactness, can be developed in general metric spaces.[5]

In contrast, the different notions of compactness are not equivalent in general topological spaces, and the most useful notion of compactness—originally called bicompactness—is defined using covers consisting of open sets (see Open cover definition below). That this form of compactness holds for closed and bounded subsets of Euclidean space is known as the Heine–Borel theorem. Compactness, when defined in this manner, often allows one to take information that is known locally—in a neighbourhood of each point of the space—and to extend it to information that holds globally throughout the space. An example of this phenomenon is Dirichlet's theorem, to which it was originally applied by Heine, that a continuous function on a compact interval is uniformly continuous; here, continuity is a local property of the function, and uniform continuity the corresponding global property.

Open cover definition

Formally, a topological space Template:Mvar is called compact if every open cover of Template:Mvar has a finite subcover.[6] That is, Template:Mvar is compact if for every collection Template:Mvar of open subsets[7] of Template:Mvar such that

X=⋃S∈CS ,

there is a finite subcollection Template:Mvar ⊆ Template:Mvar such that

X=⋃S∈FS .

Some branches of mathematics such as algebraic geometry, typically influenced by the French school of Bourbaki, use the term quasi-compact for the general notion, and reserve the term compact for topological spaces that are both Hausdorff and quasi-compact. A compact set is sometimes referred to as a compactum, plural compacta.

Compactness of subsets

A subset Template:Mvar of a topological space Template:Mvar is compact if for every arbitrary collection Template:Mvar of open subsets of Template:Mvar such that

K⊆⋃S∈CS ,

there is a finite subcollection Template:Mvar ⊆ Template:Mvar such that

K⊆⋃S∈FS .

Equivalently, Template:Mvar is compact as a subset of Template:Mvar if and only if the topological space Template:Mvar is compact in the subspace topology. In particular, if K⊂Y⊂X, with subset Template:Mvar equipped with the subspace topology, then Template:Mvar is compact in Template:Mvar if and only if Template:Mvar is compact in Template:Mvar. Furthermore, the compactness of Template:Mvar as a subset of a topological space Template:Mvar is independent of the embedding, provided that the subspace topology on Template:Mvar is the same.

Characterization

If Template:Mvar is a topological space then the following are equivalent:

  1. Template:Mvar is compact; i.e., every open cover of Template:Mvar has a finite subcover.
  2. Template:Mvar has a sub-base such that every cover of the space, by members of the sub-base, has a finite subcover (Alexander's sub-base theorem).
  3. Template:Mvar is Lindelöf and countably compact.Template:Sfn
  4. Any collection of closed subsets of Template:Mvar with the finite intersection property has nonempty intersection.
  5. Every net on Template:Mvar has a convergent subnet (see the article on nets for a proof).
  6. Every filter on Template:Mvar has a convergent refinement.
  7. Every net on Template:Mvar has a cluster point.
  8. Every filter on Template:Mvar has a cluster point.
  9. Every ultrafilter on Template:Mvar converges to at least one point.
  10. Every infinite subset of Template:Mvar has a complete accumulation point.[8]
  11. For every topological space Template:Mvar, the projection X×Y→Y is a closed mapping[9] (see proper map).
  12. Every open cover linearly ordered by subset inclusion contains Template:Mvar.Template:Sfn

Bourbaki defines a compact space (quasi-compact space) as a topological space where each filter has a cluster point (i.e., 8. in the above).[10]

Euclidean space

For any subset Template:Mvar of Euclidean space, Template:Mvar is compact if and only if it is closed and bounded; this is the Heine–Borel theorem.

As a Euclidean space is a metric space, the conditions in the next subsection also apply to all of its subsets. Of all of the equivalent conditions, it is in practice easiest to verify that a subset is closed and bounded, for example, for a closed interval or closed Template:Mvar-ball.

Metric spaces

For any metric space Template:Math, the following are equivalent (assuming countable choice):

  1. Template:Math is compact.
  2. Template:Math is complete and totally bounded (this is also equivalent to compactness for uniform spaces).[11]
  3. Template:Math is sequentially compact; that is, every sequence in Template:Mvar has a convergent subsequence whose limit is in Template:Mvar (this is also equivalent to compactness for first-countable uniform spaces).
  4. Template:Math is limit point compact (also called weakly countably compact); that is, every infinite subset of Template:Mvar has at least one limit point in Template:Mvar.
  5. Template:Math is countably compact; that is, every countable open cover of Template:Mvar has a finite subcover.
  6. Template:Mvar is empty or Template:Math is the image of a continuous function from the Cantor set.[12]
  7. Every decreasing nested sequence of nonempty closed subsets Template:Math in Template:Math has a nonempty intersection.
  8. Every increasing nested sequence of proper open subsets Template:Math in Template:Math fails to cover Template:Mvar.

A compact metric space Template:Math also satisfies the following properties:

  1. Lebesgue's number lemma: For every open cover of Template:Mvar, there exists a number Template:Nowrap such that every subset of Template:Mvar of diameter < Template:Mvar is contained in some member of the cover.
  2. Template:Math is second-countable, separable and LindelöfTemplate:Sndthese three conditions are equivalent for metric spaces. The converse is not true; e.g., a countable discrete space satisfies these three conditions, but is not compact.
  3. Template:Mvar is closed and bounded (as a subset of any metric space whose restricted metric is Template:Mvar). The converse may fail for a non-Euclidean space; e.g. the real line equipped with the discrete metric is closed and bounded but not compact, as the collection of all singletons of the space is an open cover which admits no finite subcover. It is complete but not totally bounded.

Ordered spaces

For an ordered space Template:Math (i.e. a totally ordered set equipped with the order topology), the following are equivalent:

  1. Template:Math is compact.
  2. Every subset of Template:Mvar has a supremum (i.e. a least upper bound) in Template:Mvar.
  3. Every subset of Template:Mvar has an infimum (i.e. a greatest lower bound) in Template:Mvar.
  4. Every nonempty closed subset of Template:Mvar has a maximum and a minimum element.

An ordered space satisfying (any one of) these conditions is called a complete lattice.

In addition, the following are equivalent for all ordered spaces Template:Math, and (assuming countable choice) are true whenever Template:Math is compact (the converse in general fails if Template:Math is not also metrizable):

  1. Every sequence in Template:Math has a subsequence that converges in Template:Math.
  2. Every monotone increasing sequence in Template:Mvar converges to a unique limit in Template:Mvar.
  3. Every monotone decreasing sequence in Template:Mvar converges to a unique limit in Template:Mvar.
  4. Every decreasing nested sequence of nonempty closed subsets Template:Mvar1 ⊇ Template:Mvar2 ⊇ ... in Template:Math has a nonempty intersection.
  5. Every increasing nested sequence of proper open subsets Template:Mvar1 ⊆ Template:Mvar2 ⊆ ... in Template:Math fails to cover Template:Mvar.

Characterization by continuous functions

Let Template:Mvar be a completely regular Hausdorff space and Template:Math the ring of real-valued continuous functions on Template:Mvar. For each Template:Math, the evaluation map evp:C(X)→ℝ given by evp(f)=f(p) is a ring homomorphism. Its kernel Mp=ker⁡(evp) is a maximal ideal, since by the first isomorphism theorem C(X)/Mp≅ℝ.

For a completely regular Hausdorff space Template:Mvar, Template:Mvar is pseudocompact if and only if every maximal ideal Template:Mvar of Template:Math is real, meaning that its residue field Template:Math is isomorphic to ℝ. Moreover, Template:Mvar is realcompact if and only if every real maximal ideal is of the form Template:Math for some Template:Math. Consequently, Template:Mvar is compact if and only if every maximal ideal of Template:Math is the kernel of an evaluation homomorphism.[13]

If Template:Mvar is not pseudocompact, then Template:Math has maximal ideals whose residue fields are proper ordered field extensions of ℝ, often called hyperreal fields. In the framework of non-standard analysis, this corresponds to the following characterization of compactness:[14] a topological space Template:Mvar is compact if and only if every point of the natural extension Template:Math is infinitely close to some point of Template:Mvar (that is, lies in the monad of a point of Template:Mvar).

Hyperreal definition

A space Template:Mvar is compact if its hyperreal extension Template:Math (constructed, for example, by the ultrapower construction) has the property that every point of Template:Math is infinitely close to some point of Template:Math. For example, an open real interval Template:Nowrap is not compact because its hyperreal extension Template:Math contains infinitesimals, which are infinitely close to 0, which is not a point of Template:Mvar.

Sufficient conditions

Properties of compact spaces

Functions and compact spaces

Since the image of a compact space under a continuous function is compact, the extreme value theorem holds for such spaces: a continuous real-valued function on a nonempty compact space is bounded above and attains its supremum.[17] (Slightly more generally, this is true for an upper semicontinuous function.) As a sort of converse to the above statements, the pre-image of a compact space under a proper map is compact.

Compactifications

Template:Main

Every topological space Template:Mvar is an open dense subspace of a compact space having at most one point more than Template:Mvar, by the Alexandroff one-point compactification. By the same construction, every locally compact Hausdorff space Template:Mvar is an open dense subspace of a compact Hausdorff space having at most one point more than Template:Mvar.

Ordered compact spaces

A nonempty compact subset of the real numbers has a greatest element and a least element.

Let Template:Mvar be a totally ordered set endowed with the order topology. Then Template:Mvar is compact if and only if Template:Mvar is a complete lattice (i.e., all subsets have suprema and infima).[18]

Examples

Algebraic examples

See also

Template:Div col

Template:Div col end

Notes

Template:Notelist

References

Template:Reflist

Bibliography

Template:Refbegin

Template:Refend


Template:PlanetMath attribution

Template:Topology

  1. ↑ Template:Cite encyclopedia
  2. ↑ Template:Harvnb; Template:Harvnb
  3. ↑ Template:Harvnb
  4. ↑ Frechet, M. 1904. Template:Lang. Template:Lang.
  5. ↑ Template:Cite web
  6. ↑ Template:Cite web
  7. ↑ Here, "collection" means "set" but is used because "collection of open subsets" is less awkward than "set of open subsets". Similarly, "subcollection" means "subset".
  8. ↑ Template:Harvnb
  9. ↑ Template:Harvnb
  10. ↑ Template:Harvnb
  11. ↑ Template:Harvnb
  12. ↑ Template:Harvnb Theorem 30.7.
  13. ↑ Template:Harvnb
  14. ↑ Template:Harvnb
  15. ↑ Template:Harvnb
  16. ↑ Template:Harvnb
  17. ↑ Template:Harvnb
  18. ↑ Template:Harvnb