Mathematical logic and foundations Theorem
The rationals are countable
Builds on Countably infinite setThe integers are countableProduct of countable sets is countable
Statement
The set of rational numbers is countably infinite.
Remarks
Proof: each rational number has a unique form with , and . The map is an injection into , which is countable. And is infinite. The rationals are dense in , but they are countable, and is not countable.
Reading path
To understand this page from the ground up, read these 23 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Existential quantifier definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Uniqueness quantifier definition
- Binary relation definition
- Function definition
- Codomain definition
- Injective function definition
- Surjective function definition
- Countable set definition
- Bijective function definition
- Cantor pairing function example
- Countably infinite set definition
- Product of countable sets is countable statement
- The integers are countable statement
- The rationals are countable statement
Further reading
- Web https://en.wikipedia.org/wiki/Rational_number, Countability
About this page
| Tag | 0DS9KWFDK2 |
|---|---|
| URI | m2://0DS9KWFDK2 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 03E10 |
| Status | This copy of the site has no build data. Run m2 status 0DS9KWFDK2. |
| Uses | Countably infinite set, The integers are countable, Product of countable sets is countable |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.