Content $0$ implies boundary has content $0$












0












$begingroup$



Problem: If a set $C$ has content $0$, then the boundary must also have content $0$.




The solution say




Solution: Suppose a finite set of rectangle $ U_i = (a_{i1},b_{i1}) times dots times (a_{in}, b_{in})$ where $i in {1, dots, m }$ cover $C$ and have total volume less than $epsilon/ 2$ where $epsilon >0.$ Let $V_i = (a_{i1} - delta ,b_{i1} + delta) times dots times (a_{in} - delta , b_{in} + delta)$ where



$$prod_{iin { 1,dots,n}} (b_{ij} - a_{ij} + 2delta) - prod_{iin { 1,dots,n}} (b_{ij} - a_{aj} ) < epsilon/2m .$$




Or equivalently,




Then the union of $V_i$ cover the boundary of $C$ and have total volume less than $epsilon$. Hence $partial C$ is also of content $0$.




This is a really simple question, but does $V_i - U_i$ cover $partial C$? $V_i - U_i$ means the part where we remove $U_i$ from $V_i$.



Also is the last step because of $$ sum_{i = 1}^m vol(cup( V_i - U_i)) leq sum_{i = 1}^mprod (b_{ij} - a_{aj} + 2delta) - prod (b_{ij} - a_{aj} ) < sum_{i = 1}^m epsilon/2m = epsilon /2.$$



or equivalently,



$$ sum_{i = 1}^m vol(cup V_i ) leq sum_{i = 1}^mprod (b_{ij} - a_{aj} + 2delta) < sum_{i = 1}^m epsilon/2m + prod (b_{ij} - a_{aj} ) < epsilon /2 + epsilon/2 = epsilon. $$



Am I also correct to understand the outline of this proof is




  1. Use the finite cover that covers $C$, and take a $delta$ cover over that finite cover just enough to cover the boundary of $C$.


  2. Using the finite cover of $C$, demand this cover so that it has volume less than $epsilon/2$. Pick $delta$ small enough so that we get



$$prod_{iin { 1,dots,n}} (b_{ij} - a_{ij} + 2delta) - prod_{iin { 1,dots,n}} (b_{ij} - a_{aj} ) < epsilon/2m .$$




  1. Use finite subadditivitly to finish off the estimation.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Note that you can take the cover to be closed (with the same volume) and the closed cover also covers the closure of $C$, and hence the boundary.
    $endgroup$
    – copper.hat
    May 6 '14 at 6:53










  • $begingroup$
    Wait, why does the closed cover cover the closure of $C$? This seems like a rhetorical question as you are probably going to say "because it covers the boundary…"
    $endgroup$
    – Hawk
    May 6 '14 at 7:10










  • $begingroup$
    What is content of $Q^n$? What is content its boundary?
    $endgroup$
    – George
    May 7 '14 at 13:12










  • $begingroup$
    @GogiPantsulaia, where did you get $Q^n$ from?
    $endgroup$
    – Hawk
    May 8 '14 at 1:43










  • $begingroup$
    My question is the following: what does a "content" mean?
    $endgroup$
    – George
    May 8 '14 at 7:21


















0












$begingroup$



Problem: If a set $C$ has content $0$, then the boundary must also have content $0$.




The solution say




Solution: Suppose a finite set of rectangle $ U_i = (a_{i1},b_{i1}) times dots times (a_{in}, b_{in})$ where $i in {1, dots, m }$ cover $C$ and have total volume less than $epsilon/ 2$ where $epsilon >0.$ Let $V_i = (a_{i1} - delta ,b_{i1} + delta) times dots times (a_{in} - delta , b_{in} + delta)$ where



$$prod_{iin { 1,dots,n}} (b_{ij} - a_{ij} + 2delta) - prod_{iin { 1,dots,n}} (b_{ij} - a_{aj} ) < epsilon/2m .$$




Or equivalently,




Then the union of $V_i$ cover the boundary of $C$ and have total volume less than $epsilon$. Hence $partial C$ is also of content $0$.




This is a really simple question, but does $V_i - U_i$ cover $partial C$? $V_i - U_i$ means the part where we remove $U_i$ from $V_i$.



Also is the last step because of $$ sum_{i = 1}^m vol(cup( V_i - U_i)) leq sum_{i = 1}^mprod (b_{ij} - a_{aj} + 2delta) - prod (b_{ij} - a_{aj} ) < sum_{i = 1}^m epsilon/2m = epsilon /2.$$



or equivalently,



$$ sum_{i = 1}^m vol(cup V_i ) leq sum_{i = 1}^mprod (b_{ij} - a_{aj} + 2delta) < sum_{i = 1}^m epsilon/2m + prod (b_{ij} - a_{aj} ) < epsilon /2 + epsilon/2 = epsilon. $$



Am I also correct to understand the outline of this proof is




  1. Use the finite cover that covers $C$, and take a $delta$ cover over that finite cover just enough to cover the boundary of $C$.


  2. Using the finite cover of $C$, demand this cover so that it has volume less than $epsilon/2$. Pick $delta$ small enough so that we get



$$prod_{iin { 1,dots,n}} (b_{ij} - a_{ij} + 2delta) - prod_{iin { 1,dots,n}} (b_{ij} - a_{aj} ) < epsilon/2m .$$




  1. Use finite subadditivitly to finish off the estimation.










share|cite|improve this question











$endgroup$












  • $begingroup$
    Note that you can take the cover to be closed (with the same volume) and the closed cover also covers the closure of $C$, and hence the boundary.
    $endgroup$
    – copper.hat
    May 6 '14 at 6:53










  • $begingroup$
    Wait, why does the closed cover cover the closure of $C$? This seems like a rhetorical question as you are probably going to say "because it covers the boundary…"
    $endgroup$
    – Hawk
    May 6 '14 at 7:10










  • $begingroup$
    What is content of $Q^n$? What is content its boundary?
    $endgroup$
    – George
    May 7 '14 at 13:12










  • $begingroup$
    @GogiPantsulaia, where did you get $Q^n$ from?
    $endgroup$
    – Hawk
    May 8 '14 at 1:43










  • $begingroup$
    My question is the following: what does a "content" mean?
    $endgroup$
    – George
    May 8 '14 at 7:21
















0












0








0





$begingroup$



Problem: If a set $C$ has content $0$, then the boundary must also have content $0$.




The solution say




Solution: Suppose a finite set of rectangle $ U_i = (a_{i1},b_{i1}) times dots times (a_{in}, b_{in})$ where $i in {1, dots, m }$ cover $C$ and have total volume less than $epsilon/ 2$ where $epsilon >0.$ Let $V_i = (a_{i1} - delta ,b_{i1} + delta) times dots times (a_{in} - delta , b_{in} + delta)$ where



$$prod_{iin { 1,dots,n}} (b_{ij} - a_{ij} + 2delta) - prod_{iin { 1,dots,n}} (b_{ij} - a_{aj} ) < epsilon/2m .$$




Or equivalently,




Then the union of $V_i$ cover the boundary of $C$ and have total volume less than $epsilon$. Hence $partial C$ is also of content $0$.




This is a really simple question, but does $V_i - U_i$ cover $partial C$? $V_i - U_i$ means the part where we remove $U_i$ from $V_i$.



Also is the last step because of $$ sum_{i = 1}^m vol(cup( V_i - U_i)) leq sum_{i = 1}^mprod (b_{ij} - a_{aj} + 2delta) - prod (b_{ij} - a_{aj} ) < sum_{i = 1}^m epsilon/2m = epsilon /2.$$



or equivalently,



$$ sum_{i = 1}^m vol(cup V_i ) leq sum_{i = 1}^mprod (b_{ij} - a_{aj} + 2delta) < sum_{i = 1}^m epsilon/2m + prod (b_{ij} - a_{aj} ) < epsilon /2 + epsilon/2 = epsilon. $$



Am I also correct to understand the outline of this proof is




  1. Use the finite cover that covers $C$, and take a $delta$ cover over that finite cover just enough to cover the boundary of $C$.


  2. Using the finite cover of $C$, demand this cover so that it has volume less than $epsilon/2$. Pick $delta$ small enough so that we get



$$prod_{iin { 1,dots,n}} (b_{ij} - a_{ij} + 2delta) - prod_{iin { 1,dots,n}} (b_{ij} - a_{aj} ) < epsilon/2m .$$




  1. Use finite subadditivitly to finish off the estimation.










share|cite|improve this question











$endgroup$





Problem: If a set $C$ has content $0$, then the boundary must also have content $0$.




The solution say




Solution: Suppose a finite set of rectangle $ U_i = (a_{i1},b_{i1}) times dots times (a_{in}, b_{in})$ where $i in {1, dots, m }$ cover $C$ and have total volume less than $epsilon/ 2$ where $epsilon >0.$ Let $V_i = (a_{i1} - delta ,b_{i1} + delta) times dots times (a_{in} - delta , b_{in} + delta)$ where



$$prod_{iin { 1,dots,n}} (b_{ij} - a_{ij} + 2delta) - prod_{iin { 1,dots,n}} (b_{ij} - a_{aj} ) < epsilon/2m .$$




Or equivalently,




