Are All Countable Sets Closed?

  • MHB
  • Thread starter OhMyMarkov
  • Start date
  • Tags
    Closed Sets
In summary, the conversation discusses the concept of countability and its relationship to closed sets. The speaker suggests that all countable sets are closed, but it is pointed out that this is not always true. Examples of countable sets that are not closed are given, including the set of rational numbers and the set of all natural numbers. The conversation ends with a clarification on the definition of countability and the possibility of countable sets being open.
  • #1
OhMyMarkov
83
0
Hello everyone!

I want to show that all countable sets are closed. I can show that finite sets are closed, and the set of all natural numbers is closed by showing its complement to be a union of open sets. Now, can I start like this:

A is a countable set. Every element in A can be "mapped" to an element in N by the property of countability (I presume). N is finite, so A is finite too.

Is there proof correct, if it is but technically incorrect, could you suggest a better proof.

Thanks! :eek:
 
Physics news on Phys.org
  • #2
$\Bbb N$ is not finite!

And not all countable sets are closed: take the real line with usual topology, and $S:=\{n^{-1},n\in\Bbb N\}$ is countable, but not closed (as $0$ is in the closure but not in the set).
 
  • #3
Another example: the set of all rational numbers is countable but not closed- its closure is the set of all real numbers.
 
  • #4
I apologize about saying N is finite, I forgot to edit that out. I believe I must review what countability strictly means.
 
  • #5
A set is countable if it is finite or there is a bijection with $\mathbb{N}$. :D
 
  • #6
If you consider the naturals (any subset) or rationals or something with the discrete metric then these are open, so you have (at least) countably many countable sets that are open :)
 

FAQ: Are All Countable Sets Closed?

What does it mean for a set to be "countable"?

A countable set is a set that can be put into a one-to-one correspondence with the natural numbers (1, 2, 3, ...), meaning that each element in the set can be uniquely assigned a natural number.

How can you prove that a set is countable?

To prove that a set is countable, you can use a bijection, which is a function that maps each element in the set to a unique natural number. Alternatively, you can use the Cantor-Bernstein-Schröder theorem, which states that if there exists an injection (one-to-one function) from set A to set B and an injection from set B to set A, then there exists a bijection between set A and set B.

What is the difference between a "countable" and an "uncountable" set?

A countable set is one that can be put into a one-to-one correspondence with the natural numbers, while an uncountable set is one that cannot. In other words, an uncountable set has more elements than a countable set.

How is the concept of "countability" related to the concept of "closure" in mathematics?

In mathematics, "closure" refers to the property of a set that includes all of its limit points. When referring to countable sets, "closed" typically means that the set contains all of its limit points and is therefore "complete". However, not all countable sets are necessarily closed, as there are countable sets that have limit points outside of the set.

Can you provide an example of a countable set that is not closed?

Yes, the set of rational numbers (numbers that can be expressed as a ratio of two integers) is countable but not closed. This is because there are irrational numbers (such as π and √2) that are limit points of the set of rational numbers, but are not included in the set itself.

Back
Top