in which I layout some foundation for a process of translating from one half of a 2D polytope to the other.
For some simplification in the formulas, I will index the vertices () of a representative of half of a 2D polytope (in the affine or hyperbolic case) by the following set of surreal numbers:
with the following conventions:
,
- for
,
where
is a simple root and
as in the previous post,
,
, and
, and
- for
,
is an imaginary root or zero.
Note that for a sequence comprised of imaginary roots and zeros the equivalence defined in the last post will always freely shift the zeroes around, so we may take a number of conventions regarding its support (which must be finite). I will leave it to the future to determine whether it is more convenient in different contexts to have, e.g,.
or
or
, etc.
With this notation I define:
where is the Cartan matrix and matrix multiplication and
are understood with the convention that
is the
th basis element.
If let
be the smallest to achieve this maximum. Then we set
,
for
,
and
for
,
then inductively consider the smaller polytope.
In a fashion similar to that described by Tingley for 2D affine polytopes we may handle the cases when but at this point I think I may need to delay particulars to a third installment.