Anderson’s exercise 8.3 on “generating and cogenerating”











up vote
1
down vote

favorite












I am reading “Anderson and Fuller - Rings and Categories of Modules (2nd edition, 1992)”
and I am trying to find a solution of exercise 8.3 on page 112, which says:



Let $M$ be a left $R$-module. Show that if $M$ cogenerates a generator, then $M$ is faithful.



So, $M$ cogenerates a generator, say $M$ cogenerates $X$ and $X$ is a generator, where $X$ is a left R-module.



(1) $M$ cogenerates $X$, by Corollary 8.13.(1) (page 109) the reject of $M$ in $X$ is zero, that is:



$$ Rej_X (M) = bigcap { ker(h) text{ | } h in Hom_R (X,M) } = 0 $$



(2) $X$ is a generator, this means that $X$ generates $_R R$, that is, $R$ as a left $R$-module.



Then, by Corollary 8.13.(2) (page 109) the trace of $X$ in $R$ equals $R$, that is:



$$ Tr_R (X) = sum { im(h) text{ | } h in Hom_R (X,R) } = R $$



(3) It follows that there are finitely many $f_i in Hom_R (X,R)$ and $x_i in X$, $i=1, 2, cdots ,n$ such that



$$1 = f_1 (x_1) + f_2 (x_2) + cdots + f_n(x_n)$$



( I do not know if we need this in the proof. )



(4) Proposition 8.22 on page 111 says that the annihilator of $M$ in $R$, that is:



$$ l_R (M) = { r in R text{ | } rM = 0 } $$



equals the reject of $M$ in $R$, that is:



$$ Rej_R (M) = bigcap { ker(h) text{ | } h in Hom_R (R,M) } $$



Thus



$$ l_R (M) = Rej_R (M) $$



(5) Now we have to show that M is faithful, that is, the annihilator is zero, that is,



$$ l_R (M) = Rej_R (M) = 0 $$



So, we have to prove that if $s in l_R (M) = Rej_R (M)$ then $s = 0$



Take $s in Rej_R (M) = cap { ker(h) text{ | } h in Hom_R (R,M) }$



Then, for all $ h in Hom_R (R,M)$ we have $h(s) = 0$



Also, because $ l_R (M) = Rej_R (M) = 0 $, we have $s in l_R (M)$



So, for all $m in M$ we have $sm = 0$



Take $x in X$



Then, for all $ h in Hom_R (X,M)$ we have $h(sx) = sh(x) = 0$, because $h(x) in M$



Thus, for all $ h in Hom_R (X,M)$, $sx in ker(h)$



Thus, by (1) above,



$sx in Rej_X (M) = cap { ker(h) text{ | } h in Hom_R (X,M) } = 0$



Therefore, $sx = 0$, for all $x in X$



So, $s in l_R (X) = Rej_R (X) = cap { ker(h) text{ | } h in Hom_R (R,X) } = 0$



Then, for all $ h in Hom_R (R,X)$ we have $h(s) = 0$



Now I am stuck and I do not know where I am heading to.
Can someone, please, help me to finish this proof ?










