Proof that a sequence is Cauchy.












4














Show that $left( x_{n}right) $ is a Cauchy sequence, where
$$
x_{n}=frac{sin1}{2}+frac{sin2}{2^{2}}+ldots+frac{sin n}{2^{n}}.
$$



We try to evaluate $leftvert x_{n+p}-x_{n}rightvert $ and to show that
this one is arbitrary small. So
begin{align*}
leftvert a_{n+p}-a_{n}rightvert & =leftvert frac{sinleft(
n+1right) }{2^{n+1}}+frac{sinleft( n+2right) }{2^{n+2}}+ldots
+frac{sinleft( n+pright) }{2^{n+p}}rightvert \
& leqfrac{1}{2^{n+1}}+frac{1}{2^{n+2}}+ldots+frac{1}{2^{n+p}}.
end{align*}
Now, $left( frac{1}{2^{n+j}}right) $ converge all to zero. Hence
$leftvert a_{n+p}-a_{n}rightvert rightarrow0$.
Does it work this argument according to the definition of Cauchy sequence
$$
forallvarepsilon>0,
quad
exists n_{varepsilon}in
mathbb{N}
,
quad
forall nin
mathbb{N}
,
quad
forall pin
mathbb{N}
:n,pgeq n_{varepsilon}Rightarrowleftvert a_{n+p}-a_{n}rightvert
<varepsilon?
$$
My question was born from the fact that for the sequence
$$
a_{n}=1+frac{1}{2}+ldots+frac{1}{n},
$$
we have that
begin{align*}
leftvert a_{n+p}-a_{n}rightvert & =leftvert frac{1}{n+1}+frac{1}{n+2}+ldots+frac{1}{n+p}rightvert \
& leqfrac{1}{n+1}+frac{1}{n+2}+ldots+frac{1}{n+p}
end{align*}
and also all sequences $left( frac{1}{n+j}right) _{n}$ converge to zero,
but this time $left( a_{n}right) $ is not a Cauchy sequence.






analysis







share|cite|improve this question




















  • 1




    the sequence converges, but not because of $frac{1}{2^{n}} to 0$ as $n to infty$. Use sum of G.P.
    – Offlaw
    Jan 4 at 14:16






  • 1




    an infinite sum of terms converging to zero may not converge to zero
    – Smilia
    Jan 4 at 14:16
















4














Show that $left( x_{n}right) $ is a Cauchy sequence, where
$$
x_{n}=frac{sin1}{2}+frac{sin2}{2^{2}}+ldots+frac{sin n}{2^{n}}.
$$



We try to evaluate $leftvert x_{n+p}-x_{n}rightvert $ and to show that
this one is arbitrary small. So
begin{align*}
leftvert a_{n+p}-a_{n}rightvert & =leftvert frac{sinleft(
n+1right) }{2^{n+1}}+frac{sinleft( n+2right) }{2^{n+2}}+ldots
+frac{sinleft( n+pright) }{2^{n+p}}rightvert \
& leqfrac{1}{2^{n+1}}+frac{1}{2^{n+2}}+ldots+frac{1}{2^{n+p}}.
end{align*}
Now, $left( frac{1}{2^{n+j}}right) $ converge all to zero. Hence
$leftvert a_{n+p}-a_{n}rightvert rightarrow0$.
Does it work this argument according to the definition of Cauchy sequence
$$
forallvarepsilon>0,
quad
exists n_{varepsilon}in
mathbb{N}
,
quad
forall nin
mathbb{N}
,
quad
forall pin
mathbb{N}
:n,pgeq n_{varepsilon}Rightarrowleftvert a_{n+p}-a_{n}rightvert
<varepsilon?
$$
My question was born from the fact that for the sequence
$$
a_{n}=1+frac{1}{2}+ldots+frac{1}{n},
$$
we have that
begin{align*}
leftvert a_{n+p}-a_{n}rightvert & =leftvert frac{1}{n+1}+frac{1}{n+2}+ldots+frac{1}{n+p}rightvert \
& leqfrac{1}{n+1}+frac{1}{n+2}+ldots+frac{1}{n+p}
end{align*}
and also all sequences $left( frac{1}{n+j}right) _{n}$ converge to zero,
but this time $left( a_{n}right) $ is not a Cauchy sequence.






