Mathematical logic and foundations Proposition
Product of countable sets is countable
Builds on Countable setCartesian productCantor pairing function
Statement
Let and be countable sets. Then the Cartesian product is countable.
Remarks
Proof: take injections and . Then is an injection to , where is the Cantor pairing function. By induction, a finite product of countable sets is countable. An infinite product need not be countable: the set of sequences of and is uncountable.
Reading path
To understand this page from the ground up, read these 20 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
- Product of countable sets is countable statement
Where this leads
2 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Countable_set, Formal overview
About this page
| Tag | 08G4XH86JC |
|---|---|
| URI | m2://08G4XH86JC |
| Kind | statement, proposition |
| Writing | W0 stub |
| MSC | 03E10 |
| Status | This copy of the site has no build data. Run m2 status 08G4XH86JC. |
| Uses | Countable set, Cartesian product, Cantor pairing function |
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.