10.4, Due November 10

Difficult: The most difficult part of this chapter was the notation, and understanding a function where you put in sets and get out functions. Because you have to define both of the functions... which just kind of confuses me. We have to define both fS(x) and (S). So for the set A={a,b,c}, would ({a,c})=f{a,c} ={(a,1),(b,0),(c,1)}?

Once all the notation makes sense, it would be helpful to go over the proof that said P(A) and 2^A are numerically equivalent again.

I also didn't understand how to prove that there exists no bijective function from A to P(A). It makes sense to prove it's injective, but the proof by contradiction to eliminate onto confused me.

Interesting: This is so fascinating!! Especially since there are those two sizes of infinity with no infinity in between. Say what?! (Speaking of which, I hope we never have to write that fancy Hebrew letter)