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
real-analysis
add a comment |
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
real-analysis
add a comment |
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
real-analysis
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
real-analysis
asked Nov 15 at 18:39
RM777
1158
1158
add a comment |
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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