Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Sets
A set is a collection of distinct objects.
The objects in a set are its elements or members.
When x is an element of A, we write x 2 A and say x belongs to
A.
When x is not in A, we write x 62 A.
Examples:
A = {1, 5, 9, 21}
B = {True, False}
Sets
If every element of A belongs to B, then A is a subset of B, and
B contains A; we write A B or B A.
Sets A and B are equal, written A = B, if they have the same
elements.
The empty set, written ;, is the unique set with no elements.
Sets
Set builder notation
This is used to define or describe sets that are too big or complex
to list between braces.
This appears in the following form:
X = {expression : rule}.
So, X is the set of all things of the form expression that satisfy
the rule.
Examples:
Sets
Sets
Set Operations
Let A and B be two sets. Then,
Union A [ B = {x : x 2 A or x 2 B}
Intersection A \ B = {x : x 2 A and x 2 B}
Dierence A
B = {x 2 A : x 62 B}
Properties/Laws of Sets
Let A, B, C be sets and let W be a universal set containing all
three sets.
Commutativity: A [ B = B [ A and A \ B = B \ A
Associativity: A [ (B [ C ) = (A [ B) [ C and
A \ (B \ C ) = (A \ B) \ C
Distributivity: A [ (B \ C ) = (A [ B) \ (A [ C ) and
A \ (B [ C ) = (A \ B) [ (A \ C )
A [ ; = A, A \ W = A
A \ ; = ;, A [ W = W
A \ Ac = ;, A [ Ac = W
(A [ B)c = Ac \ B c
(A \ B)c = Ac [ B c
If A B and B C , then A C
Set Inclusion
The following are equivalent (meaning, if one of the statements is
true, then they are all true):
AB
A\B =A
A[B =B
A
Bc
B=;
Ac
Note that the word and refers to the intersection and the word
or refers to the union of sets.
Let E be the set of even numbers, let O be the set of odd
numbers, and let P be the set of prime numbers.
Example: If x is even and prime, then x = 2 as E \ P = {2}.
Example: If x is even or odd, then x can be any integer
Set Inclusion
Example:
Let A = {x 2 R : x 2 x}, let B = {0, 1}, and C = [0, 1].
i. Show that B A but that A 6 B.
ii. Show that C A.
Answer.
(i) To prove that B A, we need to check that all members of B
are members of A. As B only has two members, we can check
individually.
As 02 = 0 ) 0 2 A
and
12 = 1 ) 1 2 A,
it follows that B A.
Set Inclusion
As C has infinitely many elements, we cannot individually check
that all its members also belong to A.
We need a way to check everything simultaneously.
An argument of this type is usually of the form:
pick an arbitrary element x 2 C (do not specify which one, it
could be any)
use a property that all items in C have
show that this implies x 2 A
Answer.
(ii). Pick an arbitrary item x 2 C . Note that this means
0 x 1. As x 0, we can multiply both sides of the inequality
x 1 by x, and we get x 2 x. Therefore, x satisfies the condition
for membership in A (that is, x 2 A). It follows that C A.
Equality of Sets
It is possible to give dierent descriptions to describe the same set.
For example, let
A = {countries that share a border with Nepal} and
B = {countries with a population of more than 1 billion people }.
One can check that A = B = {China, India}.
Equality of Sets
Exercises:
Show that {x 2 R : x 2 + 5x < 6} = ( 6, 1)
De Morgans Law: (A [ B)c = Ac \ B c
Let A = {(x, y ) :
that A = B.
x
y
y
x
Exercise
2} and
Show that A = B.