Problems

Solution: \begin{questionparts} \item \((ab)^2 = abab = e\) (since \(ab\) has order \(2\)), but \(a^2 = e, b^2 = e \Rightarrow a^{-1} = a, b^{-1} = b\) (since \(a\) and \(b\) have order 2) so \(ba = ab\) by multiplication on the left by \(a\) and right by \(b\). \item Suppose \((cd)^n = e \Leftrightarrow d(cd)^nc = dc \Leftrightarrow (dc)^n(dc) = e \Leftrightarrow (dc)^n = e\) Therefore any number for which \((cd)^n = e\) has the property that \((dc)^n = e\) and vice-versa, in particular the smallest number for either \(cd\) or \(dc\) will also be the smallest number for the other. \item Given \(c^{-1}bc=b^r\), then \(b^{rs} = (b^r)^s = (c^{-1}bc)^s =\underbrace{(c^{-1}bc)(c^{-1}bc) \cdots (c^{-1}bc)}_{s \text{ times}} = c^{-1}\underbrace{bb\cdots b}_{s \text{ times}}c = c^{-1}b^sc\) We proceed by induction on \(n\). When \(n = 0\), we have \(b^s = b^{sr^0}\) so the base case is true. Suppose it is true for some \(n = k\), ie \(c^{-k}b^sc^k = b^{sr^k}\). Now consider \(c^{-{k+1}}b^sc^{k+1} = c^{-1}c^{-k}b^sc^kc = c^{-1}b^{sr^k}c = (b^{sr^k \cdot r}) = b^{sr^{k+1}}\) (where the second to last equality was by the previous part). Therefore if our statement is true for \(n=k\) it is true for \(n = k+1\). Therefore, since it is also true for \(n=0\), by the principle of mathematical induction it is true for all non-negative integers \(n\).

Solution: \begin{questionparts} \item Show that, if \(o(g)=n\) and \(g^{N}=e,\) then \(n\) divides \(N.\) Using the division algorithm, write \(N = qn + r\) where \(0 \leq r < n\) to divide \(N\) by \(n\). Then we have \(e = g^N = g^{qn + r} = g^{qn}g^r = (g^{n})^qg^r = e^qg^r = g^r\) therefore \(r\) is a number smaller than \(n\) such that \(g^r = e\). Therefore either \(r = 0\) or \(o(g) = r\), but by definition \(o(g) = n\) therefore \(r = 0\) and \(n \mid N\). \item Let \(g\) and \(h\) be elements of \(G\). Prove that, for any integer \(m,\) \[ gh^{m}g^{-1}=(ghg^{-1})^{m}. \] \((ghg^{-1})^m = \underbrace{(ghg^{-1})(ghg^{-1})\cdots(ghg^{-1})}_{m \text{ times}} = gh(g^{-1}g)h(g^{-1}g)\cdots (g^{-1}g)hg^{-1} = gh^mg^{-1}\) \item Let \(g\) and \(h\) be elements of \(G\), such that \(g^{5}=e,h\neq e\) and \(ghg^{-1}=h^{2}.\) Prove that \(g^{2}hg^{-2}=h^{4}\) and find \(o(h).\) \(g^2hg^{-2} = g(ghg^{-1})g^{-1} = gh^2g^{-1} = (ghg^{-1})^2 = (h^2)^2 = h^4\). \(h = g^{5}hg^{-5} = g^4ghg^{-1}g^{-4} = g^4h^2g^{-4} = g^3(ghg^{-1})^2g^{-3} = g^3h^4g^{-3} = h^32\) Therefore \(e = h^{31}\). Therfore \(o(h) \mid 31 \Rightarrow \boxed{o(h) = 31}\) since \(31\) is prime and \(o(h) \neq 1\)