Generated Subgroups

students, welcome to the idea of generated subgroups in abstract algebra 👋 This lesson focuses on how a subgroup can be built from a smaller set of elements inside a larger group. The main goal is to understand how a few elements can create the smallest subgroup containing them, and why this idea is one of the most useful tools in the study of subgroups and cyclic groups.

By the end of this lesson, you should be able to:

• explain what a generated subgroup is,
• describe how to find the subgroup generated by one or more elements,
• use examples to test whether an element belongs to a generated subgroup,
• connect generated subgroups to cyclic groups and subgroup structure,
• recognize how this topic fits into the larger study of groups and subgroups.

Think of generated subgroups like starting with a few ingredients and then closing the recipe under the group operation 🍳 If you begin with one or more elements, the generated subgroup is everything you can make from them using the group rules, while staying inside the group.

What Does It Mean to Generate a Subgroup?

Suppose $G$ is a group and $S$ is a nonempty subset of $G$. The generated subgroup by $S$ is the smallest subgroup of $G$ that contains every element of $S$. It is usually written as $\langle S \rangle$.

This means two important things:

1. $S \subseteq \langle S \rangle$,
2. if $H$ is any subgroup of $G$ with $S \subseteq H$, then $\langle S \rangle \subseteq H$.

So $\langle S \rangle$ is the smallest possible subgroup that still includes the chosen elements. This is a very efficient way to describe a subgroup. Instead of listing every element directly, we can say it is generated by a set.

If $S = \{a\}$ has just one element, then $\langle a \rangle$ is called a cyclic subgroup. That makes generated subgroups the doorway to cyclic groups, which are groups built from powers or multiples of one element.

Example in an additive group

Take the group $\mathbb{Z}$ under addition, and let $S = \{4\}$. The subgroup generated by $4$ is

$$\langle 4 \rangle = \{4n \mid n \in \mathbb{Z}\} = \{\dots, -8, -4, 0, 4, 8, 12, \dots\}.$$

Why? Because subgroup closure under addition means we must include sums like $4+4=8$, $4+4+4=12$, and also inverses like $-4$. So once $4$ is included, all integer multiples of $4$ must be included too.

How to Build the Smallest Subgroup

A generated subgroup is built by repeatedly using the group operation and inverses. In multiplicative notation, elements are combined by products and inverses. In additive notation, they are combined by sums and negatives.

For a subset $S$ of a group $G$, the subgroup $\langle S \rangle$ consists of all elements you can form by taking finite combinations of elements of $S$ and their inverses. For example, if $S = \{a, b\}$ in a multiplicative group, then elements of $\langle a,b \rangle$ look like products such as

$$a^2b^{-1}ab^3a^{-1},$$

as long as the expression is interpreted within the group rules.

For an additive group, the same idea becomes integer linear combinations. If $S = \{x,y\}$, then elements of $\langle x,y \rangle$ look like

$$mx + ny$$

for integers $m$ and $n$.

Example in $\mathbb{Z}$

Let $S = \{6, 15\}$ in $\mathbb{Z}$. Then $\langle 6,15 \rangle$ contains all integer combinations

$$6m + 15n, \quad m,n \in \mathbb{Z}.$$

Since $\gcd(6,15)=3$, every such combination is a multiple of $3$, and in fact every multiple of $3$ can be written that way. So

$$\langle 6,15 \rangle = \langle 3 \rangle = 3\mathbb{Z}.$$

This example shows a common pattern in additive groups: generated subgroups often connect to greatest common divisors.

Generated Subgroups and Cyclic Groups

A group is cyclic if it can be generated by one element. That means there is some $g \in G$ such that

$$G = \langle g \rangle.$$

Every cyclic group is a generated subgroup of itself, generated by one element. But not every generated subgroup is cyclic from the start if we begin with several generators; however, it may still turn out to be cyclic in some cases.

Example: A finite cyclic group

Consider the group $\mathbb{Z}_{12}$ under addition modulo $12$. The subgroup generated by $4$ is

$$\langle 4 \rangle = \{0,4,8\}.$$

Adding $4$ again gives $12 \equiv 0 \pmod{12}$, so the process repeats. This subgroup has $3$ elements. Here, the order of $4$ in $\mathbb{Z}_{12}$ is $3$.

Now look at $\langle 5 \rangle$ in the same group:

$$\langle 5 \rangle = \{0,5,10,3,8,1,6,11,4,9,2,7\} = \mathbb{Z}_{12}.$$

So $5$ generates the whole group. That means $\mathbb{Z}_{12}$ is cyclic, and $5$ is a generator.

