An element of the general linear group over a finite field is an invertible matrix. Its columns must form an ordered basis of . There are choices for the first column. Its linear span contains vectors, so there are choices for a second column outside that linear span. Thus the order of a general linear group over a finite field is
The determinant is a surjective group homomorphism : for each , the diagonal matrix has determinant . Its kernel of a group homomorphism is the special linear group over a finite field. The first isomorphism theorem gives , hence
The general linear group consists of invertible two-by-two matrices over the finite field , under matrix multiplication. Such a matrix has two linearly independent columns. There are choices for a nonzero first column, and choices for a second column outside its one-dimensional span. Thus
The determinant is a group homomorphism
where is the multiplicative group of nonzero field elements. It is surjective because has determinant . Its kernel of a group homomorphism is . The first isomorphism theorem gives a quotient of order four, whence
The nonzero squares form the subgroup of . Its inverse image
is a subgroup with index two. Indeed, composing the determinant with the quotient map to makes the kernel of a surjective group homomorphism to a group of order two. Thus .
Write the matrix as . Direct multiplication and inversion give
The identity is and all determinants are one, so these formulas verify the subgroup criterion inside . This is the real Heisenberg group.
The map is a surjective group homomorphism to the additive group of real numbers; its kernel is exactly . Hence is normal and the first isomorphism theorem gives
Two matrices commute exactly when . Requiring that relation for every forces , while is unrestricted. Therefore
Finally is a surjective group homomorphism to the additive group with precisely this kernel of a group homomorphism, giving . The central coordinate records noncommutativity: the group commutator is .
Write the Heisenberg group element as . Matrix multiplication and inversion give
All matrices have determinant one. They contain , are closed under multiplication and inverses, and inherit associativity from matrix multiplication; hence they form a subgroup of .
Two such matrices commute precisely when . Requiring this for every forces . Consequently
The map is a surjective group homomorphism to the additive group , with kernel of a group homomorphism . Equivalently, it gives the explicit quotient group isomorphism
It is well-defined because multiplying by a central element changes only . It is injective because equal imply that the quotient of the two matrices is central, and surjectivity follows by taking . This also proves the needed instance of the first isomorphism theorem directly.
The evaluation map , , is a ring homomorphism and is onto because maps to any . By polynomial division, write
Then precisely when . Thus , and the first isomorphism theorem gives
Since the quotient ring is a field, is a maximal ideal.
Evaluation at a real point defines a surjective ring homomorphism from to . Its kernel is : subtracting the constant expresses the remainder as a multiple of plus a multiple of , by successive polynomial division. The first isomorphism theorem therefore identifies the quotient ring with the field , proving each is maximal.
For a maximal ideal not on this list, take
Evaluation is onto , and its kernel is : first subtract a multiple of , then divide the remaining polynomial in by . Hence , a field. Finally, if for real , the member would vanish at , requiring , which is impossible over .
If , take the empty filtration. Otherwise a nonzero quotient is a finitely generated module. Because has the ascending chain condition on ideals, the nonempty collection of annihilators of nonzero elements of has a maximal element. Part (b), applied to , supplies with a prime ideal .
The map , , is surjective with kernel . The first isomorphism theorem gives . Let be the inverse image of under . Then
Repeat whenever the quotient remains nonzero. An infinite repetition would give a strictly ascending chain of submodules of the Noetherian module , contradicting part (a). Thus the process stops after finitely many steps, necessarily at .
This constructs the required prime filtration , with each successive quotient for a prime .
Let act by left multiplication on the set of left cosets. This gives a group action homomorphism
Its kernel
is a normal subgroup of , and the first isomorphism theorem gives . By Lagrange's theorem, divides . The image acts transitively on the cosets, so the orbit-stabilizer theorem shows that divides ; in particular,
Now suppose is nonabelian and simple. Since is proper, the coset action is nontrivial, so . Simplicity gives , and embeds into . Composing with the sign homomorphism gives
Its kernel is normal. A nontrivial map would embed the simple group into the abelian group of order two, which is impossible because is nonabelian. The sign is therefore always , so
A subgroup is normal when
Its left and right cosets then agree, and multiplication
is well defined on the cosets. The identity is , the inverse of is , and associativity descends from , so these cosets form the quotient group .
For a group homomorphism , its kernel and image are
The kernel is normal because
whenever . Conversely, if , the quotient map
is a homomorphism with kernel . The image of any homomorphism is closed under products and inverses, so it is a subgroup of . Finally, the map
is well defined and bijective and preserves multiplication. This is the first isomorphism theorem.
Define
Euler's formula shows that is a homomorphism, its image is the complex unit circle, and its kernel is . The first isomorphism theorem therefore gives
The image of consists exactly of the roots of unity: if , then , while every element of finite order on the unit circle has an argument that is a rational multiple of .
The first isomorphism theorem says that for a homomorphism ,
The map is well-defined because equal cosets differ by a kernel element; it is a surjective homomorphism onto the image, and injectivity follows because its kernel is the identity coset.
Here consists of invertible real matrices and consists of those with determinant one. The latter is the kernel of the surjective determinant map to , so it is normal and
The given integral matrices form a group because products and inverses remain integral. The inverse formula shows that an integral inverse exists exactly when the determinant divides every cofactor; taking determinants shows more directly that , hence , and the adjugate formula proves the converse. The matrices show infinitude.
Reduction modulo two is a homomorphism . Its kernel is exactly , so is normal; its index is finite because the target has only six elements.
Let . The lower ramification groups are and, for ,
If is totally ramified and is a uniformizer, then . Factoring by for proves the uniformizer criterion for lower ramification groups
For , define
The inertia group acts trivially on , so . Its kernel consists exactly of those for which modulo the maximal ideal, namely . The first isomorphism theorem therefore gives an injection
By Lagrange's theorem, the index of a subgroup is . Thus the set of left cosets has three elements, and the preceding group action yields a group homomorphism after labelling them.
Its image is a subgroup of , so its order divides . By the first isomorphism theorem, also divides . Hence its order divides , giving possibilities and . The action on cosets is transitive: sends to . It cannot be the trivial action on a three-element set, so the image does not have order . Therefore
It follows that . Part (b)(i) gives , and ; equal finite orders force equality. A kernel of a group homomorphism is a normal subgroup, so
This is an instance of the fact that a subgroup of index the smallest prime divisor is normal.
The kernel of a group homomorphism is . It is a subgroup, since the identity maps to the identity and for . Also
so . Applying the same inclusion with gives equality, proving that is a normal subgroup.
The map is well defined, multiplicative and injective, with image . Thus the first isomorphism theorem gives
The quotient is isomorphic to all of precisely when the original homomorphism is surjective.
For the general linear group, the determinant gives a homomorphism , since . Its kernel is the special linear group , so that subgroup is normal. Every nonzero real is the determinant of for , making the map surjective. Therefore
where the operation on the right is multiplication.
A group homomorphism preserves multiplication: . Its group kernel is a subgroup, and for . Thus , proving it is a normal subgroup. The map is well-defined because two representatives of a coset differ by an element of . It is a homomorphism, has trivial kernel, and is surjective when is. This proves the first isomorphism theorem, . This proof does not use finiteness and therefore also applies below.
The identity matrix belongs to . The determinant is multiplicative, giving closure, and matrix multiplication is associative. The inverse of a determinant-one matrix is , also of determinant one. Thus this special linear group is a group.
The fractional linear maps must be interpreted on the Riemann sphere, including infinity: a finite pole is sent to infinity and infinity is sent to when . As literal everywhere-defined maps of the complex plane they would not form the asserted group. Substitution into the two rational expressions gives . Matrix identities and inverses therefore give the identity and inverse transformations, proving that the Möbius group is a group and that is a surjective homomorphism.
For to be the identity, on all finite points where defined. Hence is the zero polynomial, so , , and from the determinant. Therefore
The kernel is central and hence normal. In particular is not an isomorphism, since and represent the same transformation. The quotient is the projective special linear group in this complex two-dimensional case.
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. Define
This preserves all products, is surjective, and has kernel exactly . The first isomorphism theorem therefore gives
This is the quaternion group modulo its centre: the reverse-product relations also show that none of is central, so .
The kernel is a normal subgroup, so it contains the identity class and is a union of the classes listed in part (c). Its candidate orders are therefore , , and . Lagrange's theorem excludes four, since it does not divide six. The remaining possibilities are
All three are normal: the first and last trivially, while is the kernel of the map giving the sign of a permutation, or the index-two subgroup generated by a 3-cycle.
Because is onto, the first isomorphism theorem gives . Explicitly, the map is well defined, multiplicative and surjective; equality of its values means , so it is also injective. Thus
Each is realized by the identity map, the sign map and the trivial map, respectively. This completes the classification of normal subgroups and quotients of the symmetric group on three letters.
A group presentation of consists of a set of symbols and a subset of relators, together with a group isomorphism
Here is the free group on , and is the normal closure of . The images of form a generating set of a group; the relators prescribe which words become the identity element.
For the canonical presentation of a group, use one symbol for every group element . The universal property of a free group gives a surjective group homomorphism
Let , namely all words whose evaluation in is the identity element. Then
Indeed is already a normal subgroup, so its normal closure is itself, and the first isomorphism theorem identifies the resulting quotient group with . This is the course's canonical presentation of a group.
An equivalent, smaller collection of relators is for all . These encode the multiplication table. They imply and , so every word reduces to the single symbol recording its product. This proves directly that they normally generate , although the canonical collection above consists of every word in that group homomorphism kernel.
In the quaternion group, commutes with each generator because any element commutes with its powers. Hence is central and is a normal subgroup. The reverse products satisfy , , , so none of is central. Therefore .
The four cosets are . Each nonidentity coset squares to , and . Thus the quotient group is the Klein four-group. Explicitly, mapping to its identity and mapping to its three different nonidentity elements is a surjective group homomorphism with group kernel . The first isomorphism theorem gives the title result.
Quotient group Created 2026-09-24 Updated 2026-10-14
For a group and a normal subgroup , the quotient group is the set of cosets , with operation
Its identity element is the coset , and the inverse element of is . A quotient group treats all elements within one coset as the same input while retaining a consistent operation on the classes. The normal subgroup condition is what makes this operation independent of which representatives are chosen. [ref].
Take the additive group and . Since is an abelian group, is a normal subgroup. There are three elements in the quotient group:
Adding two copies of gives ; adding and gives . Hence the quotient group has the addition table of . It does not select one representative and discard the others: its elements are the entire cosets.
Figure 1.
Identifying residues differing by three turns a six-element cyclic group into a three-element quotient group
. Details.
This is useful whenever distinctions within a normal subgroup should be ignored. For example, the sign of a permutation retains only even or odd parity of a permutation in . Its group kernel is the alternating group , and the quotient group has two elements. The first isomorphism theorem explains why a group homomorphism's image is a quotient group of its domain.
For a subgroup and a normal subgroup , the map from onto is a group homomorphism with kernel . The first isomorphism theorem gives the displayed group isomorphism. The product is a subgroup because is normal. In particular, if and , then .