Proving Dedekind Infiniteness of Countable Sets | Solution Attempt

  • Thread starter Thread starter cragar
  • Start date Start date
  • Tags Tags
    Infinite Sets
cragar
Messages
2,546
Reaction score
3

Homework Statement


Call a set X Dedekind infinite if there is a 1-to-1 mapping of X onto
its proper subset.
Prove that every countable set is Dedekind infinite.

The Attempt at a Solution


I want to say that every countable set can be well ordered.
I guess I could just pick some element from our set X and call it a.
And then make sure everything from our set gets mapped to something
larger than a. So we have a 1-to-1 mapping to our proper subset.
I probably need to be more rigorous about how this mapping takes place.
 
Physics news on Phys.org
cragar said:

Homework Statement


Call a set X Dedekind infinite if there is a 1-to-1 mapping of X onto
its proper subset.
Prove that every countable set is Dedekind infinite.

The Attempt at a Solution


I want to say that every countable set can be well ordered.
I guess I could just pick some element from our set X and call it a.
And then make sure everything from our set gets mapped to something
larger than a. So we have a 1-to-1 mapping to our proper subset.
I probably need to be more rigorous about how this mapping takes place.

Yes, you should be more explicit about what the mapping is. What's the definition of countable set?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top