analysis







share|cite|improve this question




















  • 1




    the sequence converges, but not because of $frac{1}{2^{n}} to 0$ as $n to infty$. Use sum of G.P.
    – Offlaw
    Jan 4 at 14:16






  • 1




    an infinite sum of terms converging to zero may not converge to zero
    – Smilia
    Jan 4 at 14:16














4












4








4


1





Show that $left( x_{n}right) $ is a Cauchy sequence, where
$$
x_{n}=frac{sin1}{2}+frac{sin2}{2^{2}}+ldots+frac{sin n}{2^{n}}.
$$



We try to evaluate $leftvert x_{n+p}-x_{n}rightvert $ and to show that
this one is arbitrary small. So
begin{align*}
leftvert a_{n+p}-a_{n}rightvert & =leftvert frac{sinleft(
n+1right) }{2^{n+1}}+frac{sinleft( n+2right) }{2^{n+2}}+ldots
+frac{sinleft( n+pright) }{2^{n+p}}rightvert \
& leqfrac{1}{2^{n+1}}+frac{1}{2^{n+2}}+ldots+frac{1}{2^{n+p}}.
end{align*}
Now, $left( frac{1}{2^{n+j}}right) $ converge all to zero. Hence
$leftvert a_{n+p}-a_{n}rightvert rightarrow0$.
Does it work this argument according to the definition of Cauchy sequence
$$
forallvarepsilon>0,
quad
exists n_{varepsilon}in
mathbb{N}
,
quad
forall nin
mathbb{N}
,
quad
forall pin
mathbb{N}
:n,pgeq n_{varepsilon}Rightarrowleftvert a_{n+p}-a_{n}rightvert
<varepsilon?
$$
My question was born from the fact that for the sequence
$$
a_{n}=1+frac{1}{2}+ldots+frac{1}{n},
$$
we have that
begin{align*}
leftvert a_{n+p}-a_{n}rightvert & =leftvert frac{1}{n+1}+frac{1}{n+2}+ldots+frac{1}{n+p}rightvert \
& leqfrac{1}{n+1}+frac{1}{n+2}+ldots+frac{1}{n+p}
end{align*}
and also all sequences $left( frac{1}{n+j}right) _{n}$ converge to zero,
but this time $left( a_{n}right) $ is not a Cauchy sequence.






analysis







share|cite|improve this question















Show that $left( x_{n}right) $ is a Cauchy sequence, where
$$
x_{n}=frac{sin1}{2}+frac{sin2}{2^{2}}+ldots+frac{sin n}{2^{n}}.
$$



We try to evaluate $leftvert x_{n+p}-x_{n}rightvert $ and to show that
this one is arbitrary small. So
begin{align*}
leftvert a_{n+p}-a_{n}rightvert & =leftvert frac{sinleft(
n+1right) }{2^{n+1}}+frac{sinleft( n+2right) }{2^{n+2}}+ldots
+frac{sinleft( n+pright) }{2^{n+p}}rightvert \
& leqfrac{1}{2^{n+1}}+frac{1}{2^{n+2}}+ldots+frac{1}{2^{n+p}}.
end{align*}
Now, $left( frac{1}{2^{n+j}}right) $ converge all to zero. Hence
$leftvert a_{n+p}-a_{n}rightvert rightarrow0$.
Does it work this argument according to the definition of Cauchy sequence
$$
forallvarepsilon>0,
quad
exists n_{varepsilon}in
mathbb{N}
,
quad
forall nin
mathbb{N}
,
quad
forall pin
mathbb{N}
:n,pgeq n_{varepsilon}Rightarrowleftvert a_{n+p}-a_{n}rightvert
<varepsilon?
$$
My question was born from the fact that for the sequence
$$
a_{n}=1+frac{1}{2}+ldots+frac{1}{n},
$$
we have that
begin{align*}
leftvert a_{n+p}-a_{n}rightvert & =leftvert frac{1}{n+1}+frac{1}{n+2}+ldots+frac{1}{n+p}rightvert \
& leqfrac{1}{n+1}+frac{1}{n+2}+ldots+frac{1}{n+p}
end{align*}
and also all sequences $left( frac{1}{n+j}right) _{n}$ converge to zero,
but this time $left( a_{n}right) $ is not a Cauchy sequence.






