Make a bijection that shows |C|=|R|
First I thought of dividing the complex numbers in the real parts and the complex parts and then define a formula that maps those parts to the real numbers. But I don't get anywhere with that. By this I mean that it's not a good enough defined bijection.
Can someone give me a hint on how to do this?
Maybe I need to read more about complex numbers.
Answer
You can represent every complex number as z=a+ib, so let us denote this complex number as (a,b), a,b∈R. Hence we have cardinality of complex numbers equal to R2.
So finally, we need a bijection in R and R2.
This can be shown using the argument used here.
Note that since there is a bijection from [0,1]→R (see appendix), it is enough to find a bijection from the unit square [0,1]2 to the unit interval [0,1]. By constructions in the appendix, it does not really matter whether we consider [0,1], (0,1], or (0,1), since there are easy bijections between all of these.
Mapping the unit square to the unit interval
There are a number of ways to proceed in finding a bijection from the unit square to the unit interval. One approach is to fix up the "interleaving" technique I mentioned in the comments, writing ⟨0.a1a2a3…,0.b1b2b3…⟩ to 0.a1b2a2b2a3b3…. This doesn't quite work, as I noted in the comments, because there is a question of whether to represent 12 as 0.5000… or as 0.4999…. We can't use both, since then ⟨12,0⟩ goes to both 12=0.5000… and to 922=0.40909… and we don't even have a function, much less a bijection. But if we arbitrarily choose to the second representation, then there is no element of [0,1]2 that is mapped to 12, and if we choose the first there is no element that is mapped to 922, so either way we fail to have a bijection.
This problem can be fixed.
First, we will deal with (0,1] rather than with [0,1]; bijections between these two sets are well-known, or see the appendix. For real numbers with two decimal expansions, such as 12, we will agree to choose the one that ends with nines rather than with zeroes. So for example we represent 12 as 0.4999….
Now instead of interleaving single digits, we will break each input number into chunks, where each chunk consists of some number of zeroes (possibly none) followed by a single non-zero digit. For example, 1200=0.00499… is broken up as 004 9 9 9…, and 0.01003430901111… is broken up as 01 003 4 3 09 01 1 1….
This is well-defined since we are ignoring representations that contain infinite sequences of zeroes.
Now instead of interleaving digits, we interleave chunks. To interleave 0.004999… and 0.01003430901111…, we get 0.004 01 9 003 9 4 9…. This is obviously reversible. It can never produce a result that ends with an infinite sequence of zeroes, and similarly the reverse mapping can never produce a number with an infinite sequence of trailing zeroes, so we win. A problem example similar to the one from a few paragraphs ago is resolved as follows: 12=0.4999… is the unique image of ⟨0.4999…,0.999…⟩ and 922=0.40909… is the unique image of ⟨0.40909…,0.0909…⟩.
No comments:
Post a Comment