Problems

Filters
Clear Filters

7 problems found

1999 Paper 3 Q7
D: 1680.5 B: 1516.0

Let \(a\) be a non-zero real number and define a binary operation on the set of real numbers by $$ x*y = x+y+axy \,. $$ Show that the operation \(*\) is associative. Show that \((G,*)\) is a group, where \(G\) is the set of all real numbers except for one number which you should identify. Find a subgroup of \((G,*)\) which has exactly 2 elements.


Solution: Claim: \(*\) is associative. Proof: Then \(x*(y*z) = x*(y+z+ayz) = x + (y+z+ayz) + ax(y+z+ayz) = x + y + z + a(yz + xy + zx) + a^2xyz\) and \((x*y)*z = (x+y+axy)*z = (x+y+axy) + z+ a(x+y+axy)z = x + y + z + a(yz + xy + zx) + a^2xyz\) so \(x*(y*z) = (x*y)*z\) and we are done. Let \(G = \mathbb{R} \setminus \{-\frac1{a} \}\) In order to show that \((G, *)\) is a group we need to check:

  1. closure \(x*y = x + y + axy\) is a real number
  2. associativity we have already checked
  3. identity \(x*0 = x + 0 + 0 = x = 0*x\), so \(0\) is an identity
  4. inverses \(x*\left ( \frac{-x}{1+ax} \right ) = x - \frac{x}{1+ax} + ax \frac{-x}{1+ax} = \frac{x +ax^2 - x - ax^2}{1+ax} = 0\) so \(x\) has an identity, assuming \(1+ax \neq 0\) which is true for everything in our set
Consider the set \(\{0, \frac{-2}{a} \}\). Then \(\frac{-2}{a} * \frac{-2}{a} = \frac{-4}{a} + a \frac{4}{a^2} = 0\), so this is a group of order \(2\)

1996 Paper 3 Q6
D: 1674.0 B: 1529.9

  1. Let \(S\) be the set of matrices of the form \[ \begin{pmatrix}a & a\\ a & a \end{pmatrix}, \] where \(a\) is any real non-zero number. Show that \(S\) is closed under matrix multiplication and, further, that \(S\) is a group under matrix multiplication.
  2. Let \(G\) be a set of \(n\times n\) matrices which is a group under matrix multiplication, with identity element \(\mathbf{E}.\) By considering equations of the form \(\mathbf{BC=D}\) for suitable elements \(\mathbf{B},\) \(\mathbf{C}\) and \(\mathbf{D}\) of \(G\), show that if a given element \(\mathbf{A}\) of \(G\) is a singular matrix (i.e. \(\det\mathbf{A}=0\)), then all elements of \(G\) are singular. Give, with justification, an example of such a group of singular matrices in the case \(n=3.\)


Solution:

  1. Let $\mathbf{A} = \begin{pmatrix}1 & 1\\ 1 & 1 \end{pmatrix}\(, then we need to show that \)(a\mathbf{A})(b\mathbf{A})\( is of the form \)cA\( where \)a, b, c \neq 0$. Since $\mathbf{A}^2 = \begin{pmatrix}2 & 2\\ 2 & 2 \end{pmatrix} = 2\mathbf{A}\( this is certainly the case, since \)(a\mathbf{A})(b\mathbf{A}) = 2ab\mathbf{A}$. To check that we have a group be need to check:
    • Closure (done)
    • Associativity (inherited from matrix multiplication)
    • Identity (\(\frac12 \mathbf{A}\))
    • Inverses the inverse of \(a\mathbf{A}\) is \(\frac{1}{4a}\mathbf{A}\)
  2. Suppose \(\mathbf{A}\) is singular (ie \(\det\mathbf{A}=0\)), then \(\mathbf{AA^{-1}B=B}\) (where inverse is the group inverse rather than the matrix inverse) for any matrix \(\mathbf{B}\). Taking determinants we have: \(\det(\mathbf{AA^{-1}B}) = \det(B) \Rightarrow \det(A) \det(A^{-1}B) = \det(B) \Rightarrow 0 = \det(B)\), ie all matrices are singular. Consider the set of non-zero multiples of \(\begin{pmatrix} 1 & 1 & 1 \\ 1 & 1 & 1 \\ 1 & 1 & 1 \end{pmatrix}\), then the same logic as part (i) will suffice

1995 Paper 3 Q7
D: 1654.7 B: 1516.0

