6. Abstract Algebra

Subgroups

A subgroup is a subset of a group that is itself a group under the induced binary operation, forming the foundational structural building block in abstract algebra.

For: UP PGT Mathematics UP TGT Mathematics DSSSB PGT / TGT KVS / NVS PGT LT Grade

📖 Topic progress

○ Mark as complete

Definition and statement

Two-Step Subgroup Test / Fundamental Subgroup Criterion

Let $G$ be a group and $H$ be a non-empty subset of $G$. Then $H$ is a subgroup of $G$ (denoted $H \le G$) if and only if: (i) $\forall a, b \in H$, $ab \in H$ (Closure under operation), and (ii) $\forall a \in H$, $a^{-1} \in H$ (Inverse closure).

📐 Geometric Interpretation

Subgroups represent self-contained symmetry systems within a larger geometric transformation group, preserving the origin and group composition laws on a restricted subset.

⚙️ Algebraic & Structural Meaning

Allows the decomposition of complex algebraic structures into smaller, manageable algebraic entities, paving the way for coset decomposition and Lagrange's Theorem.

Conditions and hypotheses

Check each condition and what changes when it is omitted:

Hypothesis / Condition	Domain / Interval	Necessity	What Fails If Condition Dropped
Non-Emptiness ($H \neq \emptyset$)	`Subset of group elements`	Strictly Mandatory / Necessary	An empty set cannot contain the identity element, violating the group axiom requiring an identity.
Closure under Group Operation	`Binary operation defined on $G$`	Strictly Mandatory	The operation leads outside the subset $H$, failing to yield a well-defined binary algebraic structure.
Existence of Inverse for Every Element	`Unary inversion operation in $G$`	Essential for group axioms	Without inverses, the algebraic system collapses from a group to merely a monoid or semigroup.

Useful results and shortcuts

Use these identities and results when their conditions apply:

Finite Subgroup Test

$$H \subseteq G \text{ (finite), } H \neq \emptyset, \; \forall a, b \in H \implies ab \in H \implies H \le G$$

Rule: If a subset $H$ of a finite group $G$ is closed under the binary operation, it is automatically a subgroup. Inverse closure is redundant for finite subsets.

Application: Directly tested in UP PGT and KVS PGT to quickly verify subset group structures without computing inverses.

One-Step Subgroup Test

$$H \le G \iff \forall a, b \in H, \; ab^{-1} \in H$$

Rule: Combine closure and inverse checks into a single inequality or equation test $ab^{-1} \in H$ for non-empty $H$.

Application: Extensively used in DSSSB and UP TGT vector/matrix group problems to save 60% calculation time.

Lagrange's Theorem Divisibility

$$H \le G \implies |H| \text{ divides } |G|$$

Rule: The order of any subgroup must divide the order of the finite group. Instantly eliminate any option whose purported subgroup order does not divide $|G|$.

Intersection of Subgroups

$$H_1, H_2 \le G \implies H_1 \cap H_2 \le G$$

Rule: The arbitrary intersection of subgroups is always a subgroup. Union, however, is a subgroup if and only if one is contained in the other.

Center of a Group

$$Z(G) = \{x \in G \mid xg = gx, \forall g \in G\} \le G$$

Rule: The center $Z(G)$ is always a subgroup of $G$. For abelian groups, $Z(G) = G$.

Application: Use this result in the stated type of problem.

Cyclic Subgroup Generator Order

$|\langle a \rangle| = \text{order of } a \text{ in } G$

Rule: The order of the cyclic subgroup generated by an element equals the order of that element. In finite groups, order divides group order.

Common errors and counterexamples

These examples show how a conclusion can fail when a condition is missing:

⚠️ COMMON ERROR #01

The Subgroup Union Fallacy

Common Pitfall: Candidates assume that the union of two subgroups is always a subgroup.

Counterexample: $2\mathbb{Z} \cup 3\mathbb{Z} \text{ in } \mathbb{Z}$

Why it fails: $2 \in 2\mathbb{Z}$ and $3 \in 3\mathbb{Z}$, but $2 + 3 = 5 \notin 2\mathbb{Z} \cup 3\mathbb{Z}$, failing closure.

🛡️ Exam Defense: Remember: $H \cup K \le G \iff H \subseteq K \text{ or } K \subseteq H$.

⚠️ COMMON ERROR #02

Misinterpreting Lagrange's Converse

Common Pitfall: Assuming that if $d$ divides $|G|$, there must exist a subgroup of order $d$.

Counterexample: $A_4$ has order $12$, and $6$ divides $12$, but $A_4$ has no subgroup of order $6$.

Why it fails: Lagrange's theorem is a one-way implication: subgroup order divides group order. The converse is false in general.

🛡️ Exam Defense: Never select 'subgroup of order $k$ exists' merely because $k$ divides $|G|$ unless Cauchy's or Sylow's theorems apply (e.g., prime divisors).

Comparison

Concept / Theorem	Hypotheses / Assumptions	Key Formula / Outcome	Geometric Meaning	Exam Identification Clue
One-Step Subgroup Test	Non-empty subset $H \subseteq G$	$ab^{-1} \in H \, \forall a,b \in H$	Self-contained internal symmetry bounds	Check algebraic closure and inverse simultaneously
Lagrange's Theorem	Finite group $G$, $H \le G$	$\|H\|$ divides $\|G\|$; $[G:H] = \frac{\|G\|}{\|H\|}$	Partition of group space into equal coset tiles	Questions involving orders of elements or subgroups
Center of Group $Z(G)$	Any group $G$	$Z(G) = \{x \in G \mid xg = gx\} \le G$	Set of elements commuting with all transformations	Identifying elements that commute with everything
Normal Subgroup	$H \le G$ with left/right coset equality	$gHg^{-1} = H \, \forall g \in G$	Invariant geometric subspaces under conjugation	Kernel of homomorphisms or quotient group formation

Solved examples

Each problem includes a full solution and a shorter method:

CANONICAL PROBLEM 01 Dual-Method Breakdown

Find the number of subgroups of the cyclic group $\mathbb{Z}_{30}$ under addition modulo $30$.

(A) 4(B) 6(C) 8(D) 12

📚 Method A: Formal Textbook Derivation

Step 1: Identify the order of $\mathbb{Z}_{30}$, which is $30$. Step 2: List all positive divisors of $30$, which are $1, 2, 3, 5, 6, 10, 15, 30$. Step 3: For each divisor $d$ of $30$, a cyclic group has a unique subgroup of order $d$. Step 4: Count the divisors: there are 8 divisors, hence 8 subgroups.

⚡ Method B: 25-Second Exam Shortcut

Number of divisors of $n$ gives the number of subgroups for $\mathbb{Z}_n$. Divisors of $30$: $2^1 \times 3^1 \times 5^1 \implies (1+1)(1+1)(1+1) = 8$.

💡 Tip: For $\mathbb{Z}_n$, use $\tau(n)$ (number of divisors) directly to save time.

CANONICAL PROBLEM 02 Dual-Method Breakdown

Let $G = S_3$. Which of the following subsets is a subgroup of $S_3$?

(A) \{I, (1 2)\}(B) \{I, (1 2 3), (1 3 2)\}(C) \{I, (1 2), (1 3)\}(D) All permutations with fixed point 1

📚 Method A: Formal Textbook Derivation

Step 1: Check orders using Lagrange's theorem. $|S_3| = 6$. Divisors are $1, 2, 3, 6$. Step 2: Option (A) has order 2, but $S_3$ has multiple subgroups of order 2; however, closure must be tested. (1 2)(1 2) = I, but is it closed with other elements? Subgroup of order 2 generated by (1 2) is $\{I, (1 2)\}$. Wait, let's check option B: $\{I, (1 2 3), (1 3 2)\}$, order 3, which divides 6 and forms an alternating subgroup $A_3$, closed under composition.

⚡ Method B: 25-Second Exam Shortcut

Check closure: In $A_3 = \{I, (1 2 3), (1 3 2)\}$, multiplying any two elements yields an element in the set. Options like (C) fail closure: $(1 2)(1 3) = (1 3 2) \notin \{I, (1 2), (1 3)\}$.

💡 Tip: Always test non-identity product closure for small permutation group subsets.

Practice questions

Choose an answer to check it and see the solution:

MCQ 1: If $H$ and $K$ are subgroups of a group $G$, then $H \cap K$ is:

A Always a subgroup of $G$

B A subgroup of $G$ only if $H \subset K$ or $K \subset H$

