Understanding the proof $mu$ is invariant then $mu$ is a linear transformation of Lebesgue measure












2












$begingroup$



Exercise: Let $mu$ be a Lebesgue-Stieltjes measure on $mathscr{B}_{mathbb{R}}$ invariant for the class of right half-closed intervals of $mathbb{R}$, so that, $mu(a+I)=mu(I)$, for all $ainmathbb{R}$ and $I=(x,y]$. Show that, in $mathscr{B}_mathbb{R}$, $mu=c.Leb$ where cin$mathbb{R}$ and Leb denotes the Lebesgue measure.




I posted this question on another thread and this answer from another thread was suggested. Due to the fact it is an old post I did not expect the author to answer me:



The answer was:



"Here is a way to argue out. I will let you fill in the details.





  1. If we let $mu([0,1))=C$, then $mu([0,1/n)) = C/n$, where $n in mathbb{Z}^+$. This follows from additivity and translation invariance.


    1. Now prove that if $(b-a) in mathbb{Q}^+$, then $mu([a,b)) = C(b-a)$ using translation invariance and what you obtained from the previous result.

    2. Now use the monotonicity of the measure to get lower continuity of the measure for all intervals $[a,b)$.




Hence, $mu([a,b)) = mu([0,1]) times(b-a)$." by user17762




Attempted proof: 1) It is true the $[0,1]=bigcup_{i=0}^{n}(frac{i}{n},frac{i+1}{n}]$



Since the measure $mu$ is invariant then $mu((frac{i}{n},frac{i+1}{n}])=mu((frac{i}{n}-frac{1}{n},frac{i+1}{n}-frac{1}{n}])=mu((frac{i-1}{n},frac{i}{n}])$, which proves every individual set of the covering has the same measure then by addititvity $mu((0,1])=mu(bigcup_limits{i=0}^{n}(frac{i}{n},frac{i+1}{n}])=sum_limits{i=0}^{n}mu((frac{i}{n},frac{i+1}{n}])=mu((0,1])$



This implies $mu((0,frac{1}{n}])=frac{C}{n}$.
However I am having trouble on proving 2) once I cannot relate the interval (a,b] and its respective length to the previous definition as the author intended.



Question:



Can someone help me prove point 2) and explain point 3)?



Thanks in advance!










share|cite|improve this question











