1. The groups ${T_\tau }$ and ${V_\tau }$

Let $\tau$ be the small golden ratio, namely $\tau =(\sqrt 5-1)/2=0.618\ldots$, which satisfies $1=\tau +\tau ^{2}$. In [Reference Cleary7], Cleary introduced the group ${F_\tau }$, the irrational Thompson group, with breaks in $\mathbb {Z}[\tau ]$ and slopes powers of $\tau$. Given the equality $1=\tau +\tau ^{2}$, we can subdivide an interval of length $\tau ^{n}$ into one of length $\tau ^{n+1}$ and one of length $\tau ^{n+2}$. The group ${F_\tau }$ is the group of piecewise-linear maps on the interval with these breaks and slopes, see [Reference Burillo, Nucinkis and Reeves4] for details.

As is standard in the Thompson family, we construct the irrational slope versions corresponding to the groups $T$ and $V$. For the group ${T_\tau }$, one can consider maps on the circle instead of the interval. The circle will be obtained by identifying the two endpoints of the interval $[0,\,1]$, so we can consider maps of the interval such that the images of 0 and 1 are equal. So the group ${T_\tau }$ is the group of piecewise-linear, orientation-preserving homeomorphisms of the circle such that the breakpoints are in $\mathbb {Z}[\tau ]$ and the slopes of the linear parts are powers of $\tau$. The $V$-version ${V_\tau }$ consists of the left-continuous, piecewise-linear maps of $(0,\,1]$, also with breaks in $\mathbb {Z}[\tau ]$ and slopes that are powers of $\tau$. See [Reference Cannon, Floyd and Parry5] for details of this construction for $V$, which is analogous to this one. See Figure 1 for examples of elements in ${T_\tau }$ and ${V_\tau }$.

Figure 1. Elements in ${T_\tau }$ and ${V_\tau }$, based on the same subdivisions. In the element in ${T_\tau }$ the circles indicate that the first leaf is mapped to the second leaf (and the rest in cyclic order), while for the element in ${V_\tau }$ the numbers indicate the permutation and the way leaves are mapped.

Thompson's group $V$ is also commonly seen as a group of homeomorphisms of the Cantor set; however, this interpretation is not possible here. The fact that we have two types of carets and we have subdivisions which can be obtained in more than one way makes this interpretation unclear. The boundary is not well defined the traditional way, because there are different tree configurations that give the same subdivisions. Hence we will stick with left-continuous maps, but we will favour throughout the paper the expression of the elements in tree-permutation form, as is explained in what follows. Similarly, it is not clear how the arguments used to show that $F$ is a diagram group could be adapted to the irrational slope setting.

It was shown in [Reference Cleary7] that all elements of ${F_\tau }$ can be obtained by pairs of iterated subdivisions of the unit interval as above. When subdividing an interval of length $\tau ^{n}$ into two intervals of lengths $\tau ^{n+1}$ and $\tau ^{n+2},$ we have two options, either put the short interval, or the long interval first. When representing iterated subdivisions of the interval by a tree, we will use two different types of carets. Those we call $x$-carets have a long leg on the left (representing a short first interval) and those we call $y$-carets have their left leg short (representing a long first interval). See [Reference Burillo, Nucinkis and Reeves4] for details for the representation of elements of ${F_\tau }$ by tree-pair diagrams.

We now represent the elements of ${T_\tau }$ and ${V_\tau }$ by the same tree-pair diagrams, but with an added permutation of the leaves of the trees. See [Reference Cannon, Floyd and Parry5] for the analogous description for $T$ and $V$. For the group ${T_\tau }$ these permutations preserve the cyclic order of the leaves, hence giving maps of the circle. For the group ${V_\tau }$ any permutation of the leaves is allowed. These permutations are represented by labels on the leaves indicating the permutation, although the cyclic permutations in ${T_\tau }$ are determined by the image of the first leaf, so we may abbreviate the permutation with just a circle in the image of the first leaf.

The diagrams are usually denoted by $(T_1,\,\pi,\,T_2)$, where $T_1$ and $T_2$ are trees and $\pi$ is the permutation of the leaves.

Results from [Reference Burillo, Nucinkis and Reeves4] can be used to compose elements. The target tree of the first element has to be matched with the source tree of the second element, as is standard in the Thompson family. To do this, one may need to change the type of some carets, but this is independent of the two permutations of the elements and so can be done exactly as in ${F_\tau }$, using Proposition 2.1 and Lemma 2.2 from [Reference Burillo, Nucinkis and Reeves4]. The only difference is that when a caret is added, the counterpart caret added in the other tree has to go into the corresponding leaf determined by the permutation.

A reader familiar with ${F_\tau }$ and with Thompson's groups $T$ and $V$ will have no problem with all these definitions as they are very similar.

