| Thread Closed |
prove (0,1)=[0,1] |
Share Thread | Thread Tools |
| Dec11-08, 09:12 AM | #35 |
|
|
prove (0,1)=[0,1]
That's the hard way to do it! And, as I said before, what you are doing, looking at numbers of the form 1/n, is of no use because the integers are countable and none of these sets are countable.
As I said a long time ago, to define a one-to-one, onto function from [0,1] to (0,1)define f(x)= x for x any irrational number between 0 and 1, write all rational numbers in (0,1) in a list, r1, r2, etc. then define f(0)= r1, f(1)= r2, f(rn)= rn+2. |
| Dec11-08, 09:23 AM | #36 |
|
|
|
| Dec11-08, 09:33 AM | #37 |
|
|
kathrynag already stated a bijection between (0, 1) and (0, 1] in the very first post of this thread. (It doesn't take too much effort from that to conclude there is a bijection between (0, 1) and [0, 1].) Her problem is showing that it is one-to-one and onto.
I suggest practicing showing that simpler functions are bijections, such as f : R -> R defined by f(x) = 5 - x^3, so that you understand the form of the proof. |
| Dec11-08, 01:00 PM | #38 |
|
|
f(b)-5-b^3 5-x^3=5-b^3 a^3=b^3 a=b Thus 1-1 y=5-x^3 -y+5=x^3 x=(-y+5)^1/3 x includes all real numbers. Thus onto. Then how do i work around proving [0,1) is equivalent to (0,1]? Like I thought about using f(x)=1-x because f(0)=1 and f(1)=0 but then that would be a mpping and that's not quite right. |
| Dec11-08, 11:06 PM | #39 |
|
|
Ok could I still use C=[0,1]
Then A=C-x element of C B=C but B=C-null set null set is an element of C so A=C- some elemnt of C=B? |
| Dec12-08, 10:19 PM | #40 |
|
|
Ok I know [0,1) is equivalent to (0,1] by f(x)=1-x
Now I'm having trouble finding a similar function for (0,1) equivalent to [0,1] |
| Dec13-08, 12:25 PM | #41 |
|
|
Ok, I found something else. 2 sets A and B are equivalent iff there is a 1-1 function from A onto B.
|
| Dec13-08, 12:34 PM | #42 |
|
|
After reading this topic, I am completely speechless.
|
| Dec13-08, 12:49 PM | #43 |
|
|
You already have f(x) = 1 - x, a bijection between [0, 1) and (0, 1], which is easier to show. If you also have a bijection between [0, 1) and [0, 1], then that implies (0, 1) and [0, 1] are cardinally equivalent. If you want a single bijection between (0, 1) and [0, 1], think about how you can "combine" the 3 functions. |
| Dec13-08, 01:41 PM | #44 |
|
|
Ok, so (0,1) and (0,1] For f(x)=x, we get 0 and 1 For f(1/n)=1/(n-1), we get {1/1/2,1/1,1/4....} Thus, (0,1] [0, 1) and [0, 1] For this I use {0}U(0,1) because I already know (0,1) is a bijection to (0,1]. Thus we have a bijection to [0,1]. Ok, for (0,1) equivalent to [0,1]. Let f(x)=x for all elemnt not of the form 1/n Then we get the points (0,1) Thne for all other points let f(x)={0}U 1/(n-1) |
| Dec13-08, 01:59 PM | #45 |
|
|
Also, what about all other points not in {0, 1, 1/2, 1/3, 1/4, ...}? |
| Dec13-08, 02:34 PM | #46 |
|
|
All other points not in {0,1,1/2,1/3,1/4....} are in f(x)=x Yeah, i guess setting g(0)=0 and g(x)=f(x) would work. So then let f:(0,1)-->(0,1] and let g:(0,1)-->[0,1] Let f(x)=g(x) for all x in (0,1) and let g(1)=0? |
| Dec13-08, 03:01 PM | #47 |
|
|
|
| Dec13-08, 03:18 PM | #48 |
|
|
So then let f:(0,1)-->(0,1] and let g:(0,1)-->[0,1] Let f(x)=g(x) for all x in (0,1) Is this part correct? I know there needs to be some number to equal 0 right? Let g(x)=f(x)=? |
| Dec13-08, 03:39 PM | #49 |
|
|
If If f:(0,1)-->(0,1] then there is NO "x" left over to give f(x)= 0. That's the whole point.
|
| Dec13-08, 03:44 PM | #50 |
|
|
Ok I understand that.
|
| Dec13-08, 06:12 PM | #51 |
|
|
I just am unsure of what x value to plug into g(x)=0 |
| Thread Closed |
| Thread Tools | |
Similar Threads for: prove (0,1)=[0,1]
|
||||
| Thread | Forum | Replies | ||
| Prove (f+g)(x) = f(x) + g(x) | General Math | 4 | ||
| How do you prove this | General Math | 6 | ||
| How can one prove... | General Math | 4 | ||
| How to prove this? | Calculus & Beyond Homework | 1 | ||
| how to prove this? | Introductory Physics Homework | 3 | ||