TheoremBase

Cyclic Subgroups and the Order of an Element

The powers of a group element form the smallest subgroup containing it; an element of finite order n has exactly n distinct powers and its powers equal to the identity are those with exponent divisible by n; in a finite group orders divide the group order, and groups of prime order are cyclic.

Statement

In the setting of Groups: Standing Notation, let GG be a group and let g∈Gg\in G.

Cyclic subgroup. ⟨g⟩\langle g\rangle is a subgroup of GG.

Smallest subgroup containing the element. ⟨g⟩⊆H\langle g\rangle\subseteq H for every subgroup HH of GG with g∈Hg\in H.

Exponents giving the identity. If gg has finite order n=ord⁡(g)n=\operatorname{ord}(g), then for every m∈Zm\in\mathbb{Z}, with ∣\mid as in Divisibility of Integers (i),

gm=e  ⟺  n∣m.g^{m}=e\iff n\mid m.

Listing the powers. If gg has finite order n=ord⁡(g)n=\operatorname{ord}(g), then the elements gkg^{k} with k∈N0k\in\mathbb{N}_{0} and k<nk<n are pairwise distinct, and

⟨g⟩={gk:k∈N0, k<n}.\langle g\rangle=\{g^{k}:k\in\mathbb{N}_{0},\ k<n\}.

Order of the cyclic subgroup. If gg has finite order n=ord⁡(g)n=\operatorname{ord}(g), then ⟨g⟩\langle g\rangle, a group with the operation of GG restricted to it by (i) and Subgroup Criterion and Basic Examples (ii), is finite of order

∣⟨g⟩∣=n.|\langle g\rangle|=n.

Elements of infinite order. If gg has infinite order, then gm≠gm′g^{m}\neq g^{m'} for all distinct m,m′∈Zm,m'\in\mathbb{Z}.

Finite groups. If GG is finite, then every h∈Gh\in G has finite order, ord⁡(h)∣∣G∣\operatorname{ord}(h)\mid|G|, and h∣G∣=eh^{|G|}=e.

Groups of prime order. If GG is finite and ∣G∣|G| is a prime number, then GG is cyclic, and every h∈Gh\in G with h≠eh\neq e is a generator of GG.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…