I'm looking for a pointer to common techniques to map tuples of natural numbers into real or rational numbers such that the ordering is preserved (I assume tuples are ordered lexicographically).
I'm particularly interested in embeddings that map tuples of the form $(n, 0, \dots, 0)$ to $n$.
As an example for pairs, if I have a pair $(n,m)$ I can define $f: (\mathbb{N},\mathbb{N}) \to \mathbb{Q}$ as:
$f(n,m) = n + \frac{m}{m+1}$
and because $\frac{m}{m+1} \in [0;1[$, I have the desired property that $(n_1,m_1) \leq (n_2,m_2) \iff f(n_1,m_1) \leq f(n_2,m_2)$. I also have that $\forall n: f(n,0) = n$.
How does this generalize to tuples of arbitrary (but fixed) arity? Do these embeddings or some instances of such embeddings have well-known names?