Ordering: Difference between revisions
(6 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
Related to counting, countabiliy | Related to counting, countabiliy. | ||
==Diagonal== | ==Diagonal== | ||
Line 15: | Line 16: | ||
This is a bijection to Figure 2 where y is shifted by x and the matrix is flipped upside down: | This is a bijection to Figure 2 where y is shifted by x and the matrix is flipped upside down: | ||
Figure 2: | |||
<math> | <math> | ||
\begin{bmatrix} | \begin{bmatrix} | ||
Line 26: | Line 29: | ||
The is a 1-1 mapping <math>\mathbb{Z}^2 \to \mathbb{Z}</math>. | The is a 1-1 mapping <math>\mathbb{Z}^2 \to \mathbb{Z}</math>. | ||
We first derive the function from <math>\mathbb{Z}^2</math> to <math>\mathbb{ | We first derive the function from <math>(x,y) \in \mathbb{Z}^2</math> to <math>z \in \mathbb{Z}</math> as shown in Figure 2. | ||
Let <math>(x,y)</math> be the coordinates in <math>\{(0,0), (1, 0), (1,1), ...\}</math> which will map to <math>\ | Let <math>(x,y)</math> be the coordinates in <math>\{(0,0), (1, 0), (1,1), ...\}</math> which will map to <math>\{0, 1, 2, ...\}</math>. | ||
First note that <math>\sum_{0}^{k}i = \frac{(k)(k+1)}{2}</math>. | First note that <math>\sum_{0}^{k}i = \frac{(k)(k+1)}{2}</math>. | ||
Thus the number of elements in columns <math>0, ..., x-1</math> is <math>(x)(x+1)/2</math>. | Thus the number of elements in columns <math>0, ..., x-1</math> is <math>(x)(x+1)/2</math>. | ||
Thus our formula is <math>z = \frac{x(x+1)}{2} + y</math> | Thus our formula is | ||
<math display="block"> | |||
\begin{equation} | |||
z = \frac{x(x+1)}{2} + y | |||
\end{equation} | |||
</math> | |||
To calculate the inverse formula: | To calculate the inverse formula: | ||
Given an integer <math>z</math>, we want to find <math>(x, y)</math> | Given an integer <math>z</math>, we want to find <math>(x, y)</math>. | ||
Inverting <math>\frac{x(x+1)}{2}</math>, we get: | |||
<math display="block"> | |||
\begin{align} | |||
x &= \left\lfloor \frac{-1 + \sqrt{1+8z}}{2} \right\rfloor\\ | |||
y &= z - \frac{x(x+1)}{2} | |||
\end{align} | |||
</math> | |||
The formula is figure 1 is as follows: | The formula is figure 1 is as follows: | ||
Used in the proof of: | |||
* The Cartesian product of two countable sets is countable | |||
Variations: | |||
* For spherical harmonics: | |||
{{ hidden | Spherical Harmonics | | |||
For spherical harmonics, we have <math>0 \leq |m| \leq l</math>. | |||
<math display="block"> | |||
\begin{equation} | |||
z = l(l+1) + m | |||
\end{equation} | |||
</math> | |||
<math display="block"> | |||
\begin{align} | |||
l &= \left\lfloor \sqrt{z} \right\rfloor\\ | |||
m &= z - x^2- x | |||
\end{align} | |||
</math> | |||
}} |
Latest revision as of 20:07, 26 May 2020
Related to counting, countabiliy.
Diagonal
The goal is to get formulas for the following:
Figure 1: \(\displaystyle \begin{bmatrix} 0 & 2& 5& 9&\\ 1 & 4& 8& &\\ 3 & 7& & &\\ 6 & & & &\\ \end{bmatrix} \)
This is a bijection to Figure 2 where y is shifted by x and the matrix is flipped upside down:
Figure 2: \(\displaystyle \begin{bmatrix} & & & &\\ & & 5& &\\ & 2& 4& &\\ 0 & 1 & 3& ... &\\ \end{bmatrix} \)
The is a 1-1 mapping \(\displaystyle \mathbb{Z}^2 \to \mathbb{Z}\).
We first derive the function from \(\displaystyle (x,y) \in \mathbb{Z}^2\) to \(\displaystyle z \in \mathbb{Z}\) as shown in Figure 2.
Let \(\displaystyle (x,y)\) be the coordinates in \(\displaystyle \{(0,0), (1, 0), (1,1), ...\}\) which will map to \(\displaystyle \{0, 1, 2, ...\}\).
First note that \(\displaystyle \sum_{0}^{k}i = \frac{(k)(k+1)}{2}\).
Thus the number of elements in columns \(\displaystyle 0, ..., x-1\) is \(\displaystyle (x)(x+1)/2\).
Thus our formula is
\[
\begin{equation}
z = \frac{x(x+1)}{2} + y
\end{equation}
\]
To calculate the inverse formula:
Given an integer \(\displaystyle z\), we want to find \(\displaystyle (x, y)\).
Inverting \(\displaystyle \frac{x(x+1)}{2}\), we get:
\[
\begin{align}
x &= \left\lfloor \frac{-1 + \sqrt{1+8z}}{2} \right\rfloor\\
y &= z - \frac{x(x+1)}{2}
\end{align}
\]
The formula is figure 1 is as follows:
Used in the proof of:
- The Cartesian product of two countable sets is countable
Variations:
- For spherical harmonics:
For spherical harmonics, we have \(\displaystyle 0 \leq |m| \leq l\).
\[ \begin{equation} z = l(l+1) + m \end{equation} \]
\[ \begin{align} l &= \left\lfloor \sqrt{z} \right\rfloor\\ m &= z - x^2- x \end{align} \]