This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Section 2.1 Sets 47 CHAPTER 2
Basic Structures: Sets, Functions, Sequences, and Sums SECTION 2.1 Sets This exercise set (note that this is a “set” in the mathematical sense!) reinforces the concepts introduced in
this sectioniset description, subset and containment, cardinality, power set, and Cartesian product. A few of
the exercises (mostly some of the even—numbered ones) are a bit subtle. Keep in mind the distinction between
“is an element of” and “is a subset of.” Similarly, there is a big diﬂ‘erence between 9 and {G}. In dealing
with sets, as in most of mathematics, it is extremely important to say exactly what you mean. 1. a) {1,—1} b) {1,2,3,4,5,6,7,8,9,10,11}
c) {0,1,4,9,16,25,36,49,64,81} d) (3 (J2 is not an integer) 3. a) Yes; order and repetition do not matter.
b) No; the ﬁrst set has one element, and the second has two elements.
c) No; the ﬁrst set has no elements, and the second has one element (namely the empty set). 5. a) Since 2 is an integer greater than 1, 2 is an element of this set.
b) Since 2 is not a perfect square (12 < 2, but 11.2 > 2 for n, > 1), 2 is not an element of this set.
c) This set has two elements, and as we can clearly see, one of those elements is 2.
d) This set has two elements, and as we can clearly see, neither of those elements is 2. Both of the elements
of this set are sets; 2 is a number, not a set.
e) This set has two elements, and as We can clearly see, neither of those elements is 2. Both of the elements
of this set are sets; 2 is a number, not a set.
f') This set has just one element, namely the set {{2}}. So 2 is not an element of this set. Note that {2} is
not an element either, since {2} yi {{2}} 7. a) This is false, since the empty set has no elements.
b) This is false. The set on the right has only one element, namely the number 0, not the empty set.
c) This is false. In fact, the empty set has no proper subsets. d) This is true. Every element of the set on the left is, vacuously, an element of the set on the right; and the
set on the right contains an element, namely 0, that is not in the set on the left. e) This is false. The set on the right has only one element, namely the number 0, not the set containing the
number 0. f) This is false. For one set to be a proper subset of another, the two sets cannot be equal. g) This is true. Every set is a subset of itself. 9. a) T (in fact a: is the only element) b) T (every set is a subset. of itself)
c) F (the only element of {3:} is a letter, not a set) (1) T (in fact, {m} is the only element)
e) T (the empty set is a. subset of every set) f') F (the only element of {3:} is a letter, not a set) 48 Chapter 2 Basic Structures: Sets. Functions, Sequences, and Sums 11. The four months whose names don‘t contain the letter R form a subset of the set. of twelve months. as shown
here. January February March April
Septerrb er 0 ctober N m'emh er December 13. We put. the subsets inside the supersets. We also put dots in certain regions to indicate that those regions are
not empty (required by the fact that these are proper subset relations). Thus the answer is as shown. 15. \Ve need to show that every element of A is also an element of C. Let :c E A. Then since A Q B, we can
conclude that .1 6 B. Furthermore, since B Q C. the fact that a: 6 B implies that a: E C, as we wished to show. 17. The cardinality of a. set is the number of elements it has. The number of elements in its elements is irrelevant.
a) l b) l c) 2 d) 3 19 8) {ﬂied} b) {12). {alaiblaiaabll C) {®.{®}.{{®}}.{®.{®}}} 21. a) Since the set we are working with has 3 elements, the power set has 23 : 8 elements.
b) Since the set. we are working with has 4 elements, the power set has ‘2'1 2 16 elements.
c) The power set. of the empty set has '20 : 1 element. The power set of this set therefore has 21 : 2 elements.
In particular, it is {(5). {0}} . (See Example 14.) 23. In each case we need to list all the ordered pairs, and there are 4 x 2 : 8 of them. 3) {(a.y).(a,2),(b.y).(5.x).(c,y).(6.2).(d.y),(d.2)}
b) {(3}, a), {if}: b)! (CU, C): (1'), d): (2: a): (Z: (J), ('3: C)! ('3: Oil} 25. This is the set of triples (a, b. c), where a. is an airline and b and c are cities. For example. (TWA, Rochester
Hills Michigan, Middletown New Jersey) is an element of this Cartesian product. A useful subset. of this set
is the set of triples (a,b,c) for which n ﬂies between b and c. For example, (Northwest,Detroit,New York) is in this subset, but the triple mentioned earlier is not. 27. By deﬁnition, Q) x A consists of all pairs (me) such that x E Q) and a E A. Since there are no elements
I E (3, there are no such pairs, so (3 X A = 0. Similar reasoning shows that A X (/3 : Q3. 29. The Cartesian product. A X B has rrm. elements. (This problem foreshadows the general discussion of counting
in Chapter 5.) To see that this answer is correct, note that for each a 6 A there are In different elements 53 E B
with which to form the pair (rub). Since there are m different elements of A, each leading to ’n. diﬁ‘erent pairs, there must be m'n. pairs altogether. Section 2.1 Sets 49 31. 33. 37. 39. The only difference between A X B X C and (A x B) X C is parentl'ieses, so for all practical purposes one can
think of them as essentially the same thing. By Deﬁnition 10, the elements of A x B x C consist of 3etuples
(a, b,c), where 0 E A, b E B, and c E C. By Deﬁnition 9, the elements of (A x B) x C consist of ordered
pairs (p,c), where p E A X B and c E C, so the typical element of (A x B) x C looks like ((a,b),c). A
3tuple is a different creature from a Qtuple, even if the 3tuple and the 2stuple in this case convey exactly
the same information. To be more precise, there is a natural oue—toone correspondence between A X B >; C
and (A x B) x C given by ((1,1), c) H ((u.,b),c). a) Every real number has its square not equal to —1 . Alternatively, the square of a real number is never ~1.
This is true, since squares of real numbers are always nonncgative. b) There exists an integer whose square is 2. This is false, since the only two numbers whose squares are 2,
namely ME and eﬁ, are not integers. c) The square of every integer is positive. This is almost true, but not quite, since 02 ;/ 0. (1) There is a real number equal to its own square. This is true, since a: : 1 (as well as :r. : 0) ﬁts the bill. . In each case we want the set of all values of :c in the domain (the set of integers) that satisfy the given equation or inequality. a) The only integers whose squares are less than 3 are the integers whose absolute values are less than 2. So
the truth set is {3:6 Z  £62 < 3} 2 {—1,0, l}. b) All negative integers satisfy this inequality, as do all nonnegative integers other than 0 and 1. So the truth
set is {3: E Zia2 >32} :2 7 {0,1} = {...,—2,71,2,3,4,...}. c) The only real number satisfying this equation is x : —1/2. Because this value is not in our domain, the
truth set is empty: {:3 E Z l ‘23: + 1 : U} I (3. First we prove the statement mentioned in the hint. The “if” part is immediate from the deﬁnition of equality.
The “only if” part is rather subtle. \Ne want to show that if {{a}, {(r.,b}} : {{c}, {c,d}}, then a : c and
b : d. First consider the case in which a 79 I). Then {{(i}, {0, b}} has exactly two elements, both of which
are sets; exactly one of them contains one element, and exactly one of them contains two elements. Thus
{{c}, {(:,d}} must have the same property; hence (3 cannot equal d, and so {c} is the element containing
one element. Hence {a} = {c}, and so 0; = c. Also in this case the two—element elements {cab} and {c,d}
must be equal, and since 5) 75 a = c, we must have b = d. The other possibility is that a 2 b. Then
{{a}, {(L, b}} = {{a}} , a set with one element. Hence {{c}, {c, d}} must also have only one element, which
can only happen when r: = d and the set is {{c}}. It then follows that a. 2 c, and hence b = d, as well.
Now there is really nothing else to prove. The property that we want ordered pairs to have is precisely
the one that we just proved is satised by this deﬁnition. Furthermore, if we look at the proof, then it is
clear how to “recover” both a and b from {{a}, {a,b}}. If this set has two elements, then a. is the unique
element in the one—element element of this set, and b is the unique member of the twoelement element of this
set other than a. if this set has only one element, then a. and b are both equal to the unique element of the unique element of this set. we can do this recursively, using the idea from Section 4.4 of reducing a problem to a smaller instance of the
same problem. Suppose that. the elements of the set in question are listed: A : {c.1,c2,e3, . . . ,an}. First we
will write clown all the subsets that do not involve on. This is just the same problem we are talking about all
over again, but with a smaller setw~0ne with just 17. — 1 elements. we do this by the process we are currently
describing. Then we write these same subsets down again, but this time adjoin an to each one. Each subset
of A will have been written down, thenerﬁrst all those that do not include an, and then. all those that do. For example, using this procedure the subsets of {3nd, q} would be listed in the order (3, {p}, {d},
{ad}, {9}: {he}, {d,q}i {padiql‘ ...
View
Full Document
 Spring '09
 Ming

Click to edit the document details