PREVIEW
• 2.1: Sets
– Sets and Elements of Sets
– Standard Sets of Numbers: , , , , . . .
– Understanding Set Builder Notation
– Subsets
– Cardinality of a Set
– Power Set
– Cartesian Product
– Truth Set of a Predicate
• 2.2: Set Operations
– Union, Intersection, Set Difference, Complement
– Relation of Set Operations to Logical Connectives
– Algebra of Set Operations
– Proving Set Containment, Set Equality
– Venn Diagrams; Set Membership Tables
– Generalized Unions and Intersections
– Machine Representations of Sets
– Principle of Inclusion/Exclusion
HONOUR HOMEWORK: To be done before next week’s tutorials.
7th edition:
• Section 2.1 : #1, 7, 9, 11, 17, 19, 23, 31, 35, 43.
• Section 2.2 : #3, 7, 15, 19, 25, 27, 31, 47, 51, 53, 55.
8th edition:
• Section 2.1 : #1, 9, 11, 13, 19, 21, 25, 33, 37, 47.
• Section 2.2 : #3, 7, 15, 21, 27, 29, 33, 53, 57, 59, 61.
CSCI2110/MATH2080 F19 Sets and Functions Section 2.1 Page 2 of 8
1. SETS AND FUNCTIONS
2.1. Sets. (page 115 in text).
Definition 2.1. A SET is an unordered collection of elements.
NOTATION
- Set Membership symbols: ∈, < .
- Use curly brackets { } for sets
Example 1. With A = {1, 3, 5, 7}, B = {1, 7, 3, 5}
Example 2. Some Standard Sets:
(1) The set of Natural Numbers, denoted = {0, 1, 2, . . .}
NOTE: in our textbook and our course, 0 is included in
(2) The set of Integers, denoted = {0, ±1, ±2, . . .}
(3) The set of of Strictly Positive Integers, denoted + = {1, 2, . . .}
(4) The set of Rational Numbers, denoted
(5) The set of Real Numbers, denoted
(6) The Empty Set, denoted ∅ or { }
Definition 2.2. We say the set A is a subset of the set B if and only if every
element of A is an element of B. We write A ⊆ B. That is
A ⊆ B iff ∀x (x ∈ A → x ∈ B)
NOTE: Do not confuse ∈ and ⊆
Example 3.
CSCI2110/MATH2080 F19 Sets and Functions Section 2.1 Page 3 of 8
Definition 2.3. We say that two sets A and B are equal if and only if the two
sets have exactly the same elements. That is
A = B iff ∀x (x ∈ A ↔ x ∈ B)
Definition 2.4. Cardinality of a set A is the number of elements in A if the set
is finite. If the set is not finite, then cardinality is said to be infinite.
Example 4.
1. Z+ , N, Z, Q, R
2. A = {a, b, c}
SET BUILDER NOTATION
Example 5.
{x ∈ N | x 3 6 10}
Definition 2.5. The Power Set of a Set A, denoted P (A), is the set of all subsets
of the set A.
P (A) = {B | B ⊆ A}
Example 6. Find the Power sets of
1. A1 = ∅
2. A2 = {a}
3. A3 = {a, b}
CSCI2110/MATH2080 F19 Sets and Functions Section 2.1 Page 4 of 8
Definition 2.6. The Cartesian Product of sets A and B, denoted A × B, is the
set of all ordered pairs (a, b) where the first element in the pair belongs to A and
the second element in the pair belongs to B.
Example 7. Find the Cartesian Products of
(1) Let A = {a, b, c} and B = {−1, 1}
A×B =
(2) Let I = [1, 3/2] and J = (1, 2]
I ×J =
Definition 2.7. The Truth Set of a Predicate is the set of all elements (in the
universe of discourse of the predicate) for which the predicate is True.
Example 8. + is the Truth Set of the predicate P(x) : x > 0.
Example 9. Truth Sets and Equations. Solving x 2 − 3x = 4 amounts to finding
the truth set of the predicate P(x) : x 2 − 3x = 4.
Example 10. Noting Universe of discourse can affect the answer. Consider
1. x ∈ R | x 2 − 3x ≤ 4
2. x ∈ Z | x 2 − 3x ≤ 4
CSCI2110/MATH2080 F19 Sets and Functions Section 2.2 Page 5 of 8
2.2. Set Operations. (page 127 in Text.)
A∪B
Definition 2.8. The union of two sets A and B, de-
noted A ∪ B, is the set of all elements that are in A,
in B, or in both.
A B
A ∪ B = {x | x ∈ A ∨ x ∈ B}
x ∈ A ∪ B iff x ∈ A ∨ x ∈ B
Example 11.
A∩B
Definition 2.9. The intersection of two sets A and
B, denoted A ∩ B, is the set of all elements that are
in both A and B.
A B
A ∩ B = {x | x ∈ A ∧ x ∈ B}
x ∈ A ∩ B iff x ∈ A ∧ x ∈ B
Example 12.
Definition 2.10. Two sets are disjoint if their intersection is the empty set.
Example 13. A = {x ∈ | x even } and B = {x ∈ | x odd }
Definition 2.11. Let A and B be sets. The set dif- A−B
ference of A and B (aka the complement of B with
respect to A), denoted A − B, is the set of all ele-
ments that are in A but not in B. A B
A − B = {x | x ∈ A ∧ x < B}
x ∈ A − B iff x ∈ A ∧ x < B
Example 14.
CSCI2110/MATH2080 F19 Sets and Functions Section 2.2 Page 6 of 8
Definition 2.12. Let U be the universal set. The complement of the set A,
denoted A, is U − A.
A = {x | x < A} = U − A
x ∈ A iff x < A
Example 15. The complement of (set of rational numbers) in (set of real
numbers) is the set of irrational numbers.
Example 16. Express the statement x ∈ A ∪ (B − C) as a logical formula without
set operations.
x ∈ A ∪ (B − C ) ≡
SET IDENTITY Name
A∩U = A Identity Laws
A∪∅ = A
A∪U = U Domination Laws
A∩∅ = ∅
A∪A = A Idempotent Laws
A∩A = A
A =A Complementation Law
A∪B = B ∪A Commutative Laws
A∩B = B ∩A
A ∪ (B ∪ C) = (A ∪ B) ∪ C Associative Laws
A ∩ (B ∩ C) = (A ∩ B) ∩ C
A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) Distributive Laws
A ∩ (B ∪ C) = (A ∩ B) ∪ (A ∩ C)
A∩B = A∪B DeMorgan Laws
A∪B = A∩B
A ∪ (A ∩ B) = A Absorption Laws
A ∩ (A ∪ B) = A
A∪A = U Complement Laws
A∩A =∅
CSCI2110/MATH2080 F19 Sets and Functions Section 2.2 Page 7 of 8
Example 17. Prove that A − (B − C) = (A − B) ∪ (A ∩ C).
Example 18. GENERALIZED UNIONS AND INTERSECTIONS. For i = 1, 2, . . . let A i =
{x ∈ | i 6 x 6 2i} = {i, i + 1, . . . , 2i}
Example 19. COMPUTER REPRESENTATIONS OF SETS. With universal set U =
{1, 2, 3, . . . , 10}, & A = {1, 3, 5, 6}, B = {3, 6, 9}
CSCI2110/MATH2080 F19 Sets and Functions Section 2.2 Page 8 of 8
MEMBERSHIP TABLES FOR SET IDENTITIES
Example 20. Consider A − (B − C) = (A − B) ∪ (A ∩ C)
A B C
Theorem 2.13. PRINCIPLE OF INCLUSION/EXCLUSION. For any sets A, B of finite
cardinality,
|A ∪ B| = |A| + |B| − |A ∩ B|
Example 21. Out of 200 students, 50 are taking MATH, 140 are taking CSCI, and
24 are taking both. Both the MATH and CSCI students have a midterm exam on
Friday. Only students not writing an exam will go to the pub night on Thursday.
How many students will be at the pub night?
