Using Archimedian property to prove that infimum of set is $0$Proof that the infimum of a given set $E$ is uniqueQuick question about Archimedian propertyFinding the infimum of a set of real numbersInfimum of $S = x, y in mathbbN$ using archimedean propertyRigorously proving infimum of a set.Approximation Property for InfimumIf $A$ is an ordered set has the Least upper bound property iff it has the greatest lower bound property.Proof of least upper bound and greatest lower bound property of an ordered setProving an infimum using the archimedean property of RTo prove that $ cap_n=1^infty (0 , frac1n) = emptyset $
XeLaTeX and pdfLaTeX ignore hyphenation
Is there a familial term for apples and pears?
Suffixes -unt and -ut-
Is there really no realistic way for a skeleton monster to move around without magic?
Has the BBC provided arguments for saying Brexit being cancelled is unlikely?
How much RAM could one put in a typical 80386 setup?
DOS, create pipe for stdin/stdout of command.com(or 4dos.com) in C or Batch?
Prevent a directory in /tmp from being deleted
How is it possible to have an ability score that is less than 3?
Why is the design of haulage companies so “special”?
A function which translates a sentence to title-case
Is the month field really deprecated?
"which" command doesn't work / path of Safari?
Representing power series as a function - what to do with the constant after integration?
Underlining section titles
What is the command to reset a PC without deleting any files
Why Is Death Allowed In the Matrix?
How can I hide my bitcoin transactions to protect anonymity from others?
How can bays and straits be determined in a procedurally generated map?
The use of multiple foreign keys on same column in SQL Server
How to get the available space of $HOME as a variable in shell scripting?
Why can't I see bouncing of a switch on an oscilloscope?
What typically incentivizes a professor to change jobs to a lower ranking university?
If Manufacturer spice model and Datasheet give different values which should I use?
Using Archimedian property to prove that infimum of set is $0$
Proof that the infimum of a given set $E$ is uniqueQuick question about Archimedian propertyFinding the infimum of a set of real numbersInfimum of $S = fracx2^y $ using archimedean propertyRigorously proving infimum of a set.Approximation Property for InfimumIf $A$ is an ordered set has the Least upper bound property iff it has the greatest lower bound property.Proof of least upper bound and greatest lower bound property of an ordered setProving an infimum using the archimedean property of RTo prove that $ cap_n=1^infty (0 , frac1n) = emptyset $
$begingroup$
Given set A = [ $frac1n | n in mathbbN$]
It seems to me i have to prove two things :
- $frac1n geq 0 , forall n in mathbbN$
2, Assuming $b$ be another lower bound , and so $b leq 0$
Work :
1 Now $frac1n geq 0 , forall n in N$
Also $n geq 1$
So $frac1n leq 1$ . But $frac1n in R^+$. So, $0 < frac1n leq
1$
- Assume that $b > 0$
so by Archimedian property $exists n in mathbbN$
such that $frac1n < b$ which is contradiction to the fact that b is lower bound for the set
Is this correct ?
real-analysis proof-verification self-learning
$endgroup$
add a comment |
$begingroup$
Given set A = [ $frac1n | n in mathbbN$]
It seems to me i have to prove two things :
- $frac1n geq 0 , forall n in mathbbN$
2, Assuming $b$ be another lower bound , and so $b leq 0$
Work :
1 Now $frac1n geq 0 , forall n in N$
Also $n geq 1$
So $frac1n leq 1$ . But $frac1n in R^+$. So, $0 < frac1n leq
1$
- Assume that $b > 0$
so by Archimedian property $exists n in mathbbN$
such that $frac1n < b$ which is contradiction to the fact that b is lower bound for the set
Is this correct ?
real-analysis proof-verification self-learning
$endgroup$
add a comment |
$begingroup$
Given set A = [ $frac1n | n in mathbbN$]
It seems to me i have to prove two things :
- $frac1n geq 0 , forall n in mathbbN$
2, Assuming $b$ be another lower bound , and so $b leq 0$
Work :
1 Now $frac1n geq 0 , forall n in N$
Also $n geq 1$
So $frac1n leq 1$ . But $frac1n in R^+$. So, $0 < frac1n leq
1$
- Assume that $b > 0$
so by Archimedian property $exists n in mathbbN$
such that $frac1n < b$ which is contradiction to the fact that b is lower bound for the set
Is this correct ?
real-analysis proof-verification self-learning
$endgroup$
Given set A = [ $frac1n | n in mathbbN$]
It seems to me i have to prove two things :
- $frac1n geq 0 , forall n in mathbbN$
2, Assuming $b$ be another lower bound , and so $b leq 0$
Work :
1 Now $frac1n geq 0 , forall n in N$
Also $n geq 1$
So $frac1n leq 1$ . But $frac1n in R^+$. So, $0 < frac1n leq
1$
- Assume that $b > 0$
so by Archimedian property $exists n in mathbbN$
such that $frac1n < b$ which is contradiction to the fact that b is lower bound for the set
Is this correct ?
real-analysis proof-verification self-learning
real-analysis proof-verification self-learning
edited Mar 22 at 9:04
J. Deff
asked Mar 22 at 8:04
J. DeffJ. Deff
717519
717519
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
$begingroup$
$0$ is a lower bound, $ 1/n >0$, $n in mathbbZ^+$.
Assume $b >0$, real, is a lower bound.
Archimedean principle:
There is a $n_0 in mathbbZ^+$ s.t.
$n_0 >1/b$, i.e.
$b > 1/n_0$, a contradiction(Why?).
Hence $inf (A)=0$.
$endgroup$
$begingroup$
please check my attempt
$endgroup$
– J. Deff
Mar 22 at 8:42
$begingroup$
J.Deff.I 1/n >0, 0 is a lower bound.Ok?To show that 0 is the greatest lower bound you assume a lower bound b that is bigger. 0< 1/n, and assuming it is not the greatesower bound you pick b >0 , and contradict.You choose b<0, a smaller lower bound. b <0 <1/n automatically.Let me know.
$endgroup$
– Peter Szilas
Mar 22 at 8:50
$begingroup$
Check my proof now please and let me know
$endgroup$
– J. Deff
Mar 22 at 9:09
$begingroup$
Deff.You got it. I would put in an extra line, Archimedean principle: There is a n >1/b ( real).Then b >1/n, i.e. a little more explicit on the Arch.principle.
$endgroup$
– Peter Szilas
Mar 22 at 9:16
add a comment |
$begingroup$
Observe that 0 is a lower bound of $frac1n$
Archimedian property- if $x > 0 $ then there exists $n epsilon mathbbR $ such that $nx > y; x,y epsilon mathbbR$. Set $x = epsilon$ and $y=1$ $$ epsilon > frac1n forall epsilon > 0$$ . Hence infimum of $frac1n $ is $0$ .
$endgroup$
$begingroup$
I dont understand this version of archimedian property.I have following version which is :...Given there is any rela number b then there exists some natural number n such that $n > b$
$endgroup$
– J. Deff
Mar 22 at 8:31
$begingroup$
Just search archimedian property for real nos. on Google. You'll get this version of archimedian property.
$endgroup$
– Prakhar Neema
Mar 22 at 8:45
add a comment |
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
);
);
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%2f3157870%2fusing-archimedian-property-to-prove-that-infimum-of-set-is-0%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
$begingroup$
$0$ is a lower bound, $ 1/n >0$, $n in mathbbZ^+$.
Assume $b >0$, real, is a lower bound.
Archimedean principle:
There is a $n_0 in mathbbZ^+$ s.t.
$n_0 >1/b$, i.e.
$b > 1/n_0$, a contradiction(Why?).
Hence $inf (A)=0$.
$endgroup$
$begingroup$
please check my attempt
$endgroup$
– J. Deff
Mar 22 at 8:42
$begingroup$
J.Deff.I 1/n >0, 0 is a lower bound.Ok?To show that 0 is the greatest lower bound you assume a lower bound b that is bigger. 0< 1/n, and assuming it is not the greatesower bound you pick b >0 , and contradict.You choose b<0, a smaller lower bound. b <0 <1/n automatically.Let me know.
$endgroup$
– Peter Szilas
Mar 22 at 8:50
$begingroup$
Check my proof now please and let me know
$endgroup$
– J. Deff
Mar 22 at 9:09
$begingroup$
Deff.You got it. I would put in an extra line, Archimedean principle: There is a n >1/b ( real).Then b >1/n, i.e. a little more explicit on the Arch.principle.
$endgroup$
– Peter Szilas
Mar 22 at 9:16
add a comment |
$begingroup$
$0$ is a lower bound, $ 1/n >0$, $n in mathbbZ^+$.
Assume $b >0$, real, is a lower bound.
Archimedean principle:
There is a $n_0 in mathbbZ^+$ s.t.
$n_0 >1/b$, i.e.
$b > 1/n_0$, a contradiction(Why?).
Hence $inf (A)=0$.
$endgroup$
$begingroup$
please check my attempt
$endgroup$
– J. Deff
Mar 22 at 8:42
$begingroup$
J.Deff.I 1/n >0, 0 is a lower bound.Ok?To show that 0 is the greatest lower bound you assume a lower bound b that is bigger. 0< 1/n, and assuming it is not the greatesower bound you pick b >0 , and contradict.You choose b<0, a smaller lower bound. b <0 <1/n automatically.Let me know.
$endgroup$
– Peter Szilas
Mar 22 at 8:50
$begingroup$
Check my proof now please and let me know
$endgroup$
– J. Deff
Mar 22 at 9:09
$begingroup$
Deff.You got it. I would put in an extra line, Archimedean principle: There is a n >1/b ( real).Then b >1/n, i.e. a little more explicit on the Arch.principle.
$endgroup$
– Peter Szilas
Mar 22 at 9:16
add a comment |
$begingroup$
$0$ is a lower bound, $ 1/n >0$, $n in mathbbZ^+$.
Assume $b >0$, real, is a lower bound.
Archimedean principle:
There is a $n_0 in mathbbZ^+$ s.t.
$n_0 >1/b$, i.e.
$b > 1/n_0$, a contradiction(Why?).
Hence $inf (A)=0$.
$endgroup$
$0$ is a lower bound, $ 1/n >0$, $n in mathbbZ^+$.
Assume $b >0$, real, is a lower bound.
Archimedean principle:
There is a $n_0 in mathbbZ^+$ s.t.
$n_0 >1/b$, i.e.
$b > 1/n_0$, a contradiction(Why?).
Hence $inf (A)=0$.
edited Mar 22 at 8:43
answered Mar 22 at 8:37
Peter SzilasPeter Szilas
11.8k2822
11.8k2822
$begingroup$
please check my attempt
$endgroup$
– J. Deff
Mar 22 at 8:42
$begingroup$
J.Deff.I 1/n >0, 0 is a lower bound.Ok?To show that 0 is the greatest lower bound you assume a lower bound b that is bigger. 0< 1/n, and assuming it is not the greatesower bound you pick b >0 , and contradict.You choose b<0, a smaller lower bound. b <0 <1/n automatically.Let me know.
$endgroup$
– Peter Szilas
Mar 22 at 8:50
$begingroup$
Check my proof now please and let me know
$endgroup$
– J. Deff
Mar 22 at 9:09
$begingroup$
Deff.You got it. I would put in an extra line, Archimedean principle: There is a n >1/b ( real).Then b >1/n, i.e. a little more explicit on the Arch.principle.
$endgroup$
– Peter Szilas
Mar 22 at 9:16
add a comment |
$begingroup$
please check my attempt
$endgroup$
– J. Deff
Mar 22 at 8:42
$begingroup$
J.Deff.I 1/n >0, 0 is a lower bound.Ok?To show that 0 is the greatest lower bound you assume a lower bound b that is bigger. 0< 1/n, and assuming it is not the greatesower bound you pick b >0 , and contradict.You choose b<0, a smaller lower bound. b <0 <1/n automatically.Let me know.
$endgroup$
– Peter Szilas
Mar 22 at 8:50
$begingroup$
Check my proof now please and let me know
$endgroup$
– J. Deff
Mar 22 at 9:09
$begingroup$
Deff.You got it. I would put in an extra line, Archimedean principle: There is a n >1/b ( real).Then b >1/n, i.e. a little more explicit on the Arch.principle.
$endgroup$
– Peter Szilas
Mar 22 at 9:16
$begingroup$
please check my attempt
$endgroup$
– J. Deff
Mar 22 at 8:42
$begingroup$
please check my attempt
$endgroup$
– J. Deff
Mar 22 at 8:42
$begingroup$
J.Deff.I 1/n >0, 0 is a lower bound.Ok?To show that 0 is the greatest lower bound you assume a lower bound b that is bigger. 0< 1/n, and assuming it is not the greatesower bound you pick b >0 , and contradict.You choose b<0, a smaller lower bound. b <0 <1/n automatically.Let me know.
$endgroup$
– Peter Szilas
Mar 22 at 8:50
$begingroup$
J.Deff.I 1/n >0, 0 is a lower bound.Ok?To show that 0 is the greatest lower bound you assume a lower bound b that is bigger. 0< 1/n, and assuming it is not the greatesower bound you pick b >0 , and contradict.You choose b<0, a smaller lower bound. b <0 <1/n automatically.Let me know.
$endgroup$
– Peter Szilas
Mar 22 at 8:50
$begingroup$
Check my proof now please and let me know
$endgroup$
– J. Deff
Mar 22 at 9:09
$begingroup$
Check my proof now please and let me know
$endgroup$
– J. Deff
Mar 22 at 9:09
$begingroup$
Deff.You got it. I would put in an extra line, Archimedean principle: There is a n >1/b ( real).Then b >1/n, i.e. a little more explicit on the Arch.principle.
$endgroup$
– Peter Szilas
Mar 22 at 9:16
$begingroup$
Deff.You got it. I would put in an extra line, Archimedean principle: There is a n >1/b ( real).Then b >1/n, i.e. a little more explicit on the Arch.principle.
$endgroup$
– Peter Szilas
Mar 22 at 9:16
add a comment |
$begingroup$
Observe that 0 is a lower bound of $frac1n$
Archimedian property- if $x > 0 $ then there exists $n epsilon mathbbR $ such that $nx > y; x,y epsilon mathbbR$. Set $x = epsilon$ and $y=1$ $$ epsilon > frac1n forall epsilon > 0$$ . Hence infimum of $frac1n $ is $0$ .
$endgroup$
$begingroup$
I dont understand this version of archimedian property.I have following version which is :...Given there is any rela number b then there exists some natural number n such that $n > b$
$endgroup$
– J. Deff
Mar 22 at 8:31
$begingroup$
Just search archimedian property for real nos. on Google. You'll get this version of archimedian property.
$endgroup$
– Prakhar Neema
Mar 22 at 8:45
add a comment |
$begingroup$
Observe that 0 is a lower bound of $frac1n$
Archimedian property- if $x > 0 $ then there exists $n epsilon mathbbR $ such that $nx > y; x,y epsilon mathbbR$. Set $x = epsilon$ and $y=1$ $$ epsilon > frac1n forall epsilon > 0$$ . Hence infimum of $frac1n $ is $0$ .
$endgroup$
$begingroup$
I dont understand this version of archimedian property.I have following version which is :...Given there is any rela number b then there exists some natural number n such that $n > b$
$endgroup$
– J. Deff
Mar 22 at 8:31
$begingroup$
Just search archimedian property for real nos. on Google. You'll get this version of archimedian property.
$endgroup$
– Prakhar Neema
Mar 22 at 8:45
add a comment |
$begingroup$
Observe that 0 is a lower bound of $frac1n$
Archimedian property- if $x > 0 $ then there exists $n epsilon mathbbR $ such that $nx > y; x,y epsilon mathbbR$. Set $x = epsilon$ and $y=1$ $$ epsilon > frac1n forall epsilon > 0$$ . Hence infimum of $frac1n $ is $0$ .
$endgroup$
Observe that 0 is a lower bound of $frac1n$
Archimedian property- if $x > 0 $ then there exists $n epsilon mathbbR $ such that $nx > y; x,y epsilon mathbbR$. Set $x = epsilon$ and $y=1$ $$ epsilon > frac1n forall epsilon > 0$$ . Hence infimum of $frac1n $ is $0$ .
edited Mar 22 at 8:42
answered Mar 22 at 8:21
Prakhar NeemaPrakhar Neema
1174
1174
$begingroup$
I dont understand this version of archimedian property.I have following version which is :...Given there is any rela number b then there exists some natural number n such that $n > b$
$endgroup$
– J. Deff
Mar 22 at 8:31
$begingroup$
Just search archimedian property for real nos. on Google. You'll get this version of archimedian property.
$endgroup$
– Prakhar Neema
Mar 22 at 8:45
add a comment |
$begingroup$
I dont understand this version of archimedian property.I have following version which is :...Given there is any rela number b then there exists some natural number n such that $n > b$
$endgroup$
– J. Deff
Mar 22 at 8:31
$begingroup$
Just search archimedian property for real nos. on Google. You'll get this version of archimedian property.
$endgroup$
– Prakhar Neema
Mar 22 at 8:45
$begingroup$
I dont understand this version of archimedian property.I have following version which is :...Given there is any rela number b then there exists some natural number n such that $n > b$
$endgroup$
– J. Deff
Mar 22 at 8:31
$begingroup$
I dont understand this version of archimedian property.I have following version which is :...Given there is any rela number b then there exists some natural number n such that $n > b$
$endgroup$
– J. Deff
Mar 22 at 8:31
$begingroup$
Just search archimedian property for real nos. on Google. You'll get this version of archimedian property.
$endgroup$
– Prakhar Neema
Mar 22 at 8:45
$begingroup$
Just search archimedian property for real nos. on Google. You'll get this version of archimedian property.
$endgroup$
– Prakhar Neema
Mar 22 at 8:45
add a comment |
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.
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%2f3157870%2fusing-archimedian-property-to-prove-that-infimum-of-set-is-0%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