Search the courses, subjects, tracks, games and features, or jump straight to a page.
This chapter discusses countably infinite sets and transitions into uncountably infinite sets, focusing on Cantor’s diagonalization argument. The proof shows that the set of all binary strings of infinite length is uncountable by demonstrating that for any proposed enumeration, there will always be at least one string that is omitted. Different infinite sets such as {0, 1} and the real numbers between 0 and 1 are explored in further detail, reinforcing the concept of uncountability.
Chapter 610 sections
This chapter discusses countably infinite sets and transitions into uncountably infinite sets, focusing on Cantor’s diagonalization argument. The proof shows that the set of all binary strings of infinite length is uncountable by demonstrating that for any proposed enumeration, there will always be at least one string that is omitted. Different infinite sets such as {0, 1} and the real numbers between 0 and 1 are explored in further detail, reinforcing the concept of uncountability.
Countably infinite sets have the same cardinality as the set of positive integers.
Cantor’s diagonalization argument is a method to prove the existence of uncountable sets.
The set of real numbers is uncountable due to its inclusion of irrational numbers, which cannot be enumerated.
A set whose elements can be put into a one-to-one correspondence with the positive integers.
A set that cannot be placed in one-to-one correspondence with the set of positive integers, implying there are more elements than can be enumerated.
A proof technique used to demonstrate the existence of uncountable sets by showing that any list of the elements will miss at least one element.
A one-to-one correspondence between two sets, indicating they have the same cardinality.
Total Questions
2
Estimated Time
4 min
Passing Score
70%
1 more question available