6. Abstract Algebra

Lagrange theorem

Q: FAQ 1: Is Lagrange's theorem applicable to infinite groups?

Yes, in terms of cardinality and index, but the standard finite form $|H| \mid |G|$ requires finite orders. For infinite groups, $[G : H]$ can be finite or infinite (cardinal numbers).

Q: FAQ 2: What is the single most common reason students lose marks in UP PGT group theory questions?

Assuming that if $m$ divides the group order, a subgroup of order $m$ must exist (falling for the converse fallacy).

Q: FAQ 3: How can candidates solve index and order questions?

Memorize standard group orders ($S_3 = 6, A_4 = 12, S_4 = 24$) and immediately apply divisibility rules and element order properties without writing full coset decompositions.

Lagrange's Theorem in Group Theory states that the order of any subgroup of a finite group divides the order of the group, serving as a cornerstone for algebraic classification.

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

📖 Topic progress

○ Mark as complete

Definition and statement

Lagrange's Theorem for Finite Groups

Let $G$ be a finite group and $H$ be a subgroup of $G$. Then the order of $H$ divides the order of $G$. Symbolically, $|H| \mid |G|$, or equivalently, $|G| = [G : H] \cdot |H|$, where $[G : H]$ is the index of $H$ in $G$.

📐 Geometric Interpretation

While group theory is purely algebraic, the partition property can be visualized as tiling a space of size $|G|$ with disjoint, congruent blocks (cosets) of uniform size $|H|$.

⚙️ Algebraic & Structural Meaning

Establishes a fundamental restriction on the subgroup structure of finite groups, immediately implying that groups of prime order have no proper nontrivial subgroups and that the order of any element divides the group order.

Conditions and hypotheses

Check each condition and what changes when it is omitted:

Hypothesis / Condition	Domain / Interval	Necessity	What Fails If Condition Dropped
Finiteness of Group $G$	`Finite set $G$`	Strictly Mandatory / Necessary	For infinite groups (like $(\mathbb{Z}, +)$ or $(\mathbb{Q}^*, \cdot)$), orders are not integers, rendering direct divisibility statements inapplicable without cardinality formulations.
Subgroup Property of $H$	$H \le G$	Strictly Mandatory	If $H$ is merely a subset or a non-subgroup subset, left cosets do not partition the group evenly, destroying the equivalence relation foundation.
Equivalence Relation via Cosets	`Partition of $G$`	Essential for conclusion	Without partition into disjoint left cosets of equal cardinality $\|H\|$, the counting argument $\|G\| = [G : H]\|H\|$ fails.

Useful results and shortcuts

Use these identities and results when their conditions apply:

Order of Elements Divides Group Order

$$ \forall a \in G, \quad o(a) \mid |G| $$

Rule: The order of any element in a finite group $G$ divides the order of $G$. Instantly eliminate options where element orders do not divide $|G|$.

Application: Directly tested in UP PGT/TGT to find possible element orders or nonexistent elements in cyclic/symmetric groups.

Prime Order Implies Cyclicity

$$ |G| = p \text{ (prime)} \implies G \cong \mathbb{Z}_p $$

Rule: Any group of prime order is cyclic and has no proper nontrivial subgroups.

Application: Standard question in DSSSB and KVS PGT regarding classification of groups of order $p, p^2$, etc.

Fermat's Little Theorem Deduction

$$ a^{p-1} \equiv 1 \pmod p $$

Rule: Derived by applying Lagrange's theorem to the multiplicative group $(\mathbb{Z}_p^*, \cdot)$ of order $p-1$.

Application: Frequently asked number theory/algebra overlap questions in UP PGT.

Subgroup Index Calculation

$$ [G : H] = \frac{|G|}{|H|} $$

Rule: To find the number of left cosets, simply divide group order by subgroup order for finite groups.

Application: Commonly framed with alternating groups $A_n$ or symmetric groups $S_n$.

Non-existence of Subgroups

$$ \text{If } m \nmid n \implies \text{no subgroup of order } m \text{ in } G \text{ of order } n $$

Rule: If an integer $m$ does not divide $|G|$, $G$ cannot possess a subgroup of order $m$.

Application: Used to quickly eliminate options in multiple-choice questions.

Converse Failure Trap

$$ m \mid |G| \not\implies \exists \text{ subgroup of order } m $$

Rule: Lagrange's converse is false in general (e.g., $A_4$ has order 12, but no subgroup of order 6). Always check known alternating/dihedral structures.

Common errors and counterexamples

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

⚠️ COMMON ERROR #01

Assuming Lagrange's Converse is True

Common Pitfall: Candidates assume that if $m$ divides $|G|$, there must exist a subgroup of order $m$.

Counterexample: A_4 \text{ has order } 12, \text{ but has no subgroup of order } 6

Why it fails: Divisibility is necessary, but not sufficient for the existence of a subgroup of a given order.

🛡️ Exam Defense: Remember Cauchy's Theorem (prime divisors) and Sylow's Theorems ($p^k$ divisors), but never assume arbitrary divisors guarantee subgroups.

⚠️ COMMON ERROR #02

Confusing Left and Right Coset Count

Common Pitfall: Believing that left cosets and right cosets have different counts or indices.

Counterexample: [G : H]_l = [G : H]_r = \frac{|G|}{|H|}

Why it fails: The number of left cosets equals the number of right cosets, even though individual left and right cosets may not coincide unless $H$ is normal.

🛡️ Exam Defense: The index $[G : H]$ is uniquely defined regardless of left or right cosets.

Comparison

Concept / Theorem	Hypotheses / Assumptions	Key Formula / Outcome	Geometric Meaning	Exam Identification Clue
Lagrange's Theorem	G is finite group, H <= G	\|H\| divides \|G\|	Partitioning space into equal blocks	Questions about subgroup orders
Cauchy's Theorem	G is finite group, p \| \|G\| (p prime)	Exists element of order p	Guaranteed cyclic subgroup of prime order	Finding elements of specific prime order
Euler-Fermat Theorem	a, n coprime, gcd(a,n)=1	a^{\phi(n)} \equiv 1 \pmod n	Cyclic rotation periodicity	Number theory congruence simplification
Sylow's First Theorem	G is finite, p^k \| \|G\|	Exists subgroup of order p^k	Refinement of Lagrange converse for prime powers	Maximal p-subgroup existence

Solved examples

Each problem includes a full solution and a shorter method:

CANONICAL PROBLEM 01 Dual-Method Breakdown

If $G$ is a group of order 45, what are the possible orders of proper subgroups of $G$?

(A) 1, 3, 5, 9, 15, 45(B) 1, 3, 5, 9, 15(C) 3, 5, 9, 15(D) 1, 3, 9, 45

📚 Method A: Formal Textbook Derivation

Step 1: Identify $|G| = 45 = 3^2 \cdot 5$. Step 2: List all positive divisors of 45, which are 1, 3, 5, 9, 15, 45. Step 3: Proper subgroups exclude the improper subgroup $G$ itself (order 45). Thus, possible orders are divisors strictly less than 45: 1, 3, 5, 9, 15.

⚡ Method B: 25-Second Exam Shortcut

Divisors of 45 except 45 itself. Match options instantly.

💡 Tip: Read carefully whether 'subgroups' or 'proper subgroups' is asked.

CANONICAL PROBLEM 02 Dual-Method Breakdown

Which of the following orders cannot be the order of a subgroup of a group of order 60?

(A) 12(B) 15(C) 25(D) 30

📚 Method A: Formal Textbook Derivation

Step 1: Determine divisors of 60 ($60 = 2^2 \cdot 3 \cdot 5$). Divisors include 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60. Step 2: Check 25. Since 25 does not divide 60 ($25 \nmid 60$), by Lagrange's theorem, no subgroup of order 25 can exist.

⚡ Method B: 25-Second Exam Shortcut

Check divisibility of options into 60. 25 does not divide 60.

💡 Tip: Direct application of divisibility criteria.

Practice questions

Choose an answer to check it and see the solution:

MCQ 1: If $H$ and $K$ are subgroups of a finite group $G$ of orders 12 and 18 respectively, what can we say about $|H \cap K|$?

A It divides 6

B It divides 12

C It divides 18

D It divides 36

Derivation & Analysis:

$H \cap K$ is a subgroup of both $H$ and $K$. Therefore, its order must divide both $|H| = 12$ and $|K| = 18$. Thus, $|H \cap K| \mid \gcd(12, 18) = 6$.

MCQ 2: The order of every element in a finite group $G$ of order $n$ is:

A Equal to $n$

B A multiple of $n$

C A divisor of $n$

D Prime

Derivation & Analysis:

By corollary to Lagrange's theorem, the order of an element $a$ equals the order of the cyclic subgroup $\langle a \rangle$, which must divide $|G| = n$.

MCQ 3: If $G$ is a group of prime order $p$, then the number of distinct proper subgroups of $G$ is:

A $p$

B $1$

C $0$

D $p-1$

Derivation & Analysis:

A group of prime order has no proper nontrivial subgroups. The only subgroups are the trivial subgroup and $G$ itself, meaning 0 proper subgroups.

MCQ 4: If $H$ is a subgroup of index 2 in a group $G$, then for all $x \in G$, we have:

A $x^2 \in H$

B $x \in H$

C $x^2 = e$

D $x$ has infinite order

Derivation & Analysis:

A subgroup of index 2 is always normal. Thus $G/H$ is a group of order 2, meaning $(xH)^2 = H \implies x^2 H = H \implies x^2 \in H$.

MCQ 5: Which of the following groups has no proper subgroups?

A $(\mathbb{Z}_6, +)$

B $(\mathbb{Z}_5, +)$

C $(S_3, \circ)$

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

Derivation & Analysis:

(\mathbb{Z}_5, +) has prime order 5, hence no proper subgroups. Others have composite orders or infinite size.

MCQ 6: If $|G| = 100$ and $H$ is a subgroup of $G$ with $|H| = 25$, what is the index $[G : H]$?

A 25

B 4

C 100

D 5

Derivation & Analysis:

The index is given by $[G : H] = \frac{|G|}{|H|} = \frac{100}{25} = 4$.

MCQ 7: Lagrange's theorem states that if $H$ is a subgroup of a finite group $G$, then:

A $|H|$ equals $|G|$

B $|H|$ divides $|G|$

C $|G|$ divides $|H|$

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

Derivation & Analysis:

Direct statement of Lagrange's theorem: the order of a subgroup divides the order of the finite group.

MCQ 8: Assertion (A): The alternating group $A_4$ has no subgroup of order 6. Reason (R): Lagrange's theorem converse is not universally true.

A Both (A) and (R) are true and (R) is the correct explanation of (A)

B Both (A) and (R) are true but (R) is not the correct explanation

C (A) is true but (R) is false

D (A) is false but (R) is true

Derivation & Analysis:

6 divides $|A_4| = 12$, but $A_4$ has no subgroup of order 6 because Lagrange's converse fails.

MCQ 9: If $a \in G$ and $o(a) = 15$, then the possible orders of subgroups generated by powers of $a$ are:

A 1, 3, 5, 15

B 1, 2, 3, 5, 15

C 3, 5

D 1, 15

Derivation & Analysis:

The cyclic subgroup $\langle a \rangle$ has order 15. Its subgroups correspond to the divisors of 15, which are 1, 3, 5, 15.

Q10

MCQ 10: Let $G$ be a group of order $p^n$ where $p$ is prime. Every subgroup of $G$ has order of the form:

A $p^k$ where $0 \le k \le n$

B $n^k$

C $kp$

D $p+k$

Derivation & Analysis:

By Lagrange's theorem, the order of any subgroup of $G$ (order $p^n$) must divide $p^n$, hence its order must be a power of $p$, i.e., $p^k$ with $0 \le k \le n$.

Common questions

Yes, in terms of cardinality and index, but the standard finite form $|H| \mid |G|$ requires finite orders. For infinite groups, $[G : H]$ can be finite or infinite (cardinal numbers).

Assuming that if $m$ divides the group order, a subgroup of order $m$ must exist (falling for the converse fallacy).

Memorize standard group orders ($S_3 = 6, A_4 = 12, S_4 = 24$) and immediately apply divisibility rules and element order properties without writing full coset decompositions.