How to prove that finite additivity follows from countable additivity!!?
Finite additivity follows from countable additivity!
-
1Could you be more specific on additivity of what? – 2010-11-13
-
0Additivity with probabilities – 2010-11-13
2 Answers
I guess this question arises because in the definition of countable additivity it is assumed that there are infinitely many events. But if there are finitely many events, you can just throw in countably many empty events. That is, given $A_1,\ldots,A_n$, define $A_{n+1}=\emptyset$, $A_{n+2}=\emptyset$, and so on, then apply countable additivity.
I assume that you want to show that finite additivity follows from countably infinite additivity. In general, though countable means both finite and countably infinite.
We are given that $\mu(\displaystyle \cup_{i=1}^\infty A_i) = \displaystyle \sum_{i=1}^\infty \mu(A_i)$ whenever $A_i \cap A_j = \emptyset$, $\forall i \neq j$.
So we now want to show $\mu(\displaystyle \cup_{i=1}^n A_i) = \displaystyle \sum_{i=1}^n \mu(A_i)$, $\forall n \in \mathbb{N}$, whenever $A_i \cap A_j = \emptyset$, $\forall i \neq j$.
Now consider $A_{i} = \emptyset$, $\forall i > n$.
By the way we have defined, note that $A_i \cap A_j = \emptyset$, $\forall i \neq j$. (Note: $A \cap \emptyset = \emptyset$, $\forall A$).
By countably infinite additivity, $\mu(\displaystyle \cup_{i=1}^\infty A_i) = \displaystyle \sum_{i=1}^\infty \mu(A_i)$ and note that $\mu(A_i) = 0$, $\forall i > n$.
Also note that $\displaystyle \cup_{i=1}^\infty A_i = \displaystyle \cup_{i=1}^n A_i$, since $A_i = \emptyset$, $\forall i > n$.
Hence, $\mu(\displaystyle \cup_{i=1}^n A_i) = \displaystyle \sum_{i=1}^n \mu(A_i)$ whenever $A_i \cap A_j = \emptyset$, $\forall i \neq j$.
-
2The empty set is not usually denoted by $\phi$. Instead, I recommend $\emptyset$ or ∅. – 2010-11-13
-
2Whether "countable" means "countably infinite" or "at most countably infinite" depends on who you ask. E.g. http://eom.springer.de/C/c026710.htm says the former. I do prefer the meaning you use, as it is the "common sense" approach. – 2010-11-13
-
0@ Jonas: Accepted. Changed $\phi$ to $\emptyset$ – 2010-11-13
-
0@ Jonas: I am unable to access the link you provided in your comment. – 2010-11-13
-
0@Sivaram: I don't know how to make the link work for you, but it is to the Springer online encyclopedia entry for "Countable set". The body reads simply, "A set of the same cardinality as the set of natural numbers. For example, the set of rational numbers or the set of algebraic numbers." I don't know how common the convention is, but it is also mentioned in Royden's *Real Analysis*: "Many authors restrict the use of the word 'countable' to sets which are infinite and countable, but our definition includes the finite sets among the countable sets," page 10 of the 2nd edition. – 2010-11-13
-
0@ Jonas: Thanks. Yes. It makes sense, to define a set countable if the set has a bijection to some subset (proper or improper) set of Natural number. But then some people might argue that the finite sets are "uninteresting" to even consider :) – 2010-11-13