Proving Every Infinite Set Has An Infinite Countable Subset

  • Thread starter Thread starter Doom of Doom
  • Start date Start date
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 2K views
Doom of Doom
Messages
85
Reaction score
0
So, the task is to prove: Every infinite set has a infinite countable subset.


2. A set [tex]S[/tex] is countable if there exists a bijection [tex]\phi: \mathbb{N}\rightarrow X[/tex]


The Attempt at a Solution

 
Physics news on Phys.org
You can easily construct a countable subset [itex]\{s_1,s_2,\dots\}[/itex] wiht [itex]s_1,s_2,\dots[/itex] being elements of S.

Let [itex]s_1[/itex] be some element of S. Let inductively [itex]s_n[/itex] be some element of [itex]S-\{s_1,\dots,s_{n-1}\}[/itex].

Can you show that this works for any infinite set, and that it does not work for any finite set?
 
Last edited: