Supremum Proof Question
Let $a<b$ be real numbers and consider the set $T=mathbb{Q}cap[a,b]$. Show $sup T=b$.
I can show that $bgeq x$ for all $xin T$ and thus an upper bound, but am not sure how to go about showing it is the least upper bound.
supremum-and-infimum
add a comment |
Let $a<b$ be real numbers and consider the set $T=mathbb{Q}cap[a,b]$. Show $sup T=b$.
I can show that $bgeq x$ for all $xin T$ and thus an upper bound, but am not sure how to go about showing it is the least upper bound.
supremum-and-infimum
Take any other upper bound and show it must be greater than $b$
– Gregory Grant
Aug 25 '15 at 18:13
2
Use the fact that between any two distinct reals is a rational number.
– Akiva Weinberger
Aug 25 '15 at 18:14
add a comment |
Let $a<b$ be real numbers and consider the set $T=mathbb{Q}cap[a,b]$. Show $sup T=b$.
I can show that $bgeq x$ for all $xin T$ and thus an upper bound, but am not sure how to go about showing it is the least upper bound.
supremum-and-infimum
Let $a<b$ be real numbers and consider the set $T=mathbb{Q}cap[a,b]$. Show $sup T=b$.
I can show that $bgeq x$ for all $xin T$ and thus an upper bound, but am not sure how to go about showing it is the least upper bound.
supremum-and-infimum
supremum-and-infimum
edited Jan 10 '17 at 13:00
Cettt
1,749621
1,749621
asked Aug 25 '15 at 18:11
Laura
5114
5114
Take any other upper bound and show it must be greater than $b$
– Gregory Grant
Aug 25 '15 at 18:13
2
Use the fact that between any two distinct reals is a rational number.
– Akiva Weinberger
Aug 25 '15 at 18:14
add a comment |
Take any other upper bound and show it must be greater than $b$
– Gregory Grant
Aug 25 '15 at 18:13
2
Use the fact that between any two distinct reals is a rational number.
– Akiva Weinberger
Aug 25 '15 at 18:14
Take any other upper bound and show it must be greater than $b$
– Gregory Grant
Aug 25 '15 at 18:13
Take any other upper bound and show it must be greater than $b$
– Gregory Grant
Aug 25 '15 at 18:13
2
2
Use the fact that between any two distinct reals is a rational number.
– Akiva Weinberger
Aug 25 '15 at 18:14
Use the fact that between any two distinct reals is a rational number.
– Akiva Weinberger
Aug 25 '15 at 18:14
add a comment |
2 Answers
2
active
oldest
votes
Let $b=d_1.d_2d_3dots d_kdots$
Then the members of the sequence $b-0.dots d_kdots, b-0.0dots d_kdots, b-0.00dots d_kdots dots$ are all rational, with $b-0.000dots d_kdotsto b$ as $ktoinfty$, hence the supremum of this sequence is $b$.
For example, let $b=pi$ and consider $b_0=3, b_1=3.1, b_2=3.14, b_3=3.141,dots$. We have $b_ninmathbb{Q}, lim_limits{ntoinfty}b_ntopiinmathbb{I}$.
add a comment |
Suppose there is a smaller upper bound for $T$, say this is some $M<b$. Then by denseness of $mathbb{Q}$ there is some rational number $r$ such that
$$M<r<b. (1)$$
Again by denseness of the rationals, $T$ is not empty. Take some $x in T$. Then $a leq x leq M$. Combining this with the above yields $r in T$, which gives $r leq M$, a contradiction with $(1)$.
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%2f1409459%2fsupremum-proof-question%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
Let $b=d_1.d_2d_3dots d_kdots$
Then the members of the sequence $b-0.dots d_kdots, b-0.0dots d_kdots, b-0.00dots d_kdots dots$ are all rational, with $b-0.000dots d_kdotsto b$ as $ktoinfty$, hence the supremum of this sequence is $b$.
For example, let $b=pi$ and consider $b_0=3, b_1=3.1, b_2=3.14, b_3=3.141,dots$. We have $b_ninmathbb{Q}, lim_limits{ntoinfty}b_ntopiinmathbb{I}$.
add a comment |
Let $b=d_1.d_2d_3dots d_kdots$
Then the members of the sequence $b-0.dots d_kdots, b-0.0dots d_kdots, b-0.00dots d_kdots dots$ are all rational, with $b-0.000dots d_kdotsto b$ as $ktoinfty$, hence the supremum of this sequence is $b$.
For example, let $b=pi$ and consider $b_0=3, b_1=3.1, b_2=3.14, b_3=3.141,dots$. We have $b_ninmathbb{Q}, lim_limits{ntoinfty}b_ntopiinmathbb{I}$.
add a comment |
Let $b=d_1.d_2d_3dots d_kdots$
Then the members of the sequence $b-0.dots d_kdots, b-0.0dots d_kdots, b-0.00dots d_kdots dots$ are all rational, with $b-0.000dots d_kdotsto b$ as $ktoinfty$, hence the supremum of this sequence is $b$.
For example, let $b=pi$ and consider $b_0=3, b_1=3.1, b_2=3.14, b_3=3.141,dots$. We have $b_ninmathbb{Q}, lim_limits{ntoinfty}b_ntopiinmathbb{I}$.
Let $b=d_1.d_2d_3dots d_kdots$
Then the members of the sequence $b-0.dots d_kdots, b-0.0dots d_kdots, b-0.00dots d_kdots dots$ are all rational, with $b-0.000dots d_kdotsto b$ as $ktoinfty$, hence the supremum of this sequence is $b$.
For example, let $b=pi$ and consider $b_0=3, b_1=3.1, b_2=3.14, b_3=3.141,dots$. We have $b_ninmathbb{Q}, lim_limits{ntoinfty}b_ntopiinmathbb{I}$.
edited Aug 26 '15 at 4:38
answered Aug 25 '15 at 18:55
JonMark Perry
11.2k92237
11.2k92237
add a comment |
add a comment |
Suppose there is a smaller upper bound for $T$, say this is some $M<b$. Then by denseness of $mathbb{Q}$ there is some rational number $r$ such that
$$M<r<b. (1)$$
Again by denseness of the rationals, $T$ is not empty. Take some $x in T$. Then $a leq x leq M$. Combining this with the above yields $r in T$, which gives $r leq M$, a contradiction with $(1)$.
add a comment |
Suppose there is a smaller upper bound for $T$, say this is some $M<b$. Then by denseness of $mathbb{Q}$ there is some rational number $r$ such that
$$M<r<b. (1)$$
Again by denseness of the rationals, $T$ is not empty. Take some $x in T$. Then $a leq x leq M$. Combining this with the above yields $r in T$, which gives $r leq M$, a contradiction with $(1)$.
add a comment |
Suppose there is a smaller upper bound for $T$, say this is some $M<b$. Then by denseness of $mathbb{Q}$ there is some rational number $r$ such that
$$M<r<b. (1)$$
Again by denseness of the rationals, $T$ is not empty. Take some $x in T$. Then $a leq x leq M$. Combining this with the above yields $r in T$, which gives $r leq M$, a contradiction with $(1)$.
Suppose there is a smaller upper bound for $T$, say this is some $M<b$. Then by denseness of $mathbb{Q}$ there is some rational number $r$ such that
$$M<r<b. (1)$$
Again by denseness of the rationals, $T$ is not empty. Take some $x in T$. Then $a leq x leq M$. Combining this with the above yields $r in T$, which gives $r leq M$, a contradiction with $(1)$.
answered Sep 12 '17 at 20:39
M. Van
2,555311
2,555311
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%2f1409459%2fsupremum-proof-question%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
Take any other upper bound and show it must be greater than $b$
– Gregory Grant
Aug 25 '15 at 18:13
2
Use the fact that between any two distinct reals is a rational number.
– Akiva Weinberger
Aug 25 '15 at 18:14