This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Math 515 Professor Lieberman September 7, 2004 HOMEWORK # 2 SOLUTIONS Chapter 3 4. To show that n is countably additive, let h E j i be a sequence of disjoint sets. We consider three possibilities. (A complete proof requires a lot more set theory than I want to deal with in this course.) First, only finitely many sets are nonempty and the nonempty sets are all finite. Then the number of elements in the union of these sets is equal to the sum of the number of elements in each set because the sets are disjoint. Second, there is an infinite set in our list. Then the union is infinite, and nE j = . Finally, if there are infinitely many nonempty sets, then the union has infinitely many elements and nE j = , again. If E is a set and y R , then the function f : E E + y defined by f ( x ) = x + y is onetoone and onto, so E and E + y have the same number of elements, so n is translation invariant....
View
Full
Document
This note was uploaded on 03/23/2010 for the course MATH 515 taught by Professor Staff during the Spring '08 term at Iowa State.
 Spring '08
 Staff
 Set Theory, Sets

Click to edit the document details