- #1

- 18

- 0

Can you help me to construct a 1-1 mapping from real numbers onto non-integers? thanks

- Thread starter ssamsymn
- Start date

- #1

- 18

- 0

Can you help me to construct a 1-1 mapping from real numbers onto non-integers? thanks

- #2

- 18

- 0

- #3

- 3,393

- 181

$$f(r_n) = r_{2n}$$

$$f(z_n) = r_{2n+1}$$

$$f(x) = x \textrm{ for all other }x$$

It's easy to see that this is a bijection.

- #4

- 22,089

- 3,286

Now, it is not so hard to see that such a bijection has to exist. So if you're only interested in bijection and not existence, then you basically only have to apply the wonderful Cantor-Bernstein-Shroder theorem.

If you want an actual map, then this requires a bit more work. It might be easier to first find a bijection [itex]f:\mathbb{R}\rightarrow \mathbb{R}\setminus \{0\}[/itex] and then apply the same trick on your problem. For the easier problem, the trick is to select a sequence in [itex]\mathbb{R}[/itex] such as [itex]x_n=n[/itex] for [itex]n\geq 0[/itex]. Then we can define

[tex]f(x)=x~\text{if}~x\neq x_n~ \text{and}~f(x_n) = x_{n+1}[/tex]

Do you see that that works?? Can you apply this same idea on your problem?

- #5

- 18

- 0

thank you very much.

$$f(r_n) = r_{2n}$$

$$f(z_n) = r_{2n+1}$$

$$f(x) = x \textrm{ for all other }x$$

It's easy to see that this is a bijection.

I don't fully understant how I can pick real numbers with n indices.

I am not familiar with the notation, I need a valid function to show this map is one to one and onto.

my real numbers set is non countable, non integers set is also.I thought the function can be 1/(1+e^n) for any n picked from real line. after that I try to generalize it.

- #6

- 18

- 0

thank you very much.

Now, it is not so hard to see that such a bijection has to exist. So if you're only interested in bijection and not existence, then you basically only have to apply the wonderful Cantor-Bernstein-Shroder theorem.

If you want an actual map, then this requires a bit more work. It might be easier to first find a bijection [itex]f:\mathbb{R}\rightarrow \mathbb{R}\setminus \{0\}[/itex] and then apply the same trick on your problem. For the easier problem, the trick is to select a sequence in [itex]\mathbb{R}[/itex] such as [itex]x_n=n[/itex] for [itex]n\geq 0[/itex]. Then we can define

[tex]f(x)=x~\text{if}~x\neq x_n~ \text{and}~f(x_n) = x_{n+1}[/tex]

Do you see that that works?? Can you apply this same idea on your problem?

I am trying to figure out Cantor's method. I think I should construct disjoint one countable and one uncountable sets and their union should be real numbers.

- #7

- 3,393

- 181

If you want something specific, just take something like ##r_n = (2n+1)/2##, i.e., the sequence ##1/2, 3/2, 5/2, \ldots##. Any sequence of real numbers will work as long as they are all distinct and none of them are integers. Drawing a picture might help if it's not clear what the map is doing.thank you very much.

I don't fully understant how I can pick real numbers with n indices.

I am not familiar with the notation, I need a valid function to show this map is one to one and onto.

- #8

- 18

- 0

Yes, thank you very much. I thought that my function such as 2n+1/2 should be valid for any real number but I think the remaining non-integers from half integers are included in f(x)=x otherwise case. thank youIf you want something specific, just take something like ##r_n = (2n+1)/2##, i.e., the sequence ##1/2, 3/2, 5/2, \ldots##. Any sequence of real numbers will work as long as they are all distinct and none of them are integers. Drawing a picture might help if it's not clear what the map is doing.

- Replies
- 8

- Views
- 2K

- Last Post

- Replies
- 1

- Views
- 2K

- Last Post

- Replies
- 10

- Views
- 10K

- Replies
- 7

- Views
- 4K

- Last Post

- Replies
- 2

- Views
- 2K

- Replies
- 3

- Views
- 2K

- Last Post

- Replies
- 2

- Views
- 860

- Replies
- 14

- Views
- 829

- Last Post

- Replies
- 7

- Views
- 672

- Last Post

- Replies
- 0

- Views
- 2K