A1 - Sets

Sets and The Set of Real Numbers
Mathematics 17
Institute of Mathematics, University of the Philippines-Diliman
Lecture 1
Math 17 (UP-IMath) Sets and The Set of Real Numbers Lec 1 1 / 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
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
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
Notations
Empty set : or { }
Notations
Empty set : or { }
Notations
Empty set : or { }
Notations
Empty set : or { }
Notations
Empty set : or { }
Describing Sets
Listing/Roster Method:
A = {all the elements of set A}
Rule Method:
A = {x | description of any element x}
Describing Sets
Listing/Roster Method:
A = {all the elements of set A}
Rule Method:
A = {x | description of any element x}
Examples:
1. Collection of counting numbers less than 6
A = {1, 2, 3, 4, 5}
A = {x | x is a counting number less than 6}
n(A) = 5
2. Set of distinct letters in the word element
B = {e, l, m, n, t}
B = {x | x is a letter in the word element}
n(B) = 5
Examples:
A = {1, 2, 3, 4, 5}
n(A) = 5
B = {e, l, m, n, t}
n(B) = 5
Examples:
A = {1, 2, 3, 4, 5}
n(A) = 5
B = {e, l, m, n, t}
n(B) = 5
Examples:
A = {1, 2, 3, 4, 5}
n(A) = 5
B = {e, l, m, n, t}
n(B) = 5
Examples:
A = {1, 2, 3, 4, 5}
n(A) = 5
B = {e, l, m, n, t}
n(B) = 5
Examples:
A = {1, 2, 3, 4, 5}
n(A) = 5
B = {e, l, m, n, t}
n(B) = 5
Examples:
A = {1, 2, 3, 4, 5}
n(A) = 5
B = {e, l, m, n, t}
n(B) = 5
Examples:
A = {1, 2, 3, 4, 5}
n(A) = 5
B = {e, l, m, n, t}
n(B) = 5
1. Not all sets can be described by both methods.
2. The order of elements in the roster method does not matter.
Relations on Sets: Subset
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.
2
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.
Relations on Sets: Subset
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.
2
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.
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
A B
C B
A B
A, B, C U
Example.
U = {1, 2, . . . , 15}
A = {1, 2, 3, 4, 5}
C = {2, 4, 6, 8}
Then
A, B, C U
A B
C B
A B
A, B, C U
Example.
U = {1, 2, . . . , 15}
A = {1, 2, 3, 4, 5}
C = {2, 4, 6, 8}
Then
A, B, C U
A B
C B
A B
A, B, C U
Example.
U = {1, 2, . . . , 15}
A = {1, 2, 3, 4, 5}
C = {2, 4, 6, 8}
Then
A, B, C U
A B
C B
A B
A, B, C U
Example.
U = {1, 2, . . . , 15}
A = {1, 2, 3, 4, 5}
C = {2, 4, 6, 8}
Then
A, B, C U
A B
C B
A B
A, B, C U
Example.
U = {1, 2, . . . , 15}
A = {1, 2, 3, 4, 5}
C = {2, 4, 6, 8}
Then
A, B, C U
A B
C B
A B
A, B, C U
Let A, B, C be sets. We have
Reexivity A A
Transitivity if A B and B C, then A C
Reexivity A A
Transitivity if A B and B C,
then A C
Reexivity A A
Transitivity if A B and B C, then A C
Relations on Sets: Equal Sets
Denition
1
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.
2
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} B = {p, a, c, e}
C = {a, p, e, s} D = {a, c, e}
Then
A = B
B = C, A = C, A = D
A B, B C, A C
Denition
1
2
Example: Let
A = {c, a, p, e} B = {p, a, c, e}
C = {a, p, e, s} D = {a, c, e}
Then
A = B
B = C, A = C, A = D
A B, B C, A C
Denition
1
2
Example: Let
A = {c, a, p, e} B = {p, a, c, e}
C = {a, p, e, s} D = {a, c, e}
Then
A = B
B = C, A = C, A = D
A B, B C, A C
Denition
1
2
Example: Let
A = {c, a, p, e} B = {p, a, c, e}
C = {a, p, e, s} D = {a, c, e}
Then
A = B
B = C, A = C, A = D
A B, B C, A C
Denition
1
2
Example: Let
A = {c, a, p, e} B = {p, a, c, e}
C = {a, p, e, s} D = {a, c, e}
Then
A = B
B = C, A = C, A = D
A B, B C, A C
Denition
1
2
Example: Let
A = {c, a, p, e} B = {p, a, c, e}
C = {a, p, e, s} D = {a, c, e}
Then
A = B
B = C, A = C, A = D
A B, B C, A C
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
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
Relations on Sets: One-to-one Correspondence
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}

B = {a, p, e, s}
Denition
Illustration:
A = {c, a, p, e}

B = {a, p, e, s}
Denition
Illustration:
A = {c, a, p, e}

B = {a, p, e, s}
Denition
Illustration:
A = {c, a, p, e}