Finally, we can use the methods developed in [Reference Burillo, Nucinkis and Reeves4] to construct a particularly appropriate diagram for elements of the groups ${T_\tau }$ and ${V_\tau }$. As ${T_\tau }$ is a subgroup of ${V_\tau }$, the lemma is stated for elements of ${V_\tau }$.

Corollary 1.2 Every element in $v \in {V_\tau }$ has an expression

\[ v = x_0^{a_0}y_0^{\varepsilon_0}\ldots.x_n^{a_n}y_n^{\varepsilon_n}\pi x_m^{{-}b_m}\ldots.x_0^{{-}b_0}, \]

where $a_i,\,b_j,\,n,\,m \in \mathbb {Z}_{\geq 0}$ ($i=0,\,...,\,n$; $j=0,\,...m$), $\pi \in \mathcal {S}_k$ for some $k,$ and $\varepsilon _i \in \{0,\,1\}$.

This expression is called, in short, the $p\pi q^{-1}$ form of an element. The only particularity satisfied by elements of ${T_\tau }$ is that the permutation obtained will be a cyclic permutation $c$ of the leaves, and in this case we call it the $pcq^{-1}$ form, to keep with tradition. The $p\pi q^{-1}$ form can be used to solve the word problem by using the following lemma.

From this lemma, it is straightforward to solve the word problem for the groups ${T_\tau }$ and ${V_\tau }$. Given an element, find its diagram and its $p\pi q^{-1}$ form. If $\pi$ is not the identity, the element is not the identity. And if the permutation is the identity, then the element is actually in ${F_\tau }$, and that word problem was solved in [Reference Burillo, Nucinkis and Reeves4].

Finally, we observe that the method we will follow to obtain presentations for ${T_\tau }$ and ${V_\tau }$ is to see that the $p\pi q^{-1}$ form can be obtained algebraically with the set of generators stated. Hence, we proceed with the details for both groups.

2. A presentation for ${T_\tau }$

2.1. Generators for ${T_\tau }$

As happens with the standard dyadic groups, the only thing one needs to do to obtain generating sets for $T$ is to add cycles. Recall that in ${F_\tau }$ we gave preference to $x$-type carets, where the left leg was long and the right one was short. Generators were constructed with spines made out of $x$-carets. The $y_n$ generators had one $y$-type caret in the only non-spine position. So it only makes sense here to consider cyclic permutations of a spine as generators, following the methods of [Reference Cannon, Floyd and Parry5]. Hence, the generator $c_n$, for $n\ge 1$, will be defined as an element whose two trees are spines with $n+1$ carets, and where the first leaf is mapped to the last leaf. This is an element of order $n+2$ (or one of its divisors), since it is a cycle on its $n+2$ leaves. See Figure 2 for the diagrams of the $c$-generators.

Figure 2. The $c$ generators in ${T_\tau }$.

From here we can already find a set of generators.

Proposition 2.1 The set $\{x_n,\,y_n,\,c_n\mid n\ge 1\}$ is a generating set for the group ${T_\tau }$.

Proof. To see this, one only needs to decompose a tree diagram into three parts: a diagram for a positive element from ${F_\tau }$, a cycle (i.e., a power of a $c_n$) and a negative element of ${F_\tau }$. This can be done easily by introducing two spines in the middle of the diagram. The positive piece is given by the first tree and a spine (with the same number of carets), then a cycle with this same spine (which gives the permutation part of the element), and finally the spine with the target tree. Since the ${F_\tau }$ elements can be generated by the $x_n$ and $y_n$, and the central cycle is a power of a $c_n$, we have a generating set as claimed.

We need to evaluate the interactions of the generators with each other in order to find the needed relations. Clearly, all relations from ${F_\tau }$ are satisfied, so we need to see how the $x_n$ and $y_n$ generators interact with the $c_n$. Observe, to start with, that the generators $x_n$ and $c_n$ by themselves generate a copy of $T$ inside ${T_\tau }$, because all elements have only $x$-type carets and the combinatorics are exactly the same as those in $T$. Hence, the relations on $T$ between $x_n$ and $c_n$ are satisfied the same way. From the simplicity of $T$, we conclude that $T$ embeds in ${T_\tau }$. So we already have the following relations:

1. (1) The relators from ${F_\tau }$:

   1. (1.1) $x_jx_i=x_ix_{j+1}$, if $i< j$.

   2. (1.2) $x_jy_i=y_ix_{j+1}$, if $i< j$.

   3. (1.3) $y_jx_i=x_iy_{j+1}$, if $i< j$.

   4. (1.4) $y_jy_i=y_iy_{j+1}$, if $i< j$.

   5. (1.5) $y_n^{2}=x_nx_{n+1}$.

