Q3) Proving the Cardinality of Infinite Sets: A Rigorous Approach

[kingwinner]

Homework Statement

Q1) Assuming that |R|=|[0,1]| is true, how can we rigorously prove that |R²|=|[0,1] x [0,1]|? How to define the bijection? [Q1 is solved, please see Q2]



Q2) Prove that |[0,1] x [0,1]| ≤ |[0,1]|
Proof: Represent points in [0,1] x [0,1] as infinite decimals
x=0.a₁a₂a₃...
y=0.b₁b₂b₃...
Define f(x,y)=0.a₁b₁a₂b₂a₃b₃...
To avoid ambiguity, for any number that has two decimal representations, choose the one with a string of 9's.
f: [0,1] x [0,1] -> [0,1] is one-to-one, but not onto.
This one-to-one map proves that |[0,1] x [0,1]| ≤ |[0,1]|.

Now how can we formally prove that f is a one-to-one map (i.e. f(m)=f(n) => m=n)? All textbooks are avoiding this step, they just say it's obviously one-to-one, but this is exactly where I'm having trouble. How to prove formally?

Homework Equations

The Attempt at a Solution

As shown above.

Thanks a million! :)

 

[kingwinner]

Q1 is solved, but I'm still having trouble with Q2.

Can someone help me with Q2, please? It is an example I found on the internet, but I don't understand why the function f is one-to-one. How can we formally PROVE that f is a one-to-one map?

Any help is appreciated!

 

[mrbohn1]

There is really nothing to it...you just have to say: suppose f(a,b)=f(c,d). Then:

0.a_1b_1a_2b_2...=0.c_1d_1c_2d_2..., so:

a_i=c_i and b_i=d_i for all i,

ie: a=c and b=d, so (a,b)=(c,d).

 

[kingwinner]

There is really nothing to it...you just have to say: suppose f(a,b)=f(c,d). Then:

0.a_1b_1a_2b_2...=0.c_1d_1c_2d_2..., so:

a_i=c_i and b_i=d_i for all i,

ie: a=c and b=d, so (a,b)=(c,d).

We can say a_i=c_i and b_i=d_i for all i only because we have removed all ambiguities, so the decimal expansion of each number is unique, right??

Also, why is f NOT onto??

Thanks!

 

[Landau]

Also, why is f NOT onto??

Why do you think it's not? It is! Hence it is a bijection, which means |[0,1]^2|=|[0,1]|.

The proof is trivial: let z\in [0,1], z=0,z_1z_2z_3z_4z_5....
Take x,y\in[0,1] with x=0.z_1z_3z_5... and y=0.z_2z_4z_6.... Then obviously f(x,y)=z.

 

[Landau]

It seems to me to make more sense to construct a surjective (onto) map in the other direction, say g : [0,1] \rightarrow [0,1] \times [0,1]. If you can find such a map, then it's immediate that |[0,1]| \geq |[0,1]\times[0,1]|.
To create such a map, just do the opposite of what your f function does.

First, this is exactly the same since f is bijective, hence you would just be computing the inverse which contributes nothing. Second, |A|<=|B| means by definition that there exists an injection A->B, not that there exists a surjection B->A. These are only equivalent if we invoke the axiom of choice. So it does not make more sense to construct a surjective map in the other direction.

\\edit: it seems jbunniii deleted his reply.

 

[jbunniii]

\\edit: it seems jbunniii deleted his reply.

Yeah, I realized pretty quickly that it didn't make any sense, but not quickly enough!

 

[Landau]

I apologize ;)

 

[kingwinner]

Hi,

But now I seriously think that f is NOT onto.

For example, 0.17070707... is not in the image of f.
It must come from (0.10000..., 0.7777...), but by our definition of f, 0.10000... is always represented as 0.0999..., (we have to remove all the ambiguities, for any number that has two decimal representations, we choose the one with a string of 9's. When we define f, we have to remove the ambiguities, otherwise, f won't be one-to-one, actually I think f wouldn't even be a function.)
So (0.10000..., 0.7777...) is always represented as (0.09999..., 0.7777...). There is no way we can get the element 0.17070707... in the image of f.

Hence, f is definitely NOT onto, am I right?

 

[ShortFive]

It looks to me like you are trying to prove that |[0,1] \times [0,1]| = |[0,1]|. Now, I do not know what facts of life you are allowed to assume here, but it seems like the easiest way to go is to appeal to the Schroeder-Bernstein Theorem. If you are unfamiliar with it, the Schroeder-Bernstein Theorem says, briefly, that if A and B are sets, with both |A| \leq |B| and |B| \leq |A|, then |A| = |B|. This is more than a mere triviality, since it means that if we have an injection (one-one map, not necessarily onto, as pointed out above) A \rightarrow B and an injection B \rightarrow A, then A and B have the same cardinal number.

In this case, an injection [0,1] \rightarrow [0,1] \times [0,1] is easy. An injection [0,1] \times [0,1] \rightarrow [0,1] requires a bit more thought, but is readily exhibited, as you have seen.

 

[HallsofIvy]

If you are given that |R|= |[0,1]|, you already know that there exists a bijection f(x) from R to [0,1]. Then F(x,y)= (f(x), f(y)) is a bijection from RxR to [0, 1]x[0,1].

 

[Gib Z]

Great proof Halls!

 

[kingwinner]

Hi,

For Q2, to prove |[0,1]|=|[0,1]x[0,1]|, I was going to use the Schroeder-Bernstein theorem, too.

But someone said that f(x,y)=0.a1b1a2b2a3b3... is a BIJECTION. If it is a bijection, then we don't need that theorem. Can someone explain why f(x,y)=0.a1b1a2b2a3b3... is onto? I think my post #9 demonstrates that f is NOT onto. Am I missing something??

 

[Dick]

No, you're right. f(x,y) is not a bijection. Ignore statements it is and go ahead and prove the result anyway.