Then the union of $V_i$ cover the boundary of $C$ and have total volume less than $epsilon$. Hence $partial C$ is also of content $0$.




This is a really simple question, but does $V_i - U_i$ cover $partial C$? $V_i - U_i$ means the part where we remove $U_i$ from $V_i$.



Also is the last step because of $$ sum_{i = 1}^m vol(cup( V_i - U_i)) leq sum_{i = 1}^mprod (b_{ij} - a_{aj} + 2delta) - prod (b_{ij} - a_{aj} ) < sum_{i = 1}^m epsilon/2m = epsilon /2.$$



or equivalently,



$$ sum_{i = 1}^m vol(cup V_i ) leq sum_{i = 1}^mprod (b_{ij} - a_{aj} + 2delta) < sum_{i = 1}^m epsilon/2m + prod (b_{ij} - a_{aj} ) < epsilon /2 + epsilon/2 = epsilon. $$



Am I also correct to understand the outline of this proof is




  1. Use the finite cover that covers $C$, and take a $delta$ cover over that finite cover just enough to cover the boundary of $C$.


  2. Using the finite cover of $C$, demand this cover so that it has volume less than $epsilon/2$. Pick $delta$ small enough so that we get



$$prod_{iin { 1,dots,n}} (b_{ij} - a_{ij} + 2delta) - prod_{iin { 1,dots,n}} (b_{ij} - a_{aj} ) < epsilon/2m .$$




  1. Use finite subadditivitly to finish off the estimation.







real-analysis measure-theory






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited May 6 '14 at 7:06







Hawk

















asked May 6 '14 at 6:45









HawkHawk

5,5651140109




5,5651140109












  • $begingroup$
    Note that you can take the cover to be closed (with the same volume) and the closed cover also covers the closure of $C$, and hence the boundary.
    $endgroup$
    – copper.hat
    May 6 '14 at 6:53










  • $begingroup$
    Wait, why does the closed cover cover the closure of $C$? This seems like a rhetorical question as you are probably going to say "because it covers the boundary…"
    $endgroup$
    – Hawk
    May 6 '14 at 7:10










  • $begingroup$
    What is content of $Q^n$? What is content its boundary?
    $endgroup$
    – George
    May 7 '14 at 13:12










  • $begingroup$
    @GogiPantsulaia, where did you get $Q^n$ from?
    $endgroup$
    – Hawk
    May 8 '14 at 1:43










  • $begingroup$
    My question is the following: what does a "content" mean?
    $endgroup$
    – George
    May 8 '14 at 7:21




















  • $begingroup$
    Note that you can take the cover to be closed (with the same volume) and the closed cover also covers the closure of $C$, and hence the boundary.
    $endgroup$
    – copper.hat
    May 6 '14 at 6:53










  • $begingroup$
    Wait, why does the closed cover cover the closure of $C$? This seems like a rhetorical question as you are probably going to say "because it covers the boundary…"
    $endgroup$
    – Hawk
    May 6 '14 at 7:10










  • $begingroup$
    What is content of $Q^n$? What is content its boundary?
    $endgroup$
    – George
    May 7 '14 at 13:12










  • $begingroup$
    @GogiPantsulaia, where did you get $Q^n$ from?
    $endgroup$
    – Hawk
    May 8 '14 at 1:43










  • $begingroup$
    My question is the following: what does a "content" mean?
    $endgroup$
    – George
    May 8 '14 at 7:21


















$begingroup$
Note that you can take the cover to be closed (with the same volume) and the closed cover also covers the closure of $C$, and hence the boundary.
$endgroup$
– copper.hat
May 6 '14 at 6:53




$begingroup$
Note that you can take the cover to be closed (with the same volume) and the closed cover also covers the closure of $C$, and hence the boundary.
$endgroup$
– copper.hat
May 6 '14 at 6:53












$begingroup$
Wait, why does the closed cover cover the closure of $C$? This seems like a rhetorical question as you are probably going to say "because it covers the boundary…"
$endgroup$
– Hawk
May 6 '14 at 7:10




$begingroup$
Wait, why does the closed cover cover the closure of $C$? This seems like a rhetorical question as you are probably going to say "because it covers the boundary…"
$endgroup$
– Hawk
May 6 '14 at 7:10












$begingroup$
What is content of $Q^n$? What is content its boundary?
$endgroup$
– George
May 7 '14 at 13:12




$begingroup$
What is content of $Q^n$? What is content its boundary?
$endgroup$
– George
May 7 '14 at 13:12












$begingroup$
@GogiPantsulaia, where did you get $Q^n$ from?
$endgroup$
– Hawk
May 8 '14 at 1:43




