Mathematical logic and foundations Example
Cantor pairing function
Builds on Bijective functionCartesian product
Example
The Cantor pairing function is the function with It is a bijection. It lists the pairs along the diagonals : , , , .
Remarks
So is countably infinite. See product of countable sets is countable. The value is the number of pairs on the earlier diagonals, and is the position on the diagonal.
Reading path
To understand this page from the ground up, read these 18 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
- Bijective function definition
- Cantor pairing function example
Where this leads
3 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Pairing_function, Cantor pairing function
About this page
| Tag | 0NP5N5PYW5 |
|---|---|
| URI | m2://0NP5N5PYW5 |
| Aliases | cantor-pairing |
| Kind | example |
| Writing | W2 usable |
| MSC | 03E10 |
| Instance of | Bijective function |
| Uses | Bijective function, Cartesian product |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W3
- a person confirmed each agent-written section: rule P04 (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.