share|cite|improve this question


























    up vote
    1
    down vote

    favorite












    I am reading “Anderson and Fuller - Rings and Categories of Modules (2nd edition, 1992)”
    and I am trying to find a solution of exercise 8.3 on page 112, which says:



    Let $M$ be a left $R$-module. Show that if $M$ cogenerates a generator, then $M$ is faithful.



    So, $M$ cogenerates a generator, say $M$ cogenerates $X$ and $X$ is a generator, where $X$ is a left R-module.



    (1) $M$ cogenerates $X$, by Corollary 8.13.(1) (page 109) the reject of $M$ in $X$ is zero, that is:



    $$ Rej_X (M) = bigcap { ker(h) text{ | } h in Hom_R (X,M) } = 0 $$



    (2) $X$ is a generator, this means that $X$ generates $_R R$, that is, $R$ as a left $R$-module.



    Then, by Corollary 8.13.(2) (page 109) the trace of $X$ in $R$ equals $R$, that is:



    $$ Tr_R (X) = sum { im(h) text{ | } h in Hom_R (X,R) } = R $$



    (3) It follows that there are finitely many $f_i in Hom_R (X,R)$ and $x_i in X$, $i=1, 2, cdots ,n$ such that



    $$1 = f_1 (x_1) + f_2 (x_2) + cdots + f_n(x_n)$$



    ( I do not know if we need this in the proof. )



    (4) Proposition 8.22 on page 111 says that the annihilator of $M$ in $R$, that is:



    $$ l_R (M) = { r in R text{ | } rM = 0 } $$



    equals the reject of $M$ in $R$, that is:



    $$ Rej_R (M) = bigcap { ker(h) text{ | } h in Hom_R (R,M) } $$



    Thus



    $$ l_R (M) = Rej_R (M) $$



    (5) Now we have to show that M is faithful, that is, the annihilator is zero, that is,



    $$ l_R (M) = Rej_R (M) = 0 $$



    So, we have to prove that if $s in l_R (M) = Rej_R (M)$ then $s = 0$



    Take $s in Rej_R (M) = cap { ker(h) text{ | } h in Hom_R (R,M) }$



    Then, for all $ h in Hom_R (R,M)$ we have $h(s) = 0$



    Also, because $ l_R (M) = Rej_R (M) = 0 $, we have $s in l_R (M)$



    So, for all $m in M$ we have $sm = 0$



    Take $x in X$



    Then, for all $ h in Hom_R (X,M)$ we have $h(sx) = sh(x) = 0$, because $h(x) in M$



    Thus, for all $ h in Hom_R (X,M)$, $sx in ker(h)$



    Thus, by (1) above,



    $sx in Rej_X (M) = cap { ker(h) text{ | } h in Hom_R (X,M) } = 0$



    Therefore, $sx = 0$, for all $x in X$



    So, $s in l_R (X) = Rej_R (X) = cap { ker(h) text{ | } h in Hom_R (R,X) } = 0$



    Then, for all $ h in Hom_R (R,X)$ we have $h(s) = 0$



    Now I am stuck and I do not know where I am heading to.
    Can someone, please, help me to finish this proof ?










    share|cite|improve this question
























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      I am reading “Anderson and Fuller - Rings and Categories of Modules (2nd edition, 1992)”
      and I am trying to find a solution of exercise 8.3 on page 112, which says:



      Let $M$ be a left $R$-module. Show that if $M$ cogenerates a generator, then $M$ is faithful.



      So, $M$ cogenerates a generator, say $M$ cogenerates $X$ and $X$ is a generator, where $X$ is a left R-module.



      (1) $M$ cogenerates $X$, by Corollary 8.13.(1) (page 109) the reject of $M$ in $X$ is zero, that is:



      $$ Rej_X (M) = bigcap { ker(h) text{ | } h in Hom_R (X,M) } = 0 $$



      (2) $X$ is a generator, this means that $X$ generates $_R R$, that is, $R$ as a left $R$-module.



      Then, by Corollary 8.13.(2) (page 109) the trace of $X$ in $R$ equals $R$, that is:



      $$ Tr_R (X) = sum { im(h) text{ | } h in Hom_R (X,R) } = R $$



      (3) It follows that there are finitely many $f_i in Hom_R (X,R)$ and $x_i in X$, $i=1, 2, cdots ,n$ such that



      $$1 = f_1 (x_1) + f_2 (x_2) + cdots + f_n(x_n)$$



      ( I do not know if we need this in the proof. )



      (4) Proposition 8.22 on page 111 says that the annihilator of $M$ in $R$, that is:



      $$ l_R (M) = { r in R text{ | } rM = 0 } $$



      equals the reject of $M$ in $R$, that is:



      $$ Rej_R (M) = bigcap { ker(h) text{ | } h in Hom_R (R,M) } $$



      Thus



      $$ l_R (M) = Rej_R (M) $$



      (5) Now we have to show that M is faithful, that is, the annihilator is zero, that is,



      $$ l_R (M) = Rej_R (M) = 0 $$



      So, we have to prove that if $s in l_R (M) = Rej_R (M)$ then $s = 0$



      Take $s in Rej_R (M) = cap { ker(h) text{ | } h in Hom_R (R,M) }$



      Then, for all $ h in Hom_R (R,M)$ we have $h(s) = 0$



      Also, because $ l_R (M) = Rej_R (M) = 0 $, we have $s in l_R (M)$



      So, for all $m in M$ we have $sm = 0$



      Take $x in X$



      Then, for all $ h in Hom_R (X,M)$ we have $h(sx) = sh(x) = 0$, because $h(x) in M$



      Thus, for all $ h in Hom_R (X,M)$, $sx in ker(h)$



      Thus, by (1) above,



      $sx in Rej_X (M) = cap { ker(h) text{ | } h in Hom_R (X,M) } = 0$



      Therefore, $sx = 0$, for all $x in X$



      So, $s in l_R (X) = Rej_R (X) = cap { ker(h) text{ | } h in Hom_R (R,X) } = 0$



      Then, for all $ h in Hom_R (R,X)$ we have $h(s) = 0$



      Now I am stuck and I do not know where I am heading to.
      Can someone, please, help me to finish this proof ?










      share|cite|improve this question













      I am reading “Anderson and Fuller - Rings and Categories of Modules (2nd edition, 1992)”
      and I am trying to find a solution of exercise 8.3 on page 112, which says:



      Let $M$ be a left $R$-module. Show that if $M$ cogenerates a generator, then $M$ is faithful.



      So, $M$ cogenerates a generator, say $M$ cogenerates $X$ and $X$ is a generator, where $X$ is a left R-module.



      (1) $M$ cogenerates $X$, by Corollary 8.13.(1) (page 109) the reject of $M$ in $X$ is zero, that is:



      $$ Rej_X (M) = bigcap { ker(h) text{ | } h in Hom_R (X,M) } = 0 $$



      (2) $X$ is a generator, this means that $X$ generates $_R R$, that is, $R$ as a left $R$-module.



      Then, by Corollary 8.13.(2) (page 109) the trace of $X$ in $R$ equals $R$, that is:



      $$ Tr_R (X) = sum { im(h) text{ | } h in Hom_R (X,R) } = R $$



      (3) It follows that there are finitely many $f_i in Hom_R (X,R)$ and $x_i in X$, $i=1, 2, cdots ,n$ such that



      $$1 = f_1 (x_1) + f_2 (x_2) + cdots + f_n(x_n)$$



      ( I do not know if we need this in the proof. )



      (4) Proposition 8.22 on page 111 says that the annihilator of $M$ in $R$, that is:



      $$ l_R (M) = { r in R text{ | } rM = 0 } $$



      equals the reject of $M$ in $R$, that is:



      $$ Rej_R (M) = bigcap { ker(h) text{ | } h in Hom_R (R,M) } $$



      Thus



      $$ l_R (M) = Rej_R (M) $$



      (5) Now we have to show that M is faithful, that is, the annihilator is zero, that is,



      $$ l_R (M) = Rej_R (M) = 0 $$



      So, we have to prove that if $s in l_R (M) = Rej_R (M)$ then $s = 0$



      Take $s in Rej_R (M) = cap { ker(h) text{ | } h in Hom_R (R,M) }$



      Then, for all $ h in Hom_R (R,M)$ we have $h(s) = 0$



      Also, because $ l_R (M) = Rej_R (M) = 0 $, we have $s in l_R (M)$



      So, for all $m in M$ we have $sm = 0$



      Take $x in X$



      Then, for all $ h in Hom_R (X,M)$ we have $h(sx) = sh(x) = 0$, because $h(x) in M$



      Thus, for all $ h in Hom_R (X,M)$, $sx in ker(h)$



      Thus, by (1) above,



      $sx in Rej_X (M) = cap { ker(h) text{ | } h in Hom_R (X,M) } = 0$



      Therefore, $sx = 0$, for all $x in X$



      So, $s in l_R (X) = Rej_R (X) = cap { ker(h) text{ | } h in Hom_R (R,X) } = 0$



      Then, for all $ h in Hom_R (R,X)$ we have $h(s) = 0$



      Now I am stuck and I do not know where I am heading to.
      Can someone, please, help me to finish this proof ?







      abstract-algebra modules






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 14 at 19:09









      Steenis

      7917




      7917






















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          1
          down vote













          Saying that $M$ cogenerates a generator $G$ means that $G$ embeds in a direct product of copies of $M$. Indeed, since $operatorname{Rej}_G(M)=0$, if we take all homomorphisms $fcolon Gto M$, the natural map
          $$
          Gto M^{operatorname{Hom}_R(G,M)}
          $$

          defined by $xmapsto (f(x))_{finoperatorname{Hom}_R(G,M)}$ has zero kernel.



          If $r$ annihilates $M$, then it also annihilates $G$. Since a generator is necessarily faithful, then $r=0$. Therefore $M$ is faithful as well.



          Why is a generator $G$ faithful? Because $R$ (as a left $R$-module) is an epimorphic image of a direct sum of copies of $G$, thus any $r$ that annihilates $G$ has to annihilate $R$.






          share|cite|improve this answer





















          • Thank you for your answer. I am working on it, That will take a while.
            – Steenis
            Nov 15 at 12:15










          • I do understand your answer, thank you.
            – Steenis
            Nov 18 at 13:34










          • @Steenis When an answer is useful it should be upvoted so as to push it from the list of unanswered questions.
            – egreg
            Nov 18 at 16:43


















          up vote
          0
          down vote













          I found the answer in line of my argument in my original post,



          and I am embarrassed because I was so close and I did not see it.



          We proved $sx = 0$, for all $x in X$, and we have to show that $s=0$



          In (3) we found
          $$1 = f_1 (x_1) + f_2 (x_2) + cdots + f_n(x_n)$$
          So
          $$s = f_1 (s x_1) + f_2 (s x_2) + cdots + f_n(s x_n)$$



          Then, for each $i=1, 2, cdots ,n$: $ s x_i=0 $, because $x_i in X$ thus



          $$s = f_1 (0) + f_2 (0) + cdots + f_n(0) = 0$$



          Now, we are ready, because thie proves that $M$ is faithful






          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%2f2998692%2fanderson-s-exercise-8-3-on-generating-and-cogenerating%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








            up vote
            1
            down vote













            Saying that $M$ cogenerates a generator $G$ means that $G$ embeds in a direct product of copies of $M$. Indeed, since $operatorname{Rej}_G(M)=0$, if we take all homomorphisms $fcolon Gto M$, the natural map
            $$
            Gto M^{operatorname{Hom}_R(G,M)}
            $$

            defined by $xmapsto (f(x))_{finoperatorname{Hom}_R(G,M)}$ has zero kernel.



            If $r$ annihilates $M$, then it also annihilates $G$. Since a generator is necessarily faithful, then $r=0$. Therefore $M$ is faithful as well.



            Why is a generator $G$ faithful? Because $R$ (as a left $R$-module) is an epimorphic image of a direct sum of copies of $G$, thus any $r$ that annihilates $G$ has to annihilate $R$.






            share|cite|improve this answer





















            • Thank you for your answer. I am working on it, That will take a while.
              – Steenis
              Nov 15 at 12:15










            • I do understand your answer, thank you.
              – Steenis
              Nov 18 at 13:34










            • @Steenis When an answer is useful it should be upvoted so as to push it from the list of unanswered questions.
              – egreg
              Nov 18 at 16:43















            up vote
            1
            down vote













            Saying that $M$ cogenerates a generator $G$ means that $G$ embeds in a direct product of copies of $M$. Indeed, since $operatorname{Rej}_G(M)=0$, if we take all homomorphisms $fcolon Gto M$, the natural map
            $$
            Gto M^{operatorname{Hom}_R(G,M)}
            $$

            defined by $xmapsto (f(x))_{finoperatorname{Hom}_R(G,M)}$ has zero kernel.



            If $r$ annihilates $M$, then it also annihilates $G$. Since a generator is necessarily faithful, then $r=0$. Therefore $M$ is faithful as well.



            Why is a generator $G$ faithful? Because $R$ (as a left $R$-module) is an epimorphic image of a direct sum of copies of $G$, thus any $r$ that annihilates $G$ has to annihilate $R$.






            share|cite|improve this answer





















            • Thank you for your answer. I am working on it, That will take a while.
              – Steenis
              Nov 15 at 12:15










            • I do understand your answer, thank you.
              – Steenis
              Nov 18 at 13:34










            • @Steenis When an answer is useful it should be upvoted so as to push it from the list of unanswered questions.
              – egreg
              Nov 18 at 16:43













            up vote
            1
            down vote










            up vote
            1
            down vote









            Saying that $M$ cogenerates a generator $G$ means that $G$ embeds in a direct product of copies of $M$. Indeed, since $operatorname{Rej}_G(M)=0$, if we take all homomorphisms $fcolon Gto M$, the natural map
            $$
            Gto M^{operatorname{Hom}_R(G,M)}
            $$

            defined by $xmapsto (f(x))_{finoperatorname{Hom}_R(G,M)}$ has zero kernel.



            If $r$ annihilates $M$, then it also annihilates $G$. Since a generator is necessarily faithful, then $r=0$. Therefore $M$ is faithful as well.



            Why is a generator $G$ faithful? Because $R$ (as a left $R$-module) is an epimorphic image of a direct sum of copies of $G$, thus any $r$ that annihilates $G$ has to annihilate $R$.






            share|cite|improve this answer












            Saying that $M$ cogenerates a generator $G$ means that $G$ embeds in a direct product of copies of $M$. Indeed, since $operatorname{Rej}_G(M)=0$, if we take all homomorphisms $fcolon Gto M$, the natural map
            $$
            Gto M^{operatorname{Hom}_R(G,M)}
            $$

            defined by $xmapsto (f(x))_{finoperatorname{Hom}_R(G,M)}$ has zero kernel.



            If $r$ annihilates $M$, then it also annihilates $G$. Since a generator is necessarily faithful, then $r=0$. Therefore $M$ is faithful as well.



            Why is a generator $G$ faithful? Because $R$ (as a left $R$-module) is an epimorphic image of a direct sum of copies of $G$, thus any $r$ that annihilates $G$ has to annihilate $R$.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Nov 14 at 21:34









            egreg

            175k1383198




            175k1383198












            • Thank you for your answer. I am working on it, That will take a while.
              – Steenis
              Nov 15 at 12:15










            • I do understand your answer, thank you.
              – Steenis
              Nov 18 at 13:34










            • @Steenis When an answer is useful it should be upvoted so as to push it from the list of unanswered questions.
              – egreg
              Nov 18 at 16:43


















            • Thank you for your answer. I am working on it, That will take a while.
              – Steenis
              Nov 15 at 12:15










            • I do understand your answer, thank you.
              – Steenis
              Nov 18 at 13:34










            • @Steenis When an answer is useful it should be upvoted so as to push it from the list of unanswered questions.
              – egreg
              Nov 18 at 16:43
















            Thank you for your answer. I am working on it, That will take a while.
            – Steenis
            Nov 15 at 12:15




            Thank you for your answer. I am working on it, That will take a while.
            – Steenis
            Nov 15 at 12:15












            I do understand your answer, thank you.
            – Steenis
            Nov 18 at 13:34




            I do understand your answer, thank you.
            – Steenis
            Nov 18 at 13:34












            @Steenis When an answer is useful it should be upvoted so as to push it from the list of unanswered questions.
            – egreg
            Nov 18 at 16:43




            @Steenis When an answer is useful it should be upvoted so as to push it from the list of unanswered questions.
            – egreg
            Nov 18 at 16:43










            up vote
            0
            down vote













            I found the answer in line of my argument in my original post,



            and I am embarrassed because I was so close and I did not see it.



            We proved $sx = 0$, for all $x in X$, and we have to show that $s=0$



            In (3) we found
            $$1 = f_1 (x_1) + f_2 (x_2) + cdots + f_n(x_n)$$
            So
            $$s = f_1 (s x_1) + f_2 (s x_2) + cdots + f_n(s x_n)$$



            Then, for each $i=1, 2, cdots ,n$: $ s x_i=0 $, because $x_i in X$ thus



            $$s = f_1 (0) + f_2 (0) + cdots + f_n(0) = 0$$



            Now, we are ready, because thie proves that $M$ is faithful






            share|cite|improve this answer

























              up vote
              0
              down vote













              I found the answer in line of my argument in my original post,



              and I am embarrassed because I was so close and I did not see it.



              We proved $sx = 0$, for all $x in X$, and we have to show that $s=0$



              In (3) we found
              $$1 = f_1 (x_1) + f_2 (x_2) + cdots + f_n(x_n)$$
              So
              $$s = f_1 (s x_1) + f_2 (s x_2) + cdots + f_n(s x_n)$$



              Then, for each $i=1, 2, cdots ,n$: $ s x_i=0 $, because $x_i in X$ thus



              $$s = f_1 (0) + f_2 (0) + cdots + f_n(0) = 0$$



              Now, we are ready, because thie proves that $M$ is faithful






              share|cite|improve this answer























                up vote
                0
                down vote










                up vote
                0
                down vote









                I found the answer in line of my argument in my original post,



                and I am embarrassed because I was so close and I did not see it.



                We proved $sx = 0$, for all $x in X$, and we have to show that $s=0$



                In (3) we found
                $$1 = f_1 (x_1) + f_2 (x_2) + cdots + f_n(x_n)$$
                So
                $$s = f_1 (s x_1) + f_2 (s x_2) + cdots + f_n(s x_n)$$



                Then, for each $i=1, 2, cdots ,n$: $ s x_i=0 $, because $x_i in X$ thus



                $$s = f_1 (0) + f_2 (0) + cdots + f_n(0) = 0$$



                Now, we are ready, because thie proves that $M$ is faithful






                share|cite|improve this answer












                I found the answer in line of my argument in my original post,



                and I am embarrassed because I was so close and I did not see it.



                We proved $sx = 0$, for all $x in X$, and we have to show that $s=0$



                In (3) we found
                $$1 = f_1 (x_1) + f_2 (x_2) + cdots + f_n(x_n)$$
                So
                $$s = f_1 (s x_1) + f_2 (s x_2) + cdots + f_n(s x_n)$$



                Then, for each $i=1, 2, cdots ,n$: $ s x_i=0 $, because $x_i in X$ thus



                $$s = f_1 (0) + f_2 (0) + cdots + f_n(0) = 0$$



                Now, we are ready, because thie proves that $M$ is faithful







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 18 at 13:41









                Steenis

                7917




                7917






























                    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%2f2998692%2fanderson-s-exercise-8-3-on-generating-and-cogenerating%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

                    AnyDesk - Fatal Program Failure

                    How to calibrate 16:9 built-in touch-screen to a 4:3 resolution?

                    QoS: MAC-Priority for clients behind a repeater