Professional Documents
Culture Documents
Week 1 Sets
Week 1 Sets
↳ n Es
→ if a is not in s
↳ sects
→ if randy are in s
↳ c- s
my
set
→
listing items in
↳ A =
{ 1 , 2,3 }
→
can have sets within sets
→
Repeated occurrences of elements do not matter
→
empty / null / anti set
↳ ∅
↳ can be an element
→ set with one element
↳ Singleton
→ if sets are equal
↳ A = B
→ if sets not equal
↳ A ≠ B
→ Infinite sets e.
g:
Z =
{ . _ .
-
,
-3 -2
, ,
-
1
,
0
,
1
, 2,3 , . _ . _
} -
Integers
N =
I 0
,
I
, 2,3 , . . -
/ - Natural Numbers
N+ =
{ 1
,
2,3 , -
- -
f -
Positive
Integers/ Natural Numbers
I - set of national numbers
R -
set of Real numbers
Rt _
set of positive real numbers
S =
{ a /n has property p I
↳ s is the set of all n such that x has
property
↳ can also do P
S =
{ a c- A / a has
properly P /
T
collecting n from set A
e.
g diff ways to write
Odd
↳ Iselin is an odd
integer }
↳
{ n C- 2- In is odd }
↳ for some integer k /
f n / n= 2kt 1
↳
{ se / A- 2kt 1 for some KEZ
}
↳
{ 2*1 / NEZ /
Russell's Paradox
T =
1) Basis step
↳ specify one or more elements of s
2) Recursive step
↳ Give one or more rules to construct new
elements of s from existing elements of s
3) Exclusion step
↳ state that s only consists of elements generated by
last 2 steps
( usually assumed)
e-
g Natural numbers set
Basis : O E N
Recursion :
if n C- N then n+ I C- N
Odd
e.
g Integers
Basis : 201 C- Odd
Recursion :
if n C- Odd then n - 2 C- Odd and n+2 C- Odd
e.
g set A =
{ 3k + I / k C- N /
Basis : I C- A
Recursion : if n EA then n +3 C- A
subsets
A B
B is a proper subset of A
BC A
↳ This is when B ≤ A but B ≠ A
meaning
,
some elements of B are not in A
e- 9
{ a
,
c
} C
{ a
,
b, e od }
Let A =
{ n / n is a
prime
number and 42 ≤ • ≤ 51
}
B
=\ a / N = 4kt 3 and KEN }
d) Show that A ≤ B
solution show that
every element in Aisin B
:
take an
arbitrary value se EA
so N= 43 or a= 47
,
d) Show that A CB
3 = 4 (O) + 3
since
424-3 ,
3¢ A thus ACB
let A =
{ 3kt I
/ KEN
}
B- _
{ 4k + I / KEN }
d) Show that A
¢ B
Ans ) k for A
/ for
=
0 K = 0 B
310 ) + I = I 4101+1=1
I C- A ,
B
therefore we can
say 4 C- A but 4¢ B
since there is an element in A not in B
A ¢B
Power set
→ The set of all subsets of a sets
↳ PCs )
so
,
PCs ) =
{A/ A ≤s }
↳ for set PCs )
every power
∅ c- PCs) and SEPCS)
e.
9 PC 91,2 } ) =
{ ∅ { } { 21,91oz } }
,
I
,
Set operations
Union
→ A U B =
{ a
/ REAL inclusive) and n C-
Bf
*111$ '
→
Properties
AU ∅ = A
AUB = BUA
( AUB) UC = A UCBOC)
can
meaningfully say AUBUCUD - - . _
.
.
.
?U
=
AUA = A Ai
, ,
A C- Biff AUB B =
Intersection /meet
An B =
↳ if An B ∅ =
then A and B are
disjoint
↳ Properties
And ∅ =
An B = Bn A
(An B) AC AMBA C) =
can
meaningfully say An Bncn D- - . _
.
.
.
:p
=
Ai
,
.
D- C- Biff ANB = A
AMBU C) CAN B) =
u can c)
A U (Brc) =
( AU B) A ( AU c)
Difference d- sets
A -
B =
{ a /N C- A and K & B}
a
% B
( Absolute) Complement
U is a universal set
A- = U -
A =
{ a EU
/ sect a
}
U 1 1
411 I
11 /
/ A
"' ' ' ' " %
De
Morgan's laws
↳ ATB
ATB =
= ÑNB
A- UB
more properties
A - B An B
= A C- Biff B ≤ A-