Question #136814
Show that a subset of a countable set is also countable
1
Expert's answer
2020-10-18T17:51:52-0400

Remark. By a sequence , we mean a function ff defined on the set JJ of all positive integer .

Solution:

Let AA be a countable set and EE be a subset of AA .

Claim: EE is countable

If EE is finite , then EE is obviously countable.

Suppose that EE is infinite set .

Arrange the elements xx of AA in sequence {xn}\{ x_n\} of distinct elements. Construct a sequence {nk}\{ n_k\} of positive integer as follows:

Let n1n_1 be the smallest positive integer such that xn1Ex_{n_1}\in E .Having chosen n1,n2,.....nk1n_1,n_2,.....n_{k-1} (k=2,3,.......)(k=2,3,.......) ,let nkn_k be the smallest positive integer grater than nk1n_{k-1} such that xnkEx_{n_k}\in E .

Putting f(k)=xnkf(k)=x_{n_k} (k=1,2,3,......)(k=1,2,3,......) we obtain a 1-1 correspondence between E and JE \ and \ J .

i,e, If f(k1)=f(k2)f(k_1)=f(k_2)

    xnk1=xnk2\implies x_{n_{k_1}}=x_{n_{k_2}}

Hence ff is one one

Again for each xnkx_{n_k} there exist a positive integer kk form JJ

such that f(k)=xnkf(k)=x_{n_k}

Hence ff is onto.

Therefore EE is countable.


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS