Industry-relevant training in Business, Technology, and Design to help professionals and graduates upskill for real-world careers.
Fun, engaging games to boost memory, math fluency, typing speed, and English skills—perfect for learners of all ages.
This chapter discusses Cantor's theorem and the concept of cardinality in sets. It establishes that the cardinality of any set is strictly less than the cardinality of its power set, and provides various proofs, particularly using the diagonalization argument. The chapter concludes by revealing that there are infinitely many infinities, reflecting the nature of different cardinalities within infinite sets.
Enroll to start learning
You’ve not yet enrolled in this course. Please enroll for free to listen to audio lessons, classroom podcasts and take practice test.
References
ch30 - part B.pdfClass Notes
Memorization
What we have learnt
Final Test
Revision Tests
Term: Cantor's Theorem
Definition: A theorem stating that for any set A, the cardinality of A is strictly less than the cardinality of its power set P(A).
Term: Cardinality
Definition: A measure of the 'number of elements' in a set, used to compare the sizes of different sets.
Term: Diagonalization Argument
Definition: A proof technique used to show that certain sets are uncountable by constructing a subset that cannot be mapped to an existing set.
Term: Power Set
Definition: The set of all subsets of a given set A, denoted as P(A).