Contradictionproof Archimedian Property











up vote
0
down vote

favorite












I don't understand the contradiction we have assumed that $ exists xin mathbb{R}: 2^n < x ,forall n in mathbb{N}$ therefor the first convergence must be true but the author said that it must converge to 0.



5.25 Theorem (Archimedean property 1.) Let $mbox{ R}$ be a real field, and let $xinmbox{ R}$. Then there is an integer $ninmbox{ N}$ such that $n>x$.



Proof: Let $xinmbox{ R}$, and suppose (in order to get a contradiction) that there is no $ninmbox{N}$ with $n>x$. Then $xgeq n$ for all $n$. Now $displaystyle { left{ left[ 0,{xover {2^n}}right]right}}$ is a binary search sequence in $mbox{ R}$. Since $xgeq 2^n$, I have $displaystyle { 1leq {xover {2^n}}}$ for all $ninmbox{N}$. We see that $displaystyle { left{left[ 0,{xover {2^n}}right]right}to 1}$, but clearly $displaystyle { left{left[ 0,{xover {2^n}}right]right}to 0}$. Since completeness of $mbox{R}$ implies that a binary search sequence has a unique limit, this yields a contradiction, and proves the theorem. $mbox{ $mid!mid!mid$}$



Source:http://people.reed.edu/~mayer/math112.html/html1/node32.html










share|cite|improve this question


























    up vote
    0
    down vote

    favorite












    I don't understand the contradiction we have assumed that $ exists xin mathbb{R}: 2^n < x ,forall n in mathbb{N}$ therefor the first convergence must be true but the author said that it must converge to 0.



    5.25 Theorem (Archimedean property 1.) Let $mbox{ R}$ be a real field, and let $xinmbox{ R}$. Then there is an integer $ninmbox{ N}$ such that $n>x$.



    Proof: Let $xinmbox{ R}$, and suppose (in order to get a contradiction) that there is no $ninmbox{N}$ with $n>x$. Then $xgeq n$ for all $n$. Now $displaystyle { left{ left[ 0,{xover {2^n}}right]right}}$ is a binary search sequence in $mbox{ R}$. Since $xgeq 2^n$, I have $displaystyle { 1leq {xover {2^n}}}$ for all $ninmbox{N}$. We see that $displaystyle { left{left[ 0,{xover {2^n}}right]right}to 1}$, but clearly $displaystyle { left{left[ 0,{xover {2^n}}right]right}to 0}$. Since completeness of $mbox{R}$ implies that a binary search sequence has a unique limit, this yields a contradiction, and proves the theorem. $mbox{ $mid!mid!mid$}$



    Source:http://people.reed.edu/~mayer/math112.html/html1/node32.html










    share|cite|improve this question
























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      I don't understand the contradiction we have assumed that $ exists xin mathbb{R}: 2^n < x ,forall n in mathbb{N}$ therefor the first convergence must be true but the author said that it must converge to 0.



      5.25 Theorem (Archimedean property 1.) Let $mbox{ R}$ be a real field, and let $xinmbox{ R}$. Then there is an integer $ninmbox{ N}$ such that $n>x$.



      Proof: Let $xinmbox{ R}$, and suppose (in order to get a contradiction) that there is no $ninmbox{N}$ with $n>x$. Then $xgeq n$ for all $n$. Now $displaystyle { left{ left[ 0,{xover {2^n}}right]right}}$ is a binary search sequence in $mbox{ R}$. Since $xgeq 2^n$, I have $displaystyle { 1leq {xover {2^n}}}$ for all $ninmbox{N}$. We see that $displaystyle { left{left[ 0,{xover {2^n}}right]right}to 1}$, but clearly $displaystyle { left{left[ 0,{xover {2^n}}right]right}to 0}$. Since completeness of $mbox{R}$ implies that a binary search sequence has a unique limit, this yields a contradiction, and proves the theorem. $mbox{ $mid!mid!mid$}$



      Source:http://people.reed.edu/~mayer/math112.html/html1/node32.html










      share|cite|improve this question













      I don't understand the contradiction we have assumed that $ exists xin mathbb{R}: 2^n < x ,forall n in mathbb{N}$ therefor the first convergence must be true but the author said that it must converge to 0.



      5.25 Theorem (Archimedean property 1.) Let $mbox{ R}$ be a real field, and let $xinmbox{ R}$. Then there is an integer $ninmbox{ N}$ such that $n>x$.



      Proof: Let $xinmbox{ R}$, and suppose (in order to get a contradiction) that there is no $ninmbox{N}$ with $n>x$. Then $xgeq n$ for all $n$. Now $displaystyle { left{ left[ 0,{xover {2^n}}right]right}}$ is a binary search sequence in $mbox{ R}$. Since $xgeq 2^n$, I have $displaystyle { 1leq {xover {2^n}}}$ for all $ninmbox{N}$. We see that $displaystyle { left{left[ 0,{xover {2^n}}right]right}to 1}$, but clearly $displaystyle { left{left[ 0,{xover {2^n}}right]right}to 0}$. Since completeness of $mbox{R}$ implies that a binary search sequence has a unique limit, this yields a contradiction, and proves the theorem. $mbox{ $mid!mid!mid$}$



      Source:http://people.reed.edu/~mayer/math112.html/html1/node32.html







      real-analysis






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 15 at 18:39









      RM777

      1158




      1158



























          active

          oldest

          votes











          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%2f3000095%2fcontradictionproof-archimedian-property%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown






























          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          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%2f3000095%2fcontradictionproof-archimedian-property%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?

          Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

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