| Exam Board | OCR MEI |
|---|---|
| Module | FP3 (Further Pure Mathematics 3) |
| Year | 2013 |
| Session | June |
| Marks | 24 |
| Paper | Download PDF ↗ |
| Mark scheme | Download PDF ↗ |
| Topic | Groups |
| Type | Isomorphism between groups |
| Difficulty | Challenging +1.3 This is a substantial Further Maths group theory question requiring multiple techniques (identifying identity/inverses, proving cyclicity, constructing isomorphisms, function composition), but each part follows standard procedures taught in FP3. The composition table work is methodical, the function composition algebra is straightforward, and proving group axioms is routine for this level. More challenging than typical A-level questions due to abstract algebra content, but not requiring exceptional insight. |
| Spec | 8.03b Cayley tables: construct for finite sets under binary operation8.03c Group definition: recall and use, show structure is/isn't a group8.03e Order of elements: and order of groups8.03h Generators: of cyclic and non-cyclic groups8.03l Isomorphism: determine using informal methods |
| \(a\) | \(b\) | \(c\) | \(d\) | \(e\) | \(f\) | \(g\) | \(h\) | |
| \(a\) | \(c\) | \(e\) | \(b\) | \(f\) | \(a\) | \(h\) | \(d\) | \(g\) |
| \(b\) | \(e\) | \(c\) | \(a\) | \(g\) | \(b\) | \(d\) | h | \(f\) |
| \(c\) | \(b\) | \(a\) | \(e\) | \(h\) | \(c\) | \(g\) | \(f\) | \(d\) |
| \(d\) | \(f\) | \(g\) | \(h\) | \(a\) | \(d\) | \(c\) | \(e\) | \(b\) |
| \(e\) | \(a\) | \(b\) | \(c\) | \(d\) | \(e\) | \(f\) | \(g\) | \(h\) |
| \(f\) | \(h\) | \(d\) | \(g\) | \(c\) | \(f\) | \(b\) | \(a\) | \(e\) |
| \(g\) | \(d\) | \(h\) | \(f\) | \(e\) | \(g\) | \(a\) | \(b\) | \(c\) |
| \(h\) | \(g\) | \(f\) | \(d\) | \(b\) | \(h\) | \(e\) | \(c\) | \(a\) |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Identity is \(e\) | B1 | |
| Inverse table: Element \(a,b,c,d,e,f,g,h\) → Inverse \(b,a,c,g,e,h,d,f\) | B2 | Give B1 for four correct |
| [3] |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| \(d^2 = a,\ d^4 = c\) | M1, A1, A1 | Finding powers of an element; Identifying \(d\) (or \(f\), \(g\), or \(h\)) as generator; Or \(f^2=b,\ f^4=c\); Or \(g^2=b,\ g^4=c\); Or \(h^2=a,\ h^4=c\) |
| Hence \(d\) has order 8, and \(G\) is cyclic | E1 | Correctly shown |
| [4] |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Isomorphism table mapping \(H: 0,2,4,6,8,10,12,14\) to \(G\) elements | B1 | For \(e\leftrightarrow 0\) and \(c\leftrightarrow 8\) |
| \(\{d,f,g,h\} \leftrightarrow \{2,6,10,14\}\) | B1 | In any order |
| Fully correct isomorphism | B1 | |
| [3] |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| Rotations have order 2 or 4; Reflections have order 2 | B1 | Correct statement about rotations and/or reflections which implies non-IM |
| There is no element of order 8; Hence not isomorphic | E1 | Fully correct explanation |
| [2] |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| \(f_m f_n(x) = \dfrac{\dfrac{x}{1+nx}}{1+m\left(\dfrac{x}{1+nx}\right)}\) | M1 | Composition of functions |
| \(= \dfrac{x}{1+nx+mx} = \dfrac{x}{1+(m+n)x} = f_{m+n}(x)\) | E1 | Correctly shown |
| [2] |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| \((f_m f_n)f_p = f_{m+n}f_p = f_{m+n+p}\) | M1 | Combining three functions |
| \(f_m(f_n f_p) = f_m f_{n+p} = f_{m+n+p}\) | ||
| Hence \(S\) is associative | E1 | Correctly shown |
| [2] |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| For any \(f_m\), \(f_n\) in \(S\), \(f_m f_n = f_{m+n}\) | M1 | Referring to this in context |
| \(f_m f_n\) is in \(S\) (so \(S\) is closed) | A1 | |
| Identity is \(f_0\) | B1 | B0 for \(x\); B1 for \(n=0\) |
| Inverse of \(f_n\) is \(f_{-n}\) since \(f_n f_{-n} = f_{n-n} = f_0\) | B1, B1 | |
| \(S\) is also associative, and hence is a group | E1 | Closure, associativity, identity and inverses must all be mentioned |
| [6] |
| Answer | Marks | Guidance |
|---|---|---|
| Answer | Marks | Guidance |
| \(\{f_{2n}\}\) for all integers \(n\) | B2 | Or \(\{f_{3n}\}\) etc; Give B1 for multiples of 2 (or 3 etc) but not completely correctly described |
| [2] |
## Question 4(a)(i):
| Answer | Marks | Guidance |
|--------|-------|----------|
| Identity is $e$ | B1 | |
| Inverse table: Element $a,b,c,d,e,f,g,h$ → Inverse $b,a,c,g,e,h,d,f$ | B2 | Give B1 for four correct |
| **[3]** | | |
## Question 4(a)(ii):
| Answer | Marks | Guidance |
|--------|-------|----------|
| $d^2 = a,\ d^4 = c$ | M1, A1, A1 | Finding powers of an element; Identifying $d$ (or $f$, $g$, or $h$) as generator; Or $f^2=b,\ f^4=c$; Or $g^2=b,\ g^4=c$; Or $h^2=a,\ h^4=c$ | At least fourth power; Implies previous M1 |
| Hence $d$ has order 8, and $G$ is cyclic | E1 | Correctly shown |
| **[4]** | | |
## Question 4(a)(iii):
| Answer | Marks | Guidance |
|--------|-------|----------|
| Isomorphism table mapping $H: 0,2,4,6,8,10,12,14$ to $G$ elements | B1 | For $e\leftrightarrow 0$ and $c\leftrightarrow 8$ | |
| $\{d,f,g,h\} \leftrightarrow \{2,6,10,14\}$ | B1 | In any order |
| Fully correct isomorphism | B1 | |
| **[3]** | | |
## Question 4(a)(iv):
| Answer | Marks | Guidance |
|--------|-------|----------|
| Rotations have order 2 or 4; Reflections have order 2 | B1 | Correct statement about rotations and/or reflections which implies non-IM | Or (4) reflections (and 180° rotation) have order 2; Or composition of reflections (or 90° rotation and reflection) is not commutative |
| There is no element of order 8; Hence not isomorphic | E1 | Fully correct explanation | Dependent on previous B1 |
| **[2]** | | |
## Question 4(b)(i):
| Answer | Marks | Guidance |
|--------|-------|----------|
| $f_m f_n(x) = \dfrac{\dfrac{x}{1+nx}}{1+m\left(\dfrac{x}{1+nx}\right)}$ | M1 | Composition of functions | In either order |
| $= \dfrac{x}{1+nx+mx} = \dfrac{x}{1+(m+n)x} = f_{m+n}(x)$ | E1 | Correctly shown | E0 if in wrong order |
| **[2]** | | |
## Question 4(b)(ii):
| Answer | Marks | Guidance |
|--------|-------|----------|
| $(f_m f_n)f_p = f_{m+n}f_p = f_{m+n+p}$ | M1 | Combining three functions | |
| $f_m(f_n f_p) = f_m f_{n+p} = f_{m+n+p}$ | | | M1E1 bod for $(f_m f_n)f_p = f_{m+n+p} = f_m(f_n f_p)$ |
| Hence $S$ is associative | E1 | Correctly shown |
| **[2]** | | |
## Question 4(b)(iii):
| Answer | Marks | Guidance |
|--------|-------|----------|
| For any $f_m$, $f_n$ in $S$, $f_m f_n = f_{m+n}$ | M1 | Referring to this in context | |
| $f_m f_n$ is in $S$ (so $S$ is closed) | A1 | | |
| Identity is $f_0$ | B1 | B0 for $x$; B1 for $n=0$ | |
| Inverse of $f_n$ is $f_{-n}$ since $f_n f_{-n} = f_{n-n} = f_0$ | B1, B1 | | |
| $S$ is also associative, and hence is a group | E1 | Closure, associativity, identity and inverses must all be mentioned | Dependent on previous 5 marks |
| **[6]** | | |
## Question 4(b)(iv):
| Answer | Marks | Guidance |
|--------|-------|----------|
| $\{f_{2n}\}$ for all integers $n$ | B2 | Or $\{f_{3n}\}$ etc; Give B1 for multiples of 2 (or 3 etc) but not completely correctly described | e.g. $\{f_0, f_2, f_4, f_6, \ldots\}$ |
| **[2]** | | |
4
\begin{enumerate}[label=(\alph*)]
\item The composition table for a group $G$ of order 8 is given below.
\begin{center}
\begin{tabular}{|l|l|l|l|l|l|l|l|l|}
\hline
& $a$ & $b$ & $c$ & $d$ & $e$ & $f$ & $g$ & $h$ \\
\hline
$a$ & $c$ & $e$ & $b$ & $f$ & $a$ & $h$ & $d$ & $g$ \\
\hline
$b$ & $e$ & $c$ & $a$ & $g$ & $b$ & $d$ & h & $f$ \\
\hline
$c$ & $b$ & $a$ & $e$ & $h$ & $c$ & $g$ & $f$ & $d$ \\
\hline
$d$ & $f$ & $g$ & $h$ & $a$ & $d$ & $c$ & $e$ & $b$ \\
\hline
$e$ & $a$ & $b$ & $c$ & $d$ & $e$ & $f$ & $g$ & $h$ \\
\hline
$f$ & $h$ & $d$ & $g$ & $c$ & $f$ & $b$ & $a$ & $e$ \\
\hline
$g$ & $d$ & $h$ & $f$ & $e$ & $g$ & $a$ & $b$ & $c$ \\
\hline
$h$ & $g$ & $f$ & $d$ & $b$ & $h$ & $e$ & $c$ & $a$ \\
\hline
\end{tabular}
\end{center}
\begin{enumerate}[label=(\roman*)]
\item State which is the identity element, and give the inverse of each element of $G$.
\item Show that $G$ is cyclic.
\item Specify an isomorphism between $G$ and the group $H$ consisting of $\{ 0,2,4,6,8,10,12,14 \}$ under addition modulo 16 .
\item Show that $G$ is not isomorphic to the group of symmetries of a square.
\end{enumerate}\item The set $S$ consists of the functions $\mathrm { f } _ { n } ( x ) = \frac { x } { 1 + n x }$, for all integers $n$, and the binary operation is composition of functions.
\begin{enumerate}[label=(\roman*)]
\item Show that $\mathrm { f } _ { m } \mathrm { f } _ { n } = \mathrm { f } _ { m + n }$.
\item Hence show that the binary operation is associative.
\item Prove that $S$ is a group.
\item Describe one subgroup of $S$ which contains more than one element, but which is not the whole of $S$.
\end{enumerate}\end{enumerate}
\hfill \mbox{\textit{OCR MEI FP3 2013 Q4 [24]}}