Académique Documents
Professionnel Documents
Culture Documents
Infinite sets a set which has an unlimited number of elements. Finite sets a set which has a last element
Example: {the stars in the universe} we can count the number of elements in the set.
Example: {the planets in our solar system}
Ways of specifying a set:
1. list or roster method members of a set are listed and enclosed within braces.
Example: A = {1,2,3,4,5}
B = {Mr. Nieto, Mr. Baes, Mr. Nuval, Mrs. Buenaventura}
C = {.-15, -10, -5, 0, 5, 10, 15, .}
Note: The symbol is called ellipsis and it denotes the
elements which are understood to be specified.
Example: If A = {a,b,c,d,e}, then Set A has a cardinality of 5 since there are five elements in A.
It may also be represented as n(A) = 5.
If B = {2,4,6}, then Set B has a cardinality of 3 or n(B) = 3.
If C = , then Set C has a cardinality of 0 or n(C) = 0.
If D = {1,3,5,7,9}, then Set C has a cardinality of or n(C) = .
Note that in order to A B to be satisfied, sets A and B must have the same elements.
3. 4 ___ {1,2,3}
answer: since 4 is an element, not found in {1,2,3}.
Use if the given is {4} since enclosing the element in braces denotes a set, not an element.
To clarify, here are counterexamples:
a {1 , b , 5, c}
{a} {1, b , 5 , c}
Reinforcement Questions:
1. If two sets are equal, are they also equivalent?
Yes! Equal sets always have same number of elements. Thus, they are equivalent.
All equal sets are equivalent. But not all equivalent sets are equal.
C
Examples If = {1,3,5,7,9}, and A = {1,5} , then A = {3 , 7, 9}.
If = {all the English alphabets from A to Z}, and E = {all the vowels in the English alphabet}
C
then E = {all the consonants in the English alphabet}
If = {all the freshmen students of the Faculty of Pharmacy from SY 2006 2007}
and M = {all the male freshmen students of the Faculty of Pharmacy from SY 2006 2007}
C
then M = {all the female freshmen students of the Faculty of Pharmacy from SY 2006 2007}
Examples
If Q = {q,w,e,r,t,y} and S = {q,u,i,t} then Q S = {q,t}
Note that: A = . Thus, any non-empty set and an empty set are always disjoint.
To find A B, simply find the common elements in sets A and B and remove it in A.
Likewise, to find B A, find the common elements in sets A and B and remove it from B.
Examples:
If A = {0,1,2,3,4} and B = {2,3,6,8},
Then A B = {2,3}.
So, A B = {0,1,4} and B A = {6,8}
If F = {do, re, mi, fa, so} and G = {do, mi, so, ti},
then F G = {re, fa} and G F = {ti}
Note that: A = A.
Suppose D = {e,f,g},
7. What is B D? answer: {b,d}
8. What is D B? answer: {f,g}
C
9. What is A \ D? answer: {d}
10. Are A and D disjoint sets? answer: Yes.
11. How about B and D? answer: No.
12. What is B D? answer: {e}
13. What is B D ?
C
answer: {a,b,c,d,e}
14. What is (A B) D? answer: {b,e,f,g}
15. What is (A D) B?
C
answer: {b,d,e}
Reinforcement Questions:
1. Are and {4,1} disjoint sets?
Yes, because A =.
2. List the subsets of {1,2,3} that do not have 1 as an element.
,{2},{3}, and {2,3}
Cartesian Products (A x B)
=> refers to all the possible combination of elements of the given sets.
- then A x B = {(1,a),(1,b),(1,c),(2,a),(2,b),(2,c),(3,a),(3,b),(3,c)}.
We can say, therefore, that the cardinality of AxB or n(AxB) is 9.
- then B x C = {(a,x),(a,y),(b,x),(b,y),(c,x),(c,y)}.
We can say, therefore, that the cardinality of BxC or n(BxC) is 6