2. (2) The relations involving the generators $c_n$ and $x_n$, as in $T$:

   1. (2.1) $x_kc_{n+1}=c_{n}x_{k+1}$, if $k< n$.

   2. (2.2) $c_nx_0=c_{n+1}^{2}$.

   3. (2.3) $c_n=x_nc_{n+1}$.

   4. (2.4) $c_n^{n+2}=1$.

We only need to find analogs for the relations (2.1), (2.2) and (2.3) between the $y_n$ and $c_n$ by checking how these generators interact. It is straightforward to check that the relations $y_kc_{n+1}=c_ny_{k+1}$ are satisfied for all $k< n$. Because the $y$-caret does not affect the cycle, the relations work in the exact same way as with the $x$-carets. To find an analog of (2.2) for the $y_n$, we observe that the product $c_ny_0$ acquires a $y$-caret in the last leaf, continuing the spine, and this must be eliminated to rewrite it in terms of the generators. After adding a caret and performing a basic move, we obtain the product $y_{n+1}^{-1}c_{n+1}^{2}$. Finally, since normal forms for the elements of ${F_\tau }$ do not have any appearances of $y_n^{-1}$, a relator analogous to (2.3) will not be needed.

So, to the above families of relators, we can add the following two:

1. (3.1) $y_kc_{n+1}=c_{n}y_{k+1}$, if $k< n$.

2. (3.2) $c_ny_0=y_{n+1}^{-1}c_{n+1}^{2}$.

It is easy to check by direct inspection that these relations are all true in ${T_\tau }$. The goal of the following section will be to prove that this gives a presentation for the group.

2.2. Relators for ${T_\tau }$

The goal of this section is to exhibit a presentation of ${T_\tau }$. The theorem we will prove is the following.

Theorem 2.2 A presentation for the group ${T_\tau }$ is given by the generators $x_n,$ $y_n$ and $c_n,$ for $n\ge 1$ with the following relators:

1. (1) The relators from ${F_\tau }$:

   1. (1.1) $x_jx_i=x_ix_{j+1},$ if $i< j$.

   2. (1.2) $x_jy_i=y_ix_{j+1},$ if $i< j$.

   3. (1.3) $y_jx_i=x_iy_{j+1},$ if $i< j$.

   4. (1.4) $y_jy_i=y_iy_{j+1},$ if $i< j$.

   5. (1.5) $y_n^{2}=x_nx_{n+1}$.

2. (2) The relations involving the generators $c_n$ and $x_n$, same as in $T$:

   1. (2.1) $x_kc_{n+1}=c_{n}x_{k+1},$ if $k< n$.

   2. (2.2) $c_nx_0=c_{n+1}^{2}$.

   3. (2.3) $c_n=x_nc_{n+1}$.

   4. (2.4) The finite order for the $c_n,$ namely, $c_n^{n+2}=1$.

3. (3) The relations involving the generators $c_n$ and $y_n:$

   1. (3.1) $y_kc_{n+1}=c_{n}y_{k+1},$ if $k< n$.

   2. (3.2) $c_ny_0=y_{n+1}^{-1}c_{n+1}^{2}$.

The main tool to prove this theorem is the method to write any element in $pcq^{-1}$ form. This is the algebraic analog of splitting a diagram into three pieces as used at the beginning of the previous section to show that these generators suffice.

Proposition 2.3 Every element of $T_\tau$ can be written in $pcq^{-1}$ form, where $p$ and $q$ are positive elements of ${F_\tau }$ and $c$ is short for $c_n^{m}$ for some $m,\,n$.

Proof. We need the following well-known lemma, which is known to hold in $T$:

Lemma 2.4 Let n be a positive integer, The generators $x_n$ and $c_n$ satisfy the following equalities:

1. (i) $c_n^{m}=x_{n+1-m}c_{n+1}^{m},$ for $m\le n+1$

2. (ii) $c_n^{m}=c_{n+1}^{m+1}x_{m-1}^{-1}$

This is contained in Lemma 5.6 in [Reference Cannon, Floyd and Parry5].

We continue with the proof of our proposition. Given a word in the $x_n,\,y_n,\,c_n$ generators, we want to transform it into $pcq^{-1}$ form. First of all, in this word, between two consecutive $c_n$ generators, there is a word only in $x_n$ and $y_n$, representing an element in ${F_\tau }$. According to [Reference Burillo, Nucinkis and Reeves4], we can put this element of ${F_\tau }$ in seminormal form

\[ x_0^{a_0}y_0^{\epsilon_0}x_1^{a_1}y_1^{\epsilon_1}\dots x_n^{a_n}y_n^{\epsilon_n} x_m^{{-}b_m}x_{m-1}^{{-}b_{m-1}}\dots x_1^{{-}b_1}x_0^{{-}b_0} \]

