Prove $|A times A| geq |A|$











up vote
-2
down vote

favorite












For case 1, I proved that if $A$ is finite/countable, then $|Atimes A|$ is finite/countable. However, I don’t know how to proceed with showing $|Atimes A|geq|A|$. Specifically, I want to say for every $a_i$ in $A$, there is a corresponding $(a_i, a_k)$ in $|Atimes A|$ whose list is certainly greater than a single $a_i$ for a corresponding $i$. However, I was given a remark which states if $|A| geq |B|$, then there exists some $f:A to B$ that is onto. How would I show $f:|A times A|to|A|$ is onto?



Case 2 would be for $A$ is not countable.



enter image description here










share|cite|improve this question
























  • Please use the MathJax standard format and also wrtie down the problem and what you are doing or trying. As is, the problem will be closed shortly.
    – Will M.
    Nov 20 at 4:16










  • Hint: Assume $A$ is nonempty. Consider a specific $xin A$. Consider the set ${(a,x)~:~ain A}$ and how it compares to $A$ itself. Additional hint: $|Y|geq |X|$ if and only if there is some $Zsubseteq Y$ such that $|Z|=|X|$.
    – JMoravitz
    Nov 20 at 4:21

















up vote
-2
down vote

favorite












For case 1, I proved that if $A$ is finite/countable, then $|Atimes A|$ is finite/countable. However, I don’t know how to proceed with showing $|Atimes A|geq|A|$. Specifically, I want to say for every $a_i$ in $A$, there is a corresponding $(a_i, a_k)$ in $|Atimes A|$ whose list is certainly greater than a single $a_i$ for a corresponding $i$. However, I was given a remark which states if $|A| geq |B|$, then there exists some $f:A to B$ that is onto. How would I show $f:|A times A|to|A|$ is onto?



Case 2 would be for $A$ is not countable.



enter image description here










share|cite|improve this question
























  • Please use the MathJax standard format and also wrtie down the problem and what you are doing or trying. As is, the problem will be closed shortly.
    – Will M.
    Nov 20 at 4:16










  • Hint: Assume $A$ is nonempty. Consider a specific $xin A$. Consider the set ${(a,x)~:~ain A}$ and how it compares to $A$ itself. Additional hint: $|Y|geq |X|$ if and only if there is some $Zsubseteq Y$ such that $|Z|=|X|$.
    – JMoravitz
    Nov 20 at 4:21















up vote
-2
down vote

favorite









up vote
-2
down vote

favorite











For case 1, I proved that if $A$ is finite/countable, then $|Atimes A|$ is finite/countable. However, I don’t know how to proceed with showing $|Atimes A|geq|A|$. Specifically, I want to say for every $a_i$ in $A$, there is a corresponding $(a_i, a_k)$ in $|Atimes A|$ whose list is certainly greater than a single $a_i$ for a corresponding $i$. However, I was given a remark which states if $|A| geq |B|$, then there exists some $f:A to B$ that is onto. How would I show $f:|A times A|to|A|$ is onto?



Case 2 would be for $A$ is not countable.



enter image description here










share|cite|improve this question















For case 1, I proved that if $A$ is finite/countable, then $|Atimes A|$ is finite/countable. However, I don’t know how to proceed with showing $|Atimes A|geq|A|$. Specifically, I want to say for every $a_i$ in $A$, there is a corresponding $(a_i, a_k)$ in $|Atimes A|$ whose list is certainly greater than a single $a_i$ for a corresponding $i$. However, I was given a remark which states if $|A| geq |B|$, then there exists some $f:A to B$ that is onto. How would I show $f:|A times A|to|A|$ is onto?



Case 2 would be for $A$ is not countable.



enter image description here







discrete-mathematics proof-writing






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 20 at 4:29

























asked Nov 20 at 4:14









darylnak

156111




156111












  • Please use the MathJax standard format and also wrtie down the problem and what you are doing or trying. As is, the problem will be closed shortly.
    – Will M.
    Nov 20 at 4:16










  • Hint: Assume $A$ is nonempty. Consider a specific $xin A$. Consider the set ${(a,x)~:~ain A}$ and how it compares to $A$ itself. Additional hint: $|Y|geq |X|$ if and only if there is some $Zsubseteq Y$ such that $|Z|=|X|$.
    – JMoravitz
    Nov 20 at 4:21




















  • Please use the MathJax standard format and also wrtie down the problem and what you are doing or trying. As is, the problem will be closed shortly.
    – Will M.
    Nov 20 at 4:16










  • Hint: Assume $A$ is nonempty. Consider a specific $xin A$. Consider the set ${(a,x)~:~ain A}$ and how it compares to $A$ itself. Additional hint: $|Y|geq |X|$ if and only if there is some $Zsubseteq Y$ such that $|Z|=|X|$.
    – JMoravitz
    Nov 20 at 4:21


















Please use the MathJax standard format and also wrtie down the problem and what you are doing or trying. As is, the problem will be closed shortly.
– Will M.
Nov 20 at 4:16




