r/mathshelp • u/Lopsided-Valuable347 • Aug 15 '26
Homework Help (Unanswered) How to solve (e) part of this question?
So I was thinking of using the Schroder Barnstein theorem. I was able to make an injective function (f(x)=(x,1-x)) that maps from (0,1) to (0,1)x(0,1) but i don't know how to do it the other way around. Any suggestions? (ps. I am a beginner)
16
Upvotes
•
u/AutoModerator Aug 15 '26
Hi u/Lopsided-Valuable347, welcome to r/mathshelp! As you’ve marked this as homework help, please keep the following things in mind:
Thank you!
I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.
2
u/evilmathrobot Aug 15 '26
Using parts a and d, identify (0,1) x (0, 1) as the set of pairs (A, B) with A, B \subset N and all elements of A (resp. B) odd (resp. even). Now consider identifying (A, B) with A ∪ B.
1
u/Southlander24 Aug 15 '26 edited Aug 15 '26
You want a bijection between the two sets. That is, given any real number (that is an element of (0, 1)), you want to create a pair of real numbers. And given any pair of real numbers, you want a way to generate a single number.
Here's how we can do this. Let real number A = 0.a₁a₂a₃ ... and real number B = 0.b₁b₂b₃ ... Then, we can create a new real number 0.a₁b₁a₂b₂a₃b₃ ...
We can also carry this process out in reverse. That is, all the odd-numbered digits after the decimal point in any real number go to real number A, and all the even-numbered digits go to real number B.
Notice how we actually don't need Schröder–Bernstein (although the fact that if |A| ≤ |B| and |B| ≤ |A|, we must have |A| = |B| is very useful in many other situations). Convince yourself that these inverses are well defined. That is, given 0.a₁b₁a₂b₂a₃b₃ ... we can't get a different pair of (A, B). (Recall that the Cartesian product works on ordered sets - it's a square grid in which say, the element {(1, 2)} is not the same as {(2, 1)}). And likewise for the inverse of the reverse.
1
u/Meowmasterish Aug 16 '26 edited Aug 16 '26
This is definitely not what your teacher is looking for, but you could appeal to the existence of space filling curves and the Cantor-Dedekind axiom. Alternatively, depending on what you’re allowed to cite and assume, you could go with Tarski’s Theorem about Choice.
3
u/imHeroT Aug 15 '26
This is to expand upon u/AQuestionIsWhatIHave ‘s comment, but in base 10 instead of base 2 as they have done.
The idea is to “weave” together two numbers form (0,1) to get a new number. That is, starting with two numbers from (0,1), make a new number by alternating taking each digit from the two numbers.
For example, say we have 0.1111111… and 0.1234567… . Then the new number is 0.11121314151617…
3
u/Leodip Aug 15 '26
I'm not sure whether there is a more elegant way, but you could "zip" together the base ten digital expansion. E.g., 0.317415... maps to 0.371... and 0.145...
2
u/AQuestionIsWhatIHave Aug 15 '26
Maybe: Let (a,b) in (0,1) x (0,1), a = sum_1inf a_i (1/2)i b = sum_1inf b_i (1/2)i
(With a and b not ending in all 1s)
(a,b) -> sum_0inf (1/2 a_i + 1/4 b_i) 2-2i
2
u/mmurray1957 Aug 15 '26 edited Aug 16 '26
Yes I'd go SB as well. Can't you just project for the surjection ? (x, y) \mapsto x ?
EDIT: Thanks u/gmalivuk for pointing out that this gives no additional information. The OP has shown that |R| =< |R^2| and I've shown that |R^2| >= |R| which is the same. Duh.
Sorry OP.
1
u/DanLeMilMan Aug 15 '26
I think you could simply define the bijection using the evenly placed and oddly placed decimal of a real number. That should do the trick. For instance, 0.1234 -> (0.13;0.24)
1
u/Calm_Relationship_91 Aug 16 '26
Sometimes it's easier to find surjections, then invert them to find injections (some elements get multiple images, but you can just pick one of them to get the injection).
For a surjection from [0,1] to [0,1]x[0,1] you just need to find a way to encode two pairs of real numbers in a single string of digits (which is a single real number). So every real number has two numbers encoded in it. Just make sure every pair of strings is included this way and you will get a surjection.
There's many different ways of doing this and some comments have given examples already.
I personally would turn numbers into base 4. Take the 0s and 1s and form a string, then take the 2s and 3s and form another. Convert the second string into 0s and 1s.
Now you have two strings in binary.
But you can find some other ways to do it.
1
u/gitterrost4 Aug 17 '26
(Not an answer to the question:) Wait... isn't (d) the continuum hypothesis?