where $a_i,\,b_i\ge 0$ and $\epsilon _i\in \{0,\,1\}$. The proof of Proposition 2.3 will follow from a repeated application of the following process: transform

\[ c_n^{m} x_0^{a_0}y_0^{\epsilon_0}x_1^{a_1}y_1^{\epsilon_1}\dots x_n^{a_n}y_n^{\epsilon_n} x_m^{{-}b_m}x_{m-1}^{{-}b_{m-1}}\dots x_1^{{-}b_1}x_0^{{-}b_0} c_k^{l} \]

into $w(x_n,\,y_n)c_N^{M}$, where $w(x_n,\,y_n)$ is a word in the $x_n$ and $y_n$ only, and $N,\,M$ are appropriately chosen positive integers. Applying this process repeatedly from left to right will yield the result.

To move the $c_n^{m}$ past the $x_0$ use the standard $T$ relations. Observe that the index of a given $c_n^{m}$ can be raised as much as we need, at the price of adding some instances of $x_n$ to its left (which is fine) by repeated uses of property (i) of Lemma 2.4. To move an element $c_n^{m}$ past $y_0$, we apply:

\[ c_n^{m} y_0=c_n^{m-1} c_n y_0=c_n^{m-1} y_{n+1}^{{-}1} c_{n+1}^{2} \]

after using relation (3.2). To move the $y_{n+1}^{-1}$ to the left past the $c_n^{m-1}$, we will take inverses. If we take inverses directly as $y_{n+1}c_n^{1-m}$, to apply (3.1), we need to have raised the index of $c_n$ beforehand, because on the left-hand side of (3.1) the term $y_kc_{n+1}$ requires that the index of $c$ is at least two higher than that of $y$. Since there are several instances of (3.1) to be taken, and each one increases the index of $y$ by 1, we will need to raise the index several times, using (i) from the lemma. Hence:

\[ \begin{array}{ll} c_n^{m-1} y_{n+1}^{{-}1} & =x_{n-m+2} c_{n+1}^{m-1} y_{n+1}^{{-}1}=x_{n-m+2}x_{n-m+3}c_{n+2}^{m-1}y_{n+1}^{{-}1}\\ & =x_{n-m+2}x_{n-m+3}\ldots x_Nc_N^{m-1}y_{n+1}^{{-}1} \end{array} \]

where $N$ is an index large enough, much larger than $n+1$, to be able to apply the following:

\[ c_N^{m-1}y_{n+1}^{{-}1}=[y_{n+1} c_N^{N-m+3}]^{{-}1} \]

Now use repeated applications of (3.1) to obtain

\[ [y_{n+1} c_N^{N-m+3}]^{{-}1}=[c_{N-1}^{N-m+3} y_{n+N-m+2}]^{{-}1}. \]

This yields the equality

\[ c_n^{m} y_0=x_{n-m+2}\ldots x_N y_{n+N-m+2}^{{-}1} c_{N-1}^{N-m+3} \]

which is what we desired to get the $c_n^{m}$ past the $y_0$.

To get the $c_n^{m}$ past $x_k$, use $T$ again. And to go past $y_k$, note that now we can use relation (3.1) directly. Raise the index of the $c_n^{m}$ if necessary using (i) in the lemma and when the index is high enough, reverse them using (3.1). If the index of $y_k$ becomes zero, use the algorithm above.

Ultimately, this produces an element with a word on $x_n$ and $y_n$, followed by a product $c_n^{m} c_k^{l}$. To transform this into a power of a single $c$-generator, use Lemma 2.4 to raise the smaller index of $n$ and $k$, using (i) if $n$ needs to be raised, and (ii) if $k$ is smaller. The only drawback of doing this that it introduces $x$-generators to the left or right of the pair of $c$-generators, which in fact works well for our purposes. This finishes the process of getting $c_n^{m}$ past an element of ${F_\tau }$ and merging it into the following $c_k^{l}$. Continue this process until only one power of a $c_n$ is left.

This produces an element of the type $pq^{-1}crs^{-1}$, where $p,\,q,\,r,\,s$ are positive words and we can assume (using the properties of ${F_\tau }$) that $q$ and $s$ contain only $x$-generators. To finalize the process, move the word $r$ to the left, using the method above, leaving only negative elements to the right of $c$ giving a word $wcs$ in which $w$ clearly can have negative elements. Put $w$ in ${F_\tau }$-form and use $T$ to move the negative $x$-generators to the right of $c$. This finishes the proof of Proposition 2.3.

This process constructs an easy expression for an element which can be used to solve the word problem and to show that these relators suffice to have a presentation. To prove that the relators in Theorem 2.2 are enough to give a presentation, given a word in the $x_n,\,y_n,\,c_n$ which represents the identity in ${T_\tau }$, rewrite it in $pcq^{-1}$ form. Since the word represents the identity, apply Lemma 1.3 to see that $c$ is actually the identity. This then means that the original element was in ${F_\tau }$ and is thus a product of conjugates of the relators for this group, which are in the presentation as well.

This process finishes the proof of Theorem 2.2.

3. The group ${T_{xz}}$ is simple

The appearance of the relator (1.5), present already in ${F_\tau }$, was the reason for the 2-torsion observed in the abelianization of ${F_\tau }$. Observe that, as happens in ${F_\tau }$, the parity of the $y$-generators is preserved in all relations of ${T_\tau }$ (see Theorem 2.2). This shows that there is a homomorphism from ${T_\tau }$ onto ${\left.{\mathbb {Z}} /{2\mathbb {Z}}\right.}$, which sends $x_n$ and $c_n$ to 0 and $y_n$ to 1.

The group ${T_{xz}}$ is generated by the $x_n$, $c_n$ and by the new generators $z_n=y_{2n}y_{2n+2}$. Hence, the group ${T_\tau }$ has no chance of being simple like $T$, but this kernel is.

Proof. Let $N$ be a normal subgroup of ${T_{xz}}$ and let $a\neq 1$ be an element in $N$. We want to show that $N={T_{xz}}$. Let

\[ \theta:{T_{xz}}\longrightarrow{\left.{{T_{xz}}}/{N}\right.} \]

be the canonical quotient map. Since $a$ is non-trivial, we know it can be written in the form $pcq^{-1}$, and we only need that $p,\,q\in {F_\tau }$. The parity of $y$ is irrelevant for this argument. Since $\theta (a)=1$, we have that $\theta (p^{-1}q)=\theta (c)$, and hence, since $c$ is of finite order, we have that $\theta ((p^{-1}q)^{n})=1$ for some $n$. We now have two possibilities:

1. (1) $p^{-1}q\neq 1$. If this is the case, and since ${F_\tau }$ is torsion-free, we have that $(p^{-1}q)^{n}$ is an element which is in ${F_\tau }$, is not the identity but lies in the kernel of $\theta$.

2. (2) $p^{-1}q=1$. Then $\theta (c)=1$. Suppose $c=c_n^{m}$. Use relation (2.3) to see that $c_n^{m}=c_n^{m-1}x_nc_{n+1}$ and applying relator (2.1) $m-1$ times, we get $c_n^{m}=x_{n-(m-1)}c_{n+1}^{m}$. Hence, since $\theta (c_n^{m})=1$, we have that $\theta (x_{n-(m-1)})=\theta (c_{n+1}^{-m})$. But this means that $\theta (x_{n-(m-1)}^{n+3})=1$, and again we have found a non-trivial element in ${F_\tau }$ and in the kernel of $\theta$.

Restrict $\theta$ to ${F_\tau }$ and recall that a quotient of ${F_\tau }$ is either isomorphic to ${F_\tau }$, or else is abelian. From the two cases above, we deduce that $\theta |_{{F_\tau }}$ is not an isomorphism, so we conclude that $\theta ({F_\tau })$ is an abelian group.

From here we have that the images by $\theta$ of all $x_n$ and $y_n$ commute. As was done in [Reference Cannon, Floyd and Parry5], this means that:

1. (1) From relation (2.1) with $n=2$, $k=1$, namely, $x_1c_3=c_2x_2$, that is, $x_1(x_0^{-2}c_1x_1^{2})=(x_0^{-1}c_1x_1)(x_0^{-1}x_1x_0)$ we deduce that $\theta (x_1)=\theta (x_0)$.

2. (2) From relation (2.3) with $n=1$, namely, $c_1=x_1(x_0^{-1}c_1x_1)$, we deduce that $\theta (x_0)=\theta (x_1)=1$.

3. (3) From relation (2.2) with $n=1$, namely, $c_1x_0=(x_0^{-1}c_1x_1)^{2}$, we deduce that $\theta (c_1)=1$.

Hence $\theta (x_n)=\theta (c_n)=1$ for all $n$. Finally, from relation (3.1), we deduce that $y_ny_{n+1}^{-1}$ also maps to 1, and from here that $\theta (y_iy_j^{-1})=1$ for all $i,\,j$. From relation (3.2) with $n=1$ we deduce that $z_0=y_0y_2$ is also in the kernel, and by induction for any other $z_n$ using $z_{n-1}=y_{2n-2}y_{2n}$ and $y_{2n-2}^{-1}y_{2n+2}$. So $\theta$ is the trivial map and ${T_{xz}}=N$.

