Completion (construction Atiyah MacDonald chapter 10)











up vote
0
down vote

favorite












Following Atiyah MacDonald (Chapter 10: Completions), let $G$ be a topological abelian group. We assume that $0 in G$ has a fundamental system of neighborhoods consisting of subgroups $G = G_0 supseteq G_1 supseteq … supseteq G_n supseteq … $
Suppose $(x_k)$ is a Cauchy sequence in $G$.
Then it is claimed, that the image of $x_k$ in $G/G_n$ is ultimately constant. Why is this the case?










share|cite|improve this question


























    up vote
    0
    down vote

    favorite












    Following Atiyah MacDonald (Chapter 10: Completions), let $G$ be a topological abelian group. We assume that $0 in G$ has a fundamental system of neighborhoods consisting of subgroups $G = G_0 supseteq G_1 supseteq … supseteq G_n supseteq … $
    Suppose $(x_k)$ is a Cauchy sequence in $G$.
    Then it is claimed, that the image of $x_k$ in $G/G_n$ is ultimately constant. Why is this the case?










    share|cite|improve this question
























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      Following Atiyah MacDonald (Chapter 10: Completions), let $G$ be a topological abelian group. We assume that $0 in G$ has a fundamental system of neighborhoods consisting of subgroups $G = G_0 supseteq G_1 supseteq … supseteq G_n supseteq … $
      Suppose $(x_k)$ is a Cauchy sequence in $G$.
      Then it is claimed, that the image of $x_k$ in $G/G_n$ is ultimately constant. Why is this the case?










      share|cite|improve this question













      Following Atiyah MacDonald (Chapter 10: Completions), let $G$ be a topological abelian group. We assume that $0 in G$ has a fundamental system of neighborhoods consisting of subgroups $G = G_0 supseteq G_1 supseteq … supseteq G_n supseteq … $
      Suppose $(x_k)$ is a Cauchy sequence in $G$.
      Then it is claimed, that the image of $x_k$ in $G/G_n$ is ultimately constant. Why is this the case?







      commutative-algebra






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 14 at 18:49









      user573597

      103




      103






















          2 Answers
          2






          active

          oldest

          votes

















          up vote
          0
          down vote



          accepted










          Saying that $(x_n)$ is Cauchy means that, for every $k$, there exists $N$ such that, for $m,n>N$, $x_m-x_nin G_k$.



          Thus, for $m,n>N$, $x_m+G_k=x_n+G_k$. This is the same as saying that the image of $(x_n)$ in $G/G_k$ is eventually constant.






          share|cite|improve this answer




























            up vote
            0
            down vote













            Definition: A Cauchy sequence in $G$ is a sequence $(x_k)$ of elements of $G$ such that, for any neighborhood $U$ of $0$, there exists an integer $s(U)$ with the property that $x_m-x_l in U$ for all $m,l geq s(U)$.



            My idea:
            Let $phi: G rightarrow G/G_n$ denote the projection sending $x_k$ to $x_k +G_n$.

            Choose $U = G_n$ $Rightarrow x_m-x_l in G_n$ for all $m,l geq s(G_n)$



            $Rightarrow x_m+G_n = x_l +G_n$ for all $m,l geq s(G_n)$



            $Rightarrow phi(x_m) = phi(x_l)$ for all $m,l geq s(G_n)$



            $Rightarrow$ For all $r geq s(G_n)$ we have $phi(x_r) = lambda_n$






            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%2f2998670%2fcompletion-construction-atiyah-macdonald-chapter-10%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
              0
              down vote



              accepted










              Saying that $(x_n)$ is Cauchy means that, for every $k$, there exists $N$ such that, for $m,n>N$, $x_m-x_nin G_k$.



              Thus, for $m,n>N$, $x_m+G_k=x_n+G_k$. This is the same as saying that the image of $(x_n)$ in $G/G_k$ is eventually constant.






              share|cite|improve this answer

























                up vote
                0
                down vote



                accepted










                Saying that $(x_n)$ is Cauchy means that, for every $k$, there exists $N$ such that, for $m,n>N$, $x_m-x_nin G_k$.



                Thus, for $m,n>N$, $x_m+G_k=x_n+G_k$. This is the same as saying that the image of $(x_n)$ in $G/G_k$ is eventually constant.






                share|cite|improve this answer























                  up vote
                  0
                  down vote



                  accepted







                  up vote
                  0
                  down vote



                  accepted






                  Saying that $(x_n)$ is Cauchy means that, for every $k$, there exists $N$ such that, for $m,n>N$, $x_m-x_nin G_k$.



                  Thus, for $m,n>N$, $x_m+G_k=x_n+G_k$. This is the same as saying that the image of $(x_n)$ in $G/G_k$ is eventually constant.






                  share|cite|improve this answer












                  Saying that $(x_n)$ is Cauchy means that, for every $k$, there exists $N$ such that, for $m,n>N$, $x_m-x_nin G_k$.



                  Thus, for $m,n>N$, $x_m+G_k=x_n+G_k$. This is the same as saying that the image of $(x_n)$ in $G/G_k$ is eventually constant.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Nov 15 at 14:26









                  egreg

                  174k1383198




                  174k1383198






















                      up vote
                      0
                      down vote













                      Definition: A Cauchy sequence in $G$ is a sequence $(x_k)$ of elements of $G$ such that, for any neighborhood $U$ of $0$, there exists an integer $s(U)$ with the property that $x_m-x_l in U$ for all $m,l geq s(U)$.



                      My idea:
                      Let $phi: G rightarrow G/G_n$ denote the projection sending $x_k$ to $x_k +G_n$.

                      Choose $U = G_n$ $Rightarrow x_m-x_l in G_n$ for all $m,l geq s(G_n)$



                      $Rightarrow x_m+G_n = x_l +G_n$ for all $m,l geq s(G_n)$



                      $Rightarrow phi(x_m) = phi(x_l)$ for all $m,l geq s(G_n)$



                      $Rightarrow$ For all $r geq s(G_n)$ we have $phi(x_r) = lambda_n$






                      share|cite|improve this answer

























                        up vote
                        0
                        down vote













                        Definition: A Cauchy sequence in $G$ is a sequence $(x_k)$ of elements of $G$ such that, for any neighborhood $U$ of $0$, there exists an integer $s(U)$ with the property that $x_m-x_l in U$ for all $m,l geq s(U)$.



                        My idea:
                        Let $phi: G rightarrow G/G_n$ denote the projection sending $x_k$ to $x_k +G_n$.

                        Choose $U = G_n$ $Rightarrow x_m-x_l in G_n$ for all $m,l geq s(G_n)$



                        $Rightarrow x_m+G_n = x_l +G_n$ for all $m,l geq s(G_n)$



                        $Rightarrow phi(x_m) = phi(x_l)$ for all $m,l geq s(G_n)$



                        $Rightarrow$ For all $r geq s(G_n)$ we have $phi(x_r) = lambda_n$






                        share|cite|improve this answer























                          up vote
                          0
                          down vote










                          up vote
                          0
                          down vote









                          Definition: A Cauchy sequence in $G$ is a sequence $(x_k)$ of elements of $G$ such that, for any neighborhood $U$ of $0$, there exists an integer $s(U)$ with the property that $x_m-x_l in U$ for all $m,l geq s(U)$.



                          My idea:
                          Let $phi: G rightarrow G/G_n$ denote the projection sending $x_k$ to $x_k +G_n$.

                          Choose $U = G_n$ $Rightarrow x_m-x_l in G_n$ for all $m,l geq s(G_n)$



                          $Rightarrow x_m+G_n = x_l +G_n$ for all $m,l geq s(G_n)$



                          $Rightarrow phi(x_m) = phi(x_l)$ for all $m,l geq s(G_n)$



                          $Rightarrow$ For all $r geq s(G_n)$ we have $phi(x_r) = lambda_n$






                          share|cite|improve this answer












                          Definition: A Cauchy sequence in $G$ is a sequence $(x_k)$ of elements of $G$ such that, for any neighborhood $U$ of $0$, there exists an integer $s(U)$ with the property that $x_m-x_l in U$ for all $m,l geq s(U)$.



                          My idea:
                          Let $phi: G rightarrow G/G_n$ denote the projection sending $x_k$ to $x_k +G_n$.

                          Choose $U = G_n$ $Rightarrow x_m-x_l in G_n$ for all $m,l geq s(G_n)$



                          $Rightarrow x_m+G_n = x_l +G_n$ for all $m,l geq s(G_n)$



                          $Rightarrow phi(x_m) = phi(x_l)$ for all $m,l geq s(G_n)$



                          $Rightarrow$ For all $r geq s(G_n)$ we have $phi(x_r) = lambda_n$







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Nov 15 at 14:06









                          user573597

                          103




                          103






























                               

                              draft saved


                              draft discarded



















































                               


                              draft saved


                              draft discarded














                              StackExchange.ready(
                              function () {
                              StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2998670%2fcompletion-construction-atiyah-macdonald-chapter-10%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

                              How to change which sound is reproduced for terminal bell?

                              Can I use Tabulator js library in my java Spring + Thymeleaf project?

                              Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents