Skip to Content
Math4302Modern Algebra (Lecture 8)

Math4302 Modern Algebra (Lecture 8)

Subgroups

Cyclic group

Subgroup of cyclic group is cyclic

Every subgroup of a cyclic group is cyclic.

Order of subgroup of cyclic group

If a∈Ga\in G and ∣⟨a⟩∣|\langle a\rangle| be the smallest positive nn such that an=ea^n=e, then ⟨a⟩={e,a,a2,⋯ ,an−1}\langle a\rangle=\{e,a,a^2,\cdots,a^{n-1}\} and am1=am2  ⟺  m1=m2mod  na^{m_1}=a^{m_2}\iff m_1=m_2\mod n. (nn divides m1−m2m_1-m_2)

Size of subgroup of cyclic group

Let G=⟨a⟩G=\langle a\rangle and H=⟨am⟩H=\langle a^m\rangle. Then ∣H∣=∣G∣d|H|=\frac{|G|}{d} where d=gcd⁡(∣G∣,∣H∣)d=\operatorname{gcd}(|G|,|H|). In particular, ⟨am⟩=G  ⟺  gcd⁡(n,m)=1\langle a^m\rangle=G\iff \operatorname{gcd}(n,m)=1.

GCD decides the size of subgroup

Suppose G=⟨a⟩G=\langle a\rangle, ∣G∣=n|G|=n.

Then ⟨am1⟩=⟨am2⟩  ⟺  gcd⁡(n,m2)=gcd⁡(n,m1)\langle a^{m_1}\rangle=\langle a^{m_2}\rangle\iff \operatorname{gcd}(n,m_2)=\operatorname{gcd}(n,m_1).

Proof

  ⟹  \implies:

⟨am1⟩=⟨am2⟩  ⟹  gcd⁡(n,m1)=gcd⁡(n,m2)\langle a^{m_1}\rangle=\langle a^{m_2}\rangle\implies \operatorname{gcd}(n,m_1)=\operatorname{gcd}(n,m_2)

  ⟸  \impliedby:

Suppose d=gcd⁡(n,m1)=gcd⁡(n,m2)d=\operatorname{gcd}(n,m_1)=\operatorname{gcd}(n,m_2).

Enough to show am1∈⟨am2⟩a^{m_1}\in \langle a^{m_2}\rangle. (then we conclude ⟨am1⟩=⟨am2⟩\langle a^{m_1}\rangle=\langle a^{m_2}\rangle and by symmetry ⟨am2⟩=⟨am1⟩\langle a^{m_2}\rangle=\langle a^{m_1}\rangle.)

Equivalent to show that am1=(am2)ka^{m_1}=(a^{m_2})^k for some integer kk. That is nn divides m1−km2m_1-km_2 for some k∈Zk\in \mathbb{Z}.

From last lecture, we know that dd can be written as d=nr+m2sd=nr+m_2 s for some r,s∈Zr,s\in \mathbb{Z}.

Multiply by m1d\frac{m_1}{d}, (since dd divides m1m_1, this is an integer).

So m1=nrm1d+m2sm1dm_1=nr\frac{m_1}{d}+m_2s\frac{m_1}{d}.

Therefore nn divides m1−(m1ds)m2m_1-(\frac{m_1}{d}s)m_2, so k=m1dsk=\frac{m_1}{d}s. works.

Corollaries for subgroup of cyclic group

Let G=⟨a⟩G=\langle a\rangle be a cyclic group of finite order.

  1. If H≤GH\leq G, then ∣H∣|H| is a divisor of ∣G∣|G|. (More generally true for finite groups.)
  2. For any dd divides ∣G∣|G|, there is exactly one subgroup of GG of order dd. ⟨am⟩\langle a^m\rangle where m=∣G∣dm=\frac{|G|}{d}.

Examples

(Z18,+)(\mathbb{Z}_18,+).