$endgroup$

















    2












    $begingroup$



    Exercise: Let $mu$ be a Lebesgue-Stieltjes measure on $mathscr{B}_{mathbb{R}}$ invariant for the class of right half-closed intervals of $mathbb{R}$, so that, $mu(a+I)=mu(I)$, for all $ainmathbb{R}$ and $I=(x,y]$. Show that, in $mathscr{B}_mathbb{R}$, $mu=c.Leb$ where cin$mathbb{R}$ and Leb denotes the Lebesgue measure.




    I posted this question on another thread and this answer from another thread was suggested. Due to the fact it is an old post I did not expect the author to answer me:



    The answer was:



    "Here is a way to argue out. I will let you fill in the details.





    1. If we let $mu([0,1))=C$, then $mu([0,1/n)) = C/n$, where $n in mathbb{Z}^+$. This follows from additivity and translation invariance.


      1. Now prove that if $(b-a) in mathbb{Q}^+$, then $mu([a,b)) = C(b-a)$ using translation invariance and what you obtained from the previous result.

      2. Now use the monotonicity of the measure to get lower continuity of the measure for all intervals $[a,b)$.




    Hence, $mu([a,b)) = mu([0,1]) times(b-a)$." by user17762




    Attempted proof: 1) It is true the $[0,1]=bigcup_{i=0}^{n}(frac{i}{n},frac{i+1}{n}]$



    Since the measure $mu$ is invariant then $mu((frac{i}{n},frac{i+1}{n}])=mu((frac{i}{n}-frac{1}{n},frac{i+1}{n}-frac{1}{n}])=mu((frac{i-1}{n},frac{i}{n}])$, which proves every individual set of the covering has the same measure then by addititvity $mu((0,1])=mu(bigcup_limits{i=0}^{n}(frac{i}{n},frac{i+1}{n}])=sum_limits{i=0}^{n}mu((frac{i}{n},frac{i+1}{n}])=mu((0,1])$



    This implies $mu((0,frac{1}{n}])=frac{C}{n}$.
    However I am having trouble on proving 2) once I cannot relate the interval (a,b] and its respective length to the previous definition as the author intended.



    Question:



    Can someone help me prove point 2) and explain point 3)?



    Thanks in advance!










    share|cite|improve this question











    $endgroup$















      2












      2








      2


      1



      $begingroup$



      Exercise: Let $mu$ be a Lebesgue-Stieltjes measure on $mathscr{B}_{mathbb{R}}$ invariant for the class of right half-closed intervals of $mathbb{R}$, so that, $mu(a+I)=mu(I)$, for all $ainmathbb{R}$ and $I=(x,y]$. Show that, in $mathscr{B}_mathbb{R}$, $mu=c.Leb$ where cin$mathbb{R}$ and Leb denotes the Lebesgue measure.




      I posted this question on another thread and this answer from another thread was suggested. Due to the fact it is an old post I did not expect the author to answer me:



      The answer was:



      "Here is a way to argue out. I will let you fill in the details.





      1. If we let $mu([0,1))=C$, then $mu([0,1/n)) = C/n$, where $n in mathbb{Z}^+$. This follows from additivity and translation invariance.


        1. Now prove that if $(b-a) in mathbb{Q}^+$, then $mu([a,b)) = C(b-a)$ using translation invariance and what you obtained from the previous result.

        2. Now use the monotonicity of the measure to get lower continuity of the measure for all intervals $[a,b)$.




      Hence, $mu([a,b)) = mu([0,1]) times(b-a)$." by user17762




      Attempted proof: 1) It is true the $[0,1]=bigcup_{i=0}^{n}(frac{i}{n},frac{i+1}{n}]$



      Since the measure $mu$ is invariant then $mu((frac{i}{n},frac{i+1}{n}])=mu((frac{i}{n}-frac{1}{n},frac{i+1}{n}-frac{1}{n}])=mu((frac{i-1}{n},frac{i}{n}])$, which proves every individual set of the covering has the same measure then by addititvity $mu((0,1])=mu(bigcup_limits{i=0}^{n}(frac{i}{n},frac{i+1}{n}])=sum_limits{i=0}^{n}mu((frac{i}{n},frac{i+1}{n}])=mu((0,1])$



      This implies $mu((0,frac{1}{n}])=frac{C}{n}$.
      However I am having trouble on proving 2) once I cannot relate the interval (a,b] and its respective length to the previous definition as the author intended.



      Question:



      Can someone help me prove point 2) and explain point 3)?



      Thanks in advance!










      share|cite|improve this question











      $endgroup$





      Exercise: Let $mu$ be a Lebesgue-Stieltjes measure on $mathscr{B}_{mathbb{R}}$ invariant for the class of right half-closed intervals of $mathbb{R}$, so that, $mu(a+I)=mu(I)$, for all $ainmathbb{R}$ and $I=(x,y]$. Show that, in $mathscr{B}_mathbb{R}$, $mu=c.Leb$ where cin$mathbb{R}$ and Leb denotes the Lebesgue measure.




      I posted this question on another thread and this answer from another thread was suggested. Due to the fact it is an old post I did not expect the author to answer me:



      The answer was:



      "Here is a way to argue out. I will let you fill in the details.





      1. If we let $mu([0,1))=C$, then $mu([0,1/n)) = C/n$, where $n in mathbb{Z}^+$. This follows from additivity and translation invariance.


        1. Now prove that if $(b-a) in mathbb{Q}^+$, then $mu([a,b)) = C(b-a)$ using translation invariance and what you obtained from the previous result.

        2. Now use the monotonicity of the measure to get lower continuity of the measure for all intervals $[a,b)$.




      Hence, $mu([a,b)) = mu([0,1]) times(b-a)$." by user17762




      Attempted proof: 1) It is true the $[0,1]=bigcup_{i=0}^{n}(frac{i}{n},frac{i+1}{n}]$



      Since the measure $mu$ is invariant then $mu((frac{i}{n},frac{i+1}{n}])=mu((frac{i}{n}-frac{1}{n},frac{i+1}{n}-frac{1}{n}])=mu((frac{i-1}{n},frac{i}{n}])$, which proves every individual set of the covering has the same measure then by addititvity $mu((0,1])=mu(bigcup_limits{i=0}^{n}(frac{i}{n},frac{i+1}{n}])=sum_limits{i=0}^{n}mu((frac{i}{n},frac{i+1}{n}])=mu((0,1])$



      This implies $mu((0,frac{1}{n}])=frac{C}{n}$.
      However I am having trouble on proving 2) once I cannot relate the interval (a,b] and its respective length to the previous definition as the author intended.



      Question:



      Can someone help me prove point 2) and explain point 3)?



      Thanks in advance!







      real-analysis measure-theory lebesgue-measure






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 23 '18 at 14:19









      Bernard

      120k740115




      120k740115










      asked Dec 23 '18 at 14:17









      Pedro GomesPedro Gomes

      1,8222721




      1,8222721






















          2 Answers
          2






          active

          oldest

          votes


















          1












          $begingroup$

          Although you have another kind of intervals in your main question, you can easily "reverse" your proof to get $mu((0,1/n])=C/n$ with $C=mu((0,1])$. You are almost there, let me help you with part 2 first. For the measure of $(a, b] $ with $a, binmathbb Q$ it is enough to consider the case with nonnegative rationals. Indeed we can always consider $(a, b] - a$ otherwise. One has by the exclusion property of the measure
          begin{align}tag{$*$}mu((a,b])=mu((0,b]setminus(0,a])=mu((0,b])-mu((0,a])end{align}
          So it is enough to show that for $a=p/q$ with $p,q$ nonnegative integers
          begin{align}
          mu((0,a])=Cp/q
          end{align}

          We write
          begin{align}
          mu((0,a])=muleft(bigcup_{k=1}^p left(frac{k-1}{q},frac{k}{q}right] right) = sum_{k=1}^p muleft(left(frac{k-1}{q},frac{k}{q}right] right) = sum_{k=1}^p muleft(left(0,frac{1}{q}right] right)=Cp/q=Ca
          end{align}

          Since $a$ was arbitrary choice the same holds for $binmathbb Q$ implying that equation $(*)$ can be written as
          begin{align}
          mu((a,b])=mu((0,b])-mu((0,a])=Cb-Ca=C(b-a)
          end{align}

          I finish the proof in a (slightly) different way. Notice that
          begin{align}
          mathcal C:={(a,b] : a,bin mathbb Q}
          end{align}

          is a $pi$-system that generates the Borel $sigma$-algebra. We have just showed that
          begin{align}
          Coperatorname{Leb}(A)=mu(A)
          end{align}

          for all $Ainmathcal C$. By the uniqueness of measure, we conclude that
          begin{align}
          Coperatorname{Leb}(A)=mu(A)
          end{align}

          for all $Ainmathcal B$.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Could you add steps to prove how you get $mu(a,b)=C(b-a)$, please? Thanks in advance!
            $endgroup$
            – Pedro Gomes
            Dec 23 '18 at 18:08










          • $begingroup$
            What do you mean exactly? Since we are considering similar things with subtle difference, it is not clear what you are asking. What kind of interval are you considering? What are $a,b$? Real or rational?
            $endgroup$
            – Shashi
            Dec 23 '18 at 18:11










          • $begingroup$
            $a,binmathbb{Q}^+ $You proved $a=frac{p}{q}$ but you were dealing with the interval $(a,b]$. Point 2) claims $mu(a,b]=C(b-a)$. But I am still striving to see that conclusion from your argument, that is why I kindly asked if you could include some more steps.
            $endgroup$
            – Pedro Gomes
            Dec 23 '18 at 18:14












          • $begingroup$
            @PedroGomes Now I understand what your question is, I added more elaboration. Is it clear now?
            $endgroup$
            – Shashi
            Dec 23 '18 at 18:19










          • $begingroup$
            @PedroGomes I was considering nonnegative rationals first without explicitly saying it. Now I put in the text something about it.
            $endgroup$
            – Shashi
            Dec 23 '18 at 21:07



















          1












          $begingroup$

          I think the proof will be easier to push through if we break it up a bit. If this answer is not what you are looking for, I will be glad to delete it. But all you really need to know here is that every open set is a countable disjoint union of half-open intervals with rational endpoints (even dyadic rational endpoints). Then, the main idea is that Lebesgue measure is the only translation-invariant measure on $mathscr B(mathbb R)$ that assigns to each half-open interval with rational endpoints, its length. From there, it's a little trick to finish the proof.



          Cohn does it like this:



          Suppose that $mu$ is another measure that does so. Then, if $U$ is an open subset of $mathbb R$, it is a disjoint countable union of half-open intervals with rational endpoints $I_n$. Then,



          $mu (U)=sum mu (I_n)=sum lambda (I_n)=lambda (U).$



          So, $mu$ and $lambda$ agree on the open sets. Regularity of $lambda$ now implies that $mu(E)le lambda(E)$ for all Borel sets.



          For the reverse inequality, suppose that $A$ is a bounded Borel set and take an open set $V$ containing $A$ and apply the previous inequality, to get



          $mu(V)=mu (A)+mu (V-A)le lambda (A)+lambda (V-A)=lambda (V)$



          so $mu(A)=lambda (A).$



          For the unbounded case, note that $A=cup_n (-n,n]cap A$ and use the countable additivity of $mu$ and $lambda$.



          So, $mu=lambda$ on the Borel sets, which proves the main claim.



          To finish, define a new measure $nu$ on the Borel sets of $mathbb R$ by $nu(E)=frac{1}{c}mu(E)$. Then, $nu$ is translation invariant, and $nu((0,1])=lambda((0,1]).$



          Take an interval $I=(r,r+2^{-k}]; rin mathbb Q.$ Then, $I$ is an interval with rational endpoints, and now, using the translation invariance the measures, and the result we just proved, we have



          $2^kcdot nu(I)=nu((0,1])=lambda((0,1])=2^klambda (I)Rightarrow nu(I)=lambda(I)$,



          so $nu=lambda$ on the Borel sets, and thus $mu=clambda.$






          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%2f3050373%2funderstanding-the-proof-mu-is-invariant-then-mu-is-a-linear-transformation%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$

            Although you have another kind of intervals in your main question, you can easily "reverse" your proof to get $mu((0,1/n])=C/n$ with $C=mu((0,1])$. You are almost there, let me help you with part 2 first. For the measure of $(a, b] $ with $a, binmathbb Q$ it is enough to consider the case with nonnegative rationals. Indeed we can always consider $(a, b] - a$ otherwise. One has by the exclusion property of the measure
            begin{align}tag{$*$}mu((a,b])=mu((0,b]setminus(0,a])=mu((0,b])-mu((0,a])end{align}
            So it is enough to show that for $a=p/q$ with $p,q$ nonnegative integers
            begin{align}
            mu((0,a])=Cp/q
            end{align}

            We write
            begin{align}
            mu((0,a])=muleft(bigcup_{k=1}^p left(frac{k-1}{q},frac{k}{q}right] right) = sum_{k=1}^p muleft(left(frac{k-1}{q},frac{k}{q}right] right) = sum_{k=1}^p muleft(left(0,frac{1}{q}right] right)=Cp/q=Ca
            end{align}

            Since $a$ was arbitrary choice the same holds for $binmathbb Q$ implying that equation $(*)$ can be written as
            begin{align}
            mu((a,b])=mu((0,b])-mu((0,a])=Cb-Ca=C(b-a)
            end{align}

            I finish the proof in a (slightly) different way. Notice that
            begin{align}
            mathcal C:={(a,b] : a,bin mathbb Q}
            end{align}

            is a $pi$-system that generates the Borel $sigma$-algebra. We have just showed that
            begin{align}
            Coperatorname{Leb}(A)=mu(A)
            end{align}

            for all $Ainmathcal C$. By the uniqueness of measure, we conclude that
            begin{align}
            Coperatorname{Leb}(A)=mu(A)
            end{align}

            for all $Ainmathcal B$.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              Could you add steps to prove how you get $mu(a,b)=C(b-a)$, please? Thanks in advance!
              $endgroup$
              – Pedro Gomes
              Dec 23 '18 at 18:08










            • $begingroup$
              What do you mean exactly? Since we are considering similar things with subtle difference, it is not clear what you are asking. What kind of interval are you considering? What are $a,b$? Real or rational?
              $endgroup$
              – Shashi
              Dec 23 '18 at 18:11










            • $begingroup$
              $a,binmathbb{Q}^+ $You proved $a=frac{p}{q}$ but you were dealing with the interval $(a,b]$. Point 2) claims $mu(a,b]=C(b-a)$. But I am still striving to see that conclusion from your argument, that is why I kindly asked if you could include some more steps.
              $endgroup$
              – Pedro Gomes
              Dec 23 '18 at 18:14












            • $begingroup$
              @PedroGomes Now I understand what your question is, I added more elaboration. Is it clear now?
              $endgroup$
              – Shashi
              Dec 23 '18 at 18:19










            • $begingroup$
              @PedroGomes I was considering nonnegative rationals first without explicitly saying it. Now I put in the text something about it.
              $endgroup$
              – Shashi
              Dec 23 '18 at 21:07
















            1












            $begingroup$

            Although you have another kind of intervals in your main question, you can easily "reverse" your proof to get $mu((0,1/n])=C/n$ with $C=mu((0,1])$. You are almost there, let me help you with part 2 first. For the measure of $(a, b] $ with $a, binmathbb Q$ it is enough to consider the case with nonnegative rationals. Indeed we can always consider $(a, b] - a$ otherwise. One has by the exclusion property of the measure
            begin{align}tag{$*$}mu((a,b])=mu((0,b]setminus(0,a])=mu((0,b])-mu((0,a])end{align}
            So it is enough to show that for $a=p/q$ with $p,q$ nonnegative integers
            begin{align}
            mu((0,a])=Cp/q
            end{align}

            We write
            begin{align}
            mu((0,a])=muleft(bigcup_{k=1}^p left(frac{k-1}{q},frac{k}{q}right] right) = sum_{k=1}^p muleft(left(frac{k-1}{q},frac{k}{q}right] right) = sum_{k=1}^p muleft(left(0,frac{1}{q}right] right)=Cp/q=Ca
            end{align}

            Since $a$ was arbitrary choice the same holds for $binmathbb Q$ implying that equation $(*)$ can be written as
            begin{align}
            mu((a,b])=mu((0,b])-mu((0,a])=Cb-Ca=C(b-a)
            end{align}

            I finish the proof in a (slightly) different way. Notice that
            begin{align}
            mathcal C:={(a,b] : a,bin mathbb Q}
            end{align}

            is a $pi$-system that generates the Borel $sigma$-algebra. We have just showed that
            begin{align}
            Coperatorname{Leb}(A)=mu(A)
            end{align}

            for all $Ainmathcal C$. By the uniqueness of measure, we conclude that
            begin{align}
            Coperatorname{Leb}(A)=mu(A)
            end{align}

            for all $Ainmathcal B$.






            share|cite|improve this answer











            $endgroup$













            • $begingroup$
              Could you add steps to prove how you get $mu(a,b)=C(b-a)$, please? Thanks in advance!
              $endgroup$
              – Pedro Gomes
              Dec 23 '18 at 18:08










            • $begingroup$
              What do you mean exactly? Since we are considering similar things with subtle difference, it is not clear what you are asking. What kind of interval are you considering? What are $a,b$? Real or rational?
              $endgroup$
              – Shashi
              Dec 23 '18 at 18:11










            • $begingroup$
              $a,binmathbb{Q}^+ $You proved $a=frac{p}{q}$ but you were dealing with the interval $(a,b]$. Point 2) claims $mu(a,b]=C(b-a)$. But I am still striving to see that conclusion from your argument, that is why I kindly asked if you could include some more steps.
              $endgroup$
              – Pedro Gomes
              Dec 23 '18 at 18:14












            • $begingroup$
              @PedroGomes Now I understand what your question is, I added more elaboration. Is it clear now?
              $endgroup$
              – Shashi
              Dec 23 '18 at 18:19










            • $begingroup$
              @PedroGomes I was considering nonnegative rationals first without explicitly saying it. Now I put in the text something about it.
              $endgroup$
              – Shashi
              Dec 23 '18 at 21:07














            1












            1








            1





            $begingroup$

            Although you have another kind of intervals in your main question, you can easily "reverse" your proof to get $mu((0,1/n])=C/n$ with $C=mu((0,1])$. You are almost there, let me help you with part 2 first. For the measure of $(a, b] $ with $a, binmathbb Q$ it is enough to consider the case with nonnegative rationals. Indeed we can always consider $(a, b] - a$ otherwise. One has by the exclusion property of the measure
            begin{align}tag{$*$}mu((a,b])=mu((0,b]setminus(0,a])=mu((0,b])-mu((0,a])end{align}
            So it is enough to show that for $a=p/q$ with $p,q$ nonnegative integers
            begin{align}
            mu((0,a])=Cp/q
            end{align}

            We write
            begin{align}
            mu((0,a])=muleft(bigcup_{k=1}^p left(frac{k-1}{q},frac{k}{q}right] right) = sum_{k=1}^p muleft(left(frac{k-1}{q},frac{k}{q}right] right) = sum_{k=1}^p muleft(left(0,frac{1}{q}right] right)=Cp/q=Ca
            end{align}

            Since $a$ was arbitrary choice the same holds for $binmathbb Q$ implying that equation $(*)$ can be written as
            begin{align}
            mu((a,b])=mu((0,b])-mu((0,a])=Cb-Ca=C(b-a)
            end{align}

            I finish the proof in a (slightly) different way. Notice that
            begin{align}
            mathcal C:={(a,b] : a,bin mathbb Q}
            end{align}

            is a $pi$-system that generates the Borel $sigma$-algebra. We have just showed that
            begin{align}
            Coperatorname{Leb}(A)=mu(A)
            end{align}

            for all $Ainmathcal C$. By the uniqueness of measure, we conclude that
            begin{align}
            Coperatorname{Leb}(A)=mu(A)
            end{align}

            for all $Ainmathcal B$.






            share|cite|improve this answer











            $endgroup$



            Although you have another kind of intervals in your main question, you can easily "reverse" your proof to get $mu((0,1/n])=C/n$ with $C=mu((0,1])$. You are almost there, let me help you with part 2 first. For the measure of $(a, b] $ with $a, binmathbb Q$ it is enough to consider the case with nonnegative rationals. Indeed we can always consider $(a, b] - a$ otherwise. One has by the exclusion property of the measure
            begin{align}tag{$*$}mu((a,b])=mu((0,b]setminus(0,a])=mu((0,b])-mu((0,a])end{align}
            So it is enough to show that for $a=p/q$ with $p,q$ nonnegative integers
            begin{align}
            mu((0,a])=Cp/q
            end{align}

            We write
            begin{align}
            mu((0,a])=muleft(bigcup_{k=1}^p left(frac{k-1}{q},frac{k}{q}right] right) = sum_{k=1}^p muleft(left(frac{k-1}{q},frac{k}{q}right] right) = sum_{k=1}^p muleft(left(0,frac{1}{q}right] right)=Cp/q=Ca
            end{align}

            Since $a$ was arbitrary choice the same holds for $binmathbb Q$ implying that equation $(*)$ can be written as
            begin{align}
            mu((a,b])=mu((0,b])-mu((0,a])=Cb-Ca=C(b-a)
            end{align}

            I finish the proof in a (slightly) different way. Notice that
            begin{align}
            mathcal C:={(a,b] : a,bin mathbb Q}
            end{align}

            is a $pi$-system that generates the Borel $sigma$-algebra. We have just showed that
            begin{align}
            Coperatorname{Leb}(A)=mu(A)
            end{align}

            for all $Ainmathcal C$. By the uniqueness of measure, we conclude that
            begin{align}
            Coperatorname{Leb}(A)=mu(A)
            end{align}

            for all $Ainmathcal B$.







            share|cite|improve this answer














            share|cite|improve this answer



            share|cite|improve this answer








            edited Dec 23 '18 at 21:06

























            answered Dec 23 '18 at 17:57









            ShashiShashi

            7,1881628




            7,1881628












            • $begingroup$
              Could you add steps to prove how you get $mu(a,b)=C(b-a)$, please? Thanks in advance!
              $endgroup$
              – Pedro Gomes
              Dec 23 '18 at 18:08










            • $begingroup$
              What do you mean exactly? Since we are considering similar things with subtle difference, it is not clear what you are asking. What kind of interval are you considering? What are $a,b$? Real or rational?
              $endgroup$
              – Shashi
              Dec 23 '18 at 18:11










            • $begingroup$
              $a,binmathbb{Q}^+ $You proved $a=frac{p}{q}$ but you were dealing with the interval $(a,b]$. Point 2) claims $mu(a,b]=C(b-a)$. But I am still striving to see that conclusion from your argument, that is why I kindly asked if you could include some more steps.
              $endgroup$
              – Pedro Gomes
              Dec 23 '18 at 18:14












            • $begingroup$
              @PedroGomes Now I understand what your question is, I added more elaboration. Is it clear now?
              $endgroup$
              – Shashi
              Dec 23 '18 at 18:19










            • $begingroup$
              @PedroGomes I was considering nonnegative rationals first without explicitly saying it. Now I put in the text something about it.
              $endgroup$
              – Shashi
              Dec 23 '18 at 21:07


















            • $begingroup$
              Could you add steps to prove how you get $mu(a,b)=C(b-a)$, please? Thanks in advance!
              $endgroup$
              – Pedro Gomes
              Dec 23 '18 at 18:08










            • $begingroup$
              What do you mean exactly? Since we are considering similar things with subtle difference, it is not clear what you are asking. What kind of interval are you considering? What are $a,b$? Real or rational?
              $endgroup$
              – Shashi
              Dec 23 '18 at 18:11










            • $begingroup$
              $a,binmathbb{Q}^+ $You proved $a=frac{p}{q}$ but you were dealing with the interval $(a,b]$. Point 2) claims $mu(a,b]=C(b-a)$. But I am still striving to see that conclusion from your argument, that is why I kindly asked if you could include some more steps.
              $endgroup$
              – Pedro Gomes
              Dec 23 '18 at 18:14












            • $begingroup$
              @PedroGomes Now I understand what your question is, I added more elaboration. Is it clear now?
              $endgroup$
              – Shashi
              Dec 23 '18 at 18:19










            • $begingroup$
              @PedroGomes I was considering nonnegative rationals first without explicitly saying it. Now I put in the text something about it.
              $endgroup$
              – Shashi
              Dec 23 '18 at 21:07
















            $begingroup$
            Could you add steps to prove how you get $mu(a,b)=C(b-a)$, please? Thanks in advance!
            $endgroup$
            – Pedro Gomes
            Dec 23 '18 at 18:08




            $begingroup$
            Could you add steps to prove how you get $mu(a,b)=C(b-a)$, please? Thanks in advance!
            $endgroup$
            – Pedro Gomes
            Dec 23 '18 at 18:08












            $begingroup$
            What do you mean exactly? Since we are considering similar things with subtle difference, it is not clear what you are asking. What kind of interval are you considering? What are $a,b$? Real or rational?
            $endgroup$
            – Shashi
            Dec 23 '18 at 18:11




            $begingroup$
            What do you mean exactly? Since we are considering similar things with subtle difference, it is not clear what you are asking. What kind of interval are you considering? What are $a,b$? Real or rational?
            $endgroup$
            – Shashi
            Dec 23 '18 at 18:11












            $begingroup$
            $a,binmathbb{Q}^+ $You proved $a=frac{p}{q}$ but you were dealing with the interval $(a,b]$. Point 2) claims $mu(a,b]=C(b-a)$. But I am still striving to see that conclusion from your argument, that is why I kindly asked if you could include some more steps.
            $endgroup$
            – Pedro Gomes
            Dec 23 '18 at 18:14






            $begingroup$
            $a,binmathbb{Q}^+ $You proved $a=frac{p}{q}$ but you were dealing with the interval $(a,b]$. Point 2) claims $mu(a,b]=C(b-a)$. But I am still striving to see that conclusion from your argument, that is why I kindly asked if you could include some more steps.
            $endgroup$
            – Pedro Gomes
            Dec 23 '18 at 18:14














            $begingroup$
            @PedroGomes Now I understand what your question is, I added more elaboration. Is it clear now?
            $endgroup$
            – Shashi
            Dec 23 '18 at 18:19




            $begingroup$
            @PedroGomes Now I understand what your question is, I added more elaboration. Is it clear now?
            $endgroup$
            – Shashi
            Dec 23 '18 at 18:19












            $begingroup$
            @PedroGomes I was considering nonnegative rationals first without explicitly saying it. Now I put in the text something about it.
            $endgroup$
            – Shashi
            Dec 23 '18 at 21:07




            $begingroup$
            @PedroGomes I was considering nonnegative rationals first without explicitly saying it. Now I put in the text something about it.
            $endgroup$
            – Shashi
            Dec 23 '18 at 21:07











            1












            $begingroup$

            I think the proof will be easier to push through if we break it up a bit. If this answer is not what you are looking for, I will be glad to delete it. But all you really need to know here is that every open set is a countable disjoint union of half-open intervals with rational endpoints (even dyadic rational endpoints). Then, the main idea is that Lebesgue measure is the only translation-invariant measure on $mathscr B(mathbb R)$ that assigns to each half-open interval with rational endpoints, its length. From there, it's a little trick to finish the proof.



            Cohn does it like this:



            Suppose that $mu$ is another measure that does so. Then, if $U$ is an open subset of $mathbb R$, it is a disjoint countable union of half-open intervals with rational endpoints $I_n$. Then,



            $mu (U)=sum mu (I_n)=sum lambda (I_n)=lambda (U).$



            So, $mu$ and $lambda$ agree on the open sets. Regularity of $lambda$ now implies that $mu(E)le lambda(E)$ for all Borel sets.



            For the reverse inequality, suppose that $A$ is a bounded Borel set and take an open set $V$ containing $A$ and apply the previous inequality, to get



            $mu(V)=mu (A)+mu (V-A)le lambda (A)+lambda (V-A)=lambda (V)$



            so $mu(A)=lambda (A).$



            For the unbounded case, note that $A=cup_n (-n,n]cap A$ and use the countable additivity of $mu$ and $lambda$.



            So, $mu=lambda$ on the Borel sets, which proves the main claim.



            To finish, define a new measure $nu$ on the Borel sets of $mathbb R$ by $nu(E)=frac{1}{c}mu(E)$. Then, $nu$ is translation invariant, and $nu((0,1])=lambda((0,1]).$



            Take an interval $I=(r,r+2^{-k}]; rin mathbb Q.$ Then, $I$ is an interval with rational endpoints, and now, using the translation invariance the measures, and the result we just proved, we have



            $2^kcdot nu(I)=nu((0,1])=lambda((0,1])=2^klambda (I)Rightarrow nu(I)=lambda(I)$,



            so $nu=lambda$ on the Borel sets, and thus $mu=clambda.$






            share|cite|improve this answer











            $endgroup$


















              1












              $begingroup$

              I think the proof will be easier to push through if we break it up a bit. If this answer is not what you are looking for, I will be glad to delete it. But all you really need to know here is that every open set is a countable disjoint union of half-open intervals with rational endpoints (even dyadic rational endpoints). Then, the main idea is that Lebesgue measure is the only translation-invariant measure on $mathscr B(mathbb R)$ that assigns to each half-open interval with rational endpoints, its length. From there, it's a little trick to finish the proof.



              Cohn does it like this:



              Suppose that $mu$ is another measure that does so. Then, if $U$ is an open subset of $mathbb R$, it is a disjoint countable union of half-open intervals with rational endpoints $I_n$. Then,



              $mu (U)=sum mu (I_n)=sum lambda (I_n)=lambda (U).$



              So, $mu$ and $lambda$ agree on the open sets. Regularity of $lambda$ now implies that $mu(E)le lambda(E)$ for all Borel sets.



              For the reverse inequality, suppose that $A$ is a bounded Borel set and take an open set $V$ containing $A$ and apply the previous inequality, to get



              $mu(V)=mu (A)+mu (V-A)le lambda (A)+lambda (V-A)=lambda (V)$



              so $mu(A)=lambda (A).$



              For the unbounded case, note that $A=cup_n (-n,n]cap A$ and use the countable additivity of $mu$ and $lambda$.



              So, $mu=lambda$ on the Borel sets, which proves the main claim.



              To finish, define a new measure $nu$ on the Borel sets of $mathbb R$ by $nu(E)=frac{1}{c}mu(E)$. Then, $nu$ is translation invariant, and $nu((0,1])=lambda((0,1]).$



              Take an interval $I=(r,r+2^{-k}]; rin mathbb Q.$ Then, $I$ is an interval with rational endpoints, and now, using the translation invariance the measures, and the result we just proved, we have



              $2^kcdot nu(I)=nu((0,1])=lambda((0,1])=2^klambda (I)Rightarrow nu(I)=lambda(I)$,



              so $nu=lambda$ on the Borel sets, and thus $mu=clambda.$






              share|cite|improve this answer











              $endgroup$
















                1












                1








                1





                $begingroup$

                I think the proof will be easier to push through if we break it up a bit. If this answer is not what you are looking for, I will be glad to delete it. But all you really need to know here is that every open set is a countable disjoint union of half-open intervals with rational endpoints (even dyadic rational endpoints). Then, the main idea is that Lebesgue measure is the only translation-invariant measure on $mathscr B(mathbb R)$ that assigns to each half-open interval with rational endpoints, its length. From there, it's a little trick to finish the proof.



                Cohn does it like this:



                Suppose that $mu$ is another measure that does so. Then, if $U$ is an open subset of $mathbb R$, it is a disjoint countable union of half-open intervals with rational endpoints $I_n$. Then,



                $mu (U)=sum mu (I_n)=sum lambda (I_n)=lambda (U).$



                So, $mu$ and $lambda$ agree on the open sets. Regularity of $lambda$ now implies that $mu(E)le lambda(E)$ for all Borel sets.



                For the reverse inequality, suppose that $A$ is a bounded Borel set and take an open set $V$ containing $A$ and apply the previous inequality, to get



                $mu(V)=mu (A)+mu (V-A)le lambda (A)+lambda (V-A)=lambda (V)$



                so $mu(A)=lambda (A).$



                For the unbounded case, note that $A=cup_n (-n,n]cap A$ and use the countable additivity of $mu$ and $lambda$.



                So, $mu=lambda$ on the Borel sets, which proves the main claim.



                To finish, define a new measure $nu$ on the Borel sets of $mathbb R$ by $nu(E)=frac{1}{c}mu(E)$. Then, $nu$ is translation invariant, and $nu((0,1])=lambda((0,1]).$



                Take an interval $I=(r,r+2^{-k}]; rin mathbb Q.$ Then, $I$ is an interval with rational endpoints, and now, using the translation invariance the measures, and the result we just proved, we have



                $2^kcdot nu(I)=nu((0,1])=lambda((0,1])=2^klambda (I)Rightarrow nu(I)=lambda(I)$,



                so $nu=lambda$ on the Borel sets, and thus $mu=clambda.$






                share|cite|improve this answer











                $endgroup$



                I think the proof will be easier to push through if we break it up a bit. If this answer is not what you are looking for, I will be glad to delete it. But all you really need to know here is that every open set is a countable disjoint union of half-open intervals with rational endpoints (even dyadic rational endpoints). Then, the main idea is that Lebesgue measure is the only translation-invariant measure on $mathscr B(mathbb R)$ that assigns to each half-open interval with rational endpoints, its length. From there, it's a little trick to finish the proof.



                Cohn does it like this:



                Suppose that $mu$ is another measure that does so. Then, if $U$ is an open subset of $mathbb R$, it is a disjoint countable union of half-open intervals with rational endpoints $I_n$. Then,



                $mu (U)=sum mu (I_n)=sum lambda (I_n)=lambda (U).$



                So, $mu$ and $lambda$ agree on the open sets. Regularity of $lambda$ now implies that $mu(E)le lambda(E)$ for all Borel sets.



                For the reverse inequality, suppose that $A$ is a bounded Borel set and take an open set $V$ containing $A$ and apply the previous inequality, to get



                $mu(V)=mu (A)+mu (V-A)le lambda (A)+lambda (V-A)=lambda (V)$



                so $mu(A)=lambda (A).$



                For the unbounded case, note that $A=cup_n (-n,n]cap A$ and use the countable additivity of $mu$ and $lambda$.



                So, $mu=lambda$ on the Borel sets, which proves the main claim.



                To finish, define a new measure $nu$ on the Borel sets of $mathbb R$ by $nu(E)=frac{1}{c}mu(E)$. Then, $nu$ is translation invariant, and $nu((0,1])=lambda((0,1]).$



                Take an interval $I=(r,r+2^{-k}]; rin mathbb Q.$ Then, $I$ is an interval with rational endpoints, and now, using the translation invariance the measures, and the result we just proved, we have



                $2^kcdot nu(I)=nu((0,1])=lambda((0,1])=2^klambda (I)Rightarrow nu(I)=lambda(I)$,



                so $nu=lambda$ on the Borel sets, and thus $mu=clambda.$







                share|cite|improve this answer














                share|cite|improve this answer



                share|cite|improve this answer








                edited Dec 23 '18 at 19:42

























                answered Dec 23 '18 at 17:08









                MatematletaMatematleta

                10.7k2918




                10.7k2918






























                    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%2f3050373%2funderstanding-the-proof-mu-is-invariant-then-mu-is-a-linear-transformation%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

                    Bressuire

                    Cabo Verde

                    Gyllenstierna