analysis




analysis






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 4 at 14:08







stefano

















asked Jan 4 at 13:59









stefanostefano

824




824








  • 1




    the sequence converges, but not because of $frac{1}{2^{n}} to 0$ as $n to infty$. Use sum of G.P.
    – Offlaw
    Jan 4 at 14:16






  • 1




    an infinite sum of terms converging to zero may not converge to zero
    – Smilia
    Jan 4 at 14:16














  • 1




    the sequence converges, but not because of $frac{1}{2^{n}} to 0$ as $n to infty$. Use sum of G.P.
    – Offlaw
    Jan 4 at 14:16






  • 1




    an infinite sum of terms converging to zero may not converge to zero
    – Smilia
    Jan 4 at 14:16








1




1




the sequence converges, but not because of $frac{1}{2^{n}} to 0$ as $n to infty$. Use sum of G.P.
– Offlaw
Jan 4 at 14:16




the sequence converges, but not because of $frac{1}{2^{n}} to 0$ as $n to infty$. Use sum of G.P.
– Offlaw
Jan 4 at 14:16




1




1




an infinite sum of terms converging to zero may not converge to zero
– Smilia
Jan 4 at 14:16




an infinite sum of terms converging to zero may not converge to zero
– Smilia
Jan 4 at 14:16










2 Answers
2






active

oldest

votes


















2














It is not sufficient that all $left( frac{1}{2^{n+j}}right)$ converge to zero. A correct argument would be that
$$
leftvert a_{n+p}-a_{n}rightvert le
frac{1}{2^{n+1}}+frac{1}{2^{n+2}}+ldots+frac{1}{2^{n+p}}
= frac{1}{2^{n}} left( frac 12 + frac 14 + ldots + frac{1}{2^{p}}right) < frac{1}{2^{n}}
$$
becomes arbitrary small for large $n$ and arbitrary $p$.



That won't work for the harmonic series.






