Study guide
10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms
GRE Subject Test: Mathematics Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Single-Variable Differential Calculus
1.1 Limits, Continuity, and Epsilon-Delta Definitions 1.2 Differentiation Rules, Implicit & Inverse Differentiation 1.3 Mean Value Theorem, Rolle's Theorem, and Function Extrema 1.4 L'Hôpital's Rule, Curve Sketching, and Optimization 1.5 Functions, Graphs, Transformations, and Inverses 1.6 Trigonometric Functions, Identities, and Equations 1.7 Coordinate Geometry, Lines, Circles, and Conics 1.8 Parametric and Polar Curves
2 Chapter 2: Single-Variable Integral Calculus
2.1 Riemann Sums and the Fundamental Theorem of Calculus 2.2 Advanced Integration Techniques 2.3 Geometric Applications: Areas, Volumes, and Arc Length 2.4 Improper Integrals and Convergence Criteria
3 Chapter 3: Sequences, Infinite Series & Power Series
3.1 Sequences, Monotonicity, and Limits 3.2 Infinite Series and Convergence Tests 3.3 Power Series, Radius and Interval of Convergence 3.4 Taylor and Maclaurin Series with Error Bounds
4 Chapter 4: Multivariable Differential Calculus
4.1 Multivariable Functions, Limits, and Partial Derivatives 4.2 Directional Derivatives, Gradients, and Tangent Planes 4.3 Multivariable Chain Rule and Implicit Differentiation 4.4 Multivariable Extrema, Hessian Matrix, and Lagrange Multipliers
5 Chapter 5: Multivariable Integration & Vector Calculus
5.1 Multiple Integrals in Cylindrical and Spherical Coordinates 5.2 Change of Variables and the Jacobian Determinant 5.3 Vector Fields, Line Integrals, and Green's Theorem 5.4 Surface Integrals, Stokes' Theorem, and the Divergence Theorem
6 Chapter 6: Ordinary Differential Equations
6.1 First-Order ODEs: Separable, Linear, and Exact Equations 6.2 Special First-Order ODEs: Homogeneous, Bernoulli, and Orthogonal Trajectories 6.3 Second-Order Linear Homogeneous ODEs with Constant Coefficients 6.4 Nonhomogeneous Linear ODEs: Undetermined Coefficients and Variation of Parameters
7 Chapter 7: Elementary Algebra & Number Theory
7.1 Elementary Algebra, Polynomials, Roots, and Factorization 7.2 Divisibility, Primes, and the Euclidean Algorithm 7.3 Modular Arithmetic, Chinese Remainder Theorem, and Euler's Totient
8 Chapter 8: Linear Algebra: Vector Spaces & Transformations
8.1 Vector Spaces, Subspaces, Span, and Linear Independence 8.2 Basis, Dimension, and Coordinate Representations 8.3 Linear Transformations, Kernel, Range, and the Rank-Nullity Theorem 8.4 Matrix Representations of Transformations and Change of Basis
9 Chapter 9: Linear Algebra: Matrices, Determinants & Spectral Theory
9.1 Systems of Linear Equations, Matrix Rank, and Row Reduction 9.2 Determinants, Matrix Inverses, and Cramer's Rule 9.3 Eigenvalues, Eigenvectors, and Diagonalization 9.4 Inner Product Spaces, Gram-Schmidt, and the Spectral Theorem
10 Chapter 10: Abstract Algebra: Groups, Rings & Fields
10.1 Groups, Subgroups, and Permutations 10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms 10.3 Rings, Ideals, Modules, Polynomial Rings, and Fields
11 Chapter 11: Introductory Real Analysis
11.1 The Real Field and Metric Space Topology 11.2 Compactness, Completeness, and Connectedness in R^n 11.3 Continuity, Uniform Continuity, and Value Theorems 11.4 Sequences and Series of Functions: Pointwise and Uniform Convergence
12 Chapter 12: Complex Analysis
12.1 Complex Numbers and Analytic Functions 12.2 Contour Integration and Cauchy's Theorems 12.3 Laurent Series, Singularities, and the Residue Theorem
13 Chapter 13: Topology, Geometry & Numerical Analysis
13.1 Topological Spaces, Open/Closed Sets, and Bases 13.2 Euclidean Geometry, Similarity, Circles, and Transformations 13.3 Numerical Analysis: Error, Root Finding, Interpolation, and Quadrature
14 Chapter 14: Probability, Statistics & Discrete Mathematics
14.1 Logic, Set Theory, Algorithms, and Combinatorics 14.2 Graph Theory: Trees, Cycles, Paths, and Planarity 14.3 Probability Spaces, Conditional Probability, and Bayes' Theorem 14.4 Random Variables, Expected Value, Variance, and Common Distributions
10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms
Key Takeaways Explain This Topic AI
Cosets partition a group G into disjoint subsets of uniform size |H|; Lagrange's Theorem establishes that |G| = [G : H] * |H|, guaranteeing that element orders divide group order.
Every group of prime order p is cyclic and isomorphic to Z_p, with no proper non-trivial subgroups.
A subgroup N is normal (N trianglelefteq G) if and only if gNg^{-1} = N for all g in G; any subgroup of index 2 is automatically normal.
The quotient set G/N forms a group under coset multiplication if and only if N is normal in G; its order is the index [G : N].
The First Isomorphism Theorem for groups asserts that for any group homomorphism phi: G -> H, the kernel is normal in G and G / ker(phi) is isomorphic to im(phi).
Last updated: September 2026
10.2 Cosets, Lagrange's Theorem, Normal Subgroups, and Homomorphisms
Coset partitions, normal subgroups, and homomorphisms form the foundation of structural group theory. GRE Mathematics Subject Test problems frequently test the consequences of Lagrange's theorem, index calculations, quotient group structures, group center theorems, and the First Isomorphism Theorem.
Cosets and Equivalence Partitions
Let G G G be a group and H ≤ G H \le G H ≤ G a subgroup. For any element g ∈ G g \in G g ∈ G :
The left coset of H H H containing g g g is g H = { g h : h ∈ H } gH = \{gh : h \in H\} g H = { g h : h ∈ H } .
The right coset of H H H containing g g g is H g = { h g : h ∈ H } Hg = \{hg : h \in H\} H g = { h g : h ∈ H } .
Fundamental Properties of Cosets
Uniform Cardinality: The map h ↦ g h h \mapsto gh h ↦ g h is a bijection from H H H to g H gH g H , so ∣ g H ∣ = ∣ H ∣ |gH| = |H| ∣ g H ∣ = ∣ H ∣ for every g ∈ G g \in G g ∈ G .
Partition of G G G : Define an equivalence relation on G G G by a ∼ b ⟺ a − 1 b ∈ H a \sim b \iff a^{-1}b \in H a ∼ b ⟺ a − 1 b ∈ H (or equivalently b ∈ a H b \in aH b ∈ a H ). The equivalence classes under this relation are precisely the left cosets of H H H . Therefore, the left cosets partition G G G : any two cosets a H aH a H and b H bH b H are either identical ( a H = b H aH = bH a H = b H ) or completely disjoint ( a H ∩ b H = ∅ aH \cap bH = \emptyset a H ∩ b H = ∅ ).
Coset Equality Criterion: a H = b H ⟺ b − 1 a ∈ H ⟺ a ∈ b H aH = bH \iff b^{-1}a \in H \iff a \in bH a H = b H ⟺ b − 1 a ∈ H ⟺ a ∈ b H .
Asymmetry: In a non-abelian group, a left coset g H gH g H is generally not equal to the right coset H g Hg H g .
Lagrange's Theorem and Its Direct Corollaries
Lagrange's Theorem: If G G G is a finite group and H ≤ G H \le G H ≤ G , then the order of H H H divides the order of G G G . The number of distinct left (or right) cosets of H H H in G G G is called the index of H H H in G G G , denoted [ G : H ] [G : H] [ G : H ] : ∣ G ∣ = [ G : H ] ⋅ ∣ H ∣ |G| = [G : H] \cdot |H| ∣ G ∣ = [ G : H ] ⋅ ∣ H ∣
Corollaries Frequently Tested on the GRE
Element Order Divisibility: For every element g ∈ G g \in G g ∈ G , the order ∣ g ∣ = ∣ ⟨ g ⟩ ∣ |g| = |\langle g \rangle| ∣ g ∣ = ∣ ⟨ g ⟩ ∣ divides ∣ G ∣ |G| ∣ G ∣ .
Exponent Identity: For every g ∈ G g \in G g ∈ G , g ∣ G ∣ = e g^{|G|} = e g ∣ G ∣ = e .
In the multiplicative group ( Z p ∗ , ⋅ ) (\mathbb{Z}_p^*, \cdot) ( Z p ∗ , ⋅ ) of order p − 1 p - 1 p − 1 , this yields Fermat's Little Theorem: a p − 1 ≡ 1 ( m o d p ) a^{p-1} \equiv 1 \pmod p a p − 1 ≡ 1 ( mod p ) for gcd ( a , p ) = 1 \gcd(a, p) = 1 g cd ( a , p ) = 1 .
In the group of units ( Z n ∗ , ⋅ ) (\mathbb{Z}_n^*, \cdot) ( Z n ∗ , ⋅ ) of order ϕ ( n ) \phi(n) ϕ ( n ) , this yields Euler's Totient Theorem: a ϕ ( n ) ≡ 1 ( m o d n ) a^{\phi(n)} \equiv 1 \pmod n a ϕ ( n ) ≡ 1 ( mod n ) for gcd ( a , n ) = 1 \gcd(a, n) = 1 g cd ( a , n ) = 1 .
Groups of Prime Order: If ∣ G ∣ = p |G| = p ∣ G ∣ = p (where p p p is prime), then G G G has no non-trivial proper subgroups. Every non-identity element g ≠ e g \neq e g = e generates G G G , meaning G G G is cyclic and isomorphic to Z p \mathbb{Z}_p Z p .
Converse of Lagrange's Theorem is False: If d d d divides ∣ G ∣ |G| ∣ G ∣ , G G G does not necessarily have a subgroup of order d d d . The standard counterexample is the alternating group A 4 A_4 A 4 : ∣ A 4 ∣ = 12 |A_4| = 12 ∣ A 4 ∣ = 12 , and 6 divides 12, but A 4 A_4 A 4 contains no subgroup of order 6 .
Normal Subgroups and Quotient Groups
A subgroup N ≤ G N \le G N ≤ G is a normal subgroup (written N ⊴ G N \trianglelefteq G N ⊴ G ) if it is invariant under conjugation by all elements of G G G : g N g − 1 = N for all g ∈ G gNg^{-1} = N \quad \text{for all } g \in G g N g − 1 = N for all g ∈ G
Equivalent Conditions for Normality
For every g ∈ G g \in G g ∈ G , g N g − 1 ⊆ N gNg^{-1} \subseteq N g N g − 1 ⊆ N .
Left cosets coincide with right cosets: g N = N g gN = Ng g N = N g for all g ∈ G g \in G g ∈ G .
N N N is the kernel of a group homomorphism with domain G G G .
Subgroups of Index 2 Are Always Normal
If [ G : H ] = 2 [G : H] = 2 [ G : H ] = 2 , then H ⊴ G H \trianglelefteq G H ⊴ G . Proof: The left cosets partition G G G into H H H and G ∖ H G \setminus H G ∖ H . The right cosets also partition G G G into H H H and G ∖ H G \setminus H G ∖ H . For any g ∉ H g \notin H g ∈ / H , g H = G ∖ H = H g gH = G \setminus H = Hg g H = G ∖ H = H g . For g ∈ H g \in H g ∈ H , g H = H = H g gH = H = Hg g H = H = H g . Thus g H = H g gH = Hg g H = H g for all g ∈ G g \in G g ∈ G . Example: A n ⊴ S n A_n \trianglelefteq S_n A n ⊴ S n because [ S n : A n ] = n ! / ( n ! / 2 ) = 2 [S_n : A_n] = n! / (n!/2) = 2 [ S n : A n ] = n ! / ( n ! /2 ) = 2 .
The Quotient Group G / N G/N G / N
When N ⊴ G N \trianglelefteq G N ⊴ G , the set of cosets G / N = { g N : g ∈ G } G/N = \{gN : g \in G\} G / N = { g N : g ∈ G } forms a group under the operation: ( a N ) ( b N ) = ( a b ) N (aN)(bN) = (ab)N ( a N ) ( b N ) = ( ab ) N
Well-Definedness: Normality of N N N is required to ensure that ( a n 1 ) ( b n 2 ) ∈ a b N (an_1)(bn_2) \in abN ( a n 1 ) ( b n 2 ) ∈ ab N regardless of the chosen coset representatives.
Group Data: The identity element is e N = N eN = N e N = N , and the inverse is ( a N ) − 1 = a − 1 N (aN)^{-1} = a^{-1}N ( a N ) − 1 = a − 1 N .
Order: ∣ G / N ∣ = [ G : N ] = ∣ G ∣ / ∣ N ∣ |G/N| = [G : N] = |G|/|N| ∣ G / N ∣ = [ G : N ] = ∣ G ∣/∣ N ∣ .
Center of a Group and the G / Z ( G ) G/Z(G) G / Z ( G ) Theorem
The center Z ( G ) = { z ∈ G : z g = g z for all g ∈ G } Z(G) = \{z \in G : zg = gz \text{ for all } g \in G\} Z ( G ) = { z ∈ G : z g = g z for all g ∈ G } is always a normal abelian subgroup of G G G .
The G / Z ( G ) G/Z(G) G / Z ( G ) Cyclic Theorem
If the quotient group G / Z ( G ) G/Z(G) G / Z ( G ) is cyclic , then G G G is abelian (and hence G = Z ( G ) G = Z(G) G = Z ( G ) ). Proof: Let G / Z ( G ) = ⟨ g Z ( G ) ⟩ G/Z(G) = \langle g Z(G) \rangle G / Z ( G ) = ⟨ g Z ( G )⟩ . Every x , y ∈ G x, y \in G x , y ∈ G can be expressed as x = g i z 1 x = g^i z_1 x = g i z 1 and y = g j z 2 y = g^j z_2 y = g j z 2 for z 1 , z 2 ∈ Z ( G ) z_1, z_2 \in Z(G) z 1 , z 2 ∈ Z ( G ) . Then x y = g i z 1 g j z 2 = g i + j z 1 z 2 = g j + i z 2 z 1 = g j z 2 g i z 1 = y x xy = g^i z_1 g^j z_2 = g^{i+j} z_1 z_2 = g^{j+i} z_2 z_1 = g^j z_2 g^i z_1 = yx x y = g i z 1 g j z 2 = g i + j z 1 z 2 = g j + i z 2 z 1 = g j z 2 g i z 1 = y x .
Prime-Power Center Property
If G G G is a finite p p p -group (order p n p^n p n with p p p prime and n ≥ 1 n \ge 1 n ≥ 1 ), its center is non-trivial: ∣ Z ( G ) ∣ > 1 |Z(G)| > 1 ∣ Z ( G ) ∣ > 1 .
Groups of order p 2 p^2 p 2 : Since ∣ Z ( G ) ∣ ∈ { p , p 2 } |Z(G)| \in \{p, p^2\} ∣ Z ( G ) ∣ ∈ { p , p 2 } , if ∣ Z ( G ) ∣ = p |Z(G)| = p ∣ Z ( G ) ∣ = p , then ∣ G / Z ( G ) ∣ = p |G/Z(G)| = p ∣ G / Z ( G ) ∣ = p , making G / Z ( G ) G/Z(G) G / Z ( G ) cyclic. By the theorem above, this forces G G G to be abelian, contradicting ∣ Z ( G ) ∣ = p |Z(G)| = p ∣ Z ( G ) ∣ = p . Thus ∣ Z ( G ) ∣ = p 2 |Z(G)| = p^2 ∣ Z ( G ) ∣ = p 2 , proving that every group of order p 2 p^2 p 2 is abelian (isomorphic to either Z p 2 \mathbb{Z}_{p^2} Z p 2 or Z p × Z p \mathbb{Z}_p \times \mathbb{Z}_p Z p × Z p ).
Group Homomorphisms and the First Isomorphism Theorem
A map ϕ : G → H \phi: G \to H ϕ : G → H between groups is a homomorphism if for all a , b ∈ G a, b \in G a , b ∈ G : ϕ ( a b ) = ϕ ( a ) ϕ ( b ) \phi(ab) = \phi(a)\phi(b) ϕ ( ab ) = ϕ ( a ) ϕ ( b )
Basic Identities: ϕ ( e G ) = e H \phi(e_G) = e_H ϕ ( e G ) = e H , ϕ ( a − 1 ) = ( ϕ ( a ) ) − 1 \phi(a^{-1}) = (\phi(a))^{-1} ϕ ( a − 1 ) = ( ϕ ( a ) ) − 1 , and ∣ ϕ ( a ) ∣ |\phi(a)| ∣ ϕ ( a ) ∣ divides ∣ a ∣ |a| ∣ a ∣ .
Kernel: ker ( ϕ ) = { g ∈ G : ϕ ( g ) = e H } \ker(\phi) = \{g \in G : \phi(g) = e_H\} ker ( ϕ ) = { g ∈ G : ϕ ( g ) = e H } . The kernel is always a normal subgroup of G G G ( ker ( ϕ ) ⊴ G \ker(\phi) \trianglelefteq G ker ( ϕ ) ⊴ G ).
Injectivity Criterion: ϕ \phi ϕ is injective (a monomorphism) if and only if ker ( ϕ ) = { e G } \ker(\phi) = \{e_G\} ker ( ϕ ) = { e G } .
Image: im ( ϕ ) = ϕ ( G ) = { ϕ ( g ) : g ∈ G } \operatorname{im}(\phi) = \phi(G) = \{\phi(g) : g \in G\} im ( ϕ ) = ϕ ( G ) = { ϕ ( g ) : g ∈ G } is a subgroup of H H H .
The First Isomorphism Theorem for Groups
If ϕ : G → H \phi: G \to H ϕ : G → H is a group homomorphism, then: G / ker ( ϕ ) ≅ im ( ϕ ) G / \ker(\phi) \cong \operatorname{im}(\phi) G / ker ( ϕ ) ≅ im ( ϕ )
The isomorphism is given by g ker ( ϕ ) ↦ ϕ ( g ) g\ker(\phi) \mapsto \phi(g) g ker ( ϕ ) ↦ ϕ ( g ) .
Cayley's Theorem
Every group G G G is isomorphic to a subgroup of the symmetric group Sym ( G ) \operatorname{Sym}(G) Sym ( G ) on the set G G G . The embedding maps g ∈ G g \in G g ∈ G to the left-multiplication permutation λ g ( x ) = g x \lambda_g(x) = gx λ g ( x ) = gx .
Subgroups, Normality, and Quotients Summary
Concept Defining Condition Key Properties
Subgroup H ≤ G H \le G H ≤ G Closed under operation and inverses Lagrange: ∣ H ∣ ∣ ∣ G ∣ \vert H\vert\mid \vert G\vert ∣ H ∣ ∣ ∣ G ∣ ; cosets partition G G G
Index [ G : H ] [G : H] [ G : H ] Number of distinct cosets ∣ G ∣ = [ G : H ] ⋅ ∣ H ∣ \vert G\vert= [G : H] \cdot \vert H\vert ∣ G ∣ = [ G : H ] ⋅ ∣ H ∣
Normal N ⊴ G N \trianglelefteq G N ⊴ G g N g − 1 = N gNg^{-1} = N g N g − 1 = N for all g ∈ G g \in G g ∈ G [ G : N ] = 2 ⟹ N ⊴ G [G : N] = 2 \implies N \trianglelefteq G [ G : N ] = 2 ⟹ N ⊴ G ; kernels of homomorphisms
Quotient G / N G/N G / N Coset multiplication ( a N ) ( b N ) = a b N (aN)(bN) = abN ( a N ) ( b N ) = ab N Well-defined iff N N N normal; order is [ G : N ] [G : N] [ G : N ]
First Isom. Thm. ϕ : G → H \phi: G \to H ϕ : G → H homomorphism G / ker ( ϕ ) ≅ im ( ϕ ) G/\ker(\phi) \cong \operatorname{im}(\phi) G / ker ( ϕ ) ≅ im ( ϕ )
Step-by-Step Worked Problem
Problem: Determine all group homomorphisms ϕ : Z 24 → Z 18 \phi: \mathbb{Z}_{24} \to \mathbb{Z}_{18} ϕ : Z 24 → Z 18 . For the non-trivial homomorphism satisfying ϕ ( 1 ) = 6 \phi(1) = 6 ϕ ( 1 ) = 6 , compute its kernel, image, and verify the First Isomorphism Theorem.
Solution:
Step 1: Determine all homomorphisms. Since Z 24 \mathbb{Z}_{24} Z 24 is cyclic generated by 1 1 1 , any homomorphism ϕ \phi ϕ is completely determined by ϕ ( 1 ) = k ∈ Z 18 \phi(1) = k \in \mathbb{Z}_{18} ϕ ( 1 ) = k ∈ Z 18 . The condition that ϕ \phi ϕ is a well-defined group homomorphism is that the order of ϕ ( 1 ) \phi(1) ϕ ( 1 ) in Z 18 \mathbb{Z}_{18} Z 18 must divide ∣ 1 ∣ = 24 |1| = 24 ∣1∣ = 24 , which is equivalent to: 24 k ≡ 0 ( m o d 18 ) 24k \equiv 0 \pmod{18} 24 k ≡ 0 ( mod 18 )
Divide by gcd ( 24 , 18 ) = 6 \gcd(24, 18) = 6 g cd ( 24 , 18 ) = 6 : 4 k ≡ 0 ( m o d 3 ) ⟺ k ≡ 0 ( m o d 3 ) 4k \equiv 0 \pmod 3 \iff k \equiv 0 \pmod 3 4 k ≡ 0 ( mod 3 ) ⟺ k ≡ 0 ( mod 3 )
In Z 18 \mathbb{Z}_{18} Z 18 , the multiples of 3 are { 0 , 3 , 6 , 9 , 12 , 15 } \{0, 3, 6, 9, 12, 15\} { 0 , 3 , 6 , 9 , 12 , 15 } . Thus, there are exactly gcd ( 24 , 18 ) = 6 \gcd(24, 18) = 6 g cd ( 24 , 18 ) = 6 distinct homomorphisms.
Step 2: Analyze ϕ ( 1 ) = 6 \phi(1) = 6 ϕ ( 1 ) = 6 .
Image: The image is the cyclic subgroup generated by 6 6 6 in Z 18 \mathbb{Z}_{18} Z 18 : im ( ϕ ) = ⟨ 6 ⟩ = { 0 , 6 , 12 } ≤ Z 18 ⟹ ∣ im ( ϕ ) ∣ = 3 \operatorname{im}(\phi) = \langle 6 \rangle = \{0, 6, 12\} \le \mathbb{Z}_{18} \quad \implies |\operatorname{im}(\phi)| = 3 im ( ϕ ) = ⟨ 6 ⟩ = { 0 , 6 , 12 } ≤ Z 18 ⟹ ∣ im ( ϕ ) ∣ = 3
Kernel: ker ( ϕ ) = { x ∈ Z 24 : ϕ ( x ) = 6 x ≡ 0 ( m o d 18 ) } \ker(\phi) = \{x \in \mathbb{Z}_{24} : \phi(x) = 6x \equiv 0 \pmod{18}\} ker ( ϕ ) = { x ∈ Z 24 : ϕ ( x ) = 6 x ≡ 0 ( mod 18 )} . 18 ∣ 6 x ⟺ 3 ∣ x 18 \mid 6x \iff 3 \mid x 18 ∣ 6 x ⟺ 3 ∣ x
Thus ker ( ϕ ) = 3 Z 24 = { 0 , 3 , 6 , 9 , 12 , 15 , 18 , 21 } \ker(\phi) = 3\mathbb{Z}_{24} = \{0, 3, 6, 9, 12, 15, 18, 21\} ker ( ϕ ) = 3 Z 24 = { 0 , 3 , 6 , 9 , 12 , 15 , 18 , 21 } , so ∣ ker ( ϕ ) ∣ = 8 |\ker(\phi)| = 8 ∣ ker ( ϕ ) ∣ = 8 .
Verify First Isomorphism Theorem: ∣ Z 24 / ker ( ϕ ) ∣ = 24 8 = 3 = ∣ im ( ϕ ) ∣ |\mathbb{Z}_{24} / \ker(\phi)| = \frac{24}{8} = 3 = |\operatorname{im}(\phi)| ∣ Z 24 / ker ( ϕ ) ∣ = 8 24 = 3 = ∣ im ( ϕ ) ∣
Both Z 24 / ker ( ϕ ) \mathbb{Z}_{24} / \ker(\phi) Z 24 / ker ( ϕ ) and im ( ϕ ) \operatorname{im}(\phi) im ( ϕ ) are cyclic groups of order 3, confirming Z 24 / ker ( ϕ ) ≅ Z 3 ≅ im ( ϕ ) \mathbb{Z}_{24} / \ker(\phi) \cong \mathbb{Z}_3 \cong \operatorname{im}(\phi) Z 24 / ker ( ϕ ) ≅ Z 3 ≅ im ( ϕ ) .
GRE Exam Traps & Pitfalls
Trap 1: Transitivity of Normality Fails If K ⊴ H K \trianglelefteq H K ⊴ H and H ⊴ G H \trianglelefteq G H ⊴ G , it is not generally true that K ⊴ G K \trianglelefteq G K ⊴ G . In the dihedral group D 4 D_4 D 4 , a reflection subgroup of order 2 is normal in V 4 ≤ D 4 V_4 \le D_4 V 4 ≤ D 4 , but is not normal in D 4 D_4 D 4 .
Trap 2: Multiplying Cosets of Non-Normal Subgroups If H H H is not normal in G G G , the product set ( a H ) ( b H ) (aH)(bH) ( a H ) ( b H ) is typically a union of multiple cosets rather than a single coset. The coset space G / H G/H G / H does not form a group.
Trap 3: Assuming Element Orders Are Preserved by Homomorphisms A homomorphism only guarantees that ∣ ϕ ( a ) ∣ |\phi(a)| ∣ ϕ ( a ) ∣ divides ∣ a ∣ |a| ∣ a ∣ . For example, the trivial homomorphism maps all elements to e e e , so ∣ ϕ ( a ) ∣ = 1 |\phi(a)| = 1 ∣ ϕ ( a ) ∣ = 1 for all a a a .
Trap 4: Misapplying the G / Z ( G ) G/Z(G) G / Z ( G ) Cyclic Theorem If G / Z ( G ) G/Z(G) G / Z ( G ) is non-cyclic (such as D 4 / Z ( D 4 ) ≅ V 4 D_4 / Z(D_4) \cong V_4 D 4 / Z ( D 4 ) ≅ V 4 ), G G G can be non-abelian. The theorem only establishes that a cyclic quotient forces G G G to be abelian.