As previously discussed, in traditional conic sections, the null curve represents lines designating the boundary of the cone. In the complex plane, these lines have slopes taking the form of the positive and negative square roots of , which can be represented by the exponentials , and their intersections with the unit circle. Numerically, these exponentials represent the complex numbers,
(1.4.60)
with matrix representations
(1.4.61)
each of which, squares to
(1.4.62)
There exists a more fundamental representation of these numbers, where we argue that these are fundamental and analogous to the imaginary and split complex numbers
(1.4.63)
These numbers take the forms
(1.4.64)
where , are arranged on the anti-diagonal, having more geometric significance, given that the matrix entries alternate between real and imaginary values. The matrix representation for , will square to , and when raised to sequential powers, it will cycle around the unit circle points, , and the axes of the circle
(1.4.65)
In Figure 1.4.10, the geometry of the cone numbers is shown at their intersection points with the complex unit circle.
When comparing the matrix exponentials for the two representations of elements, they differ in the trigonometric entries
(1.4.66)
(1.4.67)
Figure 1.4.11 – Cone numbers on the complex unit circle.
Both representations are essentially hybrids of the trigonometric functions of the circle and the hyperbola, and these can just as easily be represented in the forms
(1.4.68)
(1.4.69)
For matrix derivatives, we find
(1.4.70)
(1.4.71)
revealing that they will differ by the entries on their anti-diagonals. When relating dihedral forms to the cone numbers, being considering, we define the cone number elements , by the following,
(1.4.71)
where each element is a cone number with respective rotational axes from the set . The products of these cone numbers form the elements of a Cartan algebra of the cone group, a few of which we calculate products with, for , indicating the set of products:
(1.4.72)
The product results are similar in form to the Cartan subalgebras from the other dihedral groups
(1.4.73)
and for the elements
(1.4.74)
In the case of a permutation matrix, for which, , we have the multiplicative identity of the group. The simplest means for a cone number element to transform to the identity , is by successive self-products
(1.4.75)
For entry values , similar representations inclusive of all -type permutations, take the general form
(1.4.76)
The group being considering is comprised of a much larger set of permutation elements in comparison to the other dihedral groups covered up to this point. The values for each entry can be any complex number from the set of eight elements The elements are a subgroup of the larger group, where for instance, we can derive , by way of the following combination of products
(1.4.77)
In like fashion, the remaining two elements , can be generated by the following products
(1.4.78)
(1.4.79)
The familiar Cartan subalgebra forms can be generated by the products , for ,
(1.4.80)
Concerning cone number permutation matrices of the -type*,* they are not necessarily commutative as they were for the Cartan subalgebras from previous studies. This is because the permutation matrices can now vary in their individual entry values, which are drawn from the set For the -type matrices, a cyclic shift in the entry values occurs for the Lie bracket operation
(1.4.81)
More succinctly, we can describe the commutator relationships, as
(1.4.82)
(1.4.83)
which implies that for the matrices to commute, we must have that .
By these considerations, we can now define the cone group , as follows:
Definition (1.4.84) –The dihedral cone group, is defined as a group under composition that sits in the complex geometric space, with a setof permutation elements, with the superscriptrepresenting the cone.
Theorem (1.4.85) –The set of permutationsforms a group under composition
Proof – Verification of group axioms
Closure:All elementsare bijective, and the composition of any elementsis also bijective.
Associativity: Permutations are functions, and their compositions are associative.
Identity: The identity functionbijectively maps all elements of the setto themselves.
Inverse:is a permutation and is thus bijective, and there exists a functionthat is also bijective.
Theorem (1.4.86) –The dihedral cone groupcontains a total of 1,536 permutation elements, where elements ofare each comprised of 256 permutations with cone numbers for their determinants, and the elementsare also each comprised of 256 elements with axis numbers for their determinants.
elements, determinants are complex numbers on the unit circle, located on cone points from the set, and specifically, the elementshave determinants equal to. For elements, they also have complex number determinants on the unit circle, located at axis points from the set, and specifically, the elementshave determinants equal to. From linear algebra, the product of determinants is equal to determinant of the matrix-matrix product
and the following product relations for thedihedral groups, hold congruent modulo 3,
From these product relationships of group elements and determinants, the-element determinants will always remain on the axes of the unit circle, and the-element determinants will always be cone number points on unit circle. Further, the product results of any even powers involving, will always be on the axes and, for example
The sum of two even exponents yield an even exponent result and based on the product relationship, any product combination of elementsthat results in an even exponent is always. All odd power exponent sums of element product of combinations, result in a cone number determinant matrix, based on the unit circle's symmetry and the element product relationships, which are always. For example,
has an odd numbered sum for the product exponents, and always holds, since any. This is the case for the results of products, and not products, and/or the combination of productsThe reason is the following determinant holds,. This implies that forand/or even/odd, the result is a matrix determinant that is a cone number and therefore. While any combinations, mand/or even/even result in an axis numbered matrix determinant, and is therefore,. The determinants are calculated by the products of the three entries in each element. For cone numbered determinants, these entries must have values that are an arrangement ofor, where, defines a cone number, and, an axis number. For example, thematrix hasfor its entries, and its determinant is
where the product, gives a cone number result. When taking the determinant product of matrices, this relationship will always hold and determines if the result is, for cone numbers, and, for axis numbers. For clarification of these numbers, we see in Figure 1.4.12the arrangement of cone numbers and axis numbers on the unit circle and their symmetry.
Figure 1.4.12 – Cone numbers and axis numbers , on the complex unit circle.
For all matrices, the arrangement of cone numbers and axis numbers can be one of four possible forms for each:
And for the matrices with elements, eachform will also have four possible forms:
As there are four different numbers in each group, there arepossible permutations for each matrix above, and given there are a total of 24 matrix forms above, there areelements total in the group.
The brute force portion of this proof now follows. Since we must show that all these permutation possibilities are indeed achievable by multiplicative closure of the elements. We start by defining permutation elementsin the form ofmatrices with main diagonals entries
and further define the matrix element, as
We start by working on the-permutations for the number arrangements
while taking, as
Since allhave element, all productswill yield the same valueforin the-matrix result. To save space, we display the results of these product transformations in avector notation,
For the forms,, we proceed to find the sixteen combinations for our fixed cone number, C, at, using the following products
For the forms,, the remaining sixteen permutation combinations forat, we use the following products
In total there are fifteen distinct permutations above, wherehas the same form,, and the sixteenth group permutation is simply our originalelement
To find the remainingpermutations, requires finding all forms of the 32 matrices above, having a cone number for its-element. To do so, we need to identify the following permutations matrices,
having the samebottom-right submatrix as the-permutations, and then simply apply all the same transformations previously done for thematrix. Finding permutation products to yield these matrices requires a mapping, denoted in the bold font in the following matrices,
By using the product combinations of our previous matrices, we find solutions for these mapping matrices
and after applying the same mappings for the first 32 permutations, this brings us to a total of 128 permutations for theelements.
The other-element permutations, come by considering the second half of the matrix number forms
for, an axis number, and the two entries in thebottom-right submatrix will alternate between axis and cone numbers. To arrive at the form above, the entries of the left matrix must be mapped by the row/column transformations:, and onto the right matrix. For the matrix, this mapping represents
To accomplish this, we use the following matrix products
To determine thetransformations, we proceed by applying the sametransformations to find sixteen elements of the form
by way of the following products:
The remaining sixteen elements of the form
are then found by the closed multiplication transformations:
which comprise fifteen different permutations, and the sixteenth is simply ourmatrix
To arrive at the remaining permutations of, it requires identifying the following permutations
having abottom-right submatrix equal to that found in thepermutation. We then we apply the sametransformations, giving us the following matrices denoted in bold below, which map:
By using the product combinations,, solutions are found by evaluating the products
With complete solutions for all cone group permutations, we find the values for all remaining, permutations by using the Cartan subalgebra element, found by using the product transformation
So, the following transformations yield, as follows
All permutations inhave now been found, totalingpermutations. Finally, to prove that we have all the permutation elements, we recall that
which when acting on another permutation, will result in a permutation matrix, having uniformly rotated elements by. Applying this linear transformation to thepermutation elements, yields the, elements
We now have all permutation elements,, making the stated theorem's total of
It is also important to point out that there are many more possible combinations when considering matrix groups that are a composition of elements. An example would be all the possible combinations of the elements in a Lie algebra group of the form
(1.4.87)
which can be calculated by finding product of all possible permutations for each . The result is would then be equal to different possibilities! After considering the dihedral cone group we have a much better idea of how many permutations are possible in complex spaces and, more importantly, we have also considered where determinants sit in complex space. At this junction, it is important to point out that distance functions will tend to change as we move from one subgroup of the cone group to another. Our next goals are to consider the symmetry group of this dihedral space, which is called the symmetric/dihedral conic group, and to expand on the other group elements more thoroughly. Before defining this symmetry group, we first consider its elements in more detail by minimal slicing.