← 2017 Paper 2
UPSC 2017 Maths Optional Paper 2 Q3a — Step-by-Step Solution
15 marks · Section A
Cyclic groups · Algebra · asked 8× in 13 yrs · Read the full method →
Question
Show that the groups Z5×Z7 and Z35 are isomorphic.
Technique
Show the product group is cyclic by finding an element of order lcm(5,7)=35=∣G∣ (the generator (1,1)); equivalently the CRT isomorphism x↦(xmod5,xmod7) with trivial kernel.
Solution
Both groups have order 35. We show Z5×Z7 is cyclic (then any cyclic group of order 35 is isomorphic to Z35). We give two complete arguments.
Method 1 — Exhibit a generator (order of (1,1))
Consider the element (1,1)∈Z5×Z7 (the group operation is coordinatewise addition mod 5 and mod 7). For k≥1,
k⋅(1,1)=(kmod5, kmod7).
This equals the identity (0,0) iff k≡0(mod5) and k≡0(mod7), i.e. iff 5∣k and 7∣k. The smallest such positive k is
lcm(5,7)=gcd(5,7)5⋅7=135=35.
Hence (1,1) has order 35. Since ∣Z5×Z7∣=35, the cyclic subgroup ⟨(1,1)⟩ already has 35 elements and equals the whole group. So Z5×Z7 is cyclic of order 35, hence
Z5×Z7≅Z35.
Method 2 — Explicit isomorphism (CRT)
Define ψ:Z35→Z5×Z7 by
ψ(xmod35)=(xmod5, xmod7).
- Well defined & homomorphism: if x≡x′(mod35) then x≡x′ mod 5 and mod 7, and reduction is additive: ψ(x+y)=ψ(x)+ψ(y).
- Injective: if ψ(x)=(0,0) then 5∣x and 7∣x; since gcd(5,7)=1, 35∣x, so x≡0(mod35). Thus kerψ={0}.
- Surjective / bijective: an injective map between finite sets of equal size ∣Z35∣=35=∣Z5×Z7∣ is a bijection.
Hence ψ is a group isomorphism. (This ψ is exactly the Chinese Remainder Theorem isomorphism for coprime moduli.)
Answer
Z5×Z7≅Z35via xmod35 ↦ (xmod5, xmod7).