Difference between revisions of "Borel-Lebesgue covering theorem"
Ulf Rehmann (talk | contribs) m (moved Borel–Lebesgue covering theorem to Borel-Lebesgue covering theorem: ascii title) |
(TeX) |
||
Line 1: | Line 1: | ||
− | Let | + | {{TEX|done}} |
+ | Let $A$ be a bounded closed set in $\mathbf R^n$ and let $G$ be an open covering of it, i.e. a system of open sets the union of which contains $A$; then there exists a finite subsystem of sets $\{G_i\}$, $i=1,\ldots,N$, in $G$ (a subcovering) which is also a covering of $A$, i.e. | ||
− | + | $$A\subset\bigcup_{i=1}^NG_i.$$ | |
− | The Borel–Lebesgue theorem has a converse: If | + | The Borel–Lebesgue theorem has a converse: If $A\subset\mathbf R^n$ and if a finite subcovering may be extracted from any open covering of $A$, then $A$ is closed and bounded. The possibility of extracting a finite subcovering out of any open covering of a set $A$ is often taken to be the definition of the set $A$ to be compact. According to such a terminology, the Borel–Lebesgue theorem and the converse theorem assume the following form: For a set $A\subset\mathbf R^n$ to be compact it is necessary and sufficient for $A$ to be bounded and closed. The theorem was proved in 1898 by E. Borel [[#References|[1]]] for the case when $A$ is a segment $[a,b]\subset\mathbf R^1$ and $G$ is a system of intervals; the theorem was given its ultimate form by H. Lebesgue [[#References|[2]]] in 1900–1910. Alternative names for the theorem are Borel lemma, Heine–Borel lemma, Heine–Borel theorem. |
====References==== | ====References==== | ||
<table><TR><TD valign="top">[1]</TD> <TD valign="top"> E. Borel, "Leçons sur la théorie des fonctions" , Gauthier-Villars (1928)</TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top"> W. Rudin, "Principles of mathematical analysis" , McGraw-Hill (1953)</TD></TR></table> | <table><TR><TD valign="top">[1]</TD> <TD valign="top"> E. Borel, "Leçons sur la théorie des fonctions" , Gauthier-Villars (1928)</TD></TR><TR><TD valign="top">[2]</TD> <TD valign="top"> W. Rudin, "Principles of mathematical analysis" , McGraw-Hill (1953)</TD></TR></table> |
Revision as of 15:00, 3 August 2014
Let $A$ be a bounded closed set in $\mathbf R^n$ and let $G$ be an open covering of it, i.e. a system of open sets the union of which contains $A$; then there exists a finite subsystem of sets $\{G_i\}$, $i=1,\ldots,N$, in $G$ (a subcovering) which is also a covering of $A$, i.e.
$$A\subset\bigcup_{i=1}^NG_i.$$
The Borel–Lebesgue theorem has a converse: If $A\subset\mathbf R^n$ and if a finite subcovering may be extracted from any open covering of $A$, then $A$ is closed and bounded. The possibility of extracting a finite subcovering out of any open covering of a set $A$ is often taken to be the definition of the set $A$ to be compact. According to such a terminology, the Borel–Lebesgue theorem and the converse theorem assume the following form: For a set $A\subset\mathbf R^n$ to be compact it is necessary and sufficient for $A$ to be bounded and closed. The theorem was proved in 1898 by E. Borel [1] for the case when $A$ is a segment $[a,b]\subset\mathbf R^1$ and $G$ is a system of intervals; the theorem was given its ultimate form by H. Lebesgue [2] in 1900–1910. Alternative names for the theorem are Borel lemma, Heine–Borel lemma, Heine–Borel theorem.
References
[1] | E. Borel, "Leçons sur la théorie des fonctions" , Gauthier-Villars (1928) |
[2] | W. Rudin, "Principles of mathematical analysis" , McGraw-Hill (1953) |
Borel-Lebesgue covering theorem. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Borel-Lebesgue_covering_theorem&oldid=32701