4. A presentation for ${V_\tau }$

The construction of a generating set for ${V_\tau }$ is straightforward. Following [Reference Cannon, Floyd and Parry5] and in the same way that we have done for ${T_\tau }$, we need to add a series of generators $\pi _n$, for $n\ge 0$, which introduce noncyclic permutations to the leaves of a spine. The generator $\pi _n$ has $n+2$ $x$-carets, hence it has $n+3$ leaves, and the permutation just transposes leaves $n+1$ and $n+2$. This is analogous to the generators for $V$ in [Reference Cannon, Floyd and Parry5]. See the generators $\pi _n$ in Figure 3. It is clear that the series $x_n$, $y_n$, $c_n$ and $\pi _n$ generate ${V_\tau }$. Observe that we write the element in $p\pi q^{-1}$ form and then the permutation $\pi$ is in some $\mathcal {S}_k$, which is generated by a $k$-cycle and a transposition. We suppose $k\ge 3$, the case $k=2$ being straightforward and is actually in ${T_\tau }$. Then the $k$-cycle is $c_{k-2}$ and the transposition is $\pi _{k-3}$.

Figure 3. The $\pi$ generators in ${V_\tau }$.

Hence, we need to find relations involving these generators. As before, the relations will be obtained by seeing how the generators of different types interact with each other. First of all, from Theorem 2.2, involving $x_n$, $y_n$ and $c_n$, we have all relators from ${T_\tau }$:

1. (1) The relations involving $x_n$ and $y_n$:

   1. (1.1) $x_jx_i=x_ix_{j+1}$, if $i< j$.

   2. (1.2) $x_jy_i=y_ix_{j+1}$, if $i< j$.

   3. (1.3) $y_jx_i=x_iy_{j+1}$, if $i< j$.

   4. (1.4) $y_jy_i=y_iy_{j+1}$, if $i< j$.

   5. (1.5) $y_n^{2}=x_nx_{n+1}$.

2. (2) The relations involving $x_n$ and $c_n$:

   1. (2.1) $x_kc_{n+1}=c_{n}x_{k+1}$, if $k< n$.

   2. (2.2) $c_nx_0=c_{n+1}^{2}$.

   3. (2.3) $c_n=x_nc_{n+1}$.

   4. (2.4) $c_n^{n+2}=1$.

3. (3) The relations involving $c_n$ and $y_n$:

   1. (3.1) $y_kc_{n+1}=c_{n}y_{k+1}$, if $k< n$.

   2. (3.2) $c_ny_0=y_{n+1}^{-1}c_{n+1}^{2}$.

Observe that the combinatorics involving $x_n$, $c_n$ and $\pi _n$ are exactly the same as in $V$, the only difference is that a binary caret is replaced by an $x$-caret; however, the methods are exactly the same. Hence, we have all relators from $V$ (as before when we had all relators for $T$ in ${T_\tau }$).

1. (4) The relations involving $x_n$ and $\pi _n$:

   1. (4.1) $\pi _i x_j = x_j\pi _i$ if $j \geq i+2.$

   2. (4.2) $\pi _i x_{i+1} = x_i\pi _{i+1}\pi _i.$

   3. (4.3) $\pi _i x_i = x_{i+1}\pi _i\pi _{i+1}.$

   4. (4.4) $\pi _i x_j = x_j \pi _{i+1}$ if $0 \leq j < i.$

   5. (4.5) $\pi _i^{2} =1.$

   6. (4.6) $(\pi _{i+1}\pi _i)^{3} =1.$

   7. (4.7) $\pi _i\pi _j=\pi _j\pi _i$ if $j \geq i+2.$

2. (5) The relations involving $c_n$ and $\pi _n$:

   1. (5.1) $c_n\pi _k = \pi _{k-1}c_n.$

   2. (5.2) $c_n\pi _0 = \pi _0 \cdots \pi _{n-1}c_n^{2}.$

   3. (5.3) $c_n^{2}\pi _0 = \pi _{n-1}\cdots \pi _0 c_n.$

   4. (5.4) $c_n^{3}\pi _0 = \pi _{n-1}c_n^{3}.$

As was the case in ${T_\tau }$, the only relators we need to add are those which involve $y_n$ and $\pi _n$. But the case here differs from what we have found in ${T_\tau }$, because the transposition in $\pi _n$ never involves the last leaf of the caret. In ${T_\tau }$ when we combined $y_n$ with $c_n$, there were some cases where the $y$-caret ends up being on the spine, the last caret of the tree, and since we are taking the spine with only $x$-carets, another $y$-caret had to be added to switch. This is the reason why relations (3.1) and (3.2) have an extra $y$-generator than their counterparts with $x_n$, which are (2.1) and (2.2). But this does not happen here, the relations involving $y_n$ and $\pi _n$ look exactly the same as for $x_n$, so they are the same as (4.1)–(4.4) with $x$ replaced by $y$.

