Given rectangle $L subseteq mathbb{R}^n$ st. $v(L) = r$, can we cover $L$ by countably many rectangles $Q_i$...












0












$begingroup$



Consider a rectangle $L = [a_1, b_1 ] times dots times [a_n, b_n]subseteq mathbb{R}^n$ such that $v(L) = r$, can we cover $L$ by countably many rectangles $Q_i$ such that $sum_{i=1}^{infty}v(Q_i) < r$?




Note that $v(L) = (b_1 - a_1)dots (b_n-a_n)$. Now intuitively I think the answer to this is no, however I'm not really sure how I could prove this, in the sense that if I suppose that I can find such a covering I don't see any way to reach a contradiction.










share|cite|improve this question









$endgroup$












  • $begingroup$
    What do you mean by covering?
    $endgroup$
    – BigbearZzz
    Dec 13 '18 at 5:59










  • $begingroup$
    @BigbearZzz I mean that $L subseteq bigcup_{i=1}^{infty} Q_i$
    $endgroup$
    – Perturbative
    Dec 13 '18 at 6:00










  • $begingroup$
    I presume that by $v(A)$ you mean the Lebesgue measure of $A$?
    $endgroup$
    – BigbearZzz
    Dec 13 '18 at 6:03
















0












$begingroup$



Consider a rectangle $L = [a_1, b_1 ] times dots times [a_n, b_n]subseteq mathbb{R}^n$ such that $v(L) = r$, can we cover $L$ by countably many rectangles $Q_i$ such that $sum_{i=1}^{infty}v(Q_i) < r$?




Note that $v(L) = (b_1 - a_1)dots (b_n-a_n)$. Now intuitively I think the answer to this is no, however I'm not really sure how I could prove this, in the sense that if I suppose that I can find such a covering I don't see any way to reach a contradiction.










share|cite|improve this question









$endgroup$












  • $begingroup$
    What do you mean by covering?
    $endgroup$
    – BigbearZzz
    Dec 13 '18 at 5:59










  • $begingroup$
    @BigbearZzz I mean that $L subseteq bigcup_{i=1}^{infty} Q_i$
    $endgroup$
    – Perturbative
    Dec 13 '18 at 6:00










  • $begingroup$
    I presume that by $v(A)$ you mean the Lebesgue measure of $A$?
    $endgroup$
    – BigbearZzz
    Dec 13 '18 at 6:03














0












0








0





$begingroup$



Consider a rectangle $L = [a_1, b_1 ] times dots times [a_n, b_n]subseteq mathbb{R}^n$ such that $v(L) = r$, can we cover $L$ by countably many rectangles $Q_i$ such that $sum_{i=1}^{infty}v(Q_i) < r$?




Note that $v(L) = (b_1 - a_1)dots (b_n-a_n)$. Now intuitively I think the answer to this is no, however I'm not really sure how I could prove this, in the sense that if I suppose that I can find such a covering I don't see any way to reach a contradiction.










share|cite|improve this question









$endgroup$





Consider a rectangle $L = [a_1, b_1 ] times dots times [a_n, b_n]subseteq mathbb{R}^n$ such that $v(L) = r$, can we cover $L$ by countably many rectangles $Q_i$ such that $sum_{i=1}^{infty}v(Q_i) < r$?




Note that $v(L) = (b_1 - a_1)dots (b_n-a_n)$. Now intuitively I think the answer to this is no, however I'm not really sure how I could prove this, in the sense that if I suppose that I can find such a covering I don't see any way to reach a contradiction.







real-analysis measure-theory






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 13 '18 at 5:55









PerturbativePerturbative

4,35811552




4,35811552












  • $begingroup$
    What do you mean by covering?
    $endgroup$
    – BigbearZzz
    Dec 13 '18 at 5:59










  • $begingroup$
    @BigbearZzz I mean that $L subseteq bigcup_{i=1}^{infty} Q_i$
    $endgroup$
    – Perturbative
    Dec 13 '18 at 6:00










  • $begingroup$
    I presume that by $v(A)$ you mean the Lebesgue measure of $A$?
    $endgroup$
    – BigbearZzz
    Dec 13 '18 at 6:03


















  • $begingroup$
    What do you mean by covering?
    $endgroup$
    – BigbearZzz
    Dec 13 '18 at 5:59










  • $begingroup$
    @BigbearZzz I mean that $L subseteq bigcup_{i=1}^{infty} Q_i$
    $endgroup$
    – Perturbative
    Dec 13 '18 at 6:00










  • $begingroup$
    I presume that by $v(A)$ you mean the Lebesgue measure of $A$?
    $endgroup$
    – BigbearZzz
    Dec 13 '18 at 6:03
