$begingroup$
@GogiPantsulaia, where did you get $Q^n$ from?
$endgroup$
– Hawk
May 8 '14 at 1:43












$begingroup$
My question is the following: what does a "content" mean?
$endgroup$
– George
May 8 '14 at 7:21






$begingroup$
My question is the following: what does a "content" mean?
$endgroup$
– George
May 8 '14 at 7:21












1 Answer
1






active

oldest

votes


















0












$begingroup$

$V_i-U_i$ will not cover $C$ in general. Note that $U_i$ is large enough to cover $C$, but it may be wasteful.
So the only trick is really to start with a sufficiently small finite cover for $C$, and blow it up slightly so that $V_isupset overline {U_i}$ and hence $bigcup V_isupset bigcup overline{U_i}=overline{bigcup U_i}supset overline Csupset partial C$, and thus obtain an arbitrarily small cover of $partial C$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Actually mentioning $V_i - U_i$ is red herring. It could possibly miss the entire set. Were my reasons for the outlines incorrect?
    $endgroup$
    – Hawk
    May 6 '14 at 7:30











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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f783177%2fcontent-0-implies-boundary-has-content-0%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









0












$begingroup$

$V_i-U_i$ will not cover $C$ in general. Note that $U_i$ is large enough to cover $C$, but it may be wasteful.
So the only trick is really to start with a sufficiently small finite cover for $C$, and blow it up slightly so that $V_isupset overline {U_i}$ and hence $bigcup V_isupset bigcup overline{U_i}=overline{bigcup U_i}supset overline Csupset partial C$, and thus obtain an arbitrarily small cover of $partial C$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Actually mentioning $V_i - U_i$ is red herring. It could possibly miss the entire set. Were my reasons for the outlines incorrect?
    $endgroup$
    – Hawk
    May 6 '14 at 7:30
















0












$begingroup$

$V_i-U_i$ will not cover $C$ in general. Note that $U_i$ is large enough to cover $C$, but it may be wasteful.
So the only trick is really to start with a sufficiently small finite cover for $C$, and blow it up slightly so that $V_isupset overline {U_i}$ and hence $bigcup V_isupset bigcup overline{U_i}=overline{bigcup U_i}supset overline Csupset partial C$, and thus obtain an arbitrarily small cover of $partial C$.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    Actually mentioning $V_i - U_i$ is red herring. It could possibly miss the entire set. Were my reasons for the outlines incorrect?
    $endgroup$
    – Hawk
    May 6 '14 at 7:30














0












0








0





$begingroup$

$V_i-U_i$ will not cover $C$ in general. Note that $U_i$ is large enough to cover $C$, but it may be wasteful.
So the only trick is really to start with a sufficiently small finite cover for $C$, and blow it up slightly so that $V_isupset overline {U_i}$ and hence $bigcup V_isupset bigcup overline{U_i}=overline{bigcup U_i}supset overline Csupset partial C$, and thus obtain an arbitrarily small cover of $partial C$.






share|cite|improve this answer









$endgroup$



$V_i-U_i$ will not cover $C$ in general. Note that $U_i$ is large enough to cover $C$, but it may be wasteful.
So the only trick is really to start with a sufficiently small finite cover for $C$, and blow it up slightly so that $V_isupset overline {U_i}$ and hence $bigcup V_isupset bigcup overline{U_i}=overline{bigcup U_i}supset overline Csupset partial C$, and thus obtain an arbitrarily small cover of $partial C$.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered May 6 '14 at 7:23









Hagen von EitzenHagen von Eitzen

283k23272507




283k23272507












  • $begingroup$
    Actually mentioning $V_i - U_i$ is red herring. It could possibly miss the entire set. Were my reasons for the outlines incorrect?
    $endgroup$
    – Hawk
    May 6 '14 at 7:30


















  • $begingroup$
    Actually mentioning $V_i - U_i$ is red herring. It could possibly miss the entire set. Were my reasons for the outlines incorrect?
    $endgroup$
    – Hawk
    May 6 '14 at 7:30
















$begingroup$
Actually mentioning $V_i - U_i$ is red herring. It could possibly miss the entire set. Were my reasons for the outlines incorrect?
$endgroup$
– Hawk
May 6 '14 at 7:30




$begingroup$
Actually mentioning $V_i - U_i$ is red herring. It could possibly miss the entire set. Were my reasons for the outlines incorrect?
$endgroup$
– Hawk
May 6 '14 at 7:30


















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f783177%2fcontent-0-implies-boundary-has-content-0%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

MongoDB - Not Authorized To Execute Command

How to fix TextFormField cause rebuild widget in Flutter

in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith