At this point, we describe the symmetry group representative of all possible ways to permute the equilateral triangle in the space, including the eight points on the unit circle point set , for three orthogonally arranged unit circles. To do this, we use generators with cone number determinants. To start, we choose two elements, the first , and the second
(1.4.103)
for which, . The rationale for choosing elements having cone number determinants is that the product relationships for , result in elements having determinants which are either a cone number or an axis number. After considering how we went about finding all element permutations in the cone group, it might seem like an even more daunting task to do so for the symmetry group the cone group belongs to. However, it turns out that it can be much more straightforward, given that elements can be cone numbers. The elements that we will be studying are in the group. Defining a set with elements having the following arrangement of numbers:
(1.4.104)
Since we are dealing with finite elements, using this set amounts to turn the dial on a combination lock to arrive at any possible permutation in the symmetry group. Now, the task is to show how to do just this.
Definition (1.4.105) – We define the Symmetric Conic Group , as group under composition that sits in the complex geometric space , with a set of permutation elements with superscript notation , representing the cone.
Theorem (1.4.106) – For as a set, the set of permutations , forms a group under composition
Proof – Verification of group axioms
- Closure: All elements are bijective, and the composition of any elements is also bijective.
- Associativity: Permutations are functions, and their compositions are associative.
- Identity: The identity function bijectively maps all elements of the set to themselves .
- Inverse: is a permutation and is thus bijective, and there exists a function that is also bijective.
Theorem (1.4.107) – The Dihedral Conic Group contains 3,072 unique permutation elements , where elements of have 512 permutations, elements of have 512 permutations, and all determinants are cone number/axis number-valued.
Staring with the elements
we find all three elements in the -subset, where multiple combinations of permutations can be considered, of which, we present the following products that result in the elements :
Since each of the three matrix entries in the permutation may take any value in the set
,
and given there are six permutation forms, a simple calculation shows the total number of permutations is
To show the power of these elements using the elements of , it becomes possible to arrive at all our original elements from the cone group, by the following products
(1.4.108)
(1.4.109)
for , a product element.