Sets
Definition A set is an unordered collection of objects called elements or members of the set.
Examples:
I S ={1,2,5}
I V ={a,e,i,o,u}
I X ={apple,32,A,Z}
I Y ={2,3,4,6,22}
I Y0 ={2,3,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Familiar sets: N,Z,R,Q,R+.
I Two common questions
I doesx∈S?
I isX =Y?
Roster method vs set-builder method.
Sets
Definition A set is an unordered collection of objects called elements or members of the set.
Examples:
I S ={1,2,5}
I V ={a,e,i,o,u}
I X ={apple,32,A,Z}
I Y ={2,3,4,6,22}
I Y0 ={2,3,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Familiar sets: N,Z,R,Q,R+.
I Two common questions
I doesx∈S?
I isX =Y?
Roster method vs set-builder method.
Sets
Definition A set is an unordered collection of objects called elements or members of the set.
Examples:
I S ={1,2,5}
I V ={a,e,i,o,u}
I X ={apple,32,A,Z}
I Y ={2,3,4,6,22}
I Y0 ={2,3,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Familiar sets: N,Z,R,Q,R+.
I Two common questions
I doesx∈S?
I isX =Y?
Roster method vs set-builder method.
Sets
Definition A set is an unordered collection of objects called elements or members of the set.
Examples:
I S ={1,2,5}
I V ={a,e,i,o,u}
I X ={apple,32,A,Z}
I Y ={2,3,4,6,22}
I Y0 ={2,3,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Familiar sets:
N,Z,R,Q,R+.
I Two common questions
I doesx∈S?
I isX =Y?
Roster method vs set-builder method.
Sets
Definition A set is an unordered collection of objects called elements or members of the set.
Examples:
I S ={1,2,5}
I V ={a,e,i,o,u}
I X ={apple,32,A,Z}
I Y ={2,3,4,6,22}
I Y0 ={2,3,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Familiar sets:
N,Z,R,Q,R+.
I Two common questions
I doesx∈S?
I isX =Y?
Roster method vs set-builder method.
Sets
Definition A set is an unordered collection of objects called elements or members of the set.
Examples:
I S ={1,2,5}
I V ={a,e,i,o,u}
I X ={apple,32,A,Z}
I Y ={2,3,4,6,22}
I Y0 ={2,3,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Familiar sets:
N,Z,R,Q,R+.
I Two common questions
I doesx∈S?
I isX =Y?
Roster method vs set-builder method.
Equality and containment
A=B
I Y ={2,3,4,6,22}
I Y0 ={2,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Express equality using quantifiers.
∀x (x ∈A↔x ∈B)
A⊆B
I A={a,b,22,33}
I B ={a,b,22,33,N}
I B *A
I Express not a subset of using quantifiers.
∃x (x ∈B∧x∈/ A)
Equality and containment
A=B
I Y ={2,3,4,6,22}
I Y0 ={2,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Express equality using quantifiers.
∀x (x ∈A↔x ∈B)
A⊆B
I A={a,b,22,33}
I B ={a,b,22,33,N}
I B *A
I Express not a subset of using quantifiers.
∃x (x ∈B∧x∈/ A)
Equality and containment
A=B
I Y ={2,3,4,6,22}
I Y0 ={2,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Express equality using quantifiers.
∀x (x ∈A↔x ∈B)
A⊆B
I A={a,b,22,33}
I B ={a,b,22,33,N}
I B *A
I Express not a subset of using quantifiers.
∃x (x ∈B∧x∈/ A)
Equality and containment
A=B
I Y ={2,3,4,6,22}
I Y0 ={2,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Express equality using quantifiers.
∀x (x ∈A↔x ∈B)
A⊆B
I A={a,b,22,33}
I B ={a,b,22,33,N}
I B *A
I Express not a subset of using quantifiers.
∃x (x ∈B∧x∈/ A)
Equality and containment
A=B
I Y ={2,3,4,6,22}
I Y0 ={2,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Express equality using quantifiers.
∀x (x ∈A↔x ∈B)
A⊆B
I A={a,b,22,33}
I B ={a,b,22,33,N}
I B *A
I Express not a subset of using quantifiers.
∃x (x ∈B∧x∈/ A)
Equality and containment
A=B
I Y ={2,3,4,6,22}
I Y0 ={2,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Express equality using quantifiers.
∀x (x ∈A↔x ∈B)
A⊆B
I A={a,b,22,33}
I B ={a,b,22,33,N}
I B *A
I Express not a subset of using quantifiers.
∃x (x ∈B∧x∈/ A)
Equality and containment
A=B
I Y ={2,3,4,6,22}
I Y0 ={2,3,4,3,22,2,6}
I Y00={22,4,6,22,3}
I Express equality using quantifiers.
∀x (x ∈A↔x ∈B)
A⊆B
I A={a,b,22,33}
I B ={a,b,22,33,N}
I B *A
I Express not a subset of using quantifiers.
∃x (x ∈B∧x∈/ A)
Empty set
Definition A set that has no elements is the empty set denoted by φor{}.
I for any setS,φ∈S.
Empty set
Definition A set that has no elements is the empty set denoted by φor{}.
I for any setS,φ∈S.
Empty set
Definition A set that has no elements is the empty set denoted by φor{}.
I for any setS,φ∈S.
I for any setS,φ⊆S.
proof?
I ∀x (x ∈φ→x∈S)
I for anyx,x∈φalways evaluates to false.
I ∴the conditional (x∈φ→x ∈S) evaluates to true.
Example of a vacuous proof.
Important {φ}is not the same as φ.
Empty set
Definition A set that has no elements is the empty set denoted by φor{}.
I for any setS,φ∈S.
I for any setS,φ⊆S. proof?
I ∀x (x ∈φ→x∈S)
I for anyx,x∈φalways evaluates to false.
I ∴the conditional (x∈φ→x ∈S) evaluates to true.
Example of a vacuous proof.
Important {φ}is not the same as φ.
Empty set
Definition A set that has no elements is the empty set denoted by φor{}.
I for any setS,φ∈S.
I for any setS,φ⊆S. proof?
I ∀x (x ∈φ→x∈S)
I for anyx,x∈φalways evaluates to false.
I ∴the conditional (x ∈φ→x ∈S) evaluates to true.
Example of a vacuous proof.
Important {φ}is not the same as φ.
Empty set
Definition A set that has no elements is the empty set denoted by φor{}.
I for any setS,φ∈S.
I for any setS,φ⊆S. proof?
I ∀x (x ∈φ→x∈S)
I for anyx,x∈φalways evaluates to false.
I ∴the conditional (x ∈φ→x ∈S) evaluates to true.
Example of a vacuous proof.
Important {φ}is not the same as φ.
Empty set
Definition A set that has no elements is the empty set denoted by φor{}.
I for any setS,φ∈S.
I for any setS,φ⊆S. proof?
I ∀x (x ∈φ→x∈S)
I for anyx,x∈φalways evaluates to false.
I ∴the conditional (x ∈φ→x ∈S) evaluates to true.
Example of a vacuous proof.
Important {φ}is not the same as φ.
Power set
S ={32,6,41}
I subsets ofS:
{},{32},{6},{41},{32,6},{6,41},{32,41},{32,6,41}.
Definition The set of all subsets of S is called the power setof S, denoted asP(S).
The power set of a set withn elements has 2n elements.
Power set
S ={32,6,41}
I subsets ofS:
{},{32},{6},{41},{32,6},{6,41},{32,41},{32,6,41}.
Definition The set of all subsets of S is called the power setof S, denoted asP(S).
The power set of a set withn elements has 2n elements.
Power set
S ={32,6,41}
I subsets ofS:
{},{32},{6},{41},{32,6},{6,41},{32,41},{32,6,41}.
Definition The set of all subsets of S is called the power setof S, denoted asP(S).
The power set of a set withn elements has 2nelements.
Size of a set
Definition If there are exactlyn distinct elements in a set S, wheren is a non-negative integer, then we say S is finite and cardinality ofS is n.
I S ={1,17,a,b};|S|= 4.
I S ={1,2,2,6,7,7};|S|= 4.
I |φ|= 0.
A set that is not finite is said to be infinite
Size of a set
Definition If there are exactlyn distinct elements in a set S, wheren is a non-negative integer, then we say S is finite and cardinality ofS is n.
I S ={1,17,a,b};|S|= 4.
I S ={1,2,2,6,7,7};|S|= 4.
I |φ|= 0.
A set that is not finite is said to be infinite
Size of a set
Definition If there are exactlyn distinct elements in a set S, wheren is a non-negative integer, then we say S is finite and cardinality ofS is n.
I S ={1,17,a,b};|S|= 4.
I S ={1,2,2,6,7,7};|S|= 4.
I |φ|= 0.
A set that is not finite is said to be infinite
Set operations
I Union
I Intersection
I Set difference
I Exclusive OR
I Complement Set identities
Exercises
1. For each of the sets below determine if 2 belongs to the set.
(a){x ∈R | x is an integer greater than 1}
(b) {x ∈R | x is the square of an integer}
(c) {2,{2}} (d){{2},{2}} (e) {{2},{2,{2}}}
2. Let A={φ,b}. Construct the following sets:
I A−φ
I A∪ P(A)
I {φ} −A
I A∩ P(A) 3. Prove thatP(A)⊆ P(B) iff A⊆B.
4. ExpressA⊂B using quantifiers.
5. Prove thatA∩B = ¯A∪B.¯