2.4. Analog of
In the two-rope scenario, it turned out that all the actions lay within since all entries of T and S were integers. We can easily see that such argument fails in our three-rope case, because the entries of our matrix for T are not all integers. This implies that we cannot simply use as the analog to
Hoping to at least preserve a similar structure as we tried to see if a group of the form for some real would work. Based on the entries of our T, we would need
We claim that if we let where is the 60th root of unity, the above condition is satisfied. To show this, first note that and are the real and imaginary parts of the 30th root of unity, respectively, so we can write and
From "On the Ring of Integers of Real Cyclotomic Fields",
3 we know that
is the ring of integers of the
nth real cyclotomic field, i.e. if a real number
r can be expressed using only powers of
and constants, then
We know that
and
are real numbers. Furthermore,
and
so both
and
can be expressed using powers of
Therefore,
as desired. Hence, our desired analog of
is
2.5. Showing Isomorphism
We want to show there is an isomorphism between
and our presentation
We can do this with a theorem from Jean-Pierre Serre’s “Trees,”
4 which states the following:
Theorem 1. Let G be a group acting on a graph Γ. Let T a segment in Γ be a fundamental domain for Γ mod G. Let P, Q be the vertices of T and be the geometric edge of T. Let , and = be the stabilizers of P, Q and y respectively. Then the following are equivalent:
Γ is a tree
The canonical homomorphism is an isomorphism.
Hence, if we can find a fundamental domain constructed by two points whose stabilizers are the powers of
S and
respectively and show that
acts on the tree with this fundamental domain, then we have shown our desired isomorphism. We first need to find the two points stabilized by powers of
S and
Let the point stabilized by powers of
S be
and the point stabilized by powers of
be
For
U, we have
This gives us the equations
and
which simplifies to
We only care about the ratio of the coordinates, so we can let
, meaning that the point stabilized by
S is
It’s easy to verify that U is indeed stabilized by However, we need to show that these are the only matrices in that stabilize U.
Suppose that
stabilizes
U, i.e.
where
is an eigenvalue of
M. Since
we have
so
is a 6th root of unity. Furthermore,
must be real because the entries of
M are all real, so
WLOG, suppose
so
Now, consider the following theorem:
Theorem 2. If a matrix M satisfies and , i.e. M is a stabilizer of , then M rotates the plane perpendicular to by some multiple of
The proof of this theorem uses the fact that any vector parallel to the axis of rotation is unaffected by the rotation. So, assuming that
the only way for
M to keep
unchanged is if
is parallel to the axis of rotation, or it is perpendicular to the plane rotated by
M. Furthermore, because
the plane needs to be returned to its original state after
n applications of
M, so the only possible angles that the plane can be rotated by under
M are multiples of
In our case,
and
, so any stabilizer of
U rotates the plane perpendicular to
by some multiple of
There are only 6 multiples of
, so there are only 6 possible
M that stabilize
U. However, we already know that the six powers of
S stabilize
U, so
must be the only stabilizers of
U. (The same reasoning applies if we had
instead of
For
W, we have
This gives us the equations
The last equation is redundant, but the first two give us
and
So, suppose we let
Now, we want to show that the powers of
i.e.
, are the only stabilizers of
W. Using Theorem 2.2, we know that any matrix satisfying
and
rotates the plane perpendicular to
by some multiple of
There are only 30 multiples of
, so
W only has 30 stabilizers. Since we know all 30 powers of
stabilize
W, this implies that they are the only stabilizers of
W. With this, we have shown that the edge connecting
U and
W, call it
L, is indeed a fundamental domain with the desired properties.
From Theorem , we can prove the isomorphism if we show that the graph generated by the matrices in on L is a tree. (A tree is a connected graph without cycles.) We want to show that the graph generated by applying combinations of S and to L is a tree by using the following conjecture: the identity can only be constructed with combinations of and This remark is useful because a cycle in the graph only exists when there exists some non-trivial combination of S and that evaluates to the identity.
For the sake of clarity, we denote
as
N. Consider the basic strings consisting of
S and
N: (Note that we only consider powers of
S up to 5 and powers of
N up to 29, as
)
Because
we consider only the strings with even powers of
S, since those with odd powers of
S can be rewritten as -1 times an even power of
S. Observe that left-multiplying by powers of
S effectively cycles the rows of
, whereas right-multiplying by
S cycles the columns. This means that for any string of the form
, we can always find some power of
S, say
n, such that
reduces to the form of one of the three rotation matrices in 3D space below:
In particular, and Recall that and 2 and 4 are inverses in so we can generalize that Therefore, where R is one of the rotation matrices.
Now, we claim that all possible strings of S and N can be reduced down to a product of rotation matrices and some power of S. First note that any string of S and N must alternate between powers of S and N, i.e. be in the form or , because if we have two adjacent powers of S or powers of N, we can always combine them and simplify using
Suppose we have the string . Consider the substring From our observation above with rotation matrices, we can replace this substring with where is one of the three rotation matrices. Then, our string can be rewritten as Now, we do the same thing with the substring , and if we keep repeating the same process until we reach the end of the string, we end up with a product of rotation matrices with some leftover power of S at the end, i.e. something of the form . Our next step is to show that it’s not possible for to be a power of S. To do this, we claim that it’s not possible to have two adjacent rotation matrices to be the same. Consider the substring From our previous observation, In order for the next substring to give us the same rotation matrix, would have to be zero, which would mean our original string was not simplified. Thus, because no two adjacent rotation matrices can be the same, and matrix multiplication is not commutative for rotation matrices around different axes, it’s not possible for to simplify down to something that equals the identity when raised to a certain power. Hence, we have shown that the only strings formed by S and that can give us the identity are the ones consisting of some combination of and This implies that our graph is indeed a tree, so by Theorem 2.1, we have our desired isomorphism.