Scribd
Upload
123 views2 pages

Cyclic Groups: Example

Cyclic groups are groups that are generated by a single element. A group G is cyclic if G = ⟨x⟩ for some element x in G, where ⟨x⟩ represents the smallest subgroup of G containing x. There are two main types of cyclic groups - infinite cyclic groups like the integers under addition, and finite cyclic groups like the integers modulo n under addition, which contains n elements. Cyclic groups play an important role in abstract algebra.

Uploaded by

Pau Triste
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
123 views2 pages

Cyclic Groups: Example

Cyclic groups are groups that are generated by a single element. A group G is cyclic if G = ⟨x⟩ for some element x in G, where ⟨x⟩ represents the smallest subgroup of G containing x. There are two main types of cyclic groups - infinite cyclic groups like the integers under addition, and finite cyclic groups like the integers modulo n under addition, which contains n elements. Cyclic groups play an important role in abstract algebra.

Uploaded by

Pau Triste
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Cyclic Groups

A group G is " cyclic" if it's generated by a single element:


G={x}

To understand its definition and notation we must:

>Define " generated"


>Several examples
> Why the name " cyclic?"
> Importance of cyclic groups

Additive notation: +
Identity element: 0

Multiplicative notation: x
Identity element: 1

Definition of Cyclic Groups


Let G be a group with operation x
Pick x ∈ G
What's the smallest subgroup of G that contains x?
⟨x⟩= {..., x-⁴, x-³, x-², x-¹, 1, x, x², x³, x⁴,...}
=Group generated by x
If G = ⟨x⟩ for some x, then we call G a cyclic group.

Let H be a group
with operation +
Pick y ∈ H
Group generated by y = smallest subgroup of H containing y.
⟨y⟩ = {..., —3y, —2y, —y, 0, y, 2y, 3y,...}
If H = ⟨y⟩ for some y, then we call H a cyclic group.

Example
Group: Integers Z under +
Claim: Z = ⟨1⟩
⟨1⟩ = {... —4, —3, —2, —1, 0, 1, 2, 3, 4...}
Z is a cyclic group

Finite Cyclic Groups


Group: G= Integers mod n under addition
Elements: {0, 1, 2, ..., n–1}
G is cyclic: G =⟨1⟩
..., –2, –1, 0, 1, 2, ...n–1, n+1, n+2, 2n, 2n+1, ...
n≡ 0 (mod n) –1≡ n–1 ( mod n)
n+1≡ 1 (mod n) –2 ≡ n–2 ( mod n)
n+2≡ 2 (mod n) –3 ≡ n–3 ( mod n)
n+3≡ 3 (mod n) –4 ≡ n–4 ( mod n)
In abstract algebra it is written:

Integers mod n: Z/n Z

Two types of Cyclic Groups


Infinite: Z, +
Finite: Z/ n Z, +
Z
Z/2Z
Z/3Z
Z/4Z
⋮
Trivial Group: {e}

You might also like