When is a Discrete Metric Space Compact?

Click For Summary

Homework Help Overview

The discussion revolves around the properties of a metric space (X, d_{disc}) equipped with the discrete metric, specifically focusing on its completeness and conditions for compactness. The original poster seeks clarification on when such a space is compact, as well as the implications of the definitions involved.

Discussion Character

  • Exploratory, Conceptual clarification, Assumption checking

Approaches and Questions Raised

  • The original poster attempts to connect the definitions of compactness and completeness, questioning the implications of boundedness in the context of the discrete metric. Participants inquire about the nature of sequences in X and their convergence properties, while others suggest examining the definition of open sets in relation to compactness.

Discussion Status

Participants are actively exploring various interpretations of compactness in discrete metric spaces. Some have provided insights regarding the nature of open sets and finite covers, while others have pointed out potential misunderstandings about the definitions being used. The conversation remains open-ended, with no explicit consensus reached yet.

Contextual Notes

The original poster expresses uncertainty about the exercise's requirements and the role of the specific properties of X. There is a mention of needing to prove that every open cover has a finite subcover, which may influence the direction of the discussion.

mattmns
Messages
1,129
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
2K
  • · Replies 14 ·
Replies
14
Views
3K
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
9
Views
3K
Replies
4
Views
2K