Consider the following sets with the usual definition of multiplication appropriate to each. In each case you may assume that the multiplication is associative. In each case state, giving adequate reasons, whether or not the set is a group.

  1. the complex numbers of unit modulus;
  2. the integers modulo 4;
  3. the matrices \[ \mathrm{M}(\theta)=\begin{pmatrix}\cos\theta & -\sin\theta\\ \sin\theta & \cos\theta \end{pmatrix}, \] where \(0\leqslant\theta<2\pi\);
  4. the integers \(1,3,5,7\) modulo 8;
  5. the \(2\times2\) matrices all of whose entries are integers;
  6. the integers \(1,2,3,4\) modulo 5.
In the case of each pair of groups above state, with reasons, whether or not they are isomorphic.


Solution:

  1. \(\{ z \in \mathbb{C} : |z| = 1\}\) is a group.
    1. (Closure) \(|z_1z_2| = |z_1||z_2| = 1\). Set is closed under multiplication
    2. (Associativity) Multiplication of complex numbers is associative
    3. (Identity) \(|1| = 1\)
    4. (Inverses) \(| \frac{1}{z} | = \frac{1}{|z|} = \frac{1}{1} = 1\), the set contains inverses
  2. the integers \(\pmod{4}\) are not a group under multiplication, \(2\) has no inverse, since \(0 \times k \equiv 0 \pmod{4}\)
  3. The set of rotation matrices is a group:
    1. (Closure) \begin{align*} \begin{pmatrix}\cos\theta_1 & -\sin\theta_1\\ \sin\theta_1 & \cos\theta_1 \end{pmatrix} \begin{pmatrix}\cos\theta_2 & -\sin\theta_2\\ \sin\theta_2 & \cos\theta_2 \end{pmatrix} &= {\scriptscriptstyle\begin{pmatrix}\cos\theta_1 \cos \theta_2 - \sin \theta_1\sin \theta_2 & -\sin\theta_1\ \cos \theta_1 - \sin \theta_2\cos\theta_1\\ \sin\theta_1\ \cos \theta_1 + \sin \theta_2\cos\theta_1 & \cos\theta_1 \cos \theta_2 - \sin \theta_1\sin \theta_2 \end{pmatrix}} \\ &= \begin{pmatrix}\cos(\theta_1+\theta_2) & -\sin(\theta_1+\theta_2)\\ \sin(\theta_1+\theta_2) & \cos(\theta_1+\theta_2) \end{pmatrix} \end{align*} Since \(\cos, \sin\) are periodic with period \(2\pi\), we can find \(\theta_3 = \theta_1 + \theta_2 + 2k\pi\) such that \(0 \leq \theta_3 < 2 \pi\), so our set is closed
    2. (Associativity) Matrix multiplication is associative
    3. (Identity) Consider \(\theta = 0\)
    4. (Inverses) Consider \(2\pi - \theta\)
  4. \(\{1, 3, 5, 7\} \pmod{8}\) is a group:
    1357
    11357
    33175
    55713
    77531
    1. (Closure) See Cayley table
    2. (Associativity) Integer multiplication is associative
    3. (Identity) \(1\)
    4. (Inverses) \(x \mapsto x\) (See Cayley table)
  5. \(2\times2\) matrices are not a group, consider $0 = \begin{pmatrix} 0 & 0 \\ 0 & 0 \end{pmatrix}\(, then \)\mathbf{0}\mathbf{M} = \mathbf{0}$ for all other matrices.
  6. 1234
    11234
    22413
    33142
    44321
    1. (Closure) See Cayley table
    2. (Associativity) Integer multiplication is associative
    3. (Identity) \(1\)
    4. (Inverses) \(1 \mapsto 1, 2 \mapsto 3, 3 \mapsto 2, 4 \mapsto 4\) (See Cayley table)
(i)(iii)(iv)(vi)
(i)\(\checkmark\)\(\checkmark\) consider \(z \mapsto \begin{pmatrix} \cos \arg (z)- \sin \arg(z)
\sin \arg(z)\cos \arg(z) \end{pmatrix}\)not finitenot finite
(iii)\(\checkmark\)not finitenot finite
(iv)\(\checkmark\)no element order \(4\)
(vi)\(\checkmark\)

1992 Paper 2 Q5
D: 1577.1 B: 1470.1

Explain what is meant by the order of an element \(g\) of a group \(G\). The set \(S\) consists of all \(2\times2\) matrices whose determinant is \(1\). Find the inverse of the element \(\mathbf{A}\) of \(S\), where \[ \mathbf{A}=\begin{pmatrix}w & x\\ y & z \end{pmatrix}. \] Show that \(S\) is a group under matrix multiplication (you may assume that matrix multiplication is associative). For which elements \(\mathbf{A}\) is \(\mathbf{A}^{-1}=\mathbf{A}\)? Which element or elements have order 2? Show that the element \(\mathbf{A}\) of \(S\) has order 3 if, and only if, \(w+z+1=0.\) Write down one such element.


Solution: The order of an element \(g\) is the smallest positive number \(k\) such that \(g^k = e\). $\mathbf{A}^{-1} = \begin{pmatrix}z & -x\\ -y & w \end{pmatrix}$. Claim, \(S\) is a group. \begin{enumerate} \item (Closure) The product of two \(2\times2\) matrices is always a \(2\times 2\) matrix so we only need to check the determinant. Suppose \(\det(\mathbf{A}) = \det (\mathbf{B}) = 1\), then \(\det(AB) = \det(A)\det(B) = 1\), so our operation is closed \item (Associativity) Inherited from matrix multiplication \item (Identity) $\mathbf{I} =\begin{pmatrix}1 & 0\\ 1 & 1 \end{pmatrix}\( has determinant \)1$. \item (Inverses) The inverse is always fine since the matrix of cofactors always contains integers and the determinant is one, so we never end up with anything which isn't an integer. \end{itemize} If \(\mathbf{A}^-1 = \mathbf{A}\) then assuming $\mathbf{A} = \begin{pmatrix}a & b\\ c & d \end{pmatrix}\( then \)\mathbf{A}^{-1} = \begin{pmatrix}d & - b\\ -c & a \end{pmatrix}\( so we must have \)a=d, -b=b, -c=c\(, so \)b = c = 0\( and \)a = d\(. For the determinant to be \)1\( we must have \)ad = a^2 = 1\(, ie \)a = \pm 1\(. Therefore we must have \)\mathbf{A} = \begin{pmatrix}1 & 0\\ 0 & 1 \end{pmatrix}\( or \)\mathbf{A} = \begin{pmatrix}-1 & 0\\ 0 & -1 \end{pmatrix}$. For an element to have order \(2\) then \(\mathbf{A}^2 = \mathbf{I}\) ie, \(\mathbf{A} = \mathbf{A}^{-1}\) and \(\mathbf{A} \neq \mathbf{I}\) therefore the only element of order \(2\) is $\begin{pmatrix}-1 & 0\\ 0 & -1 \end{pmatrix}$. For an element to have order \(3\) we must have \(\mathbf{A}^2 = \mathbf{A}^{-1}\), ie $\begin{pmatrix}w^2 + xy & x(w+z)\\ y(w+z) & z^2 + xy \end{pmatrix} = \begin{pmatrix}z & -x\\ -y & w \end{pmatrix}$. Therefore \(w^2 + xy = z, x(w+z) = -x, y(w+z) = -y, z^2+xy = w\). The second and third equations are satisfied iff \(w+z+1 = 0\) or \(x = 0\) and \(y = 0\), but if \(x = 0\) and \(y = 0\) then we aren't order \(3\), so we just need to check this is sufficient for the first and last equations. Since \(\det(\mathbf{A}) = 1\) we have \(wz =xy +1\), so the first and last equations are equivalent to \(w^2 + wz - 1 = z\) and \(x^2 + wz-1 = w\) which are equivalent to \(w(w+z) = z+1\) or \(w + z+ 1 = 0\) as required

1991 Paper 2 Q9
D: 1616.2 B: 1500.0

Let \(G\) be the set of all matrices of the form \[ \begin{pmatrix}a & b\\ 0 & c \end{pmatrix}, \] where \(a,b\) and \(c\) are integers modulo 5, and \(a\neq0\neq c\). Show that \(G\) forms a group under matrix multiplication (which may be assumed to be associative). What is the order of \(G\)? Determine whether or not \(G\) is commutative. Determine whether or not the set consisting of all elements in \(G\) of order \(1\) or \(2\) is a subgroup of \(G\).


Solution: Claim \(G\) is a group under matrix multiplication

  • (Closure) Suppose \(\mathbf{A}\) and \(\mathbf{B}\) are matrices of that form, then \(\begin{pmatrix} a_1 & b_1 \\ 0 & c_1 \end{pmatrix} \begin{pmatrix} a_2 & b_2 \\ 0 & c_2 \end{pmatrix} = \begin{pmatrix} a_1a_2 & a_1b_2 + b_1c_2 \\ 0 & c_1c_2 \end{pmatrix}\), this is clearly of the required form since if \(a_1, a_2, c_1, c_2 \neq 0\) then \(a_1a_2, c_1c_2 \neq 0\)
  • (Associative) By inheritance from matrix multiplication
  • (Identity) Consider \(\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}\) also clearly of the required form.
  • (Inverse) Consider \((ac)^{-1}\begin{pmatrix} c & -b \\ 0 & a \end{pmatrix}\), since \(ac \neq 0\) we can assume it has an inverse mod \(5\). therefore we have another matrix of the required form.
There are \(4\) possible values for \(a\) and \(c\) and \(5\) possible values for \(b\), so \(4 \times 4 \times 5 = 80\) elements, so the group is order \(80\). \(G\) is not commutative, consider \(\begin{pmatrix} 1 & 1 \\ 0 & 2 \end{pmatrix} \begin{pmatrix} 1 & 1\\ 0 & 1 \end{pmatrix} = \begin{pmatrix} 1 & 2 \\ 0 & 2 \end{pmatrix}\) \(\begin{pmatrix} 1 & 1 \\ 0 & 1 \end{pmatrix} \begin{pmatrix} 1 & 1 \\ 0 & 2 \end{pmatrix} = \begin{pmatrix} 1 & 3 \\ 0 & 2 \end{pmatrix}\) The elements of order \(1\) or \(2\) satisfy \(\begin{pmatrix} a & b \\ 0 & c \end{pmatrix} = \begin{pmatrix} a^{-1} & -ba^{-1}c^{-1} \\ 0 & c^{-1} \end{pmatrix}\) Therefore \(a^2 = 1, c^2 = 1 \Rightarrow a, c = 1, 4\) and \(b = -ba^{-1}c^{-1} \Rightarrow b = 0\) or , \(ac = -1\), so we have \((a,b,c) = (1,0,1), (4,0,4), (1, *, 4), (4, *, 1)\) So there are \(12\) elements of order \(1\) or \(2\). But this can't be a subgroup since \(12 \not \mid 80\)

1987 Paper 2 Q10
D: 1500.0 B: 1500.0

The set \(S\) consists of \(N(>2)\) elements \(a_{1},a_{2},\ldots,a_{N}.\) \(S\) is acted upon by a binary operation \(\circ,\) defined by \[ a_{j}\circ a_{k}=a_{m}, \] where \(m\) is equal to the greater of \(j\) and \(k\). Determine, giving reasons, which of the four group axioms hold for \(S\) under \(\circ,\) and which do not. Determine also, giving reasons, which of the group axioms hold for \(S\) under \(*\), where \(*\) is defined by \[ a_{j}*a_{k}=a_{n}, \] where \(n=\left|j-k\right|+1\).


Solution:

  1. (Closure) This operation is clearly closed by construction
  2. (Associative) \(a_j \circ (a_k \circ a_l) = a_j \circ a_{\max(k,l)} = a_{\max(j,k,l)} = a_{\max(j,k)} \circ a_l = (a_j \circ a_k) \circ a_l\), so it is associative
  3. (Identity) \(a_1 \circ a_k = a_{\max(1,k)} = a_k = a_{\max(k,1)} = a_k \circ a_1\) so \(a_1\) is an identity.
  4. (Inverses) There is no inverse, since \(a_N \circ a_k = a_N\) for all \(k\), and hence \(a_N\) can have no inverse.
  1. (Closure) \(n = |j-k|+1 \geq 1\) so we need to show that \(n \leq N\) to ensure closure. This is true since the largest \(j-k\) can be is if \(j = N\) and \(k = 1\), and this also satisfies \(|j-k| + 1 \leq N\). Hence the operation is closed.
  2. (Associative) \(a_j * (a_k * a_l) = a_j * (a_{|k-l|+1}) = a_{|j-|k-l|-1|+1}\). \((a_j * a_k) * a_l = a_{|j-k|+1}*a_l = a_{|l-|j-k|-1|+1}\). \(a_2 * (a_2 * a_3) = a_2 * a_2 = a_1\). \((a_2 *a_2)*a_3 = a_1 * a_3 = a_3 \neq a_2\) therefore this isn't associative for any \(N > 2\)
  3. (Identity) \(a_1\) is an identity, since \(a_1 * a_k = a_{|k-1|+1} = a_{k-1+1} = a_k\).
  4. (Inverse) Every element is self-inverse since \(a_k * a_k = a_{|k-k|+1} = a_1\)

1987 Paper 3 Q9
D: 1500.0 B: 1500.0

Let \((G,*)\) and \((H,\circ)\) be two groups and \(G\times H\) be the set of ordered pairs \((g,h)\) with \(g\in G\) and \(h\in H.\) A multiplication on \(G\times H\) is defined by \[ (g_{1},h_{1})(g_{2},h_{2})=(g_{1}*g_{2},h_{1}\circ h_{2}) \] for all \(g_{1},g_{2}\in G\) and \(h_{1},h_{2}\in H\). Show that, with this multiplication, \(G\times H\) is a group. State whether the following are true or false and prove your answers.

  1. \(G\times H\) is abelian if and only if both \(G\) and \(H\) are abelian.
  2. \(G\times H\) contains a subgroup isomorphic to \(G\).
  3. \(\mathbb{Z}_{2}\times\mathbb{Z}_{2}\) is isomorphic to \(\mathbb{Z}_{4}.\)
  4. \(S_{2}\times S_{3}\) is isomorphic to \(S_{6}.\)
{[}\(\mathbb{Z}_{n}\) is the cyclic group of order \(n\), and \(S_{n}\) is the permutation group on \(n\) objects.{]}


Solution: Claim: \(G \times H\) is a group. (Called the product group). Proof: Checking the group axioms:

  1. (Closure) is inherited from \(G\) and \(H\), since \(g_1 * g_2 \in G\) and \(h_1 \circ h_2 \in H\)
  2. (Associativity) \begin{align*} (g_1, h_1)\l (g_2, h_2)(g_3,h_3)\r &= (g_1, h_1)(g_2 *g_3, h_2 \circ h_3) \\ &= (g_1*(g_2 *g_3), h_1 \circ (h_2 \circ h_3)) \\ &= ((g_1*g_2) *g_3), (h_1 \circ h_2) \circ h_3) \\ &= (g_1*g_2, h_1 \circ h_2)(g_3, h_3) \\ &= \l(g_1, h_1)(g_2, h_2) \r(g_3,h_3) \end{align*}
  3. (Identity) Consider \((e_G, e_H)\), then \((e_G, e_H)(g,h) = (g,h) = (g,h)(e_G, e_H)\)
  4. (Inverses) If \((g,h) \in G \times H\) then consider \((g^{-1}, h^{-1})\) and we have \((g^{-1}, h^{-1})(g,h) = (e_G,e_H) = (g,h)(g^{-1}, h^{-1})\)
  • Claim: \(G \times H\) is abelian iff \(G\) and \(H\) are. Proof: \(\Rightarrow\) Suppose \(g_1, g_2 \in G\) and \(h_1, h_2 \in H\) then \((g_1, g_2)(h_1,h_2) = (g_1 * g_2, h_1 \circ h_2) = (h_1,h_2)(g_1, g_2) = (g_2 * g_1, h_2 \circ h_1)\) so \(g_1*g_2 = g_2*g_1\) and \(h_1 \circ h_2 = h_2 \circ h_1\), therefore \(G\) and \(H\) are commutative. \(\Leftarrow\) If \(H\) and \(G\) are commutative then: \((g_1, g_2)(h_1,h_2) = (g_1 * g_2, h_1 \circ h_2) = (g_2 * g_1, h_2 \circ h_1) = (h_1,h_2)(g_1, g_2)\) so \(G \times H\) is commutative.
  • Claim: \(G\times H\) contains a subgroup isomorphic to \(G\). Consider the subset \(S = \{(g,e_H) : g \in G \}\). Then this is a subgroup isomorphic to \(G\) with isomorphism given by \(\phi : S \to G\) by \(\phi((g,e_H)) = g\)
  • If \(x \in \mathbb{Z}_2 \times \mathbb{Z}_2\) then \(x^2 = e\), but \(1\) does not have order 2 in \(\mathbb{Z}_4\)
  • \(S_2 \times S_3\) has order \(2 \times 6 = 12\). \(S_6\) has order \(6! \neq 12\)