Problem 6 - A Book of Abstract Algebra

Question

A property of groups is said to be "preserved under homomorphism" if, whenever a group \(G\) has that property, every homomorphic image of \(G\) does also. In this exercise set, we will survey a few typical properties preserved under homomorphism. If \(f: G \rightarrow H\) is a homomorphism of \(G\) onto \(H\), prove each of the following: If \(G\) is finitely generated, then \(H\) is finitely generated. (A group is said to be "finitely generated" if it is generated by finitely many of its elements.)

Step-by-Step Solution

Answer

If \(G\) is finitely generated, then its homomorphic image \(H\) is also finitely generated because \(H\) can be generated by the image of a finite generating set of \(G\).

Step 1: Understand Definitions

A group is finitely generated if there exists a finite set \(S \subseteq G\) such that every element of \(G\) can be expressed as a finite product of elements of \(S\) and their inverses. A homomorphism \(f: G \rightarrow H\) maps elements from group \(G\) to group \(H\) preserving the group operation. "Onto" means \(f\) is surjective, so every element in \(H\) has a pre-image in \(G\).

Step 2: Identify the Generating Set

Since \(G\) is finitely generated, there is a finite set \( S = \{ g_1, g_2, \ldots, g_n \} \) such that every element of \(G\) can be expressed as a finite product of elements in \( S \) and their inverses. Our goal is to show that \(H\) has a finite generating set.

Step 3: Map Generators through Homomorphism

Apply the homomorphism \(f\) to the generating set of \(G\). Define \(T = \{ f(g_1), f(g_2), \ldots, f(g_n) \} \subseteq H\). Because \(f\) is onto, each \(h \in H\) is the image of some element in \(G\), which can be expressed in terms of \(g_1, g_2, \ldots, g_n\).

Step 4: Show \(H\) is Generated by \(T\)

For any \(h \in H\), there exists \(g \in G\) such that \(f(g) = h\). Since \(g\) can be expressed as a product of elements in \( S \), \(h = f(g) = f(g_{i_1})^{e_1} f(g_{i_2})^{e_2} \ldots f(g_{i_k})^{e_k}\) for some exponents \(e_j\). Thus, each \(h\) can be written in terms of the finite set \(T\).

Step 5: Conclude Preservation of Property

Since every element \(h \in H\) can be expressed using the finite set \(T\), \(H\) is finitely generated. This demonstrates that the property of being finitely generated is preserved under homomorphisms.

Key Concepts

Homomorphism

A homomorphism is a special kind of function connecting two groups, say \(G\) and \(H\), while respecting the group's structure. This means that if you have a group operation in \(G\), the homomorphism will map it neatly into a group operation in \(H\). Homomorphisms are key tools in group theory.
- They preserve the operation: If \(a\) and \(b\) are elements in \(G\), then for a homomorphism \(f: G \rightarrow H\), \(f(a \cdot b) = f(a) \cdot f(b)\).
- They help understand how two groups relate to each other.
- If \(f\) maps every element of \(G\) onto an element of \(H\), it's called a **surjective homomorphism**. This is crucial because it implies that \(H\) gets every bit of \(G\)'s structure, making \(H\) richly patterned based on \(G\).
Understanding homomorphisms is like finding a reliable translation between languages, except here, you're translating group elements across different groups.

Finitely Generated Groups

When we say a group is 'finitely generated,' it's like saying the group has a finite starting set from which you can build everything else.
- Suppose you have a tiny set of elements \(S = \{g_1, g_2, \ldots, g_n\}\).- The entire group \(G\) can be generated by taking finite combinations of elements from \(S\) and their inverses.
In simple terms, think of \(S\) as a small selection of building blocks, and with those, you can construct your house \(G\). The power of finitely generated groups is their simplicity; they are easier to analyze because you only need a few pieces to understand the whole.
For instance, in our problem, \(G\) was finitely generated, and the task was to show that \(H\), an image of \(G\) through a homomorphism, is also finitely generated.

Group Properties

Group properties are special characteristics or behaviors that a group can exhibit. One critical aspect of group properties is whether they persist under special functions like homomorphisms.
- **Closure**: In any group \(G\), doing an operation with any two elements within \(G\) always results in another element from \(G\).
- **Identity element**: There is an element in \(G\) that does not change others when used in the operation.
- **Inverse element**: For each element in \(G\), there exists another element such that their operation results in the identity element.
- Most interestingly, properties such as being finite, cyclic, or in our example, finitely generated, often transfer when applying specific homomorphisms. This insight sustains the idea that the fundamental characteristics of groups can reliably morph into their images.

Surjective Homomorphism

A surjective homomorphism is a homomorphism that covers every element in the target group \(H\). Imagine that every point in \(H\) catches something from \(G\).
- Mathematically, if \(f: G \rightarrow H\) is surjective, for every \(h \in H\), there is at least one \(g \in G\) such that \(f(g) = h\).
- This means \(H\) is completely filled with the images of elements from \(G\).
In our exercise, \(f\) being surjective guarantees that \(H\)'s structure can wholly and accurately reflect \(G\)'s finitely generated nature. Therefore, all of \(H\) can be generated from the images of a finite set from \(G\), preserving the finitely generated property.
Surjective homomorphisms are like complete storytellers, ensuring every part of one story is reflected in another, allowing you to preserve key details across their narrative arc.