From finitely additive to countably additive












5












$begingroup$


Given a finitely additive measure $mu : mathcal{B} rightarrow [0,infty]$. If we want to show that it is also countably additive, finite additivity implies
$$mu(E) geq sum_{n=1}^infty mu(E_n)$$
where $cup E_n = E$ with $E_n$ disjoint automatically.



For the inequality in the other direction, clearly countably subadditive is sufficient. I was wondering if there are weaker conditions that would also be sufficient. (Just take $mathcal{B}$ to be the Borel $sigma$-algebra on $mathbb{R}$)



I know for fact that if $mu$ is a Radon measure would also be enough (maybe $sigma$-finite with some regularity properties).










share|cite|improve this question











$endgroup$

















    5












    $begingroup$


    Given a finitely additive measure $mu : mathcal{B} rightarrow [0,infty]$. If we want to show that it is also countably additive, finite additivity implies
    $$mu(E) geq sum_{n=1}^infty mu(E_n)$$
    where $cup E_n = E$ with $E_n$ disjoint automatically.



    For the inequality in the other direction, clearly countably subadditive is sufficient. I was wondering if there are weaker conditions that would also be sufficient. (Just take $mathcal{B}$ to be the Borel $sigma$-algebra on $mathbb{R}$)



    I know for fact that if $mu$ is a Radon measure would also be enough (maybe $sigma$-finite with some regularity properties).










    share|cite|improve this question











    $endgroup$















      5












      5








      5


      3



      $begingroup$


      Given a finitely additive measure $mu : mathcal{B} rightarrow [0,infty]$. If we want to show that it is also countably additive, finite additivity implies
      $$mu(E) geq sum_{n=1}^infty mu(E_n)$$
      where $cup E_n = E$ with $E_n$ disjoint automatically.



      For the inequality in the other direction, clearly countably subadditive is sufficient. I was wondering if there are weaker conditions that would also be sufficient. (Just take $mathcal{B}$ to be the Borel $sigma$-algebra on $mathbb{R}$)



      I know for fact that if $mu$ is a Radon measure would also be enough (maybe $sigma$-finite with some regularity properties).










      share|cite|improve this question











      $endgroup$




      Given a finitely additive measure $mu : mathcal{B} rightarrow [0,infty]$. If we want to show that it is also countably additive, finite additivity implies
      $$mu(E) geq sum_{n=1}^infty mu(E_n)$$
      where $cup E_n = E$ with $E_n$ disjoint automatically.



      For the inequality in the other direction, clearly countably subadditive is sufficient. I was wondering if there are weaker conditions that would also be sufficient. (Just take $mathcal{B}$ to be the Borel $sigma$-algebra on $mathbb{R}$)



      I know for fact that if $mu$ is a Radon measure would also be enough (maybe $sigma$-finite with some regularity properties).







      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 Apr 30 '14 at 10:37







      Xiao

















      asked Apr 30 '14 at 10:09









      XiaoXiao

      4,73211434




      4,73211434






















          2 Answers
          2






          active

          oldest

          votes


















          6












          $begingroup$

          There are several easy criterions other than those you have mentioned that,
          together with finite additivity,
          imply countable additivity (but they all end up implying countable subadditivity in the end).
          Here are two examples:



          1. If $mu$ is finitely additive and continuous from below
          (that is,
          if $A_1subset A_2subsetcdots$ and $A=bigcup_nA_n$,
          then $mu(A_n)to A$),
          then $mu$ is countably additive: Take ${A_n}$ disjoint,
          and define $B_n=A_1cupcdotscup A_n$.
          Then,
          $B_1subset B_2subsetcdots$ and $bigcup_nB_n=bigcup_nA_n$,
          and thus,
          finite additivity implies that
          $$lim_{ntoinfty}sum_{i=1}^nmu(A_i)=lim_{ntoinfty}mu(B_n)=muleft(bigcup_{n}A_nright).$$



          2. If $mu$ is finitely additive and continuous from above at $varnothing$ (that is,
          if $A_1supset A_2supsetcdots$ and $bigcap_nA_n=varnothing$,
          then $mu(A_n)to0$),
          then $mu$ is countably additive:
          Take ${A_n}$ disjoint,
          and define $B_n=A_1cupcdotscup A_n$.
          Then,
          $bigcup_nB_n=bigcup_nA_n$,
          and for every $m$,
          we have by finite additivity that
          $$muleft(bigcup_nA_nright)=muleft(B_mcupleft(bigcup_nA_nright)setminus B_mright)=muleft(B_mright)+muleft(left(bigcup_nA_nright)setminus B_mright).$$
          Now,
          we see that $left(bigcup_nA_nright)setminus B_1supsetleft(bigcup_nA_nright)setminus B_2supsetcdots$,
          and that $bigcap_mleft(left(bigcup_nA_nright)setminus B_mright)=varnothing$.
          Thus,
          $$muleft(bigcup_nA_nright)=lim_{mtoinfty}left[muleft(B_mright)+muleft(left(bigcup_nA_nright)setminus B_mright)right]=lim_{mtoinfty}mu(B_m)+0.$$
          Since $mu(B_m)=sum_{i=1}^mmu(A_i)$ for each $m$,
          this implies countable additivity.






          share|cite|improve this answer









          $endgroup$





















            0












            $begingroup$

            user78270's answer is good, but leaves out some details. The following is from Measure Theory by F. R. Halmos, first edition, section 9, page 38. Remark on notation



            $
            text{Let ${E_{n}}$ be a sequence, then}\
            $

            $$
            limlimits_{nrightarrowinfty}E_{n} = bigcaplimits_{n=1}^{infty}bigcuplimits_{mgeq n}^{infty}E_{m} = bigcuplimits_{n=1}^{infty}bigcaplimits_{mgeq n}^{infty}E_{m}
            $$

            $text{i.e. } limlimits_{nrightarrowinfty}E_{n}=liminflimits_{nrightarrowinfty}E_{n}=limsuplimits_{nrightarrowinfty}E_{n}$



            Theorem:



            $quad$If $mu$ is a measure on a ring $mathcal{R}$, and if ${E_{n}}$ is an increasing sequence of sets in $mathcal{R}$ such that $limlimits_{nrightarrowinfty}E_{n} in mathcal{R}$, then $$mu(limlimits_{nrightarrowinfty}E_{n}) = limlimits_{nrightarrowinfty}mu(E_{n})$$



            Theorem:



            $quad$If $mu$ is a measure on a ring $mathcal{R}$, and if ${E_{n}}$ is an decreasing sequence of sets in $mathcal{R}$ of which at least one has finite measure and for which $limlimits_{nrightarrowinfty}E_{n} in mathcal{R}$, then $$mu(limlimits_{nrightarrowinfty}E_{n}) = limlimits_{nrightarrowinfty}mu(E_{n})$$






            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%2f775487%2ffrom-finitely-additive-to-countably-additive%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









              6












              $begingroup$

              There are several easy criterions other than those you have mentioned that,
              together with finite additivity,
              imply countable additivity (but they all end up implying countable subadditivity in the end).
              Here are two examples:



              1. If $mu$ is finitely additive and continuous from below
              (that is,
              if $A_1subset A_2subsetcdots$ and $A=bigcup_nA_n$,
              then $mu(A_n)to A$),
              then $mu$ is countably additive: Take ${A_n}$ disjoint,
              and define $B_n=A_1cupcdotscup A_n$.
              Then,
              $B_1subset B_2subsetcdots$ and $bigcup_nB_n=bigcup_nA_n$,
              and thus,
              finite additivity implies that
              $$lim_{ntoinfty}sum_{i=1}^nmu(A_i)=lim_{ntoinfty}mu(B_n)=muleft(bigcup_{n}A_nright).$$



              2. If $mu$ is finitely additive and continuous from above at $varnothing$ (that is,
              if $A_1supset A_2supsetcdots$ and $bigcap_nA_n=varnothing$,
              then $mu(A_n)to0$),
              then $mu$ is countably additive:
              Take ${A_n}$ disjoint,
              and define $B_n=A_1cupcdotscup A_n$.
              Then,
              $bigcup_nB_n=bigcup_nA_n$,
              and for every $m$,
              we have by finite additivity that
              $$muleft(bigcup_nA_nright)=muleft(B_mcupleft(bigcup_nA_nright)setminus B_mright)=muleft(B_mright)+muleft(left(bigcup_nA_nright)setminus B_mright).$$
              Now,
              we see that $left(bigcup_nA_nright)setminus B_1supsetleft(bigcup_nA_nright)setminus B_2supsetcdots$,
              and that $bigcap_mleft(left(bigcup_nA_nright)setminus B_mright)=varnothing$.
              Thus,
              $$muleft(bigcup_nA_nright)=lim_{mtoinfty}left[muleft(B_mright)+muleft(left(bigcup_nA_nright)setminus B_mright)right]=lim_{mtoinfty}mu(B_m)+0.$$
              Since $mu(B_m)=sum_{i=1}^mmu(A_i)$ for each $m$,
              this implies countable additivity.






              share|cite|improve this answer









              $endgroup$


















                6












                $begingroup$

                There are several easy criterions other than those you have mentioned that,
                together with finite additivity,
                imply countable additivity (but they all end up implying countable subadditivity in the end).
                Here are two examples:



                1. If $mu$ is finitely additive and continuous from below
                (that is,
                if $A_1subset A_2subsetcdots$ and $A=bigcup_nA_n$,
                then $mu(A_n)to A$),
                then $mu$ is countably additive: Take ${A_n}$ disjoint,
                and define $B_n=A_1cupcdotscup A_n$.
                Then,
                $B_1subset B_2subsetcdots$ and $bigcup_nB_n=bigcup_nA_n$,
                and thus,
                finite additivity implies that
                $$lim_{ntoinfty}sum_{i=1}^nmu(A_i)=lim_{ntoinfty}mu(B_n)=muleft(bigcup_{n}A_nright).$$



                2. If $mu$ is finitely additive and continuous from above at $varnothing$ (that is,
                if $A_1supset A_2supsetcdots$ and $bigcap_nA_n=varnothing$,
                then $mu(A_n)to0$),
                then $mu$ is countably additive:
                Take ${A_n}$ disjoint,
                and define $B_n=A_1cupcdotscup A_n$.
                Then,
                $bigcup_nB_n=bigcup_nA_n$,
                and for every $m$,
                we have by finite additivity that
                $$muleft(bigcup_nA_nright)=muleft(B_mcupleft(bigcup_nA_nright)setminus B_mright)=muleft(B_mright)+muleft(left(bigcup_nA_nright)setminus B_mright).$$
                Now,
                we see that $left(bigcup_nA_nright)setminus B_1supsetleft(bigcup_nA_nright)setminus B_2supsetcdots$,
                and that $bigcap_mleft(left(bigcup_nA_nright)setminus B_mright)=varnothing$.
                Thus,
                $$muleft(bigcup_nA_nright)=lim_{mtoinfty}left[muleft(B_mright)+muleft(left(bigcup_nA_nright)setminus B_mright)right]=lim_{mtoinfty}mu(B_m)+0.$$
                Since $mu(B_m)=sum_{i=1}^mmu(A_i)$ for each $m$,
                this implies countable additivity.






                share|cite|improve this answer









                $endgroup$
















                  6












                  6








                  6





                  $begingroup$

                  There are several easy criterions other than those you have mentioned that,
                  together with finite additivity,
                  imply countable additivity (but they all end up implying countable subadditivity in the end).
                  Here are two examples:



                  1. If $mu$ is finitely additive and continuous from below
                  (that is,
                  if $A_1subset A_2subsetcdots$ and $A=bigcup_nA_n$,
                  then $mu(A_n)to A$),
                  then $mu$ is countably additive: Take ${A_n}$ disjoint,
                  and define $B_n=A_1cupcdotscup A_n$.
                  Then,
                  $B_1subset B_2subsetcdots$ and $bigcup_nB_n=bigcup_nA_n$,
                  and thus,
                  finite additivity implies that
                  $$lim_{ntoinfty}sum_{i=1}^nmu(A_i)=lim_{ntoinfty}mu(B_n)=muleft(bigcup_{n}A_nright).$$



                  2. If $mu$ is finitely additive and continuous from above at $varnothing$ (that is,
                  if $A_1supset A_2supsetcdots$ and $bigcap_nA_n=varnothing$,
                  then $mu(A_n)to0$),
                  then $mu$ is countably additive:
                  Take ${A_n}$ disjoint,
                  and define $B_n=A_1cupcdotscup A_n$.
                  Then,
                  $bigcup_nB_n=bigcup_nA_n$,
                  and for every $m$,
                  we have by finite additivity that
                  $$muleft(bigcup_nA_nright)=muleft(B_mcupleft(bigcup_nA_nright)setminus B_mright)=muleft(B_mright)+muleft(left(bigcup_nA_nright)setminus B_mright).$$
                  Now,
                  we see that $left(bigcup_nA_nright)setminus B_1supsetleft(bigcup_nA_nright)setminus B_2supsetcdots$,
                  and that $bigcap_mleft(left(bigcup_nA_nright)setminus B_mright)=varnothing$.
                  Thus,
                  $$muleft(bigcup_nA_nright)=lim_{mtoinfty}left[muleft(B_mright)+muleft(left(bigcup_nA_nright)setminus B_mright)right]=lim_{mtoinfty}mu(B_m)+0.$$
                  Since $mu(B_m)=sum_{i=1}^mmu(A_i)$ for each $m$,
                  this implies countable additivity.






                  share|cite|improve this answer









                  $endgroup$



                  There are several easy criterions other than those you have mentioned that,
                  together with finite additivity,
                  imply countable additivity (but they all end up implying countable subadditivity in the end).
                  Here are two examples:



                  1. If $mu$ is finitely additive and continuous from below
                  (that is,
                  if $A_1subset A_2subsetcdots$ and $A=bigcup_nA_n$,
                  then $mu(A_n)to A$),
                  then $mu$ is countably additive: Take ${A_n}$ disjoint,
                  and define $B_n=A_1cupcdotscup A_n$.
                  Then,
                  $B_1subset B_2subsetcdots$ and $bigcup_nB_n=bigcup_nA_n$,
                  and thus,
                  finite additivity implies that
                  $$lim_{ntoinfty}sum_{i=1}^nmu(A_i)=lim_{ntoinfty}mu(B_n)=muleft(bigcup_{n}A_nright).$$



                  2. If $mu$ is finitely additive and continuous from above at $varnothing$ (that is,
                  if $A_1supset A_2supsetcdots$ and $bigcap_nA_n=varnothing$,
                  then $mu(A_n)to0$),
                  then $mu$ is countably additive:
                  Take ${A_n}$ disjoint,
                  and define $B_n=A_1cupcdotscup A_n$.
                  Then,
                  $bigcup_nB_n=bigcup_nA_n$,
                  and for every $m$,
                  we have by finite additivity that
                  $$muleft(bigcup_nA_nright)=muleft(B_mcupleft(bigcup_nA_nright)setminus B_mright)=muleft(B_mright)+muleft(left(bigcup_nA_nright)setminus B_mright).$$
                  Now,
                  we see that $left(bigcup_nA_nright)setminus B_1supsetleft(bigcup_nA_nright)setminus B_2supsetcdots$,
                  and that $bigcap_mleft(left(bigcup_nA_nright)setminus B_mright)=varnothing$.
                  Thus,
                  $$muleft(bigcup_nA_nright)=lim_{mtoinfty}left[muleft(B_mright)+muleft(left(bigcup_nA_nright)setminus B_mright)right]=lim_{mtoinfty}mu(B_m)+0.$$
                  Since $mu(B_m)=sum_{i=1}^mmu(A_i)$ for each $m$,
                  this implies countable additivity.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Apr 30 '14 at 11:51









                  user78270user78270

                  2,168721




                  2,168721























                      0












                      $begingroup$

                      user78270's answer is good, but leaves out some details. The following is from Measure Theory by F. R. Halmos, first edition, section 9, page 38. Remark on notation



                      $
                      text{Let ${E_{n}}$ be a sequence, then}\
                      $

                      $$
                      limlimits_{nrightarrowinfty}E_{n} = bigcaplimits_{n=1}^{infty}bigcuplimits_{mgeq n}^{infty}E_{m} = bigcuplimits_{n=1}^{infty}bigcaplimits_{mgeq n}^{infty}E_{m}
                      $$

                      $text{i.e. } limlimits_{nrightarrowinfty}E_{n}=liminflimits_{nrightarrowinfty}E_{n}=limsuplimits_{nrightarrowinfty}E_{n}$



                      Theorem:



                      $quad$If $mu$ is a measure on a ring $mathcal{R}$, and if ${E_{n}}$ is an increasing sequence of sets in $mathcal{R}$ such that $limlimits_{nrightarrowinfty}E_{n} in mathcal{R}$, then $$mu(limlimits_{nrightarrowinfty}E_{n}) = limlimits_{nrightarrowinfty}mu(E_{n})$$



                      Theorem:



                      $quad$If $mu$ is a measure on a ring $mathcal{R}$, and if ${E_{n}}$ is an decreasing sequence of sets in $mathcal{R}$ of which at least one has finite measure and for which $limlimits_{nrightarrowinfty}E_{n} in mathcal{R}$, then $$mu(limlimits_{nrightarrowinfty}E_{n}) = limlimits_{nrightarrowinfty}mu(E_{n})$$






                      share|cite|improve this answer









                      $endgroup$


















                        0












                        $begingroup$

                        user78270's answer is good, but leaves out some details. The following is from Measure Theory by F. R. Halmos, first edition, section 9, page 38. Remark on notation



                        $
                        text{Let ${E_{n}}$ be a sequence, then}\
                        $

                        $$
                        limlimits_{nrightarrowinfty}E_{n} = bigcaplimits_{n=1}^{infty}bigcuplimits_{mgeq n}^{infty}E_{m} = bigcuplimits_{n=1}^{infty}bigcaplimits_{mgeq n}^{infty}E_{m}
                        $$

                        $text{i.e. } limlimits_{nrightarrowinfty}E_{n}=liminflimits_{nrightarrowinfty}E_{n}=limsuplimits_{nrightarrowinfty}E_{n}$



                        Theorem:



                        $quad$If $mu$ is a measure on a ring $mathcal{R}$, and if ${E_{n}}$ is an increasing sequence of sets in $mathcal{R}$ such that $limlimits_{nrightarrowinfty}E_{n} in mathcal{R}$, then $$mu(limlimits_{nrightarrowinfty}E_{n}) = limlimits_{nrightarrowinfty}mu(E_{n})$$



                        Theorem:



                        $quad$If $mu$ is a measure on a ring $mathcal{R}$, and if ${E_{n}}$ is an decreasing sequence of sets in $mathcal{R}$ of which at least one has finite measure and for which $limlimits_{nrightarrowinfty}E_{n} in mathcal{R}$, then $$mu(limlimits_{nrightarrowinfty}E_{n}) = limlimits_{nrightarrowinfty}mu(E_{n})$$






                        share|cite|improve this answer









                        $endgroup$
















                          0












                          0








                          0





                          $begingroup$

                          user78270's answer is good, but leaves out some details. The following is from Measure Theory by F. R. Halmos, first edition, section 9, page 38. Remark on notation



                          $
                          text{Let ${E_{n}}$ be a sequence, then}\
                          $

                          $$
                          limlimits_{nrightarrowinfty}E_{n} = bigcaplimits_{n=1}^{infty}bigcuplimits_{mgeq n}^{infty}E_{m} = bigcuplimits_{n=1}^{infty}bigcaplimits_{mgeq n}^{infty}E_{m}
                          $$

                          $text{i.e. } limlimits_{nrightarrowinfty}E_{n}=liminflimits_{nrightarrowinfty}E_{n}=limsuplimits_{nrightarrowinfty}E_{n}$



                          Theorem:



                          $quad$If $mu$ is a measure on a ring $mathcal{R}$, and if ${E_{n}}$ is an increasing sequence of sets in $mathcal{R}$ such that $limlimits_{nrightarrowinfty}E_{n} in mathcal{R}$, then $$mu(limlimits_{nrightarrowinfty}E_{n}) = limlimits_{nrightarrowinfty}mu(E_{n})$$



                          Theorem:



                          $quad$If $mu$ is a measure on a ring $mathcal{R}$, and if ${E_{n}}$ is an decreasing sequence of sets in $mathcal{R}$ of which at least one has finite measure and for which $limlimits_{nrightarrowinfty}E_{n} in mathcal{R}$, then $$mu(limlimits_{nrightarrowinfty}E_{n}) = limlimits_{nrightarrowinfty}mu(E_{n})$$






                          share|cite|improve this answer









                          $endgroup$



                          user78270's answer is good, but leaves out some details. The following is from Measure Theory by F. R. Halmos, first edition, section 9, page 38. Remark on notation



                          $
                          text{Let ${E_{n}}$ be a sequence, then}\
                          $

                          $$
                          limlimits_{nrightarrowinfty}E_{n} = bigcaplimits_{n=1}^{infty}bigcuplimits_{mgeq n}^{infty}E_{m} = bigcuplimits_{n=1}^{infty}bigcaplimits_{mgeq n}^{infty}E_{m}
                          $$

                          $text{i.e. } limlimits_{nrightarrowinfty}E_{n}=liminflimits_{nrightarrowinfty}E_{n}=limsuplimits_{nrightarrowinfty}E_{n}$



                          Theorem:



                          $quad$If $mu$ is a measure on a ring $mathcal{R}$, and if ${E_{n}}$ is an increasing sequence of sets in $mathcal{R}$ such that $limlimits_{nrightarrowinfty}E_{n} in mathcal{R}$, then $$mu(limlimits_{nrightarrowinfty}E_{n}) = limlimits_{nrightarrowinfty}mu(E_{n})$$



                          Theorem:



                          $quad$If $mu$ is a measure on a ring $mathcal{R}$, and if ${E_{n}}$ is an decreasing sequence of sets in $mathcal{R}$ of which at least one has finite measure and for which $limlimits_{nrightarrowinfty}E_{n} in mathcal{R}$, then $$mu(limlimits_{nrightarrowinfty}E_{n}) = limlimits_{nrightarrowinfty}mu(E_{n})$$







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Dec 29 '18 at 23:35









                          GriffyGriffy

                          507




                          507






























                              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%2f775487%2ffrom-finitely-additive-to-countably-additive%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

                              Human spaceflight

                              Can not write log (Is /dev/pts mounted?) - openpty in Ubuntu-on-Windows?

                              張江高科駅