Length of countably many intervals
$begingroup$
The following is a proof from my textbook. I have 2 questions, which are in bold.
Theorem: Let $(I_n)$ and $(J_k)$ be sequences of intervals such that $bigcup_{n=1}^infty I_n=bigcup_{k=1}^infty J_k$. If the $I_n$ are pairwise disjoint, then $sum_{n=1}^inftyell(I_n)lesum_{k=1}^inftyell(J_k)$. Thus, if the $J_k$ are also pairwise disjoint, then the two sums are equal.
Proof:
Suppose, to the contrary, that $sum_{n=1}^inftyell(I_n)>sum_{k=1}^inftyell(J_k)$.
Then, for some $N$, we must have $sum_{n=1}^Nell(I_n)>sum_{k=1}^inftyell(J_k)$ .
Of course, we also have $bigcup_{n=1}^N I_nsubsetbigcup_{k=1}^infty J_k$ .
But now, by expanding each $J_k$ slightly and shrinking each $I_n$ slightly, we may suppose that the $J_k$ are open and the $I_n$ are closed. This does not seem like a valid mathematical step to me. In a proof, are we allowed to change the question? Please help.
Thus, the $J_k$ form an open cover for the compact set $bigcup_{n=1}^N I_n$.
And here is the contradiction: Since we have $sum_{n=1}^Nell(I_n)>sum_{k=1}^Mell(J_k)$, for any $M$, the sets ($J_k$) form an open cover for that admits no finite subcover. Could you please explain this as well?
real-analysis
$endgroup$
add a comment |
$begingroup$
The following is a proof from my textbook. I have 2 questions, which are in bold.
Theorem: Let $(I_n)$ and $(J_k)$ be sequences of intervals such that $bigcup_{n=1}^infty I_n=bigcup_{k=1}^infty J_k$. If the $I_n$ are pairwise disjoint, then $sum_{n=1}^inftyell(I_n)lesum_{k=1}^inftyell(J_k)$. Thus, if the $J_k$ are also pairwise disjoint, then the two sums are equal.
Proof:
Suppose, to the contrary, that $sum_{n=1}^inftyell(I_n)>sum_{k=1}^inftyell(J_k)$.
Then, for some $N$, we must have $sum_{n=1}^Nell(I_n)>sum_{k=1}^inftyell(J_k)$ .
Of course, we also have $bigcup_{n=1}^N I_nsubsetbigcup_{k=1}^infty J_k$ .
But now, by expanding each $J_k$ slightly and shrinking each $I_n$ slightly, we may suppose that the $J_k$ are open and the $I_n$ are closed. This does not seem like a valid mathematical step to me. In a proof, are we allowed to change the question? Please help.
Thus, the $J_k$ form an open cover for the compact set $bigcup_{n=1}^N I_n$.
And here is the contradiction: Since we have $sum_{n=1}^Nell(I_n)>sum_{k=1}^Mell(J_k)$, for any $M$, the sets ($J_k$) form an open cover for that admits no finite subcover. Could you please explain this as well?
real-analysis
$endgroup$
add a comment |
$begingroup$
The following is a proof from my textbook. I have 2 questions, which are in bold.
Theorem: Let $(I_n)$ and $(J_k)$ be sequences of intervals such that $bigcup_{n=1}^infty I_n=bigcup_{k=1}^infty J_k$. If the $I_n$ are pairwise disjoint, then $sum_{n=1}^inftyell(I_n)lesum_{k=1}^inftyell(J_k)$. Thus, if the $J_k$ are also pairwise disjoint, then the two sums are equal.
Proof:
Suppose, to the contrary, that $sum_{n=1}^inftyell(I_n)>sum_{k=1}^inftyell(J_k)$.
Then, for some $N$, we must have $sum_{n=1}^Nell(I_n)>sum_{k=1}^inftyell(J_k)$ .
Of course, we also have $bigcup_{n=1}^N I_nsubsetbigcup_{k=1}^infty J_k$ .
But now, by expanding each $J_k$ slightly and shrinking each $I_n$ slightly, we may suppose that the $J_k$ are open and the $I_n$ are closed. This does not seem like a valid mathematical step to me. In a proof, are we allowed to change the question? Please help.
Thus, the $J_k$ form an open cover for the compact set $bigcup_{n=1}^N I_n$.
And here is the contradiction: Since we have $sum_{n=1}^Nell(I_n)>sum_{k=1}^Mell(J_k)$, for any $M$, the sets ($J_k$) form an open cover for that admits no finite subcover. Could you please explain this as well?
real-analysis
$endgroup$
The following is a proof from my textbook. I have 2 questions, which are in bold.
Theorem: Let $(I_n)$ and $(J_k)$ be sequences of intervals such that $bigcup_{n=1}^infty I_n=bigcup_{k=1}^infty J_k$. If the $I_n$ are pairwise disjoint, then $sum_{n=1}^inftyell(I_n)lesum_{k=1}^inftyell(J_k)$. Thus, if the $J_k$ are also pairwise disjoint, then the two sums are equal.
Proof:
Suppose, to the contrary, that $sum_{n=1}^inftyell(I_n)>sum_{k=1}^inftyell(J_k)$.
Then, for some $N$, we must have $sum_{n=1}^Nell(I_n)>sum_{k=1}^inftyell(J_k)$ .
Of course, we also have $bigcup_{n=1}^N I_nsubsetbigcup_{k=1}^infty J_k$ .
But now, by expanding each $J_k$ slightly and shrinking each $I_n$ slightly, we may suppose that the $J_k$ are open and the $I_n$ are closed. This does not seem like a valid mathematical step to me. In a proof, are we allowed to change the question? Please help.
Thus, the $J_k$ form an open cover for the compact set $bigcup_{n=1}^N I_n$.
And here is the contradiction: Since we have $sum_{n=1}^Nell(I_n)>sum_{k=1}^Mell(J_k)$, for any $M$, the sets ($J_k$) form an open cover for that admits no finite subcover. Could you please explain this as well?
real-analysis
real-analysis
asked Nov 29 '18 at 1:50
ThomasThomas
730416
730416
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
This is valid because you have a little bit of room to play with in the inequality. To be explicit, let's suppose that there is a $gamma > 0$ such that
$$sum_{n = 1}^{N} |I_n| > sum_{k = 1}^{infty} |J_k| + 2gamma.$$
Replace each $J_k$ with a slightly bigger open set $tilde{J_k}$, where $|tilde{J_k}| le |J_k| + frac{gamma}{2^k}$; this can be done explicitly by replacing a (open/closed/semi-open) interval with endpoints $a, b$ by the open interval $(a-gamma/2^{k + 1}, b + gamma/2^{k + 1})$.
Carry out a similar (but completely explicit shrinking) process with the $I_n$, getting $tilde{I_n}$ with $|tilde{I_n}| ge |I_n| - frac{gamma}{2^n}$. Summing over all $n$ and $k$, you ought to find that
$$sum_{n = 1}^{N} |tilde{I_n}| > sum_{k = 1}^{infty} |tilde{J_k}|$$
where the new collections have the open/closed properties you were after.
$endgroup$
$begingroup$
Thank you so much! Could you answer the 2nd question as well?
$endgroup$
– Thomas
Nov 29 '18 at 3:26
$begingroup$
Also, where do we use the fact that the $I_n$ are pairwise disjoint?
$endgroup$
– Thomas
Nov 29 '18 at 3:41
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%2f3018038%2flength-of-countably-many-intervals%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
$begingroup$
This is valid because you have a little bit of room to play with in the inequality. To be explicit, let's suppose that there is a $gamma > 0$ such that
$$sum_{n = 1}^{N} |I_n| > sum_{k = 1}^{infty} |J_k| + 2gamma.$$
Replace each $J_k$ with a slightly bigger open set $tilde{J_k}$, where $|tilde{J_k}| le |J_k| + frac{gamma}{2^k}$; this can be done explicitly by replacing a (open/closed/semi-open) interval with endpoints $a, b$ by the open interval $(a-gamma/2^{k + 1}, b + gamma/2^{k + 1})$.
Carry out a similar (but completely explicit shrinking) process with the $I_n$, getting $tilde{I_n}$ with $|tilde{I_n}| ge |I_n| - frac{gamma}{2^n}$. Summing over all $n$ and $k$, you ought to find that
$$sum_{n = 1}^{N} |tilde{I_n}| > sum_{k = 1}^{infty} |tilde{J_k}|$$
where the new collections have the open/closed properties you were after.
$endgroup$
$begingroup$
Thank you so much! Could you answer the 2nd question as well?
$endgroup$
– Thomas
Nov 29 '18 at 3:26
$begingroup$
Also, where do we use the fact that the $I_n$ are pairwise disjoint?
$endgroup$
– Thomas
Nov 29 '18 at 3:41
add a comment |
$begingroup$
This is valid because you have a little bit of room to play with in the inequality. To be explicit, let's suppose that there is a $gamma > 0$ such that
$$sum_{n = 1}^{N} |I_n| > sum_{k = 1}^{infty} |J_k| + 2gamma.$$
Replace each $J_k$ with a slightly bigger open set $tilde{J_k}$, where $|tilde{J_k}| le |J_k| + frac{gamma}{2^k}$; this can be done explicitly by replacing a (open/closed/semi-open) interval with endpoints $a, b$ by the open interval $(a-gamma/2^{k + 1}, b + gamma/2^{k + 1})$.
Carry out a similar (but completely explicit shrinking) process with the $I_n$, getting $tilde{I_n}$ with $|tilde{I_n}| ge |I_n| - frac{gamma}{2^n}$. Summing over all $n$ and $k$, you ought to find that
$$sum_{n = 1}^{N} |tilde{I_n}| > sum_{k = 1}^{infty} |tilde{J_k}|$$
where the new collections have the open/closed properties you were after.
$endgroup$
$begingroup$
Thank you so much! Could you answer the 2nd question as well?
$endgroup$
– Thomas
Nov 29 '18 at 3:26
$begingroup$
Also, where do we use the fact that the $I_n$ are pairwise disjoint?
$endgroup$
– Thomas
Nov 29 '18 at 3:41
add a comment |
$begingroup$
This is valid because you have a little bit of room to play with in the inequality. To be explicit, let's suppose that there is a $gamma > 0$ such that
$$sum_{n = 1}^{N} |I_n| > sum_{k = 1}^{infty} |J_k| + 2gamma.$$
Replace each $J_k$ with a slightly bigger open set $tilde{J_k}$, where $|tilde{J_k}| le |J_k| + frac{gamma}{2^k}$; this can be done explicitly by replacing a (open/closed/semi-open) interval with endpoints $a, b$ by the open interval $(a-gamma/2^{k + 1}, b + gamma/2^{k + 1})$.
Carry out a similar (but completely explicit shrinking) process with the $I_n$, getting $tilde{I_n}$ with $|tilde{I_n}| ge |I_n| - frac{gamma}{2^n}$. Summing over all $n$ and $k$, you ought to find that
$$sum_{n = 1}^{N} |tilde{I_n}| > sum_{k = 1}^{infty} |tilde{J_k}|$$
where the new collections have the open/closed properties you were after.
$endgroup$
This is valid because you have a little bit of room to play with in the inequality. To be explicit, let's suppose that there is a $gamma > 0$ such that
$$sum_{n = 1}^{N} |I_n| > sum_{k = 1}^{infty} |J_k| + 2gamma.$$
Replace each $J_k$ with a slightly bigger open set $tilde{J_k}$, where $|tilde{J_k}| le |J_k| + frac{gamma}{2^k}$; this can be done explicitly by replacing a (open/closed/semi-open) interval with endpoints $a, b$ by the open interval $(a-gamma/2^{k + 1}, b + gamma/2^{k + 1})$.
Carry out a similar (but completely explicit shrinking) process with the $I_n$, getting $tilde{I_n}$ with $|tilde{I_n}| ge |I_n| - frac{gamma}{2^n}$. Summing over all $n$ and $k$, you ought to find that
$$sum_{n = 1}^{N} |tilde{I_n}| > sum_{k = 1}^{infty} |tilde{J_k}|$$
where the new collections have the open/closed properties you were after.
answered Nov 29 '18 at 2:11
T. BongersT. Bongers
22.9k54661
22.9k54661
$begingroup$
Thank you so much! Could you answer the 2nd question as well?
$endgroup$
– Thomas
Nov 29 '18 at 3:26
$begingroup$
Also, where do we use the fact that the $I_n$ are pairwise disjoint?
$endgroup$
– Thomas
Nov 29 '18 at 3:41
add a comment |
$begingroup$
Thank you so much! Could you answer the 2nd question as well?
$endgroup$
– Thomas
Nov 29 '18 at 3:26
$begingroup$
Also, where do we use the fact that the $I_n$ are pairwise disjoint?
$endgroup$
– Thomas
Nov 29 '18 at 3:41
$begingroup$
Thank you so much! Could you answer the 2nd question as well?
$endgroup$
– Thomas
Nov 29 '18 at 3:26
$begingroup$
Thank you so much! Could you answer the 2nd question as well?
$endgroup$
– Thomas
Nov 29 '18 at 3:26
$begingroup$
Also, where do we use the fact that the $I_n$ are pairwise disjoint?
$endgroup$
– Thomas
Nov 29 '18 at 3:41
$begingroup$
Also, where do we use the fact that the $I_n$ are pairwise disjoint?
$endgroup$
– Thomas
Nov 29 '18 at 3:41
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%2f3018038%2flength-of-countably-many-intervals%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