Consider the set $ \Bbb R^n = \{ x = (x_1, ..., x_n) : x_1, ..., x_n \in \Bbb R \}.$
For $x,y\in \Bbb R^n$, we define $<$,$\leq$ as below: $$ x<y \iff j \in \{1,..,n \} (x_j<y_j) \wedge \forall i \in \Bbb N (i<j \to x_i=y_i).$$
$$x \leq y \iff (x<y) \vee (x=y). $$
$"<"$ defines on $ \Bbb R^n $ the so called "Lexicographical Order".
Prove:
$(a)$ $ \leq $ on $ \Bbb R^n $ defines a order-relation.
$(b)$ $( \Bbb R^n, \leq )$ is total ordered.
So, could you give me any hints about it, that let me solve alone this exercise? And what is correlation between the lexicographical order and the $\leq$ realtion? Thank you!
Compare on the first component and in case of a tie compare on the second component and in case of a tie compare on the third component...
$\le$ is the non-strict version of $<$.
Antisymmetry: if two elements compare both ways ($\le$ and $\ge$), then their first components compare both ways, and there is a tie on the first components; and so on with the next components.
Transitivity: if the pairs $(x, y)$ and $(y, z)$ are ordered, then their first components are ordered and by transitivity the first components of $(x, z)$ are ordered. In the case of a tie on $(x, z)$, there is a tie on the first components of $(x, y)$ and $(y, z)$, and the reasoning applies to the next components.
Totality: the first components can be compared and in case of a tie the second components can be compared...