When is a Discrete Metric Space Compact?

Click For Summary
SUMMARY

The discussion centers on the compactness of a discrete metric space (X, d_{disc}). It is established that such a space is always complete. However, for compactness, it is concluded that X must contain a finite number of points; otherwise, it cannot be compact. The key definitions and propositions regarding compactness and completeness in metric spaces are referenced, particularly the necessity of boundedness and the existence of finite subcovers in open covers.

PREREQUISITES
  • Understanding of discrete metric spaces and their properties
  • Knowledge of compactness and completeness in metric spaces
  • Familiarity with open covers and finite subcovers
  • Ability to analyze convergent sequences in metric spaces
NEXT STEPS
  • Study the properties of discrete metric spaces in detail
  • Learn about the concept of open covers and their role in compactness
  • Explore the relationship between sequential compactness and compactness in metric spaces
  • Investigate examples of finite and infinite discrete metric spaces to solidify understanding
USEFUL FOR

Mathematicians, students of topology, and anyone studying metric spaces and their properties, particularly those interested in compactness and completeness.

mattmns
Messages
1,121
Reaction score
5
Here is the exercise:
----------
Let (X,d_{disc}) be a metric space with the discrete metric.
(a) Show that X is always complete
(b) When is X compact, and when is X not compact? Prove your claim.
---------

Now (a) is pretty simple, but for (b) I am still not sure.

Here is our definition of compact: A metric space (X,d) is said to be compact iff every sequence in (X,d) has at least one convergent subsequence.

We also have the following Proposition: Let (X,d) be a compact metric space. Then (X,d) is both complete and bounded.

This tells us that we must have X bounded and complete (the latter we already have).

But I seem to be out of ideas. I almost feel as if the answer will be any X, or something of that nature (just from the way the exercise is written).

The entire exercise feels silly, as if I am just missing some silly detail that pulls the whole thing together. Any ideas? Thanks!

edit...

Since X needs to be bounded we know that there must be a ball B(x,r) in X which contains X. This would imply X is open (since X would be a ball), but that ... I am not sure. It just seems as though there is not much to go on here.

I was also maybe thinking about contradiction. Assuming that there is some sequence which has no convergent subsequence. But all of these feel strange without having any idea of what X is, or might be.
 
Last edited:
Physics news on Phys.org
What's the discrete metric ? How is it defined ?
 
What sort of sequences must X contain (or not contain) so that they have converging subsequences?
 
Last edited:
If you just write down what a convergent sequence is in the discrete metric you'll see the answer (and if not then look up one post ot gammamcc).
 
Have you proved that, in the discrete metric, every set is an open set? In particular, every "singleton" set, every set containing exactly one ,is open. Given any set, X, the collection of all singleton sets, containing the points of X, is an open cover for X. Under what conditions does there exist a finite subcover?
 
Last edited by a moderator:
That isn't the definition the OP has of compactness. I thought of posting it too, but they are using sequential compactness (which is of coiurse equivalent to the proper definition of compactness in a metric space).
 
Thanks for the responses.

So X must contain a finite number of points to be compact.

The book has an exercise that says to prove that if every open cover of X has a finite subcover, then X is compact. Which I am currently messing around with.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 14 ·
Replies
14
Views
2K
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
9
Views
3K
Replies
4
Views
2K