Past exam of the mathematics course of the University of Cambridge 2015 ia Paper 3 6D Solution 2026-10-06
A group homomorphism satisfies for every . Its kernel of a group homomorphism is . The homomorphism equation gives by cancellation, and . Therefore contains the identity and is closed under multiplication and inverses, so it is a subgroup.
For and ,Thus conjugation carries into itself, and applying the inverse conjugation gives equality: is a normal subgroup. If , conjugation cannot send to the identity because it is injective. ConsequentlyThis proves directly the normal subgroup of order two is central principle for kernels, including the kernel facts needed below.
Past exam of the mathematics course of the University of Cambridge 2016 ia Paper 3 2D Solution Created 2026-09-24 Updated 2026-10-06
Lagrange's theorem states that, for a finite group and a subgroup ,To prove it, define an equivalence relation by when . Its classes are the left cosets , which therefore partition . Left multiplication by gives a bijection , so every coset has elements. Counting this partition gives the formula; in particular divides . Applying the theorem to the cyclic subgroup generated by an element shows that its order of a group element divides .
Write the given order-two normal subgroup as . Conjugation must preserve and cannot send its nonidentity element to the identity, so for all . Thus is in the center of a group: a normal subgroup of order two is central.
Choose . By Lagrange's theorem, its order of a group element is , or . It cannot have order two: since is central, the four distinct elements would form a subgroup of order four, whereas does not divide for odd . If has order , it already generates . Otherwise has order , commutes with , and implies . Hence both and divide , so has order . In either case
The group order is the number of elements of the finite group. A normal subgroup satisfies for every , equivalently its left and right cosets agree.
For the square, let be counterclockwise rotation by , and reflection in the horizontal axis. The dihedral group isThe first four elements rotate by degrees. The other four are Euclidean reflections in the horizontal axis, the line , the vertical axis and the line , respectively, for a square centred at the origin with sides parallel to the axes.
The eight nontrivial proper subgroups areTo check completeness, Lagrange's theorem allows proper orders one, two and four. The order-two subgroups are generated by the five involutions displayed. An order-four subgroup containing or is the rotation subgroup. Otherwise it must contain reflections; their product is a rotation, which must be , so its reflections differ by that half-turn, giving the two listed Klein subgroups. The trivial subgroup is an additional proper subgroup. Thus the PDF's count of eight uses “proper” to exclude the trivial subgroup; with the usual inclusive definition there are nine proper subgroups.
A normal subgroup of order two is central: conjugation fixes its identity and must also fix its only other member. The half-turn commutes with every square symmetry, whereas the reflection subgroups are exchanged by conjugation. Hence the unique order-two normal subgroup isFor the general polygon, write with and . A rotation commutes with exactly when , or . A reflection cannot commute with when , becauseTherefore the center of a group here is for odd , and for even . The order-two normal subgroups correspond exactly to nonidentity central involutions, provingThis agrees with the involutions in an even dihedral group and uses the convention throughout.
Write with . For any , the normal subgroup property implies . This conjugate cannot be , since multiplication by and would then give . There is only one remaining choice, soThus commutes with every element of ; the identity does too. HenceThis proves that a normal subgroup of order two is central. The proof does not require to be finite: conjugation permutes and fixes its identity, so it must fix its only other element.