Construct bijections $f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$ and $f_2 :...












0












$begingroup$


I need to construct two bijections:
$$f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$$
$$f_2 : (mathbb{Z}times[0,1))rightarrowmathbb{R}$$
I know what bijection means and all conditions that functions have to fulfill in order to be bijective, but I have no idea how should I 'construct' them. I thought of drawing graphs of each set from function $f_1$, but it does not help me to do further steps.

It would be nice if you could show me step-by-step how it should be done.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Don't get too hung up on the word "construct". If you were just asked to find the bijections, would you know what to do?
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 15:57










  • $begingroup$
    I know that I should somehow find functions which fit these sets, but how can I do it if not by guessing?
    $endgroup$
    – whiskeyo
    Dec 8 '18 at 15:59










  • $begingroup$
    Have you tried just "guessing"? This is not a follow-a- method exercise, it's just a check question to make sure you have understood what a bijection is.
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 16:06










  • $begingroup$
    I tried to transform $f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$ into $f_1 : A rightarrow B$, where $A : (0,1)rightarrow (2,3)$ and $B : (0,2)rightarrow (5,6)$ and then find functions fitting both sets, but I could not do that.
    $endgroup$
    – whiskeyo
    Dec 8 '18 at 16:23










  • $begingroup$
    Hmmm. Can you make just a function that maps (0,1) bijectively to (2,3)?
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 16:33
















0












$begingroup$


I need to construct two bijections:
$$f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$$
$$f_2 : (mathbb{Z}times[0,1))rightarrowmathbb{R}$$
I know what bijection means and all conditions that functions have to fulfill in order to be bijective, but I have no idea how should I 'construct' them. I thought of drawing graphs of each set from function $f_1$, but it does not help me to do further steps.

It would be nice if you could show me step-by-step how it should be done.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Don't get too hung up on the word "construct". If you were just asked to find the bijections, would you know what to do?
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 15:57










  • $begingroup$
    I know that I should somehow find functions which fit these sets, but how can I do it if not by guessing?
    $endgroup$
    – whiskeyo
    Dec 8 '18 at 15:59










  • $begingroup$
    Have you tried just "guessing"? This is not a follow-a- method exercise, it's just a check question to make sure you have understood what a bijection is.
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 16:06










  • $begingroup$
    I tried to transform $f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$ into $f_1 : A rightarrow B$, where $A : (0,1)rightarrow (2,3)$ and $B : (0,2)rightarrow (5,6)$ and then find functions fitting both sets, but I could not do that.
    $endgroup$
    – whiskeyo
    Dec 8 '18 at 16:23










  • $begingroup$
    Hmmm. Can you make just a function that maps (0,1) bijectively to (2,3)?
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 16:33














0












0








0





$begingroup$


I need to construct two bijections:
$$f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$$
$$f_2 : (mathbb{Z}times[0,1))rightarrowmathbb{R}$$
I know what bijection means and all conditions that functions have to fulfill in order to be bijective, but I have no idea how should I 'construct' them. I thought of drawing graphs of each set from function $f_1$, but it does not help me to do further steps.

It would be nice if you could show me step-by-step how it should be done.










share|cite|improve this question











$endgroup$




I need to construct two bijections:
$$f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$$
$$f_2 : (mathbb{Z}times[0,1))rightarrowmathbb{R}$$
I know what bijection means and all conditions that functions have to fulfill in order to be bijective, but I have no idea how should I 'construct' them. I thought of drawing graphs of each set from function $f_1$, but it does not help me to do further steps.

It would be nice if you could show me step-by-step how it should be done.







elementary-set-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 8 '18 at 18:24







whiskeyo

















asked Dec 8 '18 at 15:48









whiskeyowhiskeyo

1107




