Difficult: Alright, now I've got a lot of concepts floating around in my head that I need to work on solidifying. So we have three main special relations that we've learned: one-to-one, onto, and bijective. I understand most of them visually, like on a graph, but I need to understand them conceptually now. So, if we have to prove something is bijective, we must prove it is both one-to-one and onto? Several examples of proving these two proofs would be helpful.
I didn't understand completely about why theorem 9.4 is false for infinite sets, but I assume we don't need to completely understand that yet, since we haven't discussed infinite sets with these properties yet.
Interesting: It's interesting thinking about these properties with finite sets. I can always picture a graph on the real Cartesian plane to fulfill the properties, but when we start talking about equivalence sets, it's more difficult to picture/conceptualize, but easier to prove.
No comments:
Post a Comment