SB Cyclic groups

Section 4.1 Cyclic groups

Often a subgroup will depend entirely on a single element of the group; that is, knowing that particular element will allow us to compute any other element in the subgroup.

🔗

Example 4.1.1. An Infinite Cyclic Subgroup, Modular Addition.

Suppose that we consider

3 \in Z

and look at all multiples (both positive and negative) of 3. As a set, this is

3 Z = {\dots, - 3, 0, 3, 6, \dots} .

It is easy to see that

3 Z

is a subgroup of the integers. This subgroup is completely determined by the element 3 since we can obtain all of the other elements of the group by taking multiples of 3. Every element in the subgroup is “generated” by 3.

Example 4.1.2. An Infinite Cyclic Subgroup, Multiplication of Rational Numbers.

H = {2^{n} : n \in Z},

then

H

is a subgroup of the multiplicative group of nonzero rational numbers,

Q^{*} .

a = 2^{m}

and

b = 2^{n}

are in

H,

then

a b^{- 1} = 2^{m} 2^{- n} = 2^{m - n}

is also in

H .

By Proposition 3.3.8,

H

is a subgroup of

Q^{*}

determined by the element 2.

Theorem 4.1.3.

Let

G

be a group and

a

be any element in

G .

Then the set

🔗

⟨ a ⟩ = {a^{k} : k \in Z}

is a subgroup of

G .

Furthermore,

⟨ a ⟩

is the smallest subgroup of

G

that contains~

a .

🔗

Proof.

The identity is in

⟨ a ⟩

since

a^{0} = e .

g

and

h

are any two elements in

⟨ a ⟩,

then by the definition of

⟨ a ⟩

we can write

g = a^{m}

and

h = a^{n}

for some integers

m

and

n .

g h = a^{m} a^{n} = a^{m + n}

is again in

⟨ a ⟩ .

Finally, if

g = a^{n}

⟨ a ⟩,

then the inverse

g^{- 1} = a^{- n}

is also in

⟨ a ⟩ .

Clearly, any subgroup

H

G

containing

a

must contain all the powers of

a

by closure; hence,

H

contains

⟨ a ⟩ .

Therefore,

⟨ a ⟩

is the smallest subgroup of

G

containing

a .

Remark 4.1.4.

If we are using the “+” notation, as in the case of the integers under addition, we write

⟨ a ⟩ = {n a : n \in Z} .

🔗

For

a \in G,

we call

⟨ a ⟩

the cyclic subgroup generated by

a .

G

contains some element

a

such that

G = ⟨ a ⟩,

then

G

is a cyclic group. In this case

a

is a generator of

G .

a

is an element of a group

G,

we define the order of

a

to be the smallest positive integer

n

such that

a^{n} = e,

and we write

| a | = n .

If there is no such integer

n,

we say that the order of

a

is infinite and write

| a | = \infty

to denote the order of

a .

🔗

Example 4.1.5. Generators of a Finite Cyclic Group.

Notice that a cyclic group can have more than a single generator. Both 1 and 5 generate

Z_{6};

hence,

Z_{6}

is a cyclic group. Not every element in a cyclic group is necessarily a generator of the group. The order of

2 \in Z_{6}

is 3. The cyclic subgroup generated by 2 is

⟨ 2 ⟩ = {0, 2, 4} .

The groups

Z

and

Z_{n}

are cyclic groups. The elements 1 and

- 1

are generators for

Z .

We can certainly generate

Z_{n}

with 1 although there may be other generators of

Z_{n},

as in the case of

Z_{6} .

🔗

Example 4.1.6. A Cyclic Group of Units.

The group of units,

U (9),

Z_{9}

is a cyclic group. As a set,

U (9)

{1, 2, 4, 5, 7, 8} .

The element 2 is a generator for

U (9)

since

\begin{aligned} 2^{1} & = 2 2^{2} = 4 \\ 2^{3} & = 8 2^{4} = 7 \\ 2^{5} & = 5 2^{6} = 1 . \end{aligned}

Example 4.1.7. A Group That is Not Cyclic.

Not every group is a cyclic group. Consider the symmetry group of an equilateral triangle

S_{3} .

The subgroups of

S_{3}

are shown in Figure 4.1.8. Notice that every subgroup is cyclic; however, no single element generates the entire group.

Theorem 4.1.9.

Every cyclic group is abelian.

🔗

Proof.

Let

G

be a cyclic group and

a \in G

be a generator for

G .

g

and

h

are in

G,

then they can be written as powers of

a,

say

g = a^{r}

and

h = a^{s} .

Since

g h = a^{r} a^{s} = a^{r + s} = a^{s + r} = a^{s} a^{r} = h g,

G

is abelian.

🔗

Prev Top Next