Parametrizing the total orders on a real vector space The following question appears trivial, but it's outside my limited experience so I'd appreciate a little feedback.
A total order on a real vector space $V$ is a total ordering on its vectors which is invariant under translation and positive scalar multiples, i.e. a transitive relation $<$ on $V$ such that


*

*If $v, w \in V$ with $v \neq w$, then either $v < w$ or $w > v$

*If $v, w, u \in V$ with $v < w$, then $v + u < w + u$.

*If $v, w \in V$ with $v < w$ and $c > 0$ then $cv < cw$.


If $>$ is a total order on $V$ and $0 \neq v \in V$, then if $v > 0$ we must have $0 > -v$ by translation invariance, and symmetrically, so for every nonzero $v$ we have precisely one of $v > 0$ or $-v > 0$.
Consider the following argument:
Suppose $>$ is a total order on an $n$-dimensional real vector space $V$.  Equip $V$ with an arbitrary inner product $(-,-)$.  For each $v$ either $v > 0$ or $-v > 0$, so there is some hyperplane in $V$ which has positive elements on one side and negative elements on the other.  There are two unit normals to this hyperplane, one positive and one negative.  Let $v_1$ indicate the positive one.  Apply this same procedure to the hyperplane itself to get $v_2$, and continue.  When this procedure terminates, we're left with a uniquely-determined orthonormal basis for $V$.  On the other hand, if we are given an orthonormal basis for $V$, taking the lexicographic ordering on $V$ with respect to this basis inverts this construction.  Consequently, the total orders on $V$ are parametrized by the Stiefel manifold $V_n(V, (-,-))$.
Questions:


*

*Does this work?  Something about taking an arbitrary inner product makes me feel a little uneasy here, but I can't see anything actually wrong with the proof, except that I am a little unsure as to how to cleanly show that the fact that $v > 0$ or $-v > 0$ implies there is a hyperplane with only positive vectors on one side and only negative vectors on the other.  Further, it doesn't help that Google doesn't seem to turn up any reference to this fact, which seems like it should be a natural thing to remark on were it true.

*The only reason I have to use the inner product is to specify orientation.  There doesn't seem to be a similarly clean way of doing something like this using a flag manifold -- you'd have to specify an arbitrary positive vector at each step, rather than having one uniquely determined for you.  Is there a nice way of dealing with orientation without explicitly dealing with angles?

*Is there a book I could read that make questions like this appear trivial once I'd finished?


Thanks in advance!
 A: Let $P$ be the positive cone, and let $N = -P$. Clearly $P$ and $N$ are disjoint convex sets in V. If $C$ is a convex set, its relative interior is its interior relative to its affine hull. Both $P$ and $N$ have $V$ as affine hull, so their relative interiors are their interiors in $V$. Obviously these are disjoint, so the existence of your hyperplane follows from the finite-dimensional separating hyperplane theorem (Theorem 11 of these notes):

Two non-empty convex sets in $\mathbb{R}^n$ can be properly separated by a hyperplane if and only if their relative interiors are disjoint.

(Properly separated is defined early in the notes and is what you need. Relative interiors of convex sets are discussed briefly in Appendix B of the notes.)
It seems to me that as long as you’re looking only at finite-dimensional real vector spaces, you might as well be looking at $\mathbb{R}^n$ and using the usual inner product to define the hyperplane. So far as I can, there’s then no problem with your recursive construction of an orthonormal basis $B$ such that $<$ is the lexicographic order on the coordinate $n$-tuples relative to $B$. 
This is all pretty far from any of my usual mathematical haunts, so I can’t direct you to any books that I know to be useful; the notes that I found have references to a couple of books on convex analysis that might be helpful.
