In proving the theorem: Every infinite set is equivalent to one of its proper subsets, I am confused about the following:
We consider an infinite set M, which always contains a countable subset, which is denoted A:={a1,a2,…}. We may partition A into two countable subsets:
A1:={a1,a3,a5…},A2:={a2,a4,a6…}
and we have a one-to-one correspondence between A and A1 given by an→a2n−1.
We can then extend this correspondence to a one-to-one correspondence between the two sets:
A∪(M−A)=M,A1∪(M−A)=M−A2
by simply assigning x itself to each x∈M−A. I don't quite understand this extension, how are we allowed to do this?
This is a proof taken from Introductory Real Analysis by Kolmogorov and Fomin.
Answer
You have a bijection between the elements of A and A1. That is, you have a map f:A⟶A1 which is bijective. You define another map, g:A∪(M−A)⟶A1∪(M−A), such that g(x)=f(x)ifx∈A,andg(x)=xifx∈M−A.
Note that A∩(M−A)=∅, so g is well-defined and g is a bijection.
No comments:
Post a Comment