1107












  • $begingroup$
    Don't get too hung up on the word "construct". If you were just asked to find the bijections, would you know what to do?
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 15:57










  • $begingroup$
    I know that I should somehow find functions which fit these sets, but how can I do it if not by guessing?
    $endgroup$
    – whiskeyo
    Dec 8 '18 at 15:59










  • $begingroup$
    Have you tried just "guessing"? This is not a follow-a- method exercise, it's just a check question to make sure you have understood what a bijection is.
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 16:06










  • $begingroup$
    I tried to transform $f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$ into $f_1 : A rightarrow B$, where $A : (0,1)rightarrow (2,3)$ and $B : (0,2)rightarrow (5,6)$ and then find functions fitting both sets, but I could not do that.
    $endgroup$
    – whiskeyo
    Dec 8 '18 at 16:23










  • $begingroup$
    Hmmm. Can you make just a function that maps (0,1) bijectively to (2,3)?
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 16:33


















  • $begingroup$
    Don't get too hung up on the word "construct". If you were just asked to find the bijections, would you know what to do?
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 15:57










  • $begingroup$
    I know that I should somehow find functions which fit these sets, but how can I do it if not by guessing?
    $endgroup$
    – whiskeyo
    Dec 8 '18 at 15:59










  • $begingroup$
    Have you tried just "guessing"? This is not a follow-a- method exercise, it's just a check question to make sure you have understood what a bijection is.
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 16:06










  • $begingroup$
    I tried to transform $f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$ into $f_1 : A rightarrow B$, where $A : (0,1)rightarrow (2,3)$ and $B : (0,2)rightarrow (5,6)$ and then find functions fitting both sets, but I could not do that.
    $endgroup$
    – whiskeyo
    Dec 8 '18 at 16:23










  • $begingroup$
    Hmmm. Can you make just a function that maps (0,1) bijectively to (2,3)?
    $endgroup$
    – Henning Makholm
    Dec 8 '18 at 16:33
















$begingroup$
Don't get too hung up on the word "construct". If you were just asked to find the bijections, would you know what to do?
$endgroup$
– Henning Makholm
Dec 8 '18 at 15:57




$begingroup$
Don't get too hung up on the word "construct". If you were just asked to find the bijections, would you know what to do?
$endgroup$
– Henning Makholm
Dec 8 '18 at 15:57












$begingroup$
I know that I should somehow find functions which fit these sets, but how can I do it if not by guessing?
$endgroup$
– whiskeyo
Dec 8 '18 at 15:59




$begingroup$
I know that I should somehow find functions which fit these sets, but how can I do it if not by guessing?
$endgroup$
– whiskeyo
Dec 8 '18 at 15:59












$begingroup$
Have you tried just "guessing"? This is not a follow-a- method exercise, it's just a check question to make sure you have understood what a bijection is.
$endgroup$
– Henning Makholm
Dec 8 '18 at 16:06




$begingroup$
Have you tried just "guessing"? This is not a follow-a- method exercise, it's just a check question to make sure you have understood what a bijection is.
$endgroup$
– Henning Makholm
Dec 8 '18 at 16:06












$begingroup$
I tried to transform $f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$ into $f_1 : A rightarrow B$, where $A : (0,1)rightarrow (2,3)$ and $B : (0,2)rightarrow (5,6)$ and then find functions fitting both sets, but I could not do that.
$endgroup$
– whiskeyo
Dec 8 '18 at 16:23




$begingroup$
I tried to transform $f_1 : ((0,1)times(2,3)) rightarrow (0,2)times(5,6)$ into $f_1 : A rightarrow B$, where $A : (0,1)rightarrow (2,3)$ and $B : (0,2)rightarrow (5,6)$ and then find functions fitting both sets, but I could not do that.
$endgroup$
– whiskeyo
Dec 8 '18 at 16:23












$begingroup$
Hmmm. Can you make just a function that maps (0,1) bijectively to (2,3)?
$endgroup$
– Henning Makholm
Dec 8 '18 at 16:33




$begingroup$
Hmmm. Can you make just a function that maps (0,1) bijectively to (2,3)?
$endgroup$
– Henning Makholm
Dec 8 '18 at 16:33










1 Answer
1






active

oldest

votes


















1












$begingroup$

For $f_2$,The usual euclidean product of sets may be a little confusing here.