B = {a, p, e, s}
Relations on Sets: Equivalent Sets
Equivalence can be dened in terms of one-to-one correspondences.
Denition
Sets A and B are equivalent if and only if they are in one-to-one
correspondence.
Relations on Sets: Equivalent Sets
Equivalence can be dened in terms of one-to-one correspondences.
Denition
Sets A and B are equivalent if and only if they are in one-to-one
correspondence.
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
Venn Diagrams
region
usually circular
x A, y / A
Venn Diagrams
region
usually circular
x A, y / A
Venn Diagrams
region
usually circular
x A, y / A
Venn Diagrams
region
usually circular
x A, y / A
Set Operation: Union
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}
Set Operation: Union
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}
Set Operation: Intersection
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}
Set Operation: Intersection
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}
Example: Let A = {1, 2, 3, 4} and B = {0, 2, 4, 8, 9}
Then
A B = {0, 1, 2, 3, 4, 8, 9}
A B = {2, 4}
Then
A B = {0, 1, 2, 3, 4, 8, 9}
A B = {2, 4}
Then
A B =
{0, 1, 2, 3, 4, 8, 9}
A B = {2, 4}
Then
A B = {0, 1, 2, 3, 4, 8, 9}
A B = {2, 4}
Then
A B = {0, 1, 2, 3, 4, 8, 9}
A B =
{2, 4}
Then
A B = {0, 1, 2, 3, 4, 8, 9}
A B = {2, 4}
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.
A A =
A and A A = A
Distributive Laws:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
A A = A
and A A = A
Distributive Laws:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
A A = A and A A =
A
Distributive Laws:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
A A = A and A A = A
Distributive Laws:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
A A = A and A A = A
A B = B A
and A B = B A
Distributive Laws:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
A A = A and A A = A
Distributive Laws:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
A A = A and A A = 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)
A A = A and A A = 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)
A A = A and A A = 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)
A A = A and A A = 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)
A A = A and A A = A
Distributive Laws:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
A A = A and A A = A
Distributive Laws:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
A A = A and A A = A
Distributive Laws:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
A A = A and A A = A
Distributive Laws:
A (B C) = (A B) (A C)
A (B C) = (A B) (A C)
Set Operation: Dierence
Denition
The dierence of two sets A and B
is the set of elements in A which
are not in B.
AB or A\B = {x | x A and x / B}
Example: Let A = {0, 1, 2, 3, 4} and B = {0, 2, 4, 8, 9}.
Then
AB = {1, 3} and B A = {8, 9}
Denition
are not in B.
Example: Let A = {0, 1, 2, 3, 4} and B = {0, 2, 4, 8, 9}. Then
AB =
{1, 3} and B A = {8, 9}
Denition
are not in B.
AB = {1, 3} and B A =
{8, 9}
Denition
are not in B.
AB = {1, 3}
and B A = {8, 9}
Denition
are not in B.
AB = {1, 3} and B A = {8, 9}
Set Operation: Complement
Denition
Let A U. The complement of A
is the set of all elements of U which
are not in A.
A
or A
c
= {x U | x / A}
Example: Let U = {x|x is a counting number less than 10} and
A = {3, 5, 2, 8, 9}
Then
A
c
= {1, 4, 6, 7}
.
Denition
are not in A.
A
or A
c
= {x U | x / A}
A = {3, 5, 2, 8, 9}
Then
A
c
= {1, 4, 6, 7}
.
Denition
are not in A.
A
or A
c
= {x U | x / A}
A = {3, 5, 2, 8, 9}
Then
A
c
= {1, 4, 6, 7}
.
Set Operation: Cartesian Product
Denition
An ordered pair is a sequence of two numbers a and b denoted by (a, b).
The Cartesian product AB 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
AB = {(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)}
Denition
AB = {(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)}
Denition
AB = {(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)}
Denition
AB = {(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)}
Denition
AB = {(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)}
Denition
AB = {(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)}
Let A, B, C and D be sets.
In general, AB = B A
A = = A
If C A and D B, then C D AB.
A = = A
A = = A
Subsets of the Set of Real Numbers
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 =
p
q
| p, q Z, q = 0,
set of Irrational Numbers : Q
set of Real Numbers : R = Q Q

Exercise:
Given the sets:
U = {a, b, c, . . . , x, y, z}
A = {t, r, i, a, n, g, l, e, s}
B = {s, q, u, a, r, e}
C = {d, e, c, a, g, o, n}
Find:
1
(A (B C))
2
((A
c
B
c
) C)
3
((A B C) U)
4
((A (B U)) (B C))
5
((A C) B)

A1 - Sets

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

A1 - Sets

Uploaded by

Copyright:

Available Formats

Sets and The Set of Real Numbers

set of Irrational Numbers : Q

set of Real Numbers : R = Q Q

Math 17 (UP-IMath) Sets and The Set of Real Numbers Lec 1 23 / 25

You might also like