Number Systems with Simplicity Hierarchies: A ... - Ohio University
Number Systems with Simplicity Hierarchies: A ... - Ohio University
Number Systems with Simplicity Hierarchies: A ... - Ohio University
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
NUMBER SYSTEMS WITH SIMPLICITY HIERARCHIES 1241<br />
?2. The spectrum of s-hierarchical ordered vector spaces.<br />
2.1. s-Hierarchical ordered vector spaces. There are a great many ordered vector<br />
spaces that are not isomorphic to initial subspaces of No. The present subsection<br />
culminates <strong>with</strong> a result specifying necessary and sufficient conditions for those<br />
which are. To prepare the way for our proof of the said theorem, we first establish<br />
two preliminary results, the proof of the first of which makes use of the following<br />
ELEMENTARY OBSERVATION. If A is an initial subtree of a lexicographically ordered<br />
binary tree A' and x ={L R}A', where (L, R) is a partition of A, then A U {x} is<br />
an initial subtree of A'.<br />
PROOF. If a C prA (x), then Ls(a) C Ls(x) < {x} < Rs(x) D Rs(a). But x -<br />
{L I R}A; and so, by Theorem 2, there is a z c L U R such that z > each x' c LS W<br />
and z < each x' c Rs(x), which <strong>with</strong> Theorem 2 implies a