If $sup Anotin A$ then $A$ contains a countably infinite subset
I am required to show that if a bounded non empty set $Asubseteq mathbf{R}$ is such that $sup Anotin A$, then $A$ contains a countably infinites subset.
Now my idea is that for each $kinmathbf{N}$ there would exist $a_kin A$ such that $sup A-frac{1}{k}<a_k$ with the required set being $H = {a_1,a_2,dots}$ but how can i modify this construction to ensure that all elements of $H$ are distinct?
real-analysis soft-question
add a comment |
I am required to show that if a bounded non empty set $Asubseteq mathbf{R}$ is such that $sup Anotin A$, then $A$ contains a countably infinites subset.
Now my idea is that for each $kinmathbf{N}$ there would exist $a_kin A$ such that $sup A-frac{1}{k}<a_k$ with the required set being $H = {a_1,a_2,dots}$ but how can i modify this construction to ensure that all elements of $H$ are distinct?
real-analysis soft-question
Why do you want the elements to be distinct?
– drhab
Nov 24 at 13:05
Simply throw out all of the ones that coincide. If there were finitely many such, then since your sequence converges, it must be eventually constant (if there are infinitely many of two different values, then it has a (constant) subsequence converging to each), but it converges to $mathop{mathrm{sup}}A$, so this would mean that $mathop{mathrm{Sup}}A in A$, so we must have infinitely many distinct $a_n$.
– user3482749
Nov 24 at 13:07
add a comment |
I am required to show that if a bounded non empty set $Asubseteq mathbf{R}$ is such that $sup Anotin A$, then $A$ contains a countably infinites subset.
Now my idea is that for each $kinmathbf{N}$ there would exist $a_kin A$ such that $sup A-frac{1}{k}<a_k$ with the required set being $H = {a_1,a_2,dots}$ but how can i modify this construction to ensure that all elements of $H$ are distinct?
real-analysis soft-question
I am required to show that if a bounded non empty set $Asubseteq mathbf{R}$ is such that $sup Anotin A$, then $A$ contains a countably infinites subset.
Now my idea is that for each $kinmathbf{N}$ there would exist $a_kin A$ such that $sup A-frac{1}{k}<a_k$ with the required set being $H = {a_1,a_2,dots}$ but how can i modify this construction to ensure that all elements of $H$ are distinct?
real-analysis soft-question
real-analysis soft-question
asked Nov 24 at 13:03
Atif Farooq
3,1422825
3,1422825
Why do you want the elements to be distinct?
– drhab
Nov 24 at 13:05
Simply throw out all of the ones that coincide. If there were finitely many such, then since your sequence converges, it must be eventually constant (if there are infinitely many of two different values, then it has a (constant) subsequence converging to each), but it converges to $mathop{mathrm{sup}}A$, so this would mean that $mathop{mathrm{Sup}}A in A$, so we must have infinitely many distinct $a_n$.
– user3482749
Nov 24 at 13:07
add a comment |
Why do you want the elements to be distinct?
– drhab
Nov 24 at 13:05
Simply throw out all of the ones that coincide. If there were finitely many such, then since your sequence converges, it must be eventually constant (if there are infinitely many of two different values, then it has a (constant) subsequence converging to each), but it converges to $mathop{mathrm{sup}}A$, so this would mean that $mathop{mathrm{Sup}}A in A$, so we must have infinitely many distinct $a_n$.
– user3482749
Nov 24 at 13:07
Why do you want the elements to be distinct?
– drhab
Nov 24 at 13:05
Why do you want the elements to be distinct?
– drhab
Nov 24 at 13:05
Simply throw out all of the ones that coincide. If there were finitely many such, then since your sequence converges, it must be eventually constant (if there are infinitely many of two different values, then it has a (constant) subsequence converging to each), but it converges to $mathop{mathrm{sup}}A$, so this would mean that $mathop{mathrm{Sup}}A in A$, so we must have infinitely many distinct $a_n$.
– user3482749
Nov 24 at 13:07
Simply throw out all of the ones that coincide. If there were finitely many such, then since your sequence converges, it must be eventually constant (if there are infinitely many of two different values, then it has a (constant) subsequence converging to each), but it converges to $mathop{mathrm{sup}}A$, so this would mean that $mathop{mathrm{Sup}}A in A$, so we must have infinitely many distinct $a_n$.
– user3482749
Nov 24 at 13:07
add a comment |
1 Answer
1
active
oldest
votes
Try this: if a set $AsubsetBbb R$ is finite and nonempty then $sup Ain A$.
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%2f3011527%2fif-sup-a-not-in-a-then-a-contains-a-countably-infinite-subset%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
Try this: if a set $AsubsetBbb R$ is finite and nonempty then $sup Ain A$.
add a comment |
Try this: if a set $AsubsetBbb R$ is finite and nonempty then $sup Ain A$.
add a comment |
Try this: if a set $AsubsetBbb R$ is finite and nonempty then $sup Ain A$.
Try this: if a set $AsubsetBbb R$ is finite and nonempty then $sup Ain A$.
answered Nov 24 at 13:06
Masacroso
12.8k41746
12.8k41746
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%2f3011527%2fif-sup-a-not-in-a-then-a-contains-a-countably-infinite-subset%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
Why do you want the elements to be distinct?
– drhab
Nov 24 at 13:05
Simply throw out all of the ones that coincide. If there were finitely many such, then since your sequence converges, it must be eventually constant (if there are infinitely many of two different values, then it has a (constant) subsequence converging to each), but it converges to $mathop{mathrm{sup}}A$, so this would mean that $mathop{mathrm{Sup}}A in A$, so we must have infinitely many distinct $a_n$.
– user3482749
Nov 24 at 13:07