Professional Documents
Culture Documents
Mathematics 17
Institute of Mathematics, University of the Philippines-Diliman
Lecture 1
Math 17 (UP-IMath)
Lec 1
1 / 25
Sets
A set is a well-dened collection of objects which are called elements or members of the set.
Math 17 (UP-IMath)
Lec 1
2 / 25
Sets
A set is a well-dened collection of objects which are called elements or members of the set. Finite set: possible to list down all elements Innite set: elements cannot be counted
Math 17 (UP-IMath)
Lec 1
2 / 25
Notations
Math 17 (UP-IMath)
Lec 1
3 / 25
Notations
Math 17 (UP-IMath)
Lec 1
3 / 25
Notations
Math 17 (UP-IMath)
Lec 1
3 / 25
Notations
Math 17 (UP-IMath)
Lec 1
3 / 25
Notations
Uppercase letters : Names of sets a A : a is an element of A a / A : a is not an element of A Empty set : or { } Universal set U : set consisting of all elements under consideration
Math 17 (UP-IMath)
Lec 1
3 / 25
Notations
Uppercase letters : Names of sets a A : a is an element of A a / A : a is not an element of A Empty set : or { } Universal set U : set consisting of all elements under consideration n(A) : cardinality of a nite set A, the number of its elements
Math 17 (UP-IMath)
Lec 1
3 / 25
Describing Sets
Math 17 (UP-IMath)
Lec 1
4 / 25
Describing Sets
Listing/Roster Method: A = {all the elements of set A} Rule Method: A = {x | description of any element x}
Math 17 (UP-IMath)
Lec 1
4 / 25
Math 17 (UP-IMath)
Lec 1
5 / 25
Math 17 (UP-IMath)
Lec 1
5 / 25
Math 17 (UP-IMath)
Lec 1
5 / 25
Math 17 (UP-IMath)
Lec 1
5 / 25
Math 17 (UP-IMath)
Lec 1
5 / 25
Math 17 (UP-IMath)
Lec 1
5 / 25
Math 17 (UP-IMath)
Lec 1
5 / 25
Math 17 (UP-IMath)
Lec 1
5 / 25
1. Not all sets can be described by both methods. 2. The order of elements in the roster method does not matter.
Math 17 (UP-IMath)
Lec 1
6 / 25
Denition
1
A is a subset of B , written A B, if and only if every element of A is an element of B . If set A is not contained in set B , we write A B.
Math 17 (UP-IMath)
Lec 1
7 / 25
Denition
1
A is a subset of B , written A B, if and only if every element of A is an element of B . If set A is not contained in set B , we write A B. A is a proper subset of B , written A B, if and only if A is a subset of B and there exists an element of B which is not in A.
Math 17 (UP-IMath)
Lec 1
7 / 25
Math 17 (UP-IMath)
Lec 1
8 / 25
Example. U = {1, 2, . . . , 15} A = {1, 2, 3, 4, 5} B = {x | x is a counting number less than 8} C = {2, 4, 6, 8} Then A, B, C U
Math 17 (UP-IMath)
Lec 1
8 / 25
Example. U = {1, 2, . . . , 15} A = {1, 2, 3, 4, 5} B = {x | x is a counting number less than 8} C = {2, 4, 6, 8} Then A, B, C U AB
Math 17 (UP-IMath)
Lec 1
8 / 25
Example. U = {1, 2, . . . , 15} A = {1, 2, 3, 4, 5} B = {x | x is a counting number less than 8} C = {2, 4, 6, 8} Then A, B, C U AB CB
Math 17 (UP-IMath)
Lec 1
8 / 25
Example. U = {1, 2, . . . , 15} A = {1, 2, 3, 4, 5} B = {x | x is a counting number less than 8} C = {2, 4, 6, 8} Then A, B, C U AB CB AB
Math 17 (UP-IMath)
Lec 1
8 / 25
Example. U = {1, 2, . . . , 15} A = {1, 2, 3, 4, 5} B = {x | x is a counting number less than 8} C = {2, 4, 6, 8} Then A, B, C U AB CB AB A, B, C U
Math 17 (UP-IMath)
Lec 1
8 / 25
Math 17 (UP-IMath)
Lec 1
9 / 25
Math 17 (UP-IMath)
Lec 1
9 / 25
Math 17 (UP-IMath)
Lec 1
9 / 25
A and B are equal or A = B if and only if they have precisely the same elements. If sets A and B are not equal, we write A = B .
Math 17 (UP-IMath)
Lec 1
10 / 25
A and B are equal or A = B if and only if they have precisely the same elements. If sets A and B are not equal, we write A = B . A is equivalent to B , or A B , if and only if n(A) = n(B ).
Math 17 (UP-IMath)
Lec 1
10 / 25
A and B are equal or A = B if and only if they have precisely the same elements. If sets A and B are not equal, we write A = B . A is equivalent to B , or A B , if and only if n(A) = n(B ).
Example: Let U = {x | x is a letter in the word escape} A = {c, a, p, e} C = {a, p, e, s} B = {p, a, c, e} D = {a, c, e}
Math 17 (UP-IMath)
Lec 1
10 / 25
A and B are equal or A = B if and only if they have precisely the same elements. If sets A and B are not equal, we write A = B . A is equivalent to B , or A B , if and only if n(A) = n(B ).
Example: Let U = {x | x is a letter in the word escape} A = {c, a, p, e} C = {a, p, e, s} Then A=B B = {p, a, c, e} D = {a, c, e}
Math 17 (UP-IMath)
Lec 1
10 / 25
A and B are equal or A = B if and only if they have precisely the same elements. If sets A and B are not equal, we write A = B . A is equivalent to B , or A B , if and only if n(A) = n(B ).
Example: Let U = {x | x is a letter in the word escape} A = {c, a, p, e} C = {a, p, e, s} Then A=B B = C, A = C, A = D B = {p, a, c, e} D = {a, c, e}
Math 17 (UP-IMath)
Lec 1
10 / 25
A and B are equal or A = B if and only if they have precisely the same elements. If sets A and B are not equal, we write A = B . A is equivalent to B , or A B , if and only if n(A) = n(B ).
Example: Let U = {x | x is a letter in the word escape} A = {c, a, p, e} C = {a, p, e, s} Then A=B B = C, A = C, A = D A B, B C, A C
Math 17 (UP-IMath) Sets and The Set of Real Numbers Lec 1 10 / 25
B = {p, a, c, e} D = {a, c, e}
Math 17 (UP-IMath)
Lec 1
11 / 25
Let A, B, C be sets. We have Reexivity A = A Symmetry If A = B , then B = A. Transitivity If A = B and B = C , then A = C . Note: A = B if and only if A B and B A
Math 17 (UP-IMath)
Lec 1
11 / 25
Denition
Two sets A and B are said to be in one-to-one correspondence if to each element of A there corresponds an unique element of B and vice-versa.
Math 17 (UP-IMath)
Lec 1
12 / 25
Denition
Two sets A and B are said to be in one-to-one correspondence if to each element of A there corresponds an unique element of B and vice-versa. Illustration: A = {c, a, p, e}
Math 17 (UP-IMath)
Lec 1
12 / 25
Denition
Two sets A and B are said to be in one-to-one correspondence if to each element of A there corresponds an unique element of B and vice-versa. Illustration: A B = = {c, a, p, e} {a, p, e, s}
Math 17 (UP-IMath)
Lec 1
12 / 25
Denition
Two sets A and B are said to be in one-to-one correspondence if to each element of A there corresponds an unique element of B and vice-versa. Illustration: A B = = {c, a, p, e} {a, p, e, s}
Math 17 (UP-IMath)
Lec 1
12 / 25
Math 17 (UP-IMath)
Lec 1
13 / 25
Denition
Sets A and B are equivalent if and only if they are in one-to-one correspondence.
Math 17 (UP-IMath)
Lec 1
13 / 25
Venn Diagrams
Venn diagrams are used to visualize sets, their relations and operations.
Math 17 (UP-IMath)
Lec 1
14 / 25
Venn Diagrams
Venn diagrams are used to visualize sets, their relations and operations. U - universal set; a rectangular region
Math 17 (UP-IMath)
Lec 1
14 / 25
Venn Diagrams
Venn diagrams are used to visualize sets, their relations and operations. U - universal set; a rectangular region A - a set; any closed region, usually circular
Math 17 (UP-IMath)
Lec 1
14 / 25
Venn Diagrams
Venn diagrams are used to visualize sets, their relations and operations. U - universal set; a rectangular region A - a set; any closed region, usually circular x or y - elements; dots
Math 17 (UP-IMath)
Lec 1
14 / 25
Venn Diagrams
Venn diagrams are used to visualize sets, their relations and operations. U - universal set; a rectangular region A - a set; any closed region, usually circular x or y - elements; dots x A, y /A
Math 17 (UP-IMath)
Lec 1
14 / 25
Denition
The union of two sets A and B is the set of elements that belong to A or B or both.
Math 17 (UP-IMath)
Lec 1
15 / 25
Denition
The union of two sets A and B is the set of elements that belong to A or B or both. A B = {x | x A or x B }
Math 17 (UP-IMath)
Lec 1
15 / 25
Denition
The intersection of two sets A and B is the set of elements that belong to A and B .
Math 17 (UP-IMath)
Lec 1
16 / 25
Denition
The intersection of two sets A and B is the set of elements that belong to A and B . A B = {x | x A and x B }
Math 17 (UP-IMath)
Lec 1
16 / 25
Math 17 (UP-IMath)
Lec 1
17 / 25
Math 17 (UP-IMath)
Lec 1
17 / 25
Math 17 (UP-IMath)
Lec 1
17 / 25
Math 17 (UP-IMath)
Lec 1
17 / 25
Math 17 (UP-IMath)
Lec 1
17 / 25
Math 17 (UP-IMath)
Lec 1
17 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
18 / 25
Given sets A, B and C , A A = A and A A = A A B = B A and A B = B A If A B , then A B = B and A B = A Distributive Laws: A (B C ) = (A B ) (A C ) A (B C ) = (A B ) (A C ) If A B = , then A and B are said to be disjoint.
Math 17 (UP-IMath)
Lec 1
18 / 25
Math 17 (UP-IMath)
Lec 1
19 / 25
Math 17 (UP-IMath)
Lec 1
19 / 25
Math 17 (UP-IMath)
Lec 1
19 / 25
Math 17 (UP-IMath)
Lec 1
19 / 25
Example: Let A = {0, 1, 2, 3, 4} and B = {0, 2, 4, 8, 9}. Then A B = {1, 3} and B A = {8, 9}
Math 17 (UP-IMath)
Lec 1
19 / 25
Math 17 (UP-IMath)
Lec 1
20 / 25
Example: Let U = {x|x is a counting number less than 10} and A = {3, 5, 2, 8, 9} Then
Math 17 (UP-IMath)
Lec 1
20 / 25
Example: Let U = {x|x is a counting number less than 10} and A = {3, 5, 2, 8, 9} Then Ac = {1, 4, 6, 7} .
Math 17 (UP-IMath) Sets and The Set of Real Numbers Lec 1 20 / 25
Denition
An ordered pair is a sequence of two numbers a and b denoted by (a, b).
Math 17 (UP-IMath)
Lec 1
21 / 25
Denition
An ordered pair is a sequence of two numbers a and b denoted by (a, b).
Math 17 (UP-IMath)
Lec 1
21 / 25
Denition
An ordered pair is a sequence of two numbers a and b denoted by (a, b). The Cartesian product A B of sets A and B is the set of ordered pairs (a, b) where a A and b B .
Math 17 (UP-IMath)
Lec 1
21 / 25
Denition
An ordered pair is a sequence of two numbers a and b denoted by (a, b). The Cartesian product A B of sets A and B is the set of ordered pairs (a, b) where a A and b B . Example: Let A = {7, 8, 9} and B = {1, 2}. Then
Math 17 (UP-IMath)
Lec 1
21 / 25
Denition
An ordered pair is a sequence of two numbers a and b denoted by (a, b). The Cartesian product A B of sets A and B is the set of ordered pairs (a, b) where a A and b B . Example: Let A = {7, 8, 9} and B = {1, 2}. Then A B = {(7, 1), (8, 1), (9, 1), (7, 2), (8, 2), (9, 2)}
Math 17 (UP-IMath)
Lec 1
21 / 25
Denition
An ordered pair is a sequence of two numbers a and b denoted by (a, b). The Cartesian product A B of sets A and B is the set of ordered pairs (a, b) where a A and b B . Example: Let A = {7, 8, 9} and B = {1, 2}. Then A B = {(7, 1), (8, 1), (9, 1), (7, 2), (8, 2), (9, 2)} B A = {(1, 7), (1, 8), (1, 9), (2, 7), (2, 8), (2, 9)}
Math 17 (UP-IMath)
Lec 1
21 / 25
Math 17 (UP-IMath)
Lec 1
22 / 25
Math 17 (UP-IMath)
Lec 1
22 / 25
Math 17 (UP-IMath)
Lec 1
22 / 25
set of Natural Numbers (or Counting Numbers) : N = {1, 2, 3, . . .} set of Whole Numbers : W = N {0} = {0, 1, 2, 3, . . .} set of Integers : Z = {. . . , 3, 2, 1, 0, 1, 2, 3, . . .} set of Rational Numbers : Q = set of Irrational Numbers : Q set of Real Numbers : R = Q Q
p q
| p, q Z, q = 0,
Math 17 (UP-IMath)
Lec 1
23 / 25
Math 17 (UP-IMath)
Lec 1
24 / 25
Math 17 (UP-IMath)
Lec 1
24 / 25
Math 17 (UP-IMath)
Lec 1
24 / 25
Math 17 (UP-IMath)
Lec 1
24 / 25
Math 17 (UP-IMath)
Lec 1
24 / 25
Math 17 (UP-IMath)
Lec 1
24 / 25
Math 17 (UP-IMath)
Lec 1
24 / 25
Math 17 (UP-IMath)
Lec 1
25 / 25