Study guide
10.1 Groups, Subgroups, and Permutations
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.1 Groups, Subgroups, and Permutations
Key Takeaways Explain This Topic AI
A group (G, *) satisfies closure, associativity, identity, and inverses; an abelian group satisfies commutativity.
In a cyclic group of finite order n, an element a^k has order n / gcd(n, k), the number of generators is phi(n), and for every divisor d of n there exists a unique subgroup of order d.
The Subgroup Tests establish whether H is a subgroup of G: the one-step test requires ab^{-1} in H, while for finite subsets H, closure under the group operation alone is sufficient.
Every permutation in the symmetric group S_n decomposes uniquely into disjoint cycles, whose order is the least common multiple of their lengths; a k-cycle has sign (-1)^{k-1}, making odd-length cycles even and even-length cycles odd.
The dihedral group D_n of order 2n consists of n rotations and n reflections (all of order 2); the Klein four-group V_4 is the smallest non-cyclic group, isomorphic to Z_2 x Z_2.
Last updated: September 2026
10.1 Groups, Subgroups, and Permutations
Group theory forms the bedrock of modern abstract algebra. On the GRE Mathematics Subject Test, questions test structural properties of groups, subgroup criteria, cyclic generators, permutation order and sign calculations in S n S_n S n and A n A_n A n , and geometric symmetry groups such as D n D_n D n .
Group Axioms and Core Properties
A group ( G , ∗ ) (G, *) ( G , ∗ ) is a set G G G equipped with a binary operation ∗ : G × G → G *: G \times G \to G ∗ : G × G → G satisfying four fundamental axioms:
Closure: For all a , b ∈ G a, b \in G a , b ∈ G , a ∗ b ∈ G a * b \in G a ∗ b ∈ G .
Associativity: For all a , b , c ∈ G a, b, c \in G a , b , c ∈ G , ( a ∗ b ) ∗ c = a ∗ ( b ∗ c ) (a * b) * c = a * (b * c) ( a ∗ b ) ∗ c = a ∗ ( b ∗ c ) .
Identity Element: There exists an element e ∈ G e \in G e ∈ G such that for all a ∈ G a \in G a ∈ G , e ∗ a = a ∗ e = a e * a = a * e = a e ∗ a = a ∗ e = a .
Inverse Element: For each a ∈ G a \in G a ∈ G , there exists an element a − 1 ∈ G a^{-1} \in G a − 1 ∈ G such that a ∗ a − 1 = a − 1 ∗ a = e a * a^{-1} = a^{-1} * a = e a ∗ a − 1 = a − 1 ∗ a = e .
If the operation additionally satisfies commutativity ( a ∗ b = b ∗ a a * b = b * a a ∗ b = b ∗ a for all a , b ∈ G a, b \in G a , b ∈ G ), the group is termed abelian (or commutative).
Elementary Deductions
Uniqueness: Both the identity element e e e and the inverse a − 1 a^{-1} a − 1 of any element a ∈ G a \in G a ∈ G are unique.
Shoes and Socks Property: ( a ∗ b ) − 1 = b − 1 ∗ a − 1 (a * b)^{-1} = b^{-1} * a^{-1} ( a ∗ b ) − 1 = b − 1 ∗ a − 1 .
Cancellation Laws: Left cancellation ( a ∗ b = a ∗ c ⟹ b = c a * b = a * c \implies b = c a ∗ b = a ∗ c ⟹ b = c ) and right cancellation ( b ∗ a = c ∗ a ⟹ b = c b * a = c * a \implies b = c b ∗ a = c ∗ a ⟹ b = c ) hold universally in any group.
Order of a Group and Element: The order of a group ∣ G ∣ |G| ∣ G ∣ is its cardinality. The order of an element g ∈ G g \in G g ∈ G , denoted ∣ g ∣ |g| ∣ g ∣ or ord ( g ) \operatorname{ord}(g) ord ( g ) , is the smallest positive integer n n n such that g n = e g^n = e g n = e . If no such positive integer exists, g g g has infinite order. A critical divisibility property states: g k = e ⟺ ∣ g ∣ ∣ k g^k = e \iff |g| \mid k g k = e ⟺ ∣ g ∣ ∣ k
Furthermore, for any integer k k k , ∣ g k ∣ = ∣ g ∣ gcd ( ∣ g ∣ , k ) |g^k| = \frac{|g|}{\gcd(|g|, k)} ∣ g k ∣ = g c d ( ∣ g ∣ , k ) ∣ g ∣ .
Subgroups and Subgroup Tests
A subset H ⊆ G H \subseteq G H ⊆ G is a subgroup (written H ≤ G H \le G H ≤ G ) if H H H forms a group under the operation inherited from G G G . Every group G G G has trivial subgroups { e } \{e\} { e } and G G G itself; any other subgroup is proper.
Subgroup Tests
To establish whether a non-empty subset H ⊆ G H \subseteq G H ⊆ G is a subgroup, full verification of the four axioms is unnecessary:
Two-Step Subgroup Test: H ≤ G H \le G H ≤ G if and only if:
For all a , b ∈ H a, b \in H a , b ∈ H , a b ∈ H ab \in H ab ∈ H (closed under multiplication).
For all a ∈ H a \in H a ∈ H , a − 1 ∈ H a^{-1} \in H a − 1 ∈ H (closed under inverses).
One-Step Subgroup Test: H ≤ G H \le G H ≤ G if and only if for all a , b ∈ H a, b \in H a , b ∈ H , a b − 1 ∈ H ab^{-1} \in H a b − 1 ∈ H .
Finite Subgroup Test: If H H H is a finite non-empty subset of a group G G G , then H ≤ G H \le G H ≤ G if and only if H H H is closed under multiplication ( a , b ∈ H ⟹ a b ∈ H a, b \in H \implies ab \in H a , b ∈ H ⟹ ab ∈ H ). Inverses are automatically guaranteed because the sequence of powers a , a 2 , a 3 , … a, a^2, a^3, \dots a , a 2 , a 3 , … must repeat by the pigeonhole principle, yielding a k = e a^k = e a k = e and hence a − 1 = a k − 1 ∈ H a^{-1} = a^{k-1} \in H a − 1 = a k − 1 ∈ H .
Important Canonical Subgroups
Center of G G G : 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 } . The center is always an abelian subgroup of G G G .
Centralizer of an element: C G ( a ) = { g ∈ G : g a = a g } C_G(a) = \{g \in G : ga = ag\} C G ( a ) = { g ∈ G : g a = a g } .
Normalizer of a subgroup: N G ( H ) = { g ∈ G : g H g − 1 = H } N_G(H) = \{g \in G : gHg^{-1} = H\} N G ( H ) = { g ∈ G : g H g − 1 = H } .
Cyclic Groups and Their Subgroups
A group G G G is cyclic if there exists an element a ∈ G a \in G a ∈ G such that G = ⟨ a ⟩ = { a k : k ∈ Z } G = \langle a \rangle = \{a^k : k \in \mathbb{Z}\} G = ⟨ a ⟩ = { a k : k ∈ Z } . The element a a a is called a generator .
Classification of Cyclic Groups
Every infinite cyclic group is isomorphic to ( Z , + ) (\mathbb{Z}, +) ( Z , + ) , and every finite cyclic group of order n n n is isomorphic to ( Z n , + ) (\mathbb{Z}_n, +) ( Z n , + ) .
Fundamental Theorem of Cyclic Groups
Let G = ⟨ a ⟩ G = \langle a \rangle G = ⟨ a ⟩ be a cyclic group of order n n n :
Subgroup Characterization: Every subgroup of G G G is cyclic.
Divisor Correspondence: For each positive divisor d d d of n n n , there exists exactly one subgroup of order d d d , specifically generated by a n / d a^{n/d} a n / d .
Generators: An element a k a^k a k generates G G G if and only if gcd ( k , n ) = 1 \gcd(k, n) = 1 g cd ( k , n ) = 1 . Consequently, the total number of generators of Z n \mathbb{Z}_n Z n is given by Euler's totient function ϕ ( n ) \phi(n) ϕ ( n ) .
Elements of Order d d d : For any divisor d d d of n n n , the number of elements in G G G of order exactly d d d is ϕ ( d ) \phi(d) ϕ ( d ) .
Symmetric Groups S n S_n S n and Alternating Groups A n A_n A n
The symmetric group S n S_n S n is the group of all bijections (permutations) from the set { 1 , 2 , … , n } \{1, 2, \dots, n\} { 1 , 2 , … , n } to itself under function composition. The order of S n S_n S n is ∣ S n ∣ = n ! |S_n| = n! ∣ S n ∣ = n ! . For n ≥ 3 n \ge 3 n ≥ 3 , S n S_n S n is non-abelian.
Disjoint Cycle Decomposition
A k k k -cycle ( a 1 a 2 … a k ) (a_1\ a_2\ \dots\ a_k) ( a 1 a 2 … a k ) maps a 1 ↦ a 2 , … , a k ↦ a 1 a_1 \mapsto a_2, \dots, a_k \mapsto a_1 a 1 ↦ a 2 , … , a k ↦ a 1 , leaving other elements fixed. Two cycles are disjoint if they share no moved elements.
Disjoint cycles commute: If σ \sigma σ and τ \tau τ are disjoint cycles, σ τ = τ σ \sigma\tau = \tau\sigma σ τ = τ σ .
Canonical Factorization: Every permutation σ ∈ S n \sigma \in S_n σ ∈ S n can be factored uniquely (up to the order of factors) as a product of disjoint cycles.
Order via LCM: The order of a permutation σ \sigma σ written in disjoint cycle form is the least common multiple of the lengths of its cycles: ord ( σ ) = lcm ( ℓ 1 , ℓ 2 , … , ℓ m ) \operatorname{ord}(\sigma) = \operatorname{lcm}(\ell_1, \ell_2, \dots, \ell_m) ord ( σ ) = lcm ( ℓ 1 , ℓ 2 , … , ℓ m )
Transpositions, Parity, and A n A_n A n
A transposition is a 2-cycle ( i j ) (i\ j) ( i j ) . Every permutation can be expressed as a product of transpositions.
While the factors and number of transpositions are not unique, the parity (even or odd) of the number of transpositions is invariant.
A cycle of length k k k can be written as the product of k − 1 k - 1 k − 1 transpositions: ( a 1 a 2 … a k ) = ( a 1 a k ) ( a 1 a k − 1 ) … ( a 1 a 2 ) (a_1\ a_2\ \dots\ a_k) = (a_1\ a_k)(a_1\ a_{k-1})\dots(a_1\ a_2) ( a 1 a 2 … a k ) = ( a 1 a k ) ( a 1 a k − 1 ) … ( a 1 a 2 ) .
Sign Homomorphism: sgn : S n → { + 1 , − 1 } \operatorname{sgn}: S_n \to \{+1, -1\} sgn : S n → { + 1 , − 1 } satisfies sgn ( k -cycle ) = ( − 1 ) k − 1 \operatorname{sgn}(k\text{-cycle}) = (-1)^{k-1} sgn ( k -cycle ) = ( − 1 ) k − 1 .
An odd-length cycle is an even permutation .
An even-length cycle is an odd permutation .
The alternating group A n A_n A n is the set of all even permutations in S n S_n S n . It is a subgroup of order ∣ A n ∣ = n ! 2 |A_n| = \frac{n!}{2} ∣ A n ∣ = 2 n ! . For n ≥ 5 n \ge 5 n ≥ 5 , A n A_n A n is a simple group (having no non-trivial proper normal subgroups).
Dihedral Groups and Small Group Classification
The dihedral group D n D_n D n represents the group of symmetries of a regular n n n -sided polygon in the plane, containing n n n rotations and n n n reflections. Its order is ∣ D n ∣ = 2 n |D_n| = 2n ∣ D n ∣ = 2 n .
Generators and Relations: D n = ⟨ r , s ∣ r n = e , s 2 = e , s r s = r − 1 ⟩ D_n = \langle r, s \mid r^n = e,\ s^2 = e,\ srs = r^{-1} \rangle D n = ⟨ r , s ∣ r n = e , s 2 = e , srs = r − 1 ⟩ .
The n n n rotations form a cyclic subgroup ⟨ r ⟩ ≅ Z n \langle r \rangle \cong \mathbb{Z}_n ⟨ r ⟩ ≅ Z n of index 2.
Every reflection has the form s r k sr^k s r k and satisfies ( s r k ) 2 = e (sr^k)^2 = e ( s r k ) 2 = e , meaning all n n n reflections have order 2 .
Small Group Landscape ( ∣ G ∣ ≤ 8 |G| \le 8 ∣ G ∣ ≤ 8 )
- Order ∣ G ∣ \vert G\vert ∣ G ∣ Abelian Groups Non-Abelian Groups Key Properties
- 1 { e } \{e\} { e } None Trivial group
- 2 Z 2 \mathbb{Z}_2 Z 2 None Prime order, cyclic
- 3 Z 3 \mathbb{Z}_3 Z 3 None Prime order, cyclic
4 Z 4 , V 4 ≅ Z 2 × Z 2 \mathbb{Z}_4, V_4 \cong \mathbb{Z}_2 \times \mathbb{Z}_2 Z 4 , V 4 ≅ Z 2 × Z 2 None V 4 V_4 V 4 is Klein four-group; every non-identity has order 2
5 Z 5 \mathbb{Z}_5 Z 5 None Prime order, cyclic
6 Z 6 ≅ Z 2 × Z 3 \mathbb{Z}_6 \cong \mathbb{Z}_2 \times \mathbb{Z}_3 Z 6 ≅ Z 2 × Z 3 S 3 ≅ D 3 S_3 \cong D_3 S 3 ≅ D 3 Smallest non-abelian group; ∣ S 3 ∣ = 6 \vert S_3\vert= 6 ∣ S 3 ∣ = 6
7 Z 7 \mathbb{Z}_7 Z 7 None Prime order, cyclic
8 Z 8 , Z 4 × Z 2 , Z 2 3 \mathbb{Z}_8, \mathbb{Z}_4 \times \mathbb{Z}_2, \mathbb{Z}_2^3 Z 8 , Z 4 × Z 2 , Z 2 3 D 4 , Q 8 D_4, Q_8 D 4 , Q 8 Q 8 = { ± 1 , ± i , ± j , ± k } Q_8 = \{\pm 1, \pm i, \pm j, \pm k\} Q 8 = { ± 1 , ± i , ± j , ± k } has 6 elements of order 4
Step-by-Step Worked Problem
Problem: In the symmetric group S 7 S_7 S 7 :
Determine the maximum possible order of an element.
Count the number of elements of order 10 in S 7 S_7 S 7 .
Solution:
Step 1: Partitioning 7 to maximize LCM. The order of any σ ∈ S 7 \sigma \in S_7 σ ∈ S 7 is lcm ( c 1 , … , c k ) \operatorname{lcm}(c_1, \dots, c_k) lcm ( c 1 , … , c k ) where ∑ c i ≤ 7 \sum c_i \le 7 ∑ c i ≤ 7 .
Testing candidate integer partitions of integers ≤ 7 \le 7 ≤ 7 :
7 7 7 : order 7 7 7 .
5 + 2 5 + 2 5 + 2 : order lcm ( 5 , 2 ) = 10 \operatorname{lcm}(5, 2) = 10 lcm ( 5 , 2 ) = 10 .
4 + 3 4 + 3 4 + 3 : order lcm ( 4 , 3 ) = 12 \operatorname{lcm}(4, 3) = 12 lcm ( 4 , 3 ) = 12 .
3 + 2 + 2 3 + 2 + 2 3 + 2 + 2 : order lcm ( 3 , 2 , 2 ) = 6 \operatorname{lcm}(3, 2, 2) = 6 lcm ( 3 , 2 , 2 ) = 6 .
The maximum possible element order in S 7 S_7 S 7 is 12 , achieved by any permutation with cycle structure ( 3 , 4 ) (3, 4) ( 3 , 4 ) .
Step 2: Counting elements of order 10. To achieve order 10, the cycle lengths must have lcm = 10 \operatorname{lcm} = 10 lcm = 10 and sum ≤ 7 \le 7 ≤ 7 . The unique cycle structure is a disjoint product of a 5-cycle and a 2-cycle ( 5 + 2 = 7 5 + 2 = 7 5 + 2 = 7 ).
Choose 5 elements from 7 for the 5-cycle: ( 7 5 ) = 7 × 6 2 = 21 \binom{7}{5} = \frac{7 \times 6}{2} = 21 ( 5 7 ) = 2 7 × 6 = 21 .
The number of distinct circular arrangements of 5 elements is ( 5 − 1 ) ! = 4 ! = 24 (5 - 1)! = 4! = 24 ( 5 − 1 )! = 4 ! = 24 .
The remaining 2 elements form a unique transposition: ( 2 − 1 ) ! = 1 (2 - 1)! = 1 ( 2 − 1 )! = 1 .
Total count: 21 × 24 × 1 = 504 21 \times 24 \times 1 = 504 21 × 24 × 1 = 504 elements of order 10.
GRE Exam Traps & Pitfalls
Trap 1: Cycle Length Parity vs. Permutation Parity A cycle of length k k k has sign ( − 1 ) k − 1 (-1)^{k-1} ( − 1 ) k − 1 . A 3-cycle is an even permutation ( ( − 1 ) 2 = + 1 (-1)^2 = +1 ( − 1 ) 2 = + 1 ), whereas a 2-cycle (transposition) is odd ( ( − 1 ) 1 = − 1 (-1)^1 = -1 ( − 1 ) 1 = − 1 ). Do not assume an odd-length cycle is an odd permutation.
Trap 2: Adding Cycle Lengths Instead of Taking LCM The order of ( 1 2 ) ( 3 4 5 ) (1\ 2)(3\ 4\ 5) ( 1 2 ) ( 3 4 5 ) is lcm ( 2 , 3 ) = 6 \operatorname{lcm}(2, 3) = 6 lcm ( 2 , 3 ) = 6 , never 2 + 3 = 5 2 + 3 = 5 2 + 3 = 5 . Sums dictate the ambient index n n n in S n S_n S n ; LCM dictates element order.
Trap 3: Assuming Non-Cyclic Implies Non-Abelian The Klein four-group V 4 ≅ Z 2 × Z 2 V_4 \cong \mathbb{Z}_2 \times \mathbb{Z}_2 V 4 ≅ Z 2 × Z 2 is abelian, but it has no element of order 4 and is therefore not cyclic.
Trap 4: Subgroup Order Divisibility Converse Lagrange's theorem asserts that if H ≤ G H \le G H ≤ G , then ∣ H ∣ ∣ ∣ G ∣ |H| \mid |G| ∣ H ∣ ∣ ∣ G ∣ . However, if d ∣ ∣ G ∣ d \mid |G| d ∣ ∣ G ∣ , G G G does not necessarily possess a subgroup of order d d d . The alternating group A 4 A_4 A 4 has order 12, but has no subgroup of order 6.