1. (6) The relations involving $y_n$ and $\pi _n$:

   1. (6.1) $\pi _i y_j = y_j\pi _i$ if $j \geq i+2.$

   2. (6.2) $\pi _i y_{i+1} = y_i\pi _{i+1}\pi _i.$

   3. (6.3) $\pi _i y_i = y_{i+1}\pi _i\pi _{i+1}.$

   4. (6.4) $\pi _i y_j = y_j \pi _{i+1}$ if $0 \leq j < i.$

It is for this reason that the proof of the fact that these are all the relations we need is straightforward. For the interactions between $x_n$, $y_n$ and $c_n$ we already have the $\pi _n$-relators, and the way the $\pi _n$ interact with the other three series of generators is exactly the same as in $V$. Hence, all results for $V$ in [Reference Cannon, Floyd and Parry5] apply here, and clearly an element can be put into $p\pi q^{-1}$ form using all these relations. Once it is in this form, if it was the identity, it is in ${F_\tau }$ and it is, therefore, a product of the relators (1.1)–(1.5). This finishes the construction of the presentation for ${V_\tau }$.

5. The group $V_{xz}$ is simple

Inspecting the presentation for ${V_\tau }$ we observe the same phenomenon as in ${F_\tau }$ and ${T_\tau }$, namely, that the $y$-generators only appear in the relators an even number of times. Hence there is a well-defined epimorphism

\[ \varphi: {V_\tau} \longrightarrow {\left.{\mathbb{Z}}/{2\mathbb{Z}}\right.}, \]

given by $\varphi (x_n)=\varphi (c_n)=\varphi (\pi _n)=0,$ and $\varphi (y_n)=1$. The kernel of this epimorphism is generated by those elements in ${V_\tau }$ where $y$-generators appear an even number of times.

In particular, ${V_\tau }$ is not simple. We will consider the kernel of the homomorphism $\varphi$:

Definition 5.1 We denote by ${V_{xz}}$ the kernel of the map

\[ \varphi: {V_\tau} \longrightarrow {\left.{\mathbb{Z}}/{2\mathbb{Z}}\right.}. \]

Here we follow an argument described by Brin in [Reference Brin1], and attributed to M. Rubin.

Proof. Let $v \in {V_{xz}}$. Then, by Lemma 1.1 and the parity of $y$, it can be represented by a triple $(T,\,\pi,\,S)$ such that: $T$ and $S$ have $k$ leaves, $S$ has no $y$-carets, there are an even number of $y$-carets in $T$ all with no left children, and $\pi \in \mathcal {S}_k$.

To begin the process, we need an exposed $y$-caret in the tree $T$, that is, a $y$-caret with no children. Observe that we only know that the $y$-carets have no left children, but they could have right ones. Take any $y$-caret in $T$ and make it exposed in the following way. See Figure 4 for reference. Add two $x$-carets to its left leaf (and the corresponding ones in $S$). Perform a basic move on these two $x$-carets to transform them to $y$-carets, which produces three consecutive $y$-carets. Now switch the two top carets back to $x$-type, again using a basic move. This makes the bottom $y$-caret exposed. The number of $y$-carets has not changed. Note that this process is the reverse of a hidden cancellation described in [Reference Burillo, Nucinkis and Reeves4, Section 6].

Figure 4. The process of creating an exposed $y$-caret in the proof of Lemma 5.3. The black box indicates that a subtree is present in that leaf.

