Homework 4

Due February 11th

Problem 1. Show that the sequence {an } is a solution of the recurrence relation an = 3an 1 + 4an 2 if

(a) an = 0

(b) an = ( 4)n

(c) an = 2( 4)n + 3

Problem 2. Let X be an infinite set. Show that there exists an injection f : Z>0 ! X. This implies that the
smallest inifite cardinality is @0 .

Problem 3. Let A be a countable set. Show that any subset B of A is countable.

Problem 4. Let A be an uncountable set, and let B be a countable set. Show that A B is uncountable.
Hint. It might be helpful to use that A ✓ (A B) [ B.

Problem 5. Let A be set of all sequences {an } such that an is either 1 or 0. Show that A is uncountable.

Extra credit. Find a connection between the set of sequences A and the power set of Z>0 , P(Z>0 ).

Problem 6. Let S be a set. Show that there is no bijection from S to P(S).

Hint. Suppose that such f exist. Define the set A = {s 2 S | s 62 f (s)} and show that no element s exist for which
f (s) = T .

Problem 7. Which of the following relations on the set A = {0, 1, 2, 3} are equivalence relations? Either show that
they satisfy all the properties needed to be an equivalence relation, or show that they lack one of those properties.

(a) {(0, 0), (1, 1), (2, 2), (3, 3)}

(b) {(0, 0), (0, 2), (1, 1), (2, 0), (2, 2), (2, 3), (3, 2), (3, 3)}

(c) {(0, 0), (0, 1), (1, 0), (1, 1), (2, 2), (2, 3), (3, 2), (3, 3)}

(d) {(0, 0), (0, 1), (0, 2), (0, 3), (1, 1), (1, 2), (1, 3), (2, 2), (2, 3), (3, 3)}

Problem 8. Define a relation for sets as A ⇠ B if and only if there exists a bijection f : A ! B. Show that this is
an equivalence relation. What is the equivalence class of Z>0 ?

Problem 9. Let A = Z>0 ⇥ Z>0 and define the relation (a, b) ⇠ (c, d) if and only if ad = bc. Show that this is an
equivalence relation. What is the equivalence class of (1, 2)?
 Problem 1 :

a) an = 0

0=-3107+4 ( O) -

satisfies recurrence relationship .

"
b)
an = 1-4) " " " -2

3am,
+ 4 an = -3 1- 4) 4. (a) +
-2
.

1- 4) [(-571-4)+4]
"

=
"
(12+4)
"

=
1-4 ) -2
¢2
"

1-41 ? 16 1-4 )
"

= =
.

= C- 4T →
satisfies -

"
c) an =
4- 4) +5

→
an - ,
-14
an -2=-3 [2.1-4543]+1<[2.1-41^-2+3]
-9+81-47 -2+12
'
"

= -6 1- 4) .

"

[-6.1-47+8]
"

= 1- 4) +3

(24+8)+3
"
'
= -147
=
(-41^-2 132) +3
"
= 1-41 (2.1--44) . + 3 .

(4 )
"
2. 3
satisfies
+ -

=
→

•
Problem 3 :
problem 4 A

¥8
:

A is countable set .

a.
N
There exist
injection f A→
-

:
an

BE A If A is infinite & B is finite

→
of : A → IN by then A B is infinity constant , which
- -
still be
infinity
0 (a) =
flat for all a c- A
B is uncountable
Since f injection
.

is an .

is also ④
-

§ an
injection
.
.

→ A is countable .

Problem 5 :

f : N→
10,1 } to the
sequence 1×11×21×3 ) defined . . .

by i=fi )
✗

for each i
yields a
bijection between functions of the given type and
infinite binary sequences .

Since the latter set uncountable

is
,
so is the
given
set
of all
function .

N
f. →
for } .
Probtem :

it
Assume
possible :

let f :S → Pls) is a
bijection
C- S
For ✗
if lx) is a subset
of 5
Either × Ef Gc) or x ¢ flat .

A- -

{ sets : ✗ C-
flat
}
→ A is a subset of S ( ie ) A C- Pls )
Since f ,
is
surjective (onto) , there exists a C- S .
such that f (a) = A .

① If a C- A .

i. e) a c-
flat . Then by definition of A .
a ¢ A which is contradiction to the fact a EA .

① If a ¢A
II. e) act flat . Then by definition of A. a EA which is a contradiction to the fact that a ¢A .

Therefore it is
impossible that there exist a E S such that f (a) =A .

(i. e) f is not a
surjection so there is no
bijective map f from S to P (s ) .

Probtemt :

a) 4101071 4 , 1) 112,21 13,3 ) } ,

.

Yes ,
it is an
equivalence relation because it reflexive , transitive and symmetric .

Gymmetñci every set .

given
relation has there
opposite exist

Rule la , b) c- R lb , a) ER
if →
: .

Reflexive element should be retake to itself in the relation

:

Every .

Rule : la , a) ER
,
which also exists -

Transitive :
b) E R e (b) c) E R
if la , .

than la , c) c- R
this rule also hold true relation
for given relation ,
so
given
is
equivalence .

b) } 10101110127 ,
the ) , 1401,142) ,
( 2,31 , 13,21 , 13,31 }

transitive and
This is an
equivilanie relation
following 3 conditions :
reflexive ,

symmetric
c) 410101 , 10,1 ) , ( 1,01 , 4,1 ) , 12,21 , this) 11314,13 3) } ,

This
following 3 conditions transitive refexive symmetric
is an
equivilance relation :

, ,
.

d) 410101110,11 , 10,21 (0131,1111%11121,113) 12121,12131 13,31 } , , ,

This is not an equivi lance relation because it's not symmetric :

10,1) in the set but 11,0) not in the set .

Problemt
⑨ If A -
B then IAI =/ B / n -
ay
=
,

A-
=/ a
, ,
az ,
-
.
-

, an } ,
B= } b
, , bzi . - -

ibn } .

Define function :
f : A → B.

flxi ) -
f .

f- is one -

one and onto → bijective .

① If there exists a
bijection .

f. A→ B where A
,
B are
finite set

since fis bijective ,

so
f. is one -

ore .

so
,
IAI 2- IBI *)

f is bijection , so
f is onto

→ 1 A 171131 (* * )
(* ) (* * ) 1A/ =/ BI so A- B.
"
Probtemg : A =
21,0×21>0
9d= be

Reflexive la b) Sla , b) abeba

-

D :
,

Since multiplication is commutative in Z

2)
Symmetric :

la , b) Slc ,
d) ad = be
da
'

cb=
Cc , d) Sla , b)

3) transitive :
Laib) Slc , d) and ( cid ) s (e) f)
Hence ad be 2 :
=
ef=ed
→ adf =

bcf = bed .

bed
→ afd =
Lf-1-0)
be
→
af =

→ ( a. b) Steal
air D=
} lad I / É =
& } .

=/ la d) It =
÷ }
=/ kid ) / die } { =
lc ,
2 c) /¥}
=
2>0 × 22>
o