Prove $f[A] subseteq f[B] Rightarrow A ⊆ B$, given f is injective.












1














I have constructed a proof for the above question, but do not know where I must use the hypothesis of injectivity:



(Note: Let $X,Y$ be sets with $A,B ⊆ X$ and $f:X to Y $.)



Let $y∈f[A]$; then, there exists $a∈A$ s.t. $f(a) = y$. Since $f[A]⊆ f[B]$, then, we also have $y∈f[B]$ and so, $f(a)∈ f[B]$. We conclude $a∈B$. Thus, $a∈A Rightarrow a∈B$, so $A⊆B$.










share|cite|improve this question









New contributor




Julia Kim is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • You should write the question properly. What's $f,A,B$?
    – Yanko
    Jan 4 at 16:31






  • 1




    How do you conclude that $ain B$? That's where you should use injectivity
    – Exodd
    Jan 4 at 16:33






  • 1




    The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
    – Michael Burr
    Jan 4 at 16:40
















1














I have constructed a proof for the above question, but do not know where I must use the hypothesis of injectivity:



(Note: Let $X,Y$ be sets with $A,B ⊆ X$ and $f:X to Y $.)



Let $y∈f[A]$; then, there exists $a∈A$ s.t. $f(a) = y$. Since $f[A]⊆ f[B]$, then, we also have $y∈f[B]$ and so, $f(a)∈ f[B]$. We conclude $a∈B$. Thus, $a∈A Rightarrow a∈B$, so $A⊆B$.










share|cite|improve this question









New contributor




Julia Kim is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




















  • You should write the question properly. What's $f,A,B$?
    – Yanko
    Jan 4 at 16:31






  • 1




    How do you conclude that $ain B$? That's where you should use injectivity
    – Exodd
    Jan 4 at 16:33






  • 1




    The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
    – Michael Burr
    Jan 4 at 16:40














1












1








1







I have constructed a proof for the above question, but do not know where I must use the hypothesis of injectivity:



(Note: Let $X,Y$ be sets with $A,B ⊆ X$ and $f:X to Y $.)



Let $y∈f[A]$; then, there exists $a∈A$ s.t. $f(a) = y$. Since $f[A]⊆ f[B]$, then, we also have $y∈f[B]$ and so, $f(a)∈ f[B]$. We conclude $a∈B$. Thus, $a∈A Rightarrow a∈B$, so $A⊆B$.










share|cite|improve this question









New contributor




Julia Kim is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











I have constructed a proof for the above question, but do not know where I must use the hypothesis of injectivity:



(Note: Let $X,Y$ be sets with $A,B ⊆ X$ and $f:X to Y $.)



Let $y∈f[A]$; then, there exists $a∈A$ s.t. $f(a) = y$. Since $f[A]⊆ f[B]$, then, we also have $y∈f[B]$ and so, $f(a)∈ f[B]$. We conclude $a∈B$. Thus, $a∈A Rightarrow a∈B$, so $A⊆B$.







discrete-mathematics proof-verification elementary-set-theory






share|cite|improve this question









New contributor




Julia Kim is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|cite|improve this question









New contributor




Julia Kim is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|cite|improve this question




share|cite|improve this question








edited Jan 4 at 16:40









Foobaz John

21.4k41351




21.4k41351






New contributor




Julia Kim is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked Jan 4 at 16:29









Julia KimJulia Kim

83




83




New contributor




Julia Kim is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





Julia Kim is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






Julia Kim is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.












  • You should write the question properly. What's $f,A,B$?
    – Yanko
    Jan 4 at 16:31






  • 1




    How do you conclude that $ain B$? That's where you should use injectivity
    – Exodd
    Jan 4 at 16:33






  • 1




    The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
    – Michael Burr
    Jan 4 at 16:40


















  • You should write the question properly. What's $f,A,B$?
    – Yanko
    Jan 4 at 16:31






  • 1




    How do you conclude that $ain B$? That's where you should use injectivity
    – Exodd
    Jan 4 at 16:33






  • 1




    The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
    – Michael Burr
    Jan 4 at 16:40
















You should write the question properly. What's $f,A,B$?
– Yanko
Jan 4 at 16:31




You should write the question properly. What's $f,A,B$?
– Yanko
Jan 4 at 16:31




1




1




How do you conclude that $ain B$? That's where you should use injectivity
– Exodd
Jan 4 at 16:33




How do you conclude that $ain B$? That's where you should use injectivity
– Exodd
Jan 4 at 16:33




1




1




The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
– Michael Burr
Jan 4 at 16:40




The proof must be wrong as written since you never use the assumption of injectivity. That being said, you only need one sentence to fix this up.
– Michael Burr
Jan 4 at 16:40










2 Answers
2






active

oldest

votes


















3














