In abstract algebra, a group is a mathematical structure consisting of a set of elements and a binary operation that combines any two elements to form a third element, subject to certain axioms. An abelian group, also known as a commutative group, is a group in which the binary operation is commutative, that is, for all elements a and b in the group, ab = ba. In this article, we will discuss how to prove that a given group is abelian.

Proving a Group is Abelian

To prove that a group is abelian, we need to show that the binary operation of the group is commutative. That is, for any elements a and b in the group, we must show that ab = ba. There are several approaches to proving that a group is abelian, including using the group’s defining properties, using subgroup properties, and using element properties.

Using the Group’s Defining Properties

The most straightforward way to prove that a group is abelian is to use the group’s defining properties. Recall that a group is a set G together with a binary operation * that satisfies the following four axioms:

Closure: For all a, b in G, a * b is also in G.
Associativity: For all a, b, c in G, (a * b) * c = a * (b * c).
Identity: There exists an element e in G such that for all a in G, a * e = e * a = a.
Inverse: For each a in G, there exists an element a’ in G such that a * a’ = a’ * a = e.
To prove that a group is abelian using these properties, we need to show that ab = ba for any elements a and b in the group. To do this, we can use the associative and identity properties of the group. First, we have:

ab = (ae)b [identity property]
= a(eb) [associative property]
= (be)a [identity property]
= ba [associative property]
Therefore, we have shown that the group is abelian.

Using Subgroup Properties

Another approach to proving that a group is abelian is to use the properties of its subgroups. Recall that a subgroup H of a group G is a subset of G that is itself a group under the same binary operation as G. If a subgroup H of G is such that for any a, b in H, ab = ba, then H is said to be a commutative subgroup of G.

To prove that a group G is abelian using subgroup properties, we can show that every element of G belongs to a commutative subgroup. To do this, we can consider the cyclic subgroups of G. A cyclic subgroup of G is a subgroup generated by a single element a of G, that is, the set {a^n | n ∈ Z}. If every cyclic subgroup of G is commutative, then G is abelian.

To see why this is true, suppose that G is a group such that every cyclic subgroup is commutative, and b be two elements in G. Then, we can consider the cyclic subgroups generated by a and b, denoted by and , respectively. Since and are commutative subgroups, we have ab = ba for any a and b in G. Therefore, G is abelian.

Using Element Properties

A third approach to proving that a group is abelian is to use the properties of its elements. Recall that the order of an element a in a group G is the smallest positive integer n such that a^n = e, where e is the identity element of G. If every element of G has an even order, then G is abelian.

To prove this, suppose that G is a group such that every element has an even order, and let a and b be two elements in G. Then, we have:

(ab)^2 = abab = aabb = (ba)^2
where we have used the commutativity of a and b in the last step. Since ab and ba have even order, it follows that (ab)^2 = (ba)^2 = e. Therefore, we have ab = ba, and G is abelian.

Examples

Let’s look at some examples of how to prove that a group is abelian using the methods discussed above.

Example 1: The Group of Integers under Addition

Consider the group Z of integers under addition. To prove that Z is abelian, we can use the group’s defining properties. For any integers a and b, we have:

a + b = b + a
Therefore, Z is abelian.

Example 2: The Group of 2×2 Matrices with Determinant 1

Consider the group SL(2, R) of 2×2 matrices with real entries and determinant 1, under matrix multiplication. To prove that SL(2, R) is abelian, we can use the subgroup properties. Note that the set of matrices of the form:

(a 0)
(0 a)
where a is a real number, forms a commutative subgroup of SL(2, R). Since every element of SL(2, R) can be written as a product of these matrices, it follows that SL(2, R) is abelian.

Example 3: The Group of Symmetric Matrices

Consider the group Sym(n) of n x n symmetric matrices under matrix multiplication. To prove that Sym(n) is abelian, we can use the element properties. Note that the order of a symmetric matrix is always even, since (A^2)_{i,j} = ∑A_{i,k}A_{k,j} = ∑A_{j,k}A_{k,i} = (A^2)_{j,i}. Therefore, by the argument given above, Sym(n) is abelian.

Conclusion

In this article, we have discussed how to prove that a given group is abelian. We have seen that there are several approaches to proving that a group is abelian, including using the group’s defining properties, using subgroup properties, and using element properties. It is important to notelet a and that not all groups are abelian, and that determining whether a group is abelian can be a non-trivial problem in some cases.

Understanding the properties of abelian groups is important in many areas of mathematics and beyond, including number theory, cryptography, and physics. Abelian groups play a key role in the study of symmetry, and they are a fundamental concept in algebraic geometry and topology.

In conclusion, the ability to recognize and prove that a group is abelian is a useful skill for mathematicians and scientists. By understanding the properties of abelian groups, we can gain deeper insight into the structure and behavior of many mathematical and physical systems.