The subgroup with size 66 is ⟨3⟩={0,3,6,9,12,15}=⟨15⟩\langle 3\rangle=\{0,3,6,9,12,15\}=\langle 15\rangle.

Note that gcd⁡(18,3)=3=gcd⁡(18,15)\operatorname{gcd}(18,3)=3=\operatorname{gcd}(18,15).

⟨6⟩={0,6,12}\langle 6\rangle=\{0,6,12\}.

⟨9⟩={0,9}\langle 9\rangle=\{0,9\}.

⟨2⟩={0,2,4,6,8,10,12,14,16}\langle 2\rangle=\{0,2,4,6,8,10,12,14,16\} (generators are 2,4,8,10,14,162,4,8,10,14,16 since they have gcd 22 with 1818).

Non-cyclic groups

Let GG be a group and a,b∈Ga,b\in G, then we use ⟨a,b⟩\langle a,b\rangle to mean the subgroup of GG generated by combination of aa and bb.

⟨a,b⟩≔{e,a,b,ab,ba,a−1,b−1,(ab)−1,(ba)−1,…}\langle a,b\rangle\coloneqq \{e,a,b,ab,ba,a^{-1},b^{-1},(ab)^{-1},(ba)^{-1},\ldots\}

This is a subgroup of GG since it is closed and e=a0e=a^0.

Klein 4 group

Klein 4 group is abelian but not cyclic.

*eabc
eeabc
aaecb
bbcea
ccbae

The subgroups are

⟨e⟩={e}\langle e\rangle=\{e\}

⟨a⟩={e,a}\langle a\rangle=\{e,a\}

⟨b⟩={e,b}\langle b\rangle=\{e,b\}

⟨c⟩={e,c}\langle c\rangle=\{e,c\}

Therefore GG is not cyclic and not isomorphic to Z4\mathbb{Z}_4.

Here G=⟨a,b⟩={e,a,b,ab=c}G=\langle a,b\rangle=\{e,a,b,ab=c\}.

More generally, if we have ai∈Ga_i\in G, where i∈Ii\in I, then ⟨ai,i∈I⟩=\langle a_i,i\in I\rangle= all possible combinations of aia_i with their inverses. Is a subgroup of GG.

Another way to describe is that ⟨ai,i∈I⟩=⋂H≤G,ai∈H,i∈IH\langle a_i,i\in I\rangle=\bigcap_{H\leq G, a_i\in H,i\in I}H.

Definition of finitely generated group

If GG is a group and if there is a finite set a1,…,an∈Ga_1,\ldots, a_n\in G such that G=⟨a1,…,an⟩G=\langle a_1,\ldots, a_n\rangle, then GG is called finitely generated.

Examples

Any finite group is finitely generated.


(Q,+)(\mathbb{Q},+) is not finitely generated.

Suppose for the contrary, there is a finite set a1b1,…,anbn∈Q\frac{a_1}{b_1},\ldots,\frac{a_n}{b_n}\in \mathbb{Q} such that

\mathbb{Q}=\langle \frac{a_1}{b_1},\ldots,\frac{a_n}{b_n}\rangle=\{t_1\frac{a_1}{b_1},\ldots,t_n\frac{a_n}{b_n}|t_1,t_2,\ldots,t_n\in \mathbb{Z}\} $$. Pick prime $p$ such that $p>|b_1|,\ldots,|b_n|$. Then $\frac{1}{p}\in \mathbb{Q}$.

\frac{1}{p}=t_1\frac{a_1}{b_1}+t_2\frac{a_2}{b_2}+\cdots+t_n\frac{a_n}{b_n}=\frac{A}{b_1b_2\cdots b_n}

This implies that $pA=b_1b_2\cdots b_n$. Since $p$ is prime, $p|b_i$ for some $i$. However, by our construction, $p>|b_i|$ and cannot divide $b_i$. Contradiction. </details>
Last updated on