share|cite|improve this answer





























    0














    A (quite silly) argument...



    $x_n$ is the partial sum of an absolutely converging real sequence. Hence $(x_n)$ converges and is Cauchy as $mathbb R$ is complete.






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


      }
      });














      draft saved

      draft discarded


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3061670%2fproof-that-a-sequence-is-cauchy%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









      2














      It is not sufficient that all $left( frac{1}{2^{n+j}}right)$ converge to zero. A correct argument would be that
      $$
      leftvert a_{n+p}-a_{n}rightvert le
      frac{1}{2^{n+1}}+frac{1}{2^{n+2}}+ldots+frac{1}{2^{n+p}}
      = frac{1}{2^{n}} left( frac 12 + frac 14 + ldots + frac{1}{2^{p}}right) < frac{1}{2^{n}}
      $$
      becomes arbitrary small for large $n$ and arbitrary $p$.



      That won't work for the harmonic series.






      share|cite|improve this answer


























        2














        It is not sufficient that all $left( frac{1}{2^{n+j}}right)$ converge to zero. A correct argument would be that
        $$
        leftvert a_{n+p}-a_{n}rightvert le
        frac{1}{2^{n+1}}+frac{1}{2^{n+2}}+ldots+frac{1}{2^{n+p}}
        = frac{1}{2^{n}} left( frac 12 + frac 14 + ldots + frac{1}{2^{p}}right) < frac{1}{2^{n}}
        $$
        becomes arbitrary small for large $n$ and arbitrary $p$.



        That won't work for the harmonic series.






        share|cite|improve this answer
























          2












          2








          2






          It is not sufficient that all $left( frac{1}{2^{n+j}}right)$ converge to zero. A correct argument would be that
          $$
          leftvert a_{n+p}-a_{n}rightvert le
          frac{1}{2^{n+1}}+frac{1}{2^{n+2}}+ldots+frac{1}{2^{n+p}}
          = frac{1}{2^{n}} left( frac 12 + frac 14 + ldots + frac{1}{2^{p}}right) < frac{1}{2^{n}}
          $$
          becomes arbitrary small for large $n$ and arbitrary $p$.



          That won't work for the harmonic series.






          share|cite|improve this answer












          It is not sufficient that all $left( frac{1}{2^{n+j}}right)$ converge to zero. A correct argument would be that
          $$
          leftvert a_{n+p}-a_{n}rightvert le
          frac{1}{2^{n+1}}+frac{1}{2^{n+2}}+ldots+frac{1}{2^{n+p}}
          = frac{1}{2^{n}} left( frac 12 + frac 14 + ldots + frac{1}{2^{p}}right) < frac{1}{2^{n}}
          $$
          becomes arbitrary small for large $n$ and arbitrary $p$.



          That won't work for the harmonic series.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 4 at 14:19









          Martin RMartin R

          27.3k33254




          27.3k33254























              0














              A (quite silly) argument...



              $x_n$ is the partial sum of an absolutely converging real sequence. Hence $(x_n)$ converges and is Cauchy as $mathbb R$ is complete.






              share|cite|improve this answer


























                0














                A (quite silly) argument...



                $x_n$ is the partial sum of an absolutely converging real sequence. Hence $(x_n)$ converges and is Cauchy as $mathbb R$ is complete.






                share|cite|improve this answer
























                  0












                  0








                  0






                  A (quite silly) argument...



                  $x_n$ is the partial sum of an absolutely converging real sequence. Hence $(x_n)$ converges and is Cauchy as $mathbb R$ is complete.






                  share|cite|improve this answer












                  A (quite silly) argument...



                  $x_n$ is the partial sum of an absolutely converging real sequence. Hence $(x_n)$ converges and is Cauchy as $mathbb R$ is complete.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Jan 4 at 14:14









                  mathcounterexamples.netmathcounterexamples.net

                  25.3k21953




                  25.3k21953






























                      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%2f3061670%2fproof-that-a-sequence-is-cauchy%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

                      1300-talet

                      Image
                      Den här artikeln handlar om hundraårsperioden 1300–1399. För decenniet 1300–1309, se 1300-talet (decennium). .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output ...
                      Read more

                      1300-talet

                      Image
                      Den här artikeln handlar om hundraårsperioden 1300–1399. För decenniet 1300–1309, se 1300-talet (decennium). .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output ...
                      Read more

                      Display a custom attribute below product name in the front-end Magento 1.9.3.8

                      Image
                      0 I need to display a custom attribute bellow the product name and I don't know how can I call this attribute. I am editing the file /app/design/frontend/templatemela/MAG100219_1/template/catalog/product/view.phtml But how can I call this attribute in php? I tried calling a string echo with the name I put in the attribute, but it didn't work. Code is as below: <div class="page-title product-title"> <h1><?php echo $_helper->productAttribute($_product, $_product->getName(), 'name') ?></h1> </div> <div class="codigoinmetro"> <h2><?php echo $_helper->productAttribute($_product, $_product->getName(), 'registroinmetro') ?></h2> </div> php attrib...
                      Read more