MHB Proving that a subset of a countable set is countable

  • Thread starter Thread starter Mathmellow
  • Start date Start date
  • Tags Tags
    Set
Mathmellow
Messages
7
Reaction score
0
I am trying to prove that any subset of a countable set is either finite or countable.

I know that a set $$S$$ is countable if there exists a bijection that takes S to $$\Bbb{N}$$. My first thought was to consider the subset $$V$$ of $$S$$. If $$V$$ is finite we are done, since we can always construct a finite subset of a countably infinite set.
So I guess in the case where $$V$$ is infinite we want to prove that there is a bijection $$\beta: V\to\Bbb{N}$$. However, I am not sure how to do this.

I would really appreciate it if someone could help me with this, so I can feel more comfortable with these types of problems in the future!
 
Physics news on Phys.org
Mathmellow said:
I am trying to prove that any subset of a countable set is either finite or countable.

I know that a set $$S$$ is countable if there exists a bijection that takes S to $$\Bbb{N}$$. My first thought was to consider the subset $$V$$ of $$S$$. If $$V$$ is finite we are done, since we can always construct a finite subset of a countably infinite set.
So I guess in the case where $$V$$ is infinite we want to prove that there is a bijection $$\beta: V\to\Bbb{N}$$. However, I am not sure how to do this.

I would really appreciate it if someone could help me with this, so I can feel more comfortable with these types of problems in the future!

One just has to show that any infinite subset of $\mathbb N$ is in bijection with $\mathbb N$.

Let $A\subseteq \mathbb N$ be infinite. Define a map $f:\mathbb N\to A$ by declaring $f(i)$ to be the $i$-th smallest element of $A$. Then $f$ is a bijection.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top