Unofficial archive — problems, solutions & results © IMC, reproduced with permission.

IMC / 1996 / Problems / Day 2, P9

IMC 1996 · Day 2 · P9

Let GG be the subgroup of GL2(R)GL_2(\mathbb{R}), generated by AA and BB, where A=[2001],B=[1101].A = \begin{bmatrix} 2 & 0 \\ 0 & 1 \end{bmatrix}, \qquad B = \begin{bmatrix} 1 & 1 \\ 0 & 1 \end{bmatrix}. Let HH consist of those matrices (a11a12a21a22)\begin{pmatrix} a_{11} & a_{12} \\ a_{21} & a_{22} \end{pmatrix} in GG for which a11=a22=1a_{11} = a_{22} = 1.

(a) Show that HH is an abelian subgroup of GG.

(b) Show that HH is not finitely generated.

Remarks. GL2(R)GL_2(\mathbb{R}) denotes, as usual, the group (under matrix multiplication) of all 2×22 \times 2 invertible matrices with real entries (elements). Abelian means commutative. A group is finitely generated if there are a finite number of elements of the group such that every other element of the group can be obtained from these elements using the group operation.

Solution (official)

(a) All of the matrices in GG are of the form [0].\begin{bmatrix} * & * \\ 0 & * \end{bmatrix}. So all of the matrices in HH are of the form M(x)=[1x01],M(x) = \begin{bmatrix} 1 & x \\ 0 & 1 \end{bmatrix}, so they commute. Since M(x)1=M(x)M(x)^{-1} = M(-x), HH is a subgroup of GG.

(b) A generator of HH can only be of the form M(x)M(x), where xx is a binary rational, i.e., x=p2nx = \dfrac{p}{2^n} with integer pp and non-negative integer nn. In HH it holds M(x)M(y)=M(x+y)M(x)M(y)1=M(xy).\begin{align*} M(x) M(y) &= M(x + y) \\ M(x) M(y)^{-1} &= M(x - y). \end{align*} The matrices of the form M(12n)M \left( \dfrac{1}{2^n} \right) are in HH for all nNn \in \mathbb{N}. With only finite number of generators all of them cannot be achieved.

Similar problems