From the axiom of choice we get that every set can be ordered in a way that will make it a well ordered set, including $\Bbb R$. However, since the ordinal of such a well-ordered set of $\Bbb R$ will be at least $\omega_1$, and since as far as I understood from what I read and the questioned I researched over the website, it is only proveable that $\Bbb R$ is well ordered with the axiom of choice, it's supposedly impossible to 'show' one, as in, not to show that one exists, but to point to a specific one.
After the Course's test that thought bothered me quite a bit. I've been thinking about a specific ordering of $\Bbb R$, that seems to me as if it 'covers' all of R indeed, and is well-ordered as well. Obviously it is wrong, due to what I wrote earlier, but I can't figure out why. Any explanations to what's the 'problem' with it, or what's wrong with it will be highly appreciated. Does the problem come from the non-uniqueness of decimal representation?
The ordering I thought of:
Let $r\in\Bbb R$, then every such r can be defined as:
$r=k.n_1n_2n_3n_4...n_n...$ where $k,n_i\in\Bbb N$ and $0\le n_i\le9$.
For example, 3.14$\in\Bbb R$ would have k=3, $n_1=1, n_2=4,$ and for every $i \gt 2, n_i=0$.
let <' be an order on $\Bbb R$, so that =
{0,1,2,3,4….
-1,-2,-3,-4…
0.1, 1.1, 2.1 ,3.1…
-0.1, -1.1, -2.1, -3.1…
0.2, 1.2, 2.2, 3.2…
-0.2, -1.2, -2.2…
….
-0.9, -1.9, -2.9….
0.01, 1.01, 2.01…
…
-0.09, -1.09…
0.11, 1.11…
-0.11, -1.11…
0.12, 1.12…
-0.12, -1.12…
…
-0.19, -1.19…
0.21, 1.21…
…
-0.99, 1.99…
0.001, 1.001,…
……………….}
Let me try to explain each line. The first two lines are of $\Bbb Z$ where the first one is the positives (an 0), ordered by <, and the second one is the negatives, ordered by >. Every two lines are so (regarding the positives and negatives). Next line is the 'tenth's', as in for every $i \gt 1, n_i=0$, and we go with $n_1=0, n_1=2$ and so forth. Then we reach the hundreth, as in for every $i\gt 2$ $n_i=0$, and we go around with $n_1=0$ and 'run' with the $n_2$'s, then again with $n_1=1$ and so forth. Then the thousandth's, and so forth where we set for every $n_i$'s which's i is lesser or greater than the i on the $n_i$ which we 'run' on is 0, and then we go backwards and increase it by one every time, keeping the greaters on 0 until we reach '$999...$'.
That's the general idea, hope I made it clear enough. Eitherway, it's easy to see the order is well-ordering, and every line's ordinal is $\omega$. Question is - what did I do wrong, as this is obviously wrong according to what I stated above, if I got it right at least. I hope I didn't write anything too stupid.
Edit 1: Following Mauro ALLEGRANZA's comment, it seems the issue with the above ordering that it only covers finite number of strings. So we have to deal with r's with infinite number of strings, i.e. infinite number of strings that doesn't go to $n_i=0$ from $i \gt n_0$. If we take said number $r_w$ with smallest countable infinite strings, the set of such strings can be mapped to and have the ordinal of $\omega$. Question is whether I can follow it up from here - say that for every $n_i$>$n_w$ we set it to zero, as well as every $n_i$<$n_w$, and then we go backwards adding 'ones', or will it be impossible to say that since well, it doesn't make all too much sense. Any thoughts on the line of thought suggested in here? If it is possible to state so, then it's possible to go transfinite with this. Does something stops me from doing so, is it wrong because again, I limit it to certain place?