Suppose that $xin A$. Then $y=f(x)in f(A)$ and because $f(A)subseteq f(B)$ we have that $yin f(B)$. So there exists $w$ in $B$ such that $f(w)=y=f(x)$. But $f$ is injective, whence $w=x$ and $xin B$ as desired.






share|cite|improve this answer





























    0














    Attempt:



    Assume $B subset A$ ($B$ proper subset of $A$).
    ($A$ $B not = emptyset$)



    There exists an $a in A$ $B.$



    $f(a) in f(A$ $B) subset f(A)$, i.e.



    $f(a) in f(A)$;



    since $f$ is injective: $f(a) not in f(B)$,



    contradicts the assumption $f(A)subset f(B).$






    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',
      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
      });


      }
      });






      Julia Kim is a new contributor. Be nice, and check out our Code of Conduct.










      draft saved

      draft discarded


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3061803%2fprove-fa-subseteq-fb-rightarrow-a-%25e2%258a%2586-b-given-f-is-injective%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      3














      Suppose that $xin A$. Then $y=f(x)in f(A)$ and because $f(A)subseteq f(B)$ we have that $yin f(B)$. So there exists $w$ in $B$ such that $f(w)=y=f(x)$. But $f$ is injective, whence $w=x$ and $xin B$ as desired.






      share|cite|improve this answer


























        3














        Suppose that $xin A$. Then $y=f(x)in f(A)$ and because $f(A)subseteq f(B)$ we have that $yin f(B)$. So there exists $w$ in $B$ such that $f(w)=y=f(x)$. But $f$ is injective, whence $w=x$ and $xin B$ as desired.






        share|cite|improve this answer
























          3












          3








          3






          Suppose that $xin A$. Then $y=f(x)in f(A)$ and because $f(A)subseteq f(B)$ we have that $yin f(B)$. So there exists $w$ in $B$ such that $f(w)=y=f(x)$. But $f$ is injective, whence $w=x$ and $xin B$ as desired.






          share|cite|improve this answer












          Suppose that $xin A$. Then $y=f(x)in f(A)$ and because $f(A)subseteq f(B)$ we have that $yin f(B)$. So there exists $w$ in $B$ such that $f(w)=y=f(x)$. But $f$ is injective, whence $w=x$ and $xin B$ as desired.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 4 at 16:39









          Foobaz JohnFoobaz John

          21.4k41351




          21.4k41351























              0














              Attempt:



              Assume $B subset A$ ($B$ proper subset of $A$).
              ($A$ $B not = emptyset$)



              There exists an $a in A$ $B.$



              $f(a) in f(A$ $B) subset f(A)$, i.e.



              $f(a) in f(A)$;



              since $f$ is injective: $f(a) not in f(B)$,



              contradicts the assumption $f(A)subset f(B).$






              share|cite|improve this answer


























                0














                Attempt:



                Assume $B subset A$ ($B$ proper subset of $A$).
                ($A$ $B not = emptyset$)



                There exists an $a in A$ $B.$



                $f(a) in f(A$ $B) subset f(A)$, i.e.



                $f(a) in f(A)$;



                since $f$ is injective: $f(a) not in f(B)$,



                contradicts the assumption $f(A)subset f(B).$






                share|cite|improve this answer
























                  0












                  0








                  0






                  Attempt:



                  Assume $B subset A$ ($B$ proper subset of $A$).
                  ($A$ $B not = emptyset$)



                  There exists an $a in A$ $B.$



                  $f(a) in f(A$ $B) subset f(A)$, i.e.



                  $f(a) in f(A)$;



                  since $f$ is injective: $f(a) not in f(B)$,



                  contradicts the assumption $f(A)subset f(B).$






                  share|cite|improve this answer












                  Attempt:



                  Assume $B subset A$ ($B$ proper subset of $A$).
                  ($A$ $B not = emptyset$)



                  There exists an $a in A$ $B.$



                  $f(a) in f(A$ $B) subset f(A)$, i.e.



                  $f(a) in f(A)$;



                  since $f$ is injective: $f(a) not in f(B)$,



                  contradicts the assumption $f(A)subset f(B).$







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 4 at 18:51









                  Peter SzilasPeter Szilas

                  10.9k2720




                  10.9k2720






















                      Julia Kim is a new contributor. Be nice, and check out our Code of Conduct.










                      draft saved

                      draft discarded


















                      Julia Kim is a new contributor. Be nice, and check out our Code of Conduct.













                      Julia Kim is a new contributor. Be nice, and check out our Code of Conduct.












                      Julia Kim is a new contributor. Be nice, and check out our Code of Conduct.
















                      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%2f3061803%2fprove-fa-subseteq-fb-rightarrow-a-%25e2%258a%2586-b-given-f-is-injective%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

                      An IMO inspired problem

                      Management

                      Investment