Problem 1 - A Book of Abstract Algebra

Question

There are some group properties which, if they are true in \(G / H\) and in \(H\), must be true in \(G .\) Here is a sampling. Let \(G\) be a group, and \(H\) a normal subgroup of \(G\). Prove: If every element of \(G / H\) has finite order, and every element of \(H\) has finite order, then every element of \(G\) has finite order.

Step-by-Step Solution

Answer

Every element of \(G\) has finite order because \(g^n \in H\) has finite order in \(H\), leading to \(g\) having finite order in \(G\).

Step 1: Understanding the Group Properties

We are given a group \(G\) with a normal subgroup \(H\), and we know that each element of the quotient group \(G/H\) has finite order. Additionally, each element of \(H\) has finite order. We need to prove that every element in \(G\) has finite order.

Step 2: Define an Element in Quotient Group

Consider an element \(g \in G\). Its corresponding element in \(G/H\) is the coset \(gH\). By the problem statement, \(gH\) has finite order, say \(n\). This means \((gH)^n = H\), which is the identity element in \(G/H\).

Step 3: Relate to Elements in Subgroup

Express \((gH)^n = H\) in terms of the group operation: \(g^nH = H\). This means \(g^n \in H\), where \(g^n\) is some element in the subgroup \(H\).

Step 4: Use Properties of H

Since \(g^n \in H\) and every element of \(H\) has finite order, the element \(g^n\) itself must have finite order. Let the order be \(m\), so \(g^{nm} = e\), where \(e\) is the identity element in \(G\).

Step 5: Establish Finite Order for g

Since \(g^{nm} = e\), the element \(g\) has finite order \(nm\). Thus, every element \(g\) in \(G\) has finite order, confirmed by constructing such an \(nm\).

Key Concepts

Normal Subgroup

A normal subgroup is a very special type of subgroup. In a group, a subgroup like this interacts nicely with the entire group structure. For a subgroup \( H \) of a group \( G \) to be normal, for every element \( g \) in \( G \), the equation \( gHg^{-1} = H \) must hold. This property ensures that the subgroup "behaves" consistently under conjugation by elements of \( G \).
One of the key outcomes of having a normal subgroup is the ability to form a quotient group, denoted \( G/H \). The quotient group is formed by grouping elements together into cosets, specifically \( gH \), where \( g \in G \).

• Normal subgroups allow for the formation of these quotient groups, which have well-defined group operations.
• This leads to a simplification of complex group structures by examining their components.

In our exercise, \( H \) is a normal subgroup, which makes examining the properties of the quotient group \( G/H \) and their effects on \( G \) possible.

Finite Order

The order of an element in group theory is a measure of how many times you need to apply the group operation to get back to the identity element. If an element has finite order, this means there is a positive integer \( n \) such that the element raised to the power \( n \) yields the identity element of the group.
In simpler terms, if you keep combining an element with itself, you'll eventually reach the starting point, which is the identity element. In a given group,\( G \), if every element has finite order, it is significant because:

• The group is called a torsion group.
• Understanding the finite order of elements can help you determine the structure and characteristics of the group.

For our exercise, we examined how if elements of the quotient group \( G/H \) and subgroup \( H \) both have finite order, then all elements in the original group \( G \) must also have finite order. It follows logically because elements in \( G \) are composed of elements having finite orders within their respective structures.

Group Properties

Groups have various properties that help mathematicians understand and classify them. Major properties include whether the group is abelian (commutative), the existence of subgroups, and element orders.
Among these properties, the concept of order plays a special role as it aids in segmenting and comparing elements within the group structure. Besides order, there is the notion of normal subgroups, which we discussed earlier, and their importance in quotient group formation.

• A group being finitely generated or having finite order elements can imply specific structural outcomes for the group.
• The ability to factor a group into smaller components, like quotient groups, is useful for understanding larger, more complex groups.

Our problem illustrates how linking these properties allows us to show that under specific conditions—such as every element within a quotient group and its normal subgroup having finite orders—the whole group \( G \) also conforms to having finite order. Such insights into group properties are crucial in abstract algebra and have meaningful applications in various branches of mathematics.