$X_nleq Y_n implies inf X_n leq inf Y_n$
up vote
1
down vote
favorite
$x_nleq y_n forall n in N implies inf x_n leq inf y_n$
It is obvious from the definition of infimum and supremum, $sup x_n leq y_n$ and $inf x_n leq x_n leq y_n$. However I do not know how to use the definition to prove formally that $sup x_n leq inf y_n$ and conclude that
$inf x_n leq sup y_n$.
real-analysis sequences-and-series supremum-and-infimum
add a comment |
up vote
1
down vote
favorite
$x_nleq y_n forall n in N implies inf x_n leq inf y_n$
It is obvious from the definition of infimum and supremum, $sup x_n leq y_n$ and $inf x_n leq x_n leq y_n$. However I do not know how to use the definition to prove formally that $sup x_n leq inf y_n$ and conclude that
$inf x_n leq sup y_n$.
real-analysis sequences-and-series supremum-and-infimum
$sup x_n le inf y_n$ does not hold. Try some sequences with $x_n = y_n$.
– mschauer
Nov 22 at 21:41
I would be careful with your statement. It is true that if $x_{n} leq c$ for some fixed real number $c$, then $sup x_{n} leq c$ as well. But if you are comparing a sequence $x_{n}$ to another sequence $y_{n}$ and find that $x_{n} leq y_{n}$ for all $n$, that doesn't mean $sup x_{n} leq y_{n}$. The left hand side of the inequality is a fixed number, but which $n$ are you choosing for the right hand side? Here is an example: Take $x_{n} = 1 - frac{2}{n}$ and $y_{n} = 1 - frac{1}{n}$. Clealry, $x_{n} leq y_{n}$ for all $n$. But $sup {x_{n}} = 1$ which is bigger than all $y_{n}$.
– layman
Nov 22 at 21:41
It is not true that $sup x_n leq y_n$ and the sequences $x_n = 1/(n+1)$ and $y_n=1/n$ show for the left hand side is $1/2$ and the right hand side, when $n = 3$ is $1/3.$
– Will M.
Nov 22 at 21:41
add a comment |
up vote
1
down vote
favorite
up vote
1
down vote
favorite
$x_nleq y_n forall n in N implies inf x_n leq inf y_n$
It is obvious from the definition of infimum and supremum, $sup x_n leq y_n$ and $inf x_n leq x_n leq y_n$. However I do not know how to use the definition to prove formally that $sup x_n leq inf y_n$ and conclude that
$inf x_n leq sup y_n$.
real-analysis sequences-and-series supremum-and-infimum
$x_nleq y_n forall n in N implies inf x_n leq inf y_n$
It is obvious from the definition of infimum and supremum, $sup x_n leq y_n$ and $inf x_n leq x_n leq y_n$. However I do not know how to use the definition to prove formally that $sup x_n leq inf y_n$ and conclude that
$inf x_n leq sup y_n$.
real-analysis sequences-and-series supremum-and-infimum
real-analysis sequences-and-series supremum-and-infimum
edited Nov 22 at 21:37
Yadati Kiran
1,327418
1,327418
asked Nov 22 at 21:36
Pumpkin
4861417
4861417
$sup x_n le inf y_n$ does not hold. Try some sequences with $x_n = y_n$.
– mschauer
Nov 22 at 21:41
I would be careful with your statement. It is true that if $x_{n} leq c$ for some fixed real number $c$, then $sup x_{n} leq c$ as well. But if you are comparing a sequence $x_{n}$ to another sequence $y_{n}$ and find that $x_{n} leq y_{n}$ for all $n$, that doesn't mean $sup x_{n} leq y_{n}$. The left hand side of the inequality is a fixed number, but which $n$ are you choosing for the right hand side? Here is an example: Take $x_{n} = 1 - frac{2}{n}$ and $y_{n} = 1 - frac{1}{n}$. Clealry, $x_{n} leq y_{n}$ for all $n$. But $sup {x_{n}} = 1$ which is bigger than all $y_{n}$.
– layman
Nov 22 at 21:41
It is not true that $sup x_n leq y_n$ and the sequences $x_n = 1/(n+1)$ and $y_n=1/n$ show for the left hand side is $1/2$ and the right hand side, when $n = 3$ is $1/3.$
– Will M.
Nov 22 at 21:41
add a comment |
$sup x_n le inf y_n$ does not hold. Try some sequences with $x_n = y_n$.
– mschauer
Nov 22 at 21:41
I would be careful with your statement. It is true that if $x_{n} leq c$ for some fixed real number $c$, then $sup x_{n} leq c$ as well. But if you are comparing a sequence $x_{n}$ to another sequence $y_{n}$ and find that $x_{n} leq y_{n}$ for all $n$, that doesn't mean $sup x_{n} leq y_{n}$. The left hand side of the inequality is a fixed number, but which $n$ are you choosing for the right hand side? Here is an example: Take $x_{n} = 1 - frac{2}{n}$ and $y_{n} = 1 - frac{1}{n}$. Clealry, $x_{n} leq y_{n}$ for all $n$. But $sup {x_{n}} = 1$ which is bigger than all $y_{n}$.
– layman
Nov 22 at 21:41
It is not true that $sup x_n leq y_n$ and the sequences $x_n = 1/(n+1)$ and $y_n=1/n$ show for the left hand side is $1/2$ and the right hand side, when $n = 3$ is $1/3.$
– Will M.
Nov 22 at 21:41
$sup x_n le inf y_n$ does not hold. Try some sequences with $x_n = y_n$.
– mschauer
Nov 22 at 21:41
$sup x_n le inf y_n$ does not hold. Try some sequences with $x_n = y_n$.
– mschauer
Nov 22 at 21:41
I would be careful with your statement. It is true that if $x_{n} leq c$ for some fixed real number $c$, then $sup x_{n} leq c$ as well. But if you are comparing a sequence $x_{n}$ to another sequence $y_{n}$ and find that $x_{n} leq y_{n}$ for all $n$, that doesn't mean $sup x_{n} leq y_{n}$. The left hand side of the inequality is a fixed number, but which $n$ are you choosing for the right hand side? Here is an example: Take $x_{n} = 1 - frac{2}{n}$ and $y_{n} = 1 - frac{1}{n}$. Clealry, $x_{n} leq y_{n}$ for all $n$. But $sup {x_{n}} = 1$ which is bigger than all $y_{n}$.
– layman
Nov 22 at 21:41
I would be careful with your statement. It is true that if $x_{n} leq c$ for some fixed real number $c$, then $sup x_{n} leq c$ as well. But if you are comparing a sequence $x_{n}$ to another sequence $y_{n}$ and find that $x_{n} leq y_{n}$ for all $n$, that doesn't mean $sup x_{n} leq y_{n}$. The left hand side of the inequality is a fixed number, but which $n$ are you choosing for the right hand side? Here is an example: Take $x_{n} = 1 - frac{2}{n}$ and $y_{n} = 1 - frac{1}{n}$. Clealry, $x_{n} leq y_{n}$ for all $n$. But $sup {x_{n}} = 1$ which is bigger than all $y_{n}$.
– layman
Nov 22 at 21:41
It is not true that $sup x_n leq y_n$ and the sequences $x_n = 1/(n+1)$ and $y_n=1/n$ show for the left hand side is $1/2$ and the right hand side, when $n = 3$ is $1/3.$
– Will M.
Nov 22 at 21:41
It is not true that $sup x_n leq y_n$ and the sequences $x_n = 1/(n+1)$ and $y_n=1/n$ show for the left hand side is $1/2$ and the right hand side, when $n = 3$ is $1/3.$
– Will M.
Nov 22 at 21:41
add a comment |
2 Answers
2
active
oldest
votes
up vote
1
down vote
accepted
Note that
$$
inf x_nleq x_nle y_n
$$
for all $n$. So $inf x_n$ is a lower bound for $y_n$ whence
$$
inf x_nleq inf y_n.
$$
add a comment |
up vote
1
down vote
Assume by contradiction $$inf x_n=x>inf y_n=y$$therefore$$forall 0<epsilon <x-y,exists
Nqquad forall n>Nto 0le y_n-y<epsilon<x-y$$which means that the exists $nin Bbb N$ such that $$yle y_n<xle x_n$$or equivalently $$y_n<x_n$$which is a contradiction. Therefore $xle y$ and the proof is complete $blacksquare$
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',
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%2f3009691%2fx-n-leq-y-n-implies-inf-x-n-leq-inf-y-n%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
1
down vote
accepted
Note that
$$
inf x_nleq x_nle y_n
$$
for all $n$. So $inf x_n$ is a lower bound for $y_n$ whence
$$
inf x_nleq inf y_n.
$$
add a comment |
up vote
1
down vote
accepted
Note that
$$
inf x_nleq x_nle y_n
$$
for all $n$. So $inf x_n$ is a lower bound for $y_n$ whence
$$
inf x_nleq inf y_n.
$$
add a comment |
up vote
1
down vote
accepted
up vote
1
down vote
accepted
Note that
$$
inf x_nleq x_nle y_n
$$
for all $n$. So $inf x_n$ is a lower bound for $y_n$ whence
$$
inf x_nleq inf y_n.
$$
Note that
$$
inf x_nleq x_nle y_n
$$
for all $n$. So $inf x_n$ is a lower bound for $y_n$ whence
$$
inf x_nleq inf y_n.
$$
answered Nov 22 at 22:00
Foobaz John
20.3k41250
20.3k41250
add a comment |
add a comment |
up vote
1
down vote
Assume by contradiction $$inf x_n=x>inf y_n=y$$therefore$$forall 0<epsilon <x-y,exists
Nqquad forall n>Nto 0le y_n-y<epsilon<x-y$$which means that the exists $nin Bbb N$ such that $$yle y_n<xle x_n$$or equivalently $$y_n<x_n$$which is a contradiction. Therefore $xle y$ and the proof is complete $blacksquare$
add a comment |
up vote
1
down vote
Assume by contradiction $$inf x_n=x>inf y_n=y$$therefore$$forall 0<epsilon <x-y,exists
Nqquad forall n>Nto 0le y_n-y<epsilon<x-y$$which means that the exists $nin Bbb N$ such that $$yle y_n<xle x_n$$or equivalently $$y_n<x_n$$which is a contradiction. Therefore $xle y$ and the proof is complete $blacksquare$
add a comment |
up vote
1
down vote
up vote
1
down vote
Assume by contradiction $$inf x_n=x>inf y_n=y$$therefore$$forall 0<epsilon <x-y,exists
Nqquad forall n>Nto 0le y_n-y<epsilon<x-y$$which means that the exists $nin Bbb N$ such that $$yle y_n<xle x_n$$or equivalently $$y_n<x_n$$which is a contradiction. Therefore $xle y$ and the proof is complete $blacksquare$
Assume by contradiction $$inf x_n=x>inf y_n=y$$therefore$$forall 0<epsilon <x-y,exists
Nqquad forall n>Nto 0le y_n-y<epsilon<x-y$$which means that the exists $nin Bbb N$ such that $$yle y_n<xle x_n$$or equivalently $$y_n<x_n$$which is a contradiction. Therefore $xle y$ and the proof is complete $blacksquare$
answered Nov 22 at 21:45
Mostafa Ayaz
13.5k3836
13.5k3836
add a comment |
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.
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%2f3009691%2fx-n-leq-y-n-implies-inf-x-n-leq-inf-y-n%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
$sup x_n le inf y_n$ does not hold. Try some sequences with $x_n = y_n$.
– mschauer
Nov 22 at 21:41
I would be careful with your statement. It is true that if $x_{n} leq c$ for some fixed real number $c$, then $sup x_{n} leq c$ as well. But if you are comparing a sequence $x_{n}$ to another sequence $y_{n}$ and find that $x_{n} leq y_{n}$ for all $n$, that doesn't mean $sup x_{n} leq y_{n}$. The left hand side of the inequality is a fixed number, but which $n$ are you choosing for the right hand side? Here is an example: Take $x_{n} = 1 - frac{2}{n}$ and $y_{n} = 1 - frac{1}{n}$. Clealry, $x_{n} leq y_{n}$ for all $n$. But $sup {x_{n}} = 1$ which is bigger than all $y_{n}$.
– layman
Nov 22 at 21:41
It is not true that $sup x_n leq y_n$ and the sequences $x_n = 1/(n+1)$ and $y_n=1/n$ show for the left hand side is $1/2$ and the right hand side, when $n = 3$ is $1/3.$
– Will M.
Nov 22 at 21:41