The most important theorems in my opinion are the theorems from chapter ten, especially theorem 10.17.
The kinds of questions that I expect to see on the exam would be some multiple choice that have to do with mostly definitions and then some proofs for telling if something is denumerable or not and a proof about the cardinality of sets.
What I need to understand better would be concepts such as the schroder-bernstein theorem, uncountable sets, and the division algorithm. I would like to see examples worked through for all three of these but particularly the schroder-bernstein. Perhaps see a proof using schroder-bernstein that shows that |(0,1)|=|[0,1]|
No comments:
Post a Comment