Please use the MathJax standard format and also wrtie down the problem and what you are doing or trying. As is, the problem will be closed shortly.
– Will M.
Nov 20 at 4:16












Hint: Assume $A$ is nonempty. Consider a specific $xin A$. Consider the set ${(a,x)~:~ain A}$ and how it compares to $A$ itself. Additional hint: $|Y|geq |X|$ if and only if there is some $Zsubseteq Y$ such that $|Z|=|X|$.
– JMoravitz
Nov 20 at 4:21






Hint: Assume $A$ is nonempty. Consider a specific $xin A$. Consider the set ${(a,x)~:~ain A}$ and how it compares to $A$ itself. Additional hint: $|Y|geq |X|$ if and only if there is some $Zsubseteq Y$ such that $|Z|=|X|$.
– JMoravitz
Nov 20 at 4:21












1 Answer
1






active

oldest

votes

















up vote
1
down vote



accepted










To show that $f$ is onto, consider a sort of projection. For example, if



$$A = {1,2}$$



then



$$A times A = {(1,1);,;(1,2);,;(2,1);,;(2,2)}$$



We can define the function $f : Atimes A rightarrow A $ by



$$f(x,y)=x$$



Then $(1,1)$ and $(1,2)$ map to $1$, and $(2,1)$ and $(2,2)$ map to $2$. Thus, every element of $A$ has a preimage.



Can you see how this might prove $f$ is surjective in a more general case if $A$ is nonempty? (Or "onto," whichever terminology you prefer.) About the only nuance you would really need to consider for this would be $A = emptyset$, which you can handle separately and more trivially.






share|cite|improve this answer





















    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',
    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%2f3005926%2fprove-a-times-a-geq-a%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








    up vote
    1
    down vote



    accepted










    To show that $f$ is onto, consider a sort of projection. For example, if



    $$A = {1,2}$$



    then



    $$A times A = {(1,1);,;(1,2);,;(2,1);,;(2,2)}$$



    We can define the function $f : Atimes A rightarrow A $ by



    $$f(x,y)=x$$



    Then $(1,1)$ and $(1,2)$ map to $1$, and $(2,1)$ and $(2,2)$ map to $2$. Thus, every element of $A$ has a preimage.



    Can you see how this might prove $f$ is surjective in a more general case if $A$ is nonempty? (Or "onto," whichever terminology you prefer.) About the only nuance you would really need to consider for this would be $A = emptyset$, which you can handle separately and more trivially.






    share|cite|improve this answer

























      up vote
      1
      down vote



      accepted










      To show that $f$ is onto, consider a sort of projection. For example, if



      $$A = {1,2}$$



      then



      $$A times A = {(1,1);,;(1,2);,;(2,1);,;(2,2)}$$



      We can define the function $f : Atimes A rightarrow A $ by



      $$f(x,y)=x$$



      Then $(1,1)$ and $(1,2)$ map to $1$, and $(2,1)$ and $(2,2)$ map to $2$. Thus, every element of $A$ has a preimage.



      Can you see how this might prove $f$ is surjective in a more general case if $A$ is nonempty? (Or "onto," whichever terminology you prefer.) About the only nuance you would really need to consider for this would be $A = emptyset$, which you can handle separately and more trivially.






      share|cite|improve this answer























        up vote
        1
        down vote



        accepted







        up vote
        1
        down vote



        accepted






        To show that $f$ is onto, consider a sort of projection. For example, if



        $$A = {1,2}$$



        then



        $$A times A = {(1,1);,;(1,2);,;(2,1);,;(2,2)}$$



        We can define the function $f : Atimes A rightarrow A $ by



        $$f(x,y)=x$$



        Then $(1,1)$ and $(1,2)$ map to $1$, and $(2,1)$ and $(2,2)$ map to $2$. Thus, every element of $A$ has a preimage.



        Can you see how this might prove $f$ is surjective in a more general case if $A$ is nonempty? (Or "onto," whichever terminology you prefer.) About the only nuance you would really need to consider for this would be $A = emptyset$, which you can handle separately and more trivially.






        share|cite|improve this answer












        To show that $f$ is onto, consider a sort of projection. For example, if



        $$A = {1,2}$$



        then



        $$A times A = {(1,1);,;(1,2);,;(2,1);,;(2,2)}$$



        We can define the function $f : Atimes A rightarrow A $ by



        $$f(x,y)=x$$



        Then $(1,1)$ and $(1,2)$ map to $1$, and $(2,1)$ and $(2,2)$ map to $2$. Thus, every element of $A$ has a preimage.



        Can you see how this might prove $f$ is surjective in a more general case if $A$ is nonempty? (Or "onto," whichever terminology you prefer.) About the only nuance you would really need to consider for this would be $A = emptyset$, which you can handle separately and more trivially.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Nov 20 at 4:22









        Eevee Trainer

        1,839216




        1,839216






























            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.





            Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


            Please pay close attention to the following guidance:


            • 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.


            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%2f3005926%2fprove-a-times-a-geq-a%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

            Quarter-circle Tiles

            build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

            Mont Emei