Now we have ensured that in $T$, there is at least one exposed caret. Pick a pair of $y$-carets $c_1$ and $c_2$ in $T$ and assume $c_1$ is exposed. Then add a $y$-caret to the left leaf of $c_2$; this means that we have to add a $y$-caret $d_1$ to the corresponding leaf in $S$. Switch $c_2$ and the recently added caret to type $x$ using a basic move. We have now a representation of $v$ by a triple $(T',\, \pi ',\, S'),$ where $T'$ and $S'$ are now trees with $k+1$ carets, and $\pi ' \in \mathcal {S}_{k+1},$ and the carets $c_1$ and $d_1$ are both exposed, one in each tree.

We now precompose with a permutation $\sigma$ of the leaves of $T',$ so that $c_1$ in the left-most tree has the same labelling as $d_1$ in $S'$. We now have obtained an element $v_1=\sigma v$ represented by

\[ (T',\sigma, T')(T', \pi' , S'), \]

where the $y$-carets $c_1$ and $d_1$ map to each other, so they have become redundant and can be removed. Hence $v_1$ is now represented by a triple as above with $k+2$ leaves, but with two fewer $y$-carets.

We repeat this process until we have $u = \rho v,$ where $\rho$ is a product of permutations and $u$ is an element represented by a tree-pair with only $x$-carets.

We can now follow the procedure set out by Brin as if we were in $V$: find a pair of exposed carets, one in each tree, premultiply with a permutation making this pair of carets redundant, then remove the carets to obtain an element represented by a tree with fewer carets. Then continue this process until no tree is left. Our original element is now a product of permutations.

This sequence of results, 5.3 through to 5.7, now yield Theorem 5.2.

6. A $V$-type Thompson's group with a normal subgroup of index $4$

As mentioned above, Higman [Reference Higman9] showed that some of the $V$-type groups have index-$2$ normal subgroups. This, however, occurs only when the $n$-ary carets in the trees representing the elements have $n$ odd. Hence, this is a very different phenomenon than the one we observe for ${V_\tau }$. Let $\beta = \sqrt 2-1,$ the positive root of $X^{2}+2X-1$. In [Reference Cleary6], Cleary also showed that the group $G(I,\, \mathbb {Z}[\beta ],\, \langle \beta \rangle ) = {F_\beta }$ can be seen as a group of rearrangements of $\beta$-regular subdivisions of the unit interval. In his thesis, J. Brown [Reference Brown2], shows that elements of ${F_\beta }$ can also be represented by tree-pair diagrams, this time having three caret-types with three legs each, see Figure 5.

Figure 5. The three different caret types in $V_\beta$.

He also produced an infinite presentation involving $x$-carets and $y$-carets only:

Proposition 6.1 Brown [Reference Brown2, 6.1.1.]

A presentation for ${F_\beta }$ is:

\[ \left< x_n,y_n,\text{ for }n\ge 0\,\middle|\, \begin{array} l a_ib_j = b_ja_{i+2},\text{ for all } i>j, \text{ and } a,b \in \{x,y\},\\ y_k^{2} = x_kx_{k+1},\text{ for }k \geq 0 \end{array} \right>. \]

The generators are represented by the following tree-pairs $(T_{a_i},\, S_k),$ where $T_{a_i}$ are as in Figure 6 ($a \in \{x,\,y\}$), and $S_k$ is a spine with $\lfloor \frac {i}{2}\rfloor +2$ $x$-carets.

Figure 6. The left-hand trees for the generators. Top left $T_{x_{2i}}$, top right $T_{x_{2i+1}}$, bottom left $T_{y_{2i}}$, bottom right $T_{y_{2i+1}}$.

Analogously to ${V_\tau }$, we can now define the group ${V_\beta },$ whose elements are represented by triples $(T,\, \pi,\, S)$, where $T$ and $S$ are trees with the same number of leaves, and $\pi$ is a permutation of leaves. We now follow the arguments of § 5.

Lemma 6.3 There is a well-defined surjective homomorphism

\[ \varphi: {V_\beta} \longrightarrow {\left.{\mathbb{Z}}/{2\mathbb{Z}}\right.} \]

given by $\varphi (x_i) = \varphi (\sigma ) =0$ and $\varphi (y_i)=1$ ($i \geq 0$), where $\sigma$ is a permutation of leaves.

Analogously to Higman's original argument [Reference Higman9, Section 5], we can also find a subgroup of index-$2$ in ${V_\beta }$ given by the sign of the permutation in $(T,\, \pi,\, S)$. This sign is unchanged by the expansion of the trees, see [Reference Higman9, Section 5], and also by the relations between the different carets, which follows from the fact that the relations do not change the order of the leaves, see Figure 7.

Lemma 6.4 There is a well-defined subgroup ${V_\beta }^{+}$ of index $2$ in ${V_\beta }$ given by the elements of even parity. Hence there is a canonical projection:

\[ \rho: {V_\beta} \longrightarrow {\left.{{V_\beta}}/{{V_\beta}^{+}}\right.} \cong {\left.{\mathbb{Z}}/{2\mathbb{Z}}\right.}. \]

Figure 7. The order of leaves does not change when we perform a basic move replacing two carets by another two giving the same subdivision.

The kernel $K$ of this map is the subgroup given by all even elements, which have an even number of $y_i$ in each expression $v = p\sigma q^{-1}$ where $p$ and $q$ are words in positive powers of $x_i$ and $y_i$ ($i \geq 0$). We suspect that $K$ is simple, but the methods above for ${V_\tau }$ do not work, and one would have to follow Higman's original proof of the simplicity of $G_{n,r}^{+}$. This is the subject of N. Winstone's thesis [Reference Winstone13], where Thompson groups for more general algebraic numbers are considered.