Pairing function ================ In mathematics, a pairing function is a process to uniquely encode two natural numbers into a single natural number. Any pairing function can be used in set theory to prove that integers and rational numbers have the same cardinality as natural numbers. In mathematics, a pairing function is a process to uniquely encode two natural numbers into a single natural number. Any pairing function can be used in set theory to prove that integers and rational numbers have the same cardinality as natural numbers. ==Definition== A pairing function is a bijection \pi:\mathbb{N} \times \mathbb{N} \to \mathbb{N}. ===Generalization=== More generally, a pairing function on a set A is a function that maps each pair of elements from A into an element of A , such that distinct pairs of elements of A are associated with distinct elements of A , or a bijection from A^2 to A . Instead of abstracting from the domain, the arity of the pairing function can also be generalized: there exists an n-ary generalized Cantor pairing function on \mathbb{N} . \pi(k_1,k_2) := \frac{1}{2}(k_1 + k_2)(k_1 + k_2 + 1)+k_2=\binom{k_1+k_2+1}{2}+k_2 where k_1, k_2\in\{0, 1, 2, 3, \dots\} . It can also be expressed as \pi(x, y) := \frac{x^2 + x + 2xy + 3y + y^2}{2} . It is also strictly monotonic with respect to each argument, that is, for all k_1, k_1', k_2, k_2' \in \mathbb{N} , if k_1 , then \pi(k_1, k_2) ; similarly, if k_2 , then \pi(k_1, k_2) . The statement that this is the only quadratic pairing function is known as the Fueter–Pólya theorem. Whether this is the only polynomial pairing function is still an open question. When we apply the pairing function to and we often denote the resulting number as . This definition can be inductively generalized to the \pi^{(n)}:\mathbb{N}^n \to \mathbb{N} for n > 2 as \pi^{(n)}(k_1, \ldots, k_{n-1}, k_n) := \pi ( \pi^{(n-1)}(k_1, \ldots, k_{n-1}) , k_n) with the base case defined above for a pair: \pi^{(2)}(k_1,k_2) := \pi(k_1,k_2). Another generalization of the Cantor pairing function to a bijection \pi^{(n)}\colon\mathbb{N}^n \to \mathbb{N} is provided by the combinatorial number system: \pi^{(n)}(x_1,\dots,x_n)=\binom{x_1+\dots+x_n+n-1}{n}+\binom{x_1+\dots+x_{n-1}+n-2}{n-1}+\dots+\binom{x_1+x_2+1}{2}+\binom{x_1}1. z = \pi(x, y) = \frac{(x + y + 1)(x + y)}{2} + y and hence that the function is invertible. It is helpful to define some intermediate values in the calculation: w = x + y \! t = \frac{1}{2}w(w + 1) = \frac{w^2 + w}{2} z = t + y \! where is the triangle number of . If we solve the quadratic equation w^2 + w - 2t = 0 \! for as a function of , we get w = \frac{\sqrt{8t + 1} - 1}{2} which is a strictly increasing and continuous function when is non-negative real. Since t \leq z = t + y we get that w \leq \frac{\sqrt{8z + 1} - 1}{2} and thus w = \left\lfloor \frac{\sqrt{8z + 1} - 1}{2} \right\rfloor. where is the floor function. So to calculate and from , we do: w = \left\lfloor \frac{\sqrt{8z + 1} - 1}{2} \right\rfloor t = \frac{w^2 + w}{2} y = z - t \! x = w - y. \! Since the Cantor pairing function is invertible, it must be one-to-one and onto. \pi(x,y)+1 = \pi(x-1,y+1) . The function must also define what to do when it hits the boundaries of the 1st quadrant – Cantor's pairing function resets back to the x-axis to resume its diagonal progression one step further out, or algebraically: \pi(0,k)+1 = \pi(k+1,0) . Also we need to define the starting point, what will be the initial step in our induction method: . Assume that there is a quadratic 2-dimensional polynomial that can fit these conditions (if there were not, one could just repeat by trying a higher-degree polynomial). The general form is then \pi(x,y) = ax^2+by^2+cxy+dx+ey+f . Plug in our initial and boundary conditions to get and: bk^2+ek+1 = a(k+1)^2+d(k+1) , so we can match our terms to get . So every parameter can be written in terms of except for , and we have a final equation, our diagonal step, that will relate them: \begin{align} \pi(x,y)+1 &= a(x^2+y^2) + cxy + (1-a)x + (1+a)y + 1 \\ &= a((x-1)^2+(y+1)^2) + c(x-1)(y+1) + (1-a)(x-1) + (1+a)(y+1). \end{align} Expand and match terms again to get fixed values for and , and thus all parameters: . Therefore \begin{align} \pi(x,y) &= \frac{1}{2}(x^2+y^2) + xy + \frac{1}{2}x + \frac{3}{2}y \\ &= \frac{1}{2}(x+y)(x+y+1) + y, \end{align} is the Cantor pairing function, and we also demonstrated through the derivation that this satisfies all the conditions of induction. The following pairing function: \langle i, j\rangle := \frac{1}{2}(i+j-2)(i+j-1) + i , where i, j\in\{1, 2, 3, \dots \} . is the same as the Cantor pairing function, but shifted to exclude 0 (i.e., i=k_2+1 , j=k_1+1 , and \langle i, j\rangle - 1 = \pi(k_2,k_1) ). It was used in the popular computer textbook of Hopcroft and Ullman (1979). (\alpha,\beta) = (\gamma,\delta),\\[4pt] \max(\alpha,\beta) The basic idea is that is used as the primary sort key. Therefore, for every ordinal , all pairs with both entries less than comes before all other pairs; in other words, the Cartesian product is mapped to an initial segment of this new ordering, with the order type of the initial segment denoted by . Since is a strictly increasing ordinal sequence, . It is also continuous, since for limit ordinal we have . Now for all aleph number , can be proved by transfinite induction: If , then by continuity since is a natural number for every natural number . If is an initial ordinal, then by continuity since for all infinite , where can be shown by applying the inductive hypothesis to the initial ordinal of . An important implication of this pairing function is that for all well-orderable infinite cardinal number . In particular, in ZFC every cardinal number is well-orderable, so holds for all infinite cardinal . Conversely, the statement " holds for all infinite cardinal " implies the axiom of choice; this result is known as Tarski's theorem about choice. \operatorname{ElegantPair}[x, y] := \begin{cases} y^2 + x&\text{if}\ x Which can be unpaired using the expression: \operatorname{ElegantUnpair}[z] := \begin{cases} \left\{ z - \lfloor\sqrt{z}\rfloor^2, \lfloor\sqrt{z}\rfloor \right\} & \text{if }z - \lfloor\sqrt{z}\rfloor^2 (Qualitatively, it assigns consecutive numbers to pairs along the edges of squares.) One advantage of this pairing function manifests when using a pair function to represent a binary tree-like structure, where the first natural numbers represent distinct types of leaves, and represents a binary tree with left and right subtrees represented by and respectively. This pairing function guarantees that all binary trees are ordered by depth. A concrete example of such a binary tree-like structure is an SK combinator calculus expression. The function P_2(x, y):= 2^x(2y + 1) - 1 is a pairing function. In 1990, Regan proposed the first known pairing function that is computable in linear time and with constant space (as the previously known examples can only be computed in linear time if multiplication can be too, which is doubtful). In fact, both this pairing function and its inverse can be computed with finite-state transducers. In the same paper, the author proposed two more monotone pairing functions that can be computed online in linear time and with logarithmic space; the first can also be computed offline with constant space. In 2001, Pigeon proposed a pairing function based on bit-interleaving, defined recursively as: \langle i,j\rangle_{P}=\begin{cases} \bot & \text{if}\ i=j=0;\\ \langle\lfloor i/2\rfloor,\lfloor j/2\rfloor\rangle_{P}:i_0:j_0&\text{otherwise,} \end{cases} where i_0 and j_0 are the least significant bits of i and j respectively. ==Citations== ===Notes=== ===Footnotes=== ===References=== REFERENCES ---------- BIBLIOGRAPHY (BibTeX) -------------------- @article{ref0, title = {Pairing function}, url = {https://encyclopegia.org/a/pairing-function} } BIBLIOGRAPHY (RIS) ------------------- TY - JOUR TI - Pairing function UR - https://encyclopegia.org/a/pairing-function ER - CITE THIS ARTICLE ---------------- Cite this article: Pairing function Derived from: https://en.wikipedia.org/w/index.php?oldid=1368483616 Licence: CC BY-SA 4.0 Snapshot: enwiki-001368483616 Permalink: /a/pairing-function