Continuous functions define there are no gaps between points on the function and that it is differentiable everywhere. This provides the minimum requirements for a function to be smooth, and the smoothness of a function is a property related to the number of continuous derivatives it has over a domain. If a function has continuous derivatives for all orders in its domain, this function is referred to as a C-infinity function We also note that the minimal element basis is the limiter in terms of the angle coefficients that can be chosen. Mindful of this, we return to
(1.5.107)
and state the following theorem.
Theorem (1.5.108) – For any solutions of , the winding number of any reduced rational number chosen for , results in a winding number equal to . For non-reduced rationals, and in radians, the winding number will be equal to the reduced number for that rational.
Proof – Similar the previous section, for , the number of elements in the minimal element basis, , the numerator of the rational expression , , the denominator of the rational expression , and , the winding number, we first solve the following for
We can solve the above to show that , but we can also show that based on the fact that the minimal element will be for all reduced rationals, and for this implies that , and then arrive at , stated explicitly, as
To prove that , we can use the finite matrices of the cyclic groups of the form , for , the integer value of the rational denominator we have been working with. The elements of the group will have the following matrix template, where the column number of the first row serves as the numerator value , and all other matrix entries, apart from the entries with value , will be set to zero
The entry, , which continues down the main diagonal is the identity element The minimal element is the first entry to the right of , for , and continues along its diagonal path to form the minimal element matrix. These matrices are modulo , which represents a rotation of radians on the unit circle. In the cyclic groups, the primitive root is the same thing we have been referring to as the minimal element, and as such, every element in the cyclic group can be thought of as a power of this primitive root. So, another way to consider every entry in the matrix template is for the set of entries that is similar to our original definition, but with the variable set to 1. This acts on the minimal element, or primitive root, by
and since the primitive root rotates counterclockwise by one element at a time on unit circle, this translates as one column shift to the right on the template matrix. We can express any value of , as its minimal element, or primitive root, representation , for , the power to which we raise the minimal element, which is also equal to the numerator in our original form. In this form, it is clear to see that every number in the set of elements
is a power of the minimal element. Since is the non-zero exponential power that the minimal element is raised to in order to equal , for , we have our first identity , for a non-zero exponential. As we have stated in the definition, is the number of unique elements in the set of the minimal element basis, after passing , for iterative powers , the cyclic nature of the element repeats itself. Therefore, the total number of unique elements in the set of the minimal element basis equals , which is equal to . We can now consider the following equation with subtle changes, and since we are taking powers of the minimal element, we know that the winding number will increase by one after every factor . Now we can solve again for , having proved that it is equal to for the following,
therefore, must be equal to the value .
To clarify the matrix template introduced in the previous theorem, we present an example of a matrix. We start first by the zero-wind identity permutation
(1.5.109)
and the distance travelled from to the minimal distance point on the unit circle is , which is the minimal element permutation
(1.5.110)
The next permutation in the cyclic group is
(1.5.111)
and the next
(1.5.112)
The cyclic permutation just prior to arriving at the identity has the form , and for is
(1.5.113)
which is the permutation matrix
(1.5.114)
Based on the cyclic group nature, the next iteration brings us to the identity element at the point on the unit circle, occurring at the cyclic element for, at . For this example, when , the iteration is located at ,
(1.5.115)
The minimal element chosen for , was which will always have a winding number equal to on the complex unit circle. We saw the reduced form was equal to where the winding number is also equal to Using the non-reduced , we can more readily see that we are working with the cyclic group. Continuing the example, we know that the next permutation is going to be the minimal element permutation, or more succinctly, , which is the permutation
(1.5.116)
There are easier and less expansive ways of proving the previous theorem but by showing the connection the minimal element has with the cyclic groups and primitive root, we can see that they are the same. By defining the cyclic group template in terms of powers of the minimal element, it proves useful to describe a cyclic matrix group
(1.5.117)
In , all entries are in terms of the minimal element, and the exponential terms are related to the denominator value, (or the value) , the winding number and the cyclic distance iteration , away from the identity element in the counterclockwise orientation. This in the cyclic distance relates to our former value of in the numerator. We can also define a template for the clockwise cyclic group
(1.5.118)
with a denominator , winding number and a cyclic distance set , away from the identity element in the clockwise orientation. The utility of these forms for the groups is having a consistent one-column rightward march of the elements for each exponent iteration, meaning that for any winding number , and fraction of as it relates to the group dynamics are consistent with the primitive root element. It should be readily apparent any element choice will iterate times before returning to the identity, Using our initial example , as expected, the following progression holds
(1.5.119)
The cyclic permutation will have entries
(1.5.120)
where , is the winding number, is the cyclic distance in the counterclockwise orientation from the identity , and , as the minimal element. As gets larger, the minimal element gets smaller in arclength and closer to the origin at . Taking the limit of the matrix entries in the group
(1.5.121)
brings us to the origin for and we arrive at the identity based on the winding number .
As a next step, we want to ensure that the function we have been working with can be simplified to a single variable that represents any angular rotation in radians, where the goal is to derive a function , such that
(1.5.122)
Taking the limit as ) approaches zero shows that we can make the substitution for
(1.5.123)
where this represents an infinitesimal change in , which is the derivative, and it will take the same form , since the imaginary coefficient on the left side defines the orthogonal tangent of . So, it can also be said that we have the same orthogonality for , therefore, the substitution is consistent for , and
(1.5.124)
We started this section by talking about smoothness and continuous functions. Subsequently, we have seen that by taking the limit as approaches zero, we obtain an infinitesimal minimal element basis consistent with a function since is smooth and infinitely differentiable.