Cantor pairing function
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.
Explanations
L1 human
Write the pairs in an infinite grid. Walk through the grid along the short diagonals, one after the other, and number the pairs as you go. Each pair gets exactly one number, and each number gets exactly one pair.
What this node 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 node is. They do not measure its truth.
What depends on this
3 nodes use this node, directly or through other nodes.
- Product of countable sets is countable 08G4XH86JC
- The rationals are countable 0DS9KWFDK2
- Countable union of countable sets is countable 0Z8FM54P86
Sources
- Web https://en.wikipedia.org/wiki/Pairing_function, Cantor pairing function
What links here
Used by
- Product of countable sets is countable 08G4XH86JC