A problem similar to the previous post. Let be a countable set and a collection of all its subsets. Put if is finite and if is inifinite. Show that the set function is finitely additive but not countable additive.

To see that it is finitely additive, let be disjoint.

To show that it is not countably additive, consider the case where is the set of natural numbers. Then

### Like this:

Like Loading...

*Related*