Exercise 1.6.9

Using the various tools and techniques developed in the last two sections (including the exercises from Section 1.5), give a compelling argument showing that P ( N ) R .

Answers

Recall from Exercise 1.6.4 that if

S = { ( a 1 , a 2 , a 3 , ) : a n = 0  or  1 }

then S R . Define f : P ( N ) S as f ( x ) = ( a 1 , a 2 , ) where a i = 1 if i x and a i = 0 otherwise. f is thus a one-to-one, onto map between P ( N ) and S , hence P ( N ) S . Since is an equivalence relation, P ( N ) R .

User profile picture
2022-01-27 00:00
Comments