Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 308 2 ii Solution Created 2026-10-03 Updated 2026-10-06
Use the coefficients in the authoritative PDF, including their factor . Write andThe numerator and denominator are coprime: a common zero would, by subtraction, require , where both equal one. Therefore the degree of a rational map of the Riemann sphere is four. Direct algebra givesThe domain transformations and are sphere rotations as special-unitary Möbius transformations: respectively a quarter-turn about the third axis and a one-third turn cycling the three coordinate axes. In particular the latter sends , the north, first-axis and second-axis directions. They generate the order-24 rotational symmetry group of a cube, isomorphic to the symmetric group . Their target transformations are rotations: is a half-turn about the first target axis and is a one-third turn about the third target axis. This proves whole-map combined equivariance, not just symmetry of selected roots.
The target rotation image is the order-six dihedral group . The spatial half-turns about all three coordinate axes act trivially on the map: and generate a Klein four-group kernel. Thus the full Skyrmion symmetry combines the spatial cubic rotations with compensating isospin rotations, while its angular energy and Skyrme baryon density have pure spatial cubic symmetry.
The critical directions make the geometry explicit. Its Wronskian of a rational map isThe five finite ramification points are ; infinity supplies the sixth, since in the local coordinate the map starts with . These are the six coordinate-axis directions, or face centres of a cube. The angular Jacobian of a rational map vanishes there, consistent with a cube-shaped shell whose density is concentrated away from its face centres. Any further rotational equivariance would have to preserve this set, so the spatial proper rotation group is exactly the cubic group already generated above.
There is also a reflection relation . Together with the proper rotations, it makes the angular density invariant under the full order-48 symmetry group of a cube, usually denoted . The target operation in this reflection relation is orientation reversing; it should not be mistaken for a proper isospin rotation. In the full Skyrme model, reflections are expressed using the field parity operation together with a compensating isospin rotation.
This is the cubic charge-four rational-map ansatz:The cubic rational-map ansatz for four Skyrmions is a useful approximation and starting point for the cubic four-Skyrmion, whose lowest spin-zero, isospin-zero quantized state models an alpha particle. A radial minimization and, for precision, unrestricted field relaxation are still required. The TeX's missing changes this map; the six critical directions alone would not detect the error, because the same Wronskian zero set persists when is real. The actual rotational equivariance identities are the stronger check.
Past exam of the mathematics course of the University of Cambridge 2018 ii Paper 1 18I Solution Created 2026-09-24 Updated 2026-10-03
Let be the Galois group of a polynomial of the irreducible quartic. Irreducibility makes a transitive subgroup of . The three roots of the given cubic resolvent of a quartic correspond to the three partitions of the four quartic roots into two unordered pairs, and the kernel of the -action on these partitions is the Klein four-group . If the resolvent has Galois group , the image of in this action is all of . Among the transitive subgroups of the symmetric group on four points, only has this image. Hence
Now put . The Eisenstein criterion at proves that is an irreducible polynomial, and its cubic resolvent isIts discriminant of a depressed cubic isFor odd , the -adic valuation of is three because ; for , . Thus is never a square in .
By the rational root theorem, a reducible has an integer root among . Reduction modulo shows that the root is divisible by ; writing it as , with , givesThe only possibilities are and , corresponding to roots and . For every other prime, is irreducible with nonsquare discriminant, so its Galois group is and the criterion above gives the quartic group . For or , the reducible resolvent makes the quartic group a proper subgroup. Therefore
Past exam of the mathematics course of the University of Cambridge 2018 ii Paper 2 19I c Solution Created 2026-09-24 Updated 2026-10-03
The normis a positive integer, because it is the sum of the squares of the multiplicities of the irreducible constituents. The character restriction norm bound and make it at most three. It is therefore , , or .
All three values occur:
- In with , the trivial character remains irreducible on , giving norm .
- For the same pair, the two-dimensional standard representation of the symmetric group restricts to the sum of the trivial and nontrivial linear characters of , giving norm .
- In with its normal Klein four-group , the three-dimensional irreducible representation of the alternating group on four letters restricts to the sum of the three nontrivial linear characters of , giving norm .
Past exam of the mathematics course of the University of Cambridge 2019 ii Paper 4 18F ii Solution Created 2026-09-24 Updated 2026-10-03
If , thenLetThis is the nonidentity automorphism of . By extending an embedding that sends to , and composing with if necessary, chooseThenThe eight elementsare distinct, and exhaust the Galois group. Thus the dihedral Galois action on four radical roots gives
Now suppose is a square in . Then , so every automorphism fixes . We are in case (i) with , and therefore
Conversely, suppose the group is the Klein four-group. Label the rootsThe three nonidentity elements in its transitive action are the three double transpositions. Each fixes : they send the ordered pair respectively towhose products all equal . Hence every element of the Galois group fixes . By the Artin fixed-field theorem,Therefore is a square in . This proves the Klein-four criterion for an irreducible even quartic:
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 2 18G c i Solution Created 2026-09-24 Updated 2026-09-29
A group is solvable when its derived serieseventually reaches the trivial group; equivalently, it has a subnormal series with abelian quotients.
The symmetric group is solvable becausehas abelian quotients , , and , where is the Klein four-group. Thus
Past exam of the mathematics course of the University of Cambridge 2020 ii Paper 4 18G b Solution Created 2026-09-24 Updated 2026-09-29
The symmetric group acts on the three partitions of four roots into two unordered pairs. The resulting homomorphism has kernel the Klein four-group . If is a square and the characteristic is not two, the discriminant criterion for an alternating Galois group gives , and its image on the three resolvent roots lies in .
For an irreducible quartic, is transitive on four roots, and its only possibilities inside are and . The resolvent is irreducible exactly when the image acts transitively on its three roots, equivalently when that image is . ThusThe printed statement omits the needed irreducibility hypothesis on . Literally it is false: has square discriminant and Galois group , and its resolvent is irreducible. Without quartic irreducibility, a reducible resolvent only implies , allowing the trivial group, , or .
For the specified polynomial ,Its resolvent is . Modulo this is , which has no root in and is therefore an irreducible cubic. The quartic is given to be irreducible, so the preceding criterion yields
Past exam of the mathematics course of the University of Cambridge 2022 ia Paper 3 2E Solution Created 2026-09-23 Updated 2026-09-25
A group is abelian when for every . It is cyclic when some generator of a group satisfiesIf and belong to a cyclic group, thenso every cyclic group is abelian.
The Klein four-group is abelian, but every nonidentity element has order two, so no element generates all four elements. Thus an abelian group need not be cyclic.
For the converse, the Klein four-group is an abelian group, with componentwise multiplication. Each nonidentity element has order of a group element two, so none generates its four elements. It is therefore not a cyclic group.
Choose distinct , possible because . By iii, and commute, and . The four elementsare distinct: would give , while or would make or . Commutativity and show that products stay in , and every element is its own inverse. More explicitly,is a group isomorphism, with addition of exponents modulo two. Hence contains a subgroup isomorphic to the Klein four-group.
The converse is false. The direct product of groups contains , but it has elements of order of a group element three. Thus the existence of the specified subgroup does not force every nonidentity element to have order of a group element two.
The complete classification up to group isomorphism isHere is the trivial group. The prime number cases follow from i. For four elements, an element of order of a group element four generates . If there is none, Lagrange's theorem makes every nonidentity element have order of a group element two. Then iv produces a four-element subgroup, which must be all of , giving the Klein four-group.
For six elements, an element of order of a group element six gives . Suppose there is none. If there were no element of order of a group element three either, all nonidentity elements would have order of a group element two. Part iv would then produce a subgroup of cardinality four, contradicting Lagrange's theorem. Thus choose of order of a group element three. There is also an involution : otherwise the five nonidentity elements could be paired into distinct pairs , impossible for an odd number of elements.
The subgroup has index of a subgroup two, so it is a normal subgroup. Indeed, for , both and are the complement of , and for both equal . Consequently is either or . The first possibility makes commute, and then has order of a group element six: forces , so both and divide . This contradicts our assumption. ThereforeEvery element is uniquely or , with , and the relation determines all their products. Sending to and to gives a group isomorphism with the symmetric group . This completes the classification of groups of order at most six.
Of these groups, exactly embed in . Concrete subgroups areThere is no subgroup, since does not divide . There is no subgroup either: the order of a group element in a symmetric group is the least common multiple of the lengths in its disjoint cycle decomposition, and on four letters the only possibilities are .
Label the vertices of a regular tetrahedron , and include all its Euclidean isometries, both rotations and reflections. The following list describes every subgroup of cardinality at most six, allowing arbitrary relabelling of the vertices. The numbers count actual subgroups, rather than just their group isomorphism types.
- One trivial subgroup contains only the identity element.
- Six reflection subgroups are generated by a transposition, for example . Its mirror plane contains vertices and the midpoint of the opposite edge .
- Three half-turn subgroups are generated by a product of two disjoint transpositions, for example . The rotation axis joins the midpoints of the opposite edges and .
- Four cyclic subgroups consist of the three rotations about an axis joining a vertex to the centre of its opposite face. For example, fixes vertex .
- Three cyclic subgroups are generated by an improper orthogonal transformation: a quarter-turn about an axis through opposite edge midpoints, composed with a reflection in the perpendicular plane through the centre. For , the axis joins the midpoints of edges and . Its square is the half-turn .
- One rotational Klein four-group consists of the identity element and the three half-turns about opposite-edge midpoint axes:
- Three further Klein four-groups arise from a pair of opposite edges. For edges , the subgroup isIt contains two reflections in perpendicular planes and their product, the half-turn about the line where those planes meet. It preserves each of the two opposite edges as a set.
- Four subgroups are the stabilizer subgroups of individual vertices. Each contains three rotations about the vertex-to-opposite-face axis and three reflections in planes containing that axis. For the fixed vertex , this is every permutation of .
Here is why this is exhaustive. Part b leaves only the trivial group, . The disjoint cycle decomposition gives exactly the two listed kinds of involutions, the three-cycles, and the four-cycles, accounting for all the cyclic subgroups. In a Klein four-group, the nonidentity elements commute. If it contains , any other nonidentity element must be a commuting involution, hence or ; either choice yields the displayed opposite-edge subgroup. If it has no transposition, its three nonidentity elements must be all three double transpositions, yielding the rotational subgroup.
Finally, an subgroup has a unique cyclic subgroup of cardinality three. Its two three-cycles fix the same unique vertex. Every element of the subgroup preserves this vertex, since conjugation preserves that unique cyclic subgroup. Thus it is the full stabilizer subgroup of that vertex. The counts in the list are consequently exhaustive, givingThe two kinds of and the two kinds of Klein four-groups have different geometric behavior despite having the same abstract group isomorphism type within each pair. This is the distinction recorded by the small subgroups of tetrahedral symmetry.
A smallest example is the Klein four-groupwith coordinatewise addition modulo . Every nonidentity element has order of a group element , so none generates all four elements; hence this group is not a cyclic group.
A group of group order is a cyclic group. A group of group order or is also a cyclic group: choose a nonidentity element; by Lagrange's theorem, its order of a group element is a nontrivial divisor of that prime number, so equals the whole group order. Thus no smaller example exists, and the smallest possible group order is .
Past exam of the mathematics course of the year 2 of the natural sciences course of the University of Cambridge 2001 Paper 2 10 Solution Created 2026-10-18 Updated 2026-10-20
Representations. A complex group representation is a group homomorphism to the invertible linear maps on a vector space. It is an irreducible representation when and the only invariant subspaces are and .
Group table. The supplied matrices satisfy , , and . Their multiplication table isThe table proves closure and gives identity and an inverse for every element; associativity is inherited from matrix multiplication. The table is symmetric, so the group is abelian. It is the Klein four-group .
Dimensions and conjugacy. The sum of squares of irreducible representation dimensions is . A two-dimensional irreducible would alone contribute four, leaving no room for the ever-present one-dimensional trivial representation. Hence the given two-dimensional representation is reducible. Since the group is abelian, every conjugacy class is a singleton. There are therefore four inequivalent complex irreducible representations, each of dimension one:Taking the trace of the given matrices gives their character of a representation:
Irreducible characters. In a one-dimensional representation, the values on and must each be , since both elements square to . Their values determine the value on . The four choices give the complete character table:Each row is a character because it respects the generating relations, and the rows have unit norm and pairwise zero character inner product. The multiplicities of these rows in are respectively , by character orthogonality. Thus
Past exam of the mathematics course of the year 2 of the natural sciences course of the University of Cambridge 2005 Paper 2 8 Solution Created 2026-10-18 Updated 2026-10-20
A left coset is . The cosets partition a finite group into equally sized sets of elements, so Lagrange's theorem gives ; in particular subgroup order divides group order.
The table proves closure, is the identity and every element is its own inverse. Associativity is inherited from matrix multiplication, so this is the Klein four-group.
Finally, if every nonidentity element has order two, every element satisfies , including the identity. Then . Thus a group of exponent two is abelian.
Past exam of the mathematics course of the year 2 of the natural sciences course of the University of Cambridge 2007 Paper 2 8 Solution Created 2026-10-18 Updated 2026-10-20
Lagrange's theorem states that the group order of a finite group divides the group order; more precisely .
If every element squares to the identity element, every element is its own inverse element, and . Thus a group of exponent two is abelian. For distinct nonidentity , the four elements are distinct: for example would imply , and would imply . Products remain in this set because commute and square to one. Thus they form a Klein four-group subgroup of order four.
Now let with odd prime number . By Lagrange's theorem, every element order is one of . If an element has order , its square has order . If no element had order , all nonidentity elements would therefore have order two. There are at least two distinct such elements, producing a subgroup of order four. This contradicts . Hence there is an element of order .
The Klein four-group has multiplication tableSince it is abelian, every conjugacy class is a singleton: . An irreducible representation is a nonzero representation whose only invariant subspaces are zero and the whole representation space. For a finite group, the number of inequivalent complex irreducible representations equals the number of conjugacy classes, so there are four here.
A one-dimensional representation sends the involutions to signs, independently. All four choices areThey are distinct irreducible representations, exhausting the four possibilities. The character table of the Klein four-group isThe specified diagonal matrices obey , commute, and satisfy , so the group relations prove that is a group representation. Its coordinate axes are invariant lines carrying respectively . ThereforeThe trivial representation is absent. If denotes the four-row character matrix above, direct row products give . This verifies character orthogonality:The character of is , whose inner products with the four rows are , independently confirming the decomposition. All these irreducibles are real as well: commuting real involutions can be simultaneously diagonalized into their real sign eigenspaces.
For a subgroup of a finite group , distinct left cosets are disjoint and partition . Each coset has exactly elements because is a bijection. Counting the partition proves Lagrange's theorem:A cyclic group is generated by a single element. In a group of order four, an element of order four generates the whole group, giving . Otherwise all three nonidentity elements have order two. Choose two of them ; cancellation makes the third. Since , . The remaining products then give the Klein four-group. This proves that there are precisely two groups of order four up to isomorphism, distinguished by whether an element of order four exists.
For the square, take to be counterclockwise rotation by and reflection in the horizontal axis. They satisfy and . The dihedral group here is of order eight, with elements . Both generators are necessary: one generator would give a cyclic, hence abelian, group, while and do not commute. In the following Cayley table, the row acts after the column; the formula , with exponents reduced modulo four and two, computes every entry.The largest cyclic subgroup is , of order four. Every reflection has order two and there is no element of order eight. The other subgroups of order four areBoth are Klein four-groups, generated by the commuting involutions and one reflection. For completeness, any order-four subgroup containing or equals . Otherwise it contains a reflection ; the product of two distinct reflections is a nonidentity rotation, which must be if odd powers of are excluded. This forces the subgroup to be , giving exactly the two displayed choices. It is the square case of the classification of subgroups of a dihedral group.
The order of a finite group is its number of elements. Lagrange's theorem states that for a subgroup ,so divides . In particular the order of a group element divides , because it is the order of its generated cyclic subgroup.
For , if some element has order four it generates the whole group, which is therefore the cyclic group . Otherwise every nonidentity element has order two. Choose two distinct ones and put . Cancellation shows , so is the remaining element. Since ,The other products follow: , , and . Thus the second possibility is the Klein four-group. The two groups are not isomorphic because only has an element of order four. This proves the order-four case of the classification of groups of order p squared.
A group homomorphism obeys . It maps identity to identity and inverses to inverses. Its group kernel contains and is closed under , so the subgroup test makes it a subgroup. For and ,Thus ; applying the same argument to gives equality. Hence is a normal subgroup.
Define by . If , then , giving , so this is well-defined. Coset multiplication shows it is a group homomorphism. Its kernel is just the identity coset, since means . It is therefore injective, and the assumed surjectivity of makes it surjective as well. This proves the first isomorphism theorem here:
In the quaternion group, the element commutes with each of , because an element commutes with its square. It then commutes with their negatives too, and with . The set is a subgroup because , and it is central, hence a normal subgroup.
The four quotient cosets are . They square to , and . Reversed products have the same coset: for example , while , so . The same calculation gives and . After signs are identified, these are precisely the products in the Klein four-group. DefineThis preserves all products, is surjective, and has kernel exactly . The first isomorphism theorem therefore givesThis is the quaternion group modulo its centre: the reverse-product relations also show that none of is central, so .
The group order of a finite group is its number of elements, . The order of a group element is the least positive integer with . Such an exists in a finite group because two powers must coincide, and cancellation then gives a positive power equal to the identity element.
For the direct product of groups, the componentwise operation is closed because each factor is closed. Associativity holds in each coordinate:The identity element is , and the inverse element of is . Thus all group axioms hold. For finite factors, the multiplication principle gives
For , write , , , , with . Its Cayley table, with the row element multiplying the column element, isThis is the Klein four-group: every nonidentity element has order two.
In the cyclic group , the set is closed because , and both elements have inverses in the set. It is therefore a proper subgroup of order two. By Lagrange's theorem, a proper subgroup has order one or two. An order-two subgroup must be generated by an element of order two. Neither nor has order two, whereas does. HenceThe PDF's claim needs “nontrivial”: is the only nontrivial proper subgroup, but is also a proper subgroup under the usual definition.
A group isomorphism preserves element orders: if and only if , using the homomorphism property and injectivity. Since has elements of order four and the Klein four-group does not,
Denote the four listed matrices, in order, by . As permutation matrices, act on the four basis vectors by , and , respectively. Direct multiplication givesThese relations prove closure and show that each element is its own inverse. The identity is included and matrix multiplication is associative, so the matrices form a group.
The relations coincide with those of the Klein four-group : take its half-turn generator to , a reflection generator to , and their product to . All four matrices are distinct, so this assignment is a faithful representation of . It is the four-point regular representation of the Klein four-group.
Every matrix fixes , since it permutes its coordinates. Thereforeis a one-dimensional invariant subspace, nonzero and strictly smaller than the four-dimensional space. This proves the representation is reducible. In fact the four mutually orthogonal sign vectors , , and give invariant lines and completely diagonalize the representation, as in the normalized Hadamard matrix construction.