In mathematics a topological space is called countably compact if every countable open cover has a finite subcover.
A topological space X is called countably compact if it satisfies any of the following equivalent conditions:
(1) Every countable open cover of X has a finite subcover.
(2) Every infinite set A in X has an ω-accumulation point in X.
(3) Every sequence in X has an accumulation point in X.
(4) Every countable family of closed subsets of X with an empty intersection has a finite subfamily with an empty intersection.
(1) (2): Suppose (1) holds and A is an infinite subset of X without -accumulation point. By taking a subset of A if necessary, we can assume that A is countable.
Every has an open neighbourhood such that is finite (possibly empty), since x is not an ω-accumulation point. For every finite subset F of A define . Every is a subset of one of the , so the cover X. Since there are countably many of them, the form a countable open cover of X. But every intersect A in a finite subset (namely F), so finitely many of them cannot cover A, let alone X. This contradiction proves (2).
(2) (3): Suppose (2) holds, and let be a sequence in X. If the sequence has a value x that occurs infinitely many times, that value is an accumulation point of the sequence. Otherwise, every value in the sequence occurs only finitely many times and the set is infinite and so has an ω-accumulation point x. That x is then an accumulation point of the sequence, as is easily checked.
(3) (1): Suppose (3) holds and is a countable open cover without a finite subcover. Then for each we can choose a point that is not in . The sequence has an accumulation point x and that x is in some . But then is a neighborhood of x that does not contain any of the with , so x is not an accumulation point of the sequence after all. This contradiction proves (1).
(4) (1): Conditions (1) and (4) are easily seen to be equivalent by taking complements.
The first uncountable ordinal (with the order topology) is an example of a countably compact space that is not compact.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In mathematics, the first uncountable ordinal, traditionally denoted by or sometimes by , is the smallest ordinal number that, considered as a set, is uncountable. It is the supremum (least upper bound) of all countable ordinals. When considered as a set, the elements of are the countable ordinals (including finite ordinals), of which there are uncountably many. Like any ordinal number (in von Neumann's approach), is a well-ordered set, with set membership serving as the order relation. is a limit ordinal, i.
In mathematics a topological space is called countably compact if every countable open cover has a finite subcover. A topological space X is called countably compact if it satisfies any of the following equivalent conditions: (1) Every countable open cover of X has a finite subcover. (2) Every infinite set A in X has an ω-accumulation point in X. (3) Every sequence in X has an accumulation point in X. (4) Every countable family of closed subsets of X with an empty intersection has a finite subfamily with an empty intersection.
In mathematics, a topological space X is sequentially compact if every sequence of points in X has a convergent subsequence converging to a point in . Every metric space is naturally a topological space, and for metric spaces, the notions of compactness and sequential compactness are equivalent (if one assumes countable choice). However, there exist sequentially compact topological spaces that are not compact, and compact topological spaces that are not sequentially compact.
This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex
Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics a