Let us have a general sequence a in N^N
Question 1
If we simply insert that sequence into the nested fractions, then we get
a0+1/(a1+1/(a2+1/(a3+...)))
It seems that for any such sequence we get a converging sequence, which is a real number. So correct me if I am wrong, but that seems a straightforward bijection of all such sequences onto real numbers. Also, we are able to build a ordering simply in the following manner:
def compare(a,b): i = 0 while (a[i]==b[i]): if i%2 == 0: if a[i] b[i]: return "a < b" else: i += 1 else: if a[i] b[i]: return "a > b" else: i += 1
I never saw that construction alongside others like Dedekind, Weierstrass or Cantor approaches.
{Question 2}
Have anybody investigated the topologies on N^N for this mapping to be continous?