Try thinking of "$mathbb{Z}times[0,1)$" as the set "To each integer, assign an interval from 0 to 1." Then $f_2(x,t) = x+t$ is a bijection to $mathbb{R}$, where $xinmathbb{Z}$ is the integer part of some real number, and $tin[0,1)$ is the decimal part of that number.






share|cite|improve this answer









$endgroup$













    Your Answer





    StackExchange.ifUsing("editor", function () {
    return StackExchange.using("mathjaxEditing", function () {
    StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
    StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
    });
    });
    }, "mathjax-editing");

    StackExchange.ready(function() {
    var channelOptions = {
    tags: "".split(" "),
    id: "69"
    };
    initTagRenderer("".split(" "), "".split(" "), channelOptions);

    StackExchange.using("externalEditor", function() {
    // Have to fire editor after snippets, if snippets enabled
    if (StackExchange.settings.snippets.snippetsEnabled) {
    StackExchange.using("snippets", function() {
    createEditor();
    });
    }
    else {
    createEditor();
    }
    });

    function createEditor() {
    StackExchange.prepareEditor({
    heartbeatType: 'answer',
    autoActivateHeartbeat: false,
    convertImagesToLinks: true,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: 10,
    bindNavPrevention: true,
    postfix: "",
    imageUploader: {
    brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
    contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
    allowUrls: true
    },
    noCode: true, onDemand: true,
    discardSelector: ".discard-answer"
    ,immediatelyShowMarkdownHelp:true
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3031268%2fconstruct-bijections-f-1-0-1-times2-3-rightarrow-0-2-times5-6-and%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    1 Answer
    1






    active

    oldest

    votes








    1 Answer
    1






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    For $f_2$,The usual euclidean product of sets may be a little confusing here.



    Try thinking of "$mathbb{Z}times[0,1)$" as the set "To each integer, assign an interval from 0 to 1." Then $f_2(x,t) = x+t$ is a bijection to $mathbb{R}$, where $xinmathbb{Z}$ is the integer part of some real number, and $tin[0,1)$ is the decimal part of that number.






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      For $f_2$,The usual euclidean product of sets may be a little confusing here.



      Try thinking of "$mathbb{Z}times[0,1)$" as the set "To each integer, assign an interval from 0 to 1." Then $f_2(x,t) = x+t$ is a bijection to $mathbb{R}$, where $xinmathbb{Z}$ is the integer part of some real number, and $tin[0,1)$ is the decimal part of that number.






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        For $f_2$,The usual euclidean product of sets may be a little confusing here.



        Try thinking of "$mathbb{Z}times[0,1)$" as the set "To each integer, assign an interval from 0 to 1." Then $f_2(x,t) = x+t$ is a bijection to $mathbb{R}$, where $xinmathbb{Z}$ is the integer part of some real number, and $tin[0,1)$ is the decimal part of that number.






        share|cite|improve this answer









        $endgroup$



        For $f_2$,The usual euclidean product of sets may be a little confusing here.



        Try thinking of "$mathbb{Z}times[0,1)$" as the set "To each integer, assign an interval from 0 to 1." Then $f_2(x,t) = x+t$ is a bijection to $mathbb{R}$, where $xinmathbb{Z}$ is the integer part of some real number, and $tin[0,1)$ is the decimal part of that number.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 8 '18 at 18:37









        Adam CartisanoAdam Cartisano

        1614




        1614






























            draft saved

            draft discarded




















































            Thanks for contributing an answer to Mathematics Stack Exchange!


            • Please be sure to answer the question. Provide details and share your research!

            But avoid



            • Asking for help, clarification, or responding to other answers.

            • Making statements based on opinion; back them up with references or personal experience.


            Use MathJax to format equations. MathJax reference.


            To learn more, see our tips on writing great answers.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3031268%2fconstruct-bijections-f-1-0-1-times2-3-rightarrow-0-2-times5-6-and%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown





















































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown

































            Required, but never shown














            Required, but never shown












            Required, but never shown







            Required, but never shown







            Popular posts from this blog

            Berounka

            Sphinx de Gizeh

            Different font size/position of beamer's navigation symbols template's content depending on regular/plain...