程序代写代做代考 flex C CGI MATH1061/7861, Wed 16 Sep 2020

MATH1061/7861, Wed 16 Sep 2020
Question 1. True or false? If x1, x2, x3, … is any infinite sequence, then {x1, x2, x3, …} must be:
A. Finite
B. Infinite
C. Countable
D. Uncountable
E. Countably infinite
NO
7 Countable IX
Sizes
of
A
IHZHNI
Smallest layer
D
IN 121 IQI
INI
that l
PANDI
countably
I
is
11121
1PLINY
remember Eon R PAN
set
INI 1,1IXilFACTL D
Countereti
as IN smallest
Any
E finite but same size
LINI sete
Xo
lNe
ri
Anya
has alepheO
IFretH 1PCP4N
IMPOUND
84 many
Otis

Question 2. Prove that the intervals [0,1] and [6,9] have the same cardinality. domwain cowdomain
Sdu
Defne f fo T ftp.fd by Hse
joyful
t.mn
ex ie
Need to show f
Hol
Onto
let If
a be Gil
I CGc
Bijection OI S B
This
0 Ex El
hmu
tweeter since
ftp.T yI
3 16
does describe a
That is If I C domain then fed C codomain
Oe3x E3
bijection a.bedomain
fa fbthen
ytcodomai
Loftf 4
let
Then yC 6,9J
working f
is
3aef 39
36 6 35
613
6 C 314 9
e
i a MiltoI
t
is
i FED 3 6 3 Y tf x 513
9dL need ego y
56 6 y

I to 1 Bi
and orto i
bijection
i
ONTO
10,14 46,931
a.io
Question 3. Prove that the intervals [0,1] and (6,9) have the same cardinality.
Trot endpoints
f 3ot6
6 codomain 9 codomain
Sohl o
TT endpoints
yes
oey.co of
f fee
NOT
oe
A FUN ON find another bijection
i
i
xdomm
El
c domain
flax 2x
notsy
R IN
bijV not onto
4naoettoo

Schroder
Bernstein
l Et
Cgi
c
proof
i
Ex
Question 4. Show that N × N × N is countable.
Challenge. Prove that for any set X, there is no onto function from X to 𝒫(X).
MIDSEMCONTENTT
HERE
Question 5. Draw an arrow diagram for the relation 𝜌 on {0,1,2,3,4,5,6} defined by x𝜌y if and only if xy ≡ 1 (mod 7). Is this relation reflexive? Symmetric? Transitive?
(The arrow diagram will be drawn here during during the lecture.)
STOPS
formalise
lol El boyI 2241
O
Q
57 4
1
3
7
3
02
676
to I 6,9
te
325
IIIs

Reflex’ve Symon I
Transitive
YES every 7 has corresponding
Nf
Noy 7
OJO
Question 6. Consider the diagram arrow diagram below. Is this relation reflexive? Symmetric? Transitive?
aft
f
b
Question 7. Prove or disprove: If a relation is both symmetric and transitive, then it must also be reflexive. bgb.de
I
Gotto
E
Jthitivsarely Woop
7
Mode my
Tras
boys
Build
tNxo7N bijeelion
2
2
dtd
symm.ve asd but dfa
Ref Noe
but