C Never a subgroup of $G$

D Always a normal subgroup of $G$

Derivation & Analysis:

The intersection of any family of subgroups of $G$ is again a subgroup of $G$ because closure and inverse properties are preserved under intersection.

MCQ 2: The number of subgroups of the Klein 4-group $V_4 = \{e, a, b, c\}$ is:

A 2

B 3

C 4

D 5

Derivation & Analysis:

V_4 has subgroups: $\{e\}$, $\{e,a\}$, $\{e,b\}$, $\{e,c\}$, and $V_4$ itself. Total count is $1 + 3 + 1 = 5$ subgroups.

MCQ 3: According to Lagrange's Theorem, if $H$ is a subgroup of a finite group $G$, then:

A $|H|$ must equal $|G|$

B $|H|$ must divide $|G|$

C $|G|$ must divide $|H|$

D $|H| + |G|$ is even

Derivation & Analysis:

Lagrange's theorem states that the order of any subgroup of a finite group divides the order of the group.

MCQ 4: Which of the following is a subgroup of $(\mathbb{R}, +)$?

A $(\mathbb{Q}, +)$

B $(\mathbb{N}, +)$

C The set of all irrational numbers

D $(\mathbb{Z}^+, +)$

Derivation & Analysis:

$(\mathbb{Q}, +)$ is closed under addition and additive inverses, forming a subgroup of $(\mathbb{R}, +)$. $(\mathbb{N}, +)$ lacks additive inverses.

MCQ 5: If $G$ is a cyclic group of order 12, the number of generators of $G$ is:

A 2

B 4

C 6

D 3

Derivation & Analysis:

The number of generators of a cyclic group of order $n$ is given by Euler's totient function $\phi(n)$. Here $\phi(12) = 12(1 - 1/2)(1 - 1/3) = 4$.

MCQ 6: Let $H = \{A \in GL_2(\mathbb{R}) \mid \det(A) = 1\}$. Then $H$ is:

A Not a subgroup

B A subgroup of $GL_2(\mathbb{R})$

C Equal to $GL_2(\mathbb{R})$

D An abelian subgroup

Derivation & Analysis:

The subset $SL_2(\mathbb{R})$ has $\det(AB) = \det(A)\det(B) = 1$ (closure) and $\det(A^{-1}) = 1/\det(A) = 1$ (inverse), making it a subgroup.

MCQ 7: If $H \le G$ and $[G:H] = 2$, then $H$ is always:

A Abelian

B Normal in $G$

C Cyclic

D Trivial

Derivation & Analysis:

Any subgroup of index 2 in a group $G$ is guaranteed to be a normal subgroup of $G$ because left and right cosets coincide.

MCQ 8: The center $Z(G)$ of a group $G$ is abelian if $G$ is:

A Non-abelian

B Any group $G$

C Finite only

D Cyclic only

Derivation & Analysis:

The center $Z(G)$ is always an abelian subgroup of $G$, regardless of whether $G$ itself is abelian or non-abelian.

MCQ 9: What is the index of $3\mathbb{Z}$ in $(\mathbb{Z}, +)$?

A 1

B 2

C 3

D Infinite

Derivation & Analysis:

The index $[\mathbb{Z} : 3\mathbb{Z}]$ is the number of distinct cosets, which is $3$ (namely $3\mathbb{Z}, 1+3\mathbb{Z}, 2+3\mathbb{Z}$).

Q10

MCQ 10: If every subgroup of a group $G$ is cyclic, then $G$ must be:

A Finite

B Abelian

C Non-abelian

D Simple

Derivation & Analysis:

While not all groups with cyclic subgroups are abelian, groups where all proper subgroups are cyclic or specific structural constraints apply are thoroughly analyzed in advanced classification theorems.

Common questions

Because combining elements from two different subgroups can yield an element outside both subgroups, violating closure. For example, $2\mathbb{Z} \cup 3\mathbb{Z}$ contains 2 and 3, but their sum 5 is in neither.

Simply find the number of positive divisors of $n$ (denoted as $\tau(n)$). For each divisor $d$ of $n$, there exists one and only one cyclic subgroup of order $d$.

No. By definition, a subgroup must contain at least the identity element of the group, ensuring it is non-empty.

← Previous Topic

Subgroup of cyclic group

Next Topic →

Symmetric group Sn