$begingroup$
What do you mean by covering?
$endgroup$
– BigbearZzz
Dec 13 '18 at 5:59




$begingroup$
What do you mean by covering?
$endgroup$
– BigbearZzz
Dec 13 '18 at 5:59












$begingroup$
@BigbearZzz I mean that $L subseteq bigcup_{i=1}^{infty} Q_i$
$endgroup$
– Perturbative
Dec 13 '18 at 6:00




$begingroup$
@BigbearZzz I mean that $L subseteq bigcup_{i=1}^{infty} Q_i$
$endgroup$
– Perturbative
Dec 13 '18 at 6:00












$begingroup$
I presume that by $v(A)$ you mean the Lebesgue measure of $A$?
$endgroup$
– BigbearZzz
Dec 13 '18 at 6:03




$begingroup$
I presume that by $v(A)$ you mean the Lebesgue measure of $A$?
$endgroup$
– BigbearZzz
Dec 13 '18 at 6:03










2 Answers
2






active

oldest

votes


















1












$begingroup$

No, of course this follows from the theory of Lebesgue measure.



If you don't want to appeal to that, then consider this. One can expand
the $Q_i$ slightly so they become open but still the sum of their measures
is less than $v(L)$. As $L$ is compact, Heine-Borel shows that a finite
number of the $Q_i$ cover $L$. Now it is quite elementary that
$sum_{i=1}^n v(Q_i)ge v(L)$ for a finite covering of rectangles.






share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    I'll suppose that $v(A)$ coincides with the $n$-dimensional Lebesgue measure of $A$. Assuming we can find such a cover, then
    $$
    v(L) le vleft(bigcup_{i=1}^infty Q_iright)
    $$

    since $v$ is monotonic and $Lsubset cup_{i=1}^infty Q_i$. However, $v$ is also subadditive, i.e. $vleft(bigcup_{i=1}^infty A_iright) le sum_{i=1}^infty v(A_i)$ (and equality holds when $A_i$ are disjoint), hence
    $$
    r=v(L) le vleft(bigcup_{i=1}^infty Q_iright) le sum_{i=1}^infty v(Q_i) <r.
    $$

    This is a contradiction.



    Edit: If your definition of the function $v$ only involves rectangular set, then it is possible to extend $v$ so that its domain is a pretty large class of subsets of $Bbb R^n$ called the measurable sets. You can look up Caratheodory extension theorem if you want to know precisely what I meant.






    share|cite|improve this answer











    $endgroup$













      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%2f3037656%2fgiven-rectangle-l-subseteq-mathbbrn-st-vl-r-can-we-cover-l-by-c%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









      1












      $begingroup$

      No, of course this follows from the theory of Lebesgue measure.



      If you don't want to appeal to that, then consider this. One can expand
      the $Q_i$ slightly so they become open but still the sum of their measures
      is less than $v(L)$. As $L$ is compact, Heine-Borel shows that a finite
      number of the $Q_i$ cover $L$. Now it is quite elementary that
      $sum_{i=1}^n v(Q_i)ge v(L)$ for a finite covering of rectangles.






      share|cite|improve this answer









      $endgroup$


















        1












        $begingroup$

        No, of course this follows from the theory of Lebesgue measure.



        If you don't want to appeal to that, then consider this. One can expand
        the $Q_i$ slightly so they become open but still the sum of their measures
        is less than $v(L)$. As $L$ is compact, Heine-Borel shows that a finite
        number of the $Q_i$ cover $L$. Now it is quite elementary that
        $sum_{i=1}^n v(Q_i)ge v(L)$ for a finite covering of rectangles.






        share|cite|improve this answer









        $endgroup$
















          1












          1








          1





          $begingroup$

          No, of course this follows from the theory of Lebesgue measure.



          If you don't want to appeal to that, then consider this. One can expand
          the $Q_i$ slightly so they become open but still the sum of their measures
          is less than $v(L)$. As $L$ is compact, Heine-Borel shows that a finite
          number of the $Q_i$ cover $L$. Now it is quite elementary that
          $sum_{i=1}^n v(Q_i)ge v(L)$ for a finite covering of rectangles.






          share|cite|improve this answer









          $endgroup$



          No, of course this follows from the theory of Lebesgue measure.



          If you don't want to appeal to that, then consider this. One can expand
          the $Q_i$ slightly so they become open but still the sum of their measures
          is less than $v(L)$. As $L$ is compact, Heine-Borel shows that a finite
          number of the $Q_i$ cover $L$. Now it is quite elementary that
          $sum_{i=1}^n v(Q_i)ge v(L)$ for a finite covering of rectangles.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 13 '18 at 6:00









          Lord Shark the UnknownLord Shark the Unknown

          104k1160132




          104k1160132























              0












              $begingroup$

              I'll suppose that $v(A)$ coincides with the $n$-dimensional Lebesgue measure of $A$. Assuming we can find such a cover, then
              $$
              v(L) le vleft(bigcup_{i=1}^infty Q_iright)
              $$

              since $v$ is monotonic and $Lsubset cup_{i=1}^infty Q_i$. However, $v$ is also subadditive, i.e. $vleft(bigcup_{i=1}^infty A_iright) le sum_{i=1}^infty v(A_i)$ (and equality holds when $A_i$ are disjoint), hence
              $$
              r=v(L) le vleft(bigcup_{i=1}^infty Q_iright) le sum_{i=1}^infty v(Q_i) <r.
              $$

              This is a contradiction.



              Edit: If your definition of the function $v$ only involves rectangular set, then it is possible to extend $v$ so that its domain is a pretty large class of subsets of $Bbb R^n$ called the measurable sets. You can look up Caratheodory extension theorem if you want to know precisely what I meant.






              share|cite|improve this answer











              $endgroup$


















                0












                $begingroup$

                I'll suppose that $v(A)$ coincides with the $n$-dimensional Lebesgue measure of $A$. Assuming we can find such a cover, then
                $$
                v(L) le vleft(bigcup_{i=1}^infty Q_iright)
                $$

                since $v$ is monotonic and $Lsubset cup_{i=1}^infty Q_i$. However, $v$ is also subadditive, i.e. $vleft(bigcup_{i=1}^infty A_iright) le sum_{i=1}^infty v(A_i)$ (and equality holds when $A_i$ are disjoint), hence
                $$
                r=v(L) le vleft(bigcup_{i=1}^infty Q_iright) le sum_{i=1}^infty v(Q_i) <r.
                $$

                This is a contradiction.



                Edit: If your definition of the function $v$ only involves rectangular set, then it is possible to extend $v$ so that its domain is a pretty large class of subsets of $Bbb R^n$ called the measurable sets. You can look up Caratheodory extension theorem if you want to know precisely what I meant.






                share|cite|improve this answer











                $endgroup$
















                  0












                  0








                  0





                  $begingroup$

                  I'll suppose that $v(A)$ coincides with the $n$-dimensional Lebesgue measure of $A$. Assuming we can find such a cover, then
                  $$
                  v(L) le vleft(bigcup_{i=1}^infty Q_iright)
                  $$

                  since $v$ is monotonic and $Lsubset cup_{i=1}^infty Q_i$. However, $v$ is also subadditive, i.e. $vleft(bigcup_{i=1}^infty A_iright) le sum_{i=1}^infty v(A_i)$ (and equality holds when $A_i$ are disjoint), hence
                  $$
                  r=v(L) le vleft(bigcup_{i=1}^infty Q_iright) le sum_{i=1}^infty v(Q_i) <r.
                  $$

                  This is a contradiction.



                  Edit: If your definition of the function $v$ only involves rectangular set, then it is possible to extend $v$ so that its domain is a pretty large class of subsets of $Bbb R^n$ called the measurable sets. You can look up Caratheodory extension theorem if you want to know precisely what I meant.






                  share|cite|improve this answer











                  $endgroup$



                  I'll suppose that $v(A)$ coincides with the $n$-dimensional Lebesgue measure of $A$. Assuming we can find such a cover, then
                  $$
                  v(L) le vleft(bigcup_{i=1}^infty Q_iright)
                  $$

                  since $v$ is monotonic and $Lsubset cup_{i=1}^infty Q_i$. However, $v$ is also subadditive, i.e. $vleft(bigcup_{i=1}^infty A_iright) le sum_{i=1}^infty v(A_i)$ (and equality holds when $A_i$ are disjoint), hence
                  $$
                  r=v(L) le vleft(bigcup_{i=1}^infty Q_iright) le sum_{i=1}^infty v(Q_i) <r.
                  $$

                  This is a contradiction.



                  Edit: If your definition of the function $v$ only involves rectangular set, then it is possible to extend $v$ so that its domain is a pretty large class of subsets of $Bbb R^n$ called the measurable sets. You can look up Caratheodory extension theorem if you want to know precisely what I meant.







                  share|cite|improve this answer














                  share|cite|improve this answer



                  share|cite|improve this answer








                  edited Dec 13 '18 at 17:09

























                  answered Dec 13 '18 at 6:10









                  BigbearZzzBigbearZzz

                  8,72621652




                  8,72621652






























                      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%2f3037656%2fgiven-rectangle-l-subseteq-mathbbrn-st-vl-r-can-we-cover-l-by-c%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

                      How do I know what Microsoft account the skydrive app is syncing to?

                      When does type information flow backwards in C++?

                      Grease: Live!