Why this matters

Generated subgroups help us identify whether a group is cyclic and how large the subgroup generated by one element is. In a finite cyclic group, the subgroup generated by an element depends on the order of that element. If the order of $g$ is $n$, then

$$\langle g \rangle = \{e, g, g^2, \dots, g^{n-1}\}.$$

In additive notation, if the order of $g$ is $n$, then

$$\langle g \rangle = \{0, g, 2g, \dots, (n-1)g\}.$$

Finding Generated Subgroups in Practice

To determine $\langle S \rangle$, ask what must be included because of subgroup properties.

Step 1: Include the generators

If $S = \{a,b\}$, then $a$ and $b$ must be in the subgroup.

Step 2: Include closure under the operation

If the group is multiplicative, include products like $ab$, $ba$, $a^2b$, and so on.

Step 3: Include inverses

If $a$ is in the subgroup, then $a^{-1}$ must also be in the subgroup. This is essential.

Step 4: Keep going until no new elements appear

In finite groups, the process eventually stops. In infinite groups, the pattern may continue forever.

Example in a permutation group

Let $G = S_3$, the group of permutations of three objects, and let $S = \{(12)\}$. Then

$$\langle (12) \rangle = \{e, (12)\}.$$

This is a subgroup of order $2$. The element $(12)$ is its own inverse, since

$$((12))^2 = e.$$

Now take $S = \{(12), (23)\}$. Then $\langle (12), (23) \rangle = S_3$ because these two transpositions generate the whole symmetric group on three symbols.

This is a powerful idea: a group can sometimes be described by a small generating set rather than by listing every element.

Important Facts and Patterns

Generated subgroups have several key properties.

The subgroup generated by a set always exists

For any subset $S \subseteq G$, there is at least one subgroup containing $S$, namely $G$ itself. The intersection of all subgroups containing $S$ is also a subgroup, and it is exactly $\langle S \rangle$.

That gives a precise definition:

$$\langle S \rangle = \bigcap \{H \le G \mid S \subseteq H\}.$$

This formula means the generated subgroup is not just a guess. It is the intersection of all subgroups that already contain the set $S$.

If $S \subseteq T$, then $\langle S \rangle \subseteq \langle T \rangle$

Adding more generators can only make the generated subgroup the same size or larger.

If $S$ is already a subgroup, then $\langle S \rangle = S$

A subgroup generates itself.

In abelian groups, generated subgroups are easier to describe

When the group operation commutes, combinations often simplify. For example, in $\mathbb{Z}$ every finitely generated subgroup is cyclic, and in fact equal to $d\mathbb{Z}$ for some $d \ge 0$.

Connection to the Bigger Picture

Generated subgroups are one of the main tools for understanding subgroup structure. They help answer questions like:

• Which elements are enough to build the whole group?
• What is the smallest subgroup containing a chosen set?
• How do we describe subgroups without listing every element?

They also connect directly to cyclic groups. A cyclic group is exactly a group generated by one element, so the study of generated subgroups naturally leads into classification results for cyclic groups. In finite cyclic groups, every subgroup is cyclic as well, and subgroups correspond to divisors of the group order. That is one reason generated subgroups are so important in abstract algebra.

Conclusion

Generated subgroups turn the abstract idea of a subgroup into a construction process. students, instead of asking only whether a set is a subgroup, we can ask what subgroup it creates. The answer is $\langle S \rangle$, the smallest subgroup containing $S$.

This idea works in many settings: integers under addition, permutation groups, modular arithmetic, and more. It also provides the foundation for cyclic groups, since a cyclic group is generated by a single element. By learning generated subgroups, you build a stronger understanding of how groups are organized and how complex structures can arise from simple starting points ✨

Study Notes

• The generated subgroup of a subset $S$ is written $\langle S \rangle$.
• $\langle S \rangle$ is the smallest subgroup containing $S$.
• Formally, $\langle S \rangle = \bigcap \{H \le G \mid S \subseteq H\}$.
• If $S = \{a\}$, then $\langle a \rangle$ is a cyclic subgroup.
• In additive groups, generated subgroups are made of integer combinations like $mx + ny$.
• In multiplicative groups, generated subgroups are built from products and inverses.
• In $\mathbb{Z}$, $\langle n \rangle = n\mathbb{Z}$.
• In $\mathbb{Z}_{12}$, $\langle 4 \rangle = \{0,4,8\}$ and $\langle 5 \rangle = \mathbb{Z}_{12}$.
• Generated subgroups are central to understanding cyclic groups and subgroup classification.
• A small set of generators can describe a much larger structure.