Mathwords logoMathwords

Abelian Group — Definition, Formula & Examples

An Abelian group is a group in which the order you combine any two elements does not matter — the result is the same either way. Named after mathematician Niels Henrik Abel, these are groups where the operation is commutative.

A group (G,)(G, \cdot) is called Abelian if it satisfies the commutative property: for all a,bGa, b \in G, ab=baa \cdot b = b \cdot a. This is in addition to the standard group axioms of closure, associativity, the existence of an identity element, and the existence of inverses.

How It Works

To verify that an algebraic structure is an Abelian group, you must check five properties: closure, associativity, existence of an identity, existence of inverses, and commutativity. The first four make it a group; the fifth — commutativity — makes it Abelian. Many familiar number systems form Abelian groups under addition, such as (Z,+)(\mathbb{Z}, +) and (R,+)(\mathbb{R}, +). Not every group is Abelian: the symmetric group S3S_3 (permutations of three objects) is a standard counterexample where composing permutations in different orders can yield different results.

Example

Problem: Show that the integers modulo 4 under addition, (Z4,+)(\mathbb{Z}_4, +), form an Abelian group.
Step 1: Identify elements and operation: The set is {0,1,2,3}\{0, 1, 2, 3\} with addition modulo 4.
Step 2: Check group axioms: Closure: any sum mod 4 stays in the set. Associativity: modular addition is associative. Identity: 00 is the identity since a+0a(mod4)a + 0 \equiv a \pmod{4}. Inverses: each element has an inverse — for instance, the inverse of 11 is 33 and the inverse of 22 is 22.
1+30(mod4),2+20(mod4)1 + 3 \equiv 0 \pmod{4}, \quad 2 + 2 \equiv 0 \pmod{4}
Step 3: Check commutativity: For any two elements, the order of addition does not matter. For example:
1+3=3+10(mod4)1 + 3 = 3 + 1 \equiv 0 \pmod{4}
Answer: (Z4,+)(\mathbb{Z}_4, +) satisfies closure, associativity, identity, inverses, and commutativity, so it is an Abelian group.

Why It Matters

Abelian groups appear throughout mathematics: the classification of finitely generated Abelian groups is a cornerstone theorem in abstract algebra. They are essential in number theory, cryptography (elliptic curve groups), coding theory, and physics (symmetry groups in quantum mechanics).

Common Mistakes

Mistake: Assuming every group is Abelian because familiar examples like integer addition are commutative.
Correction: Many important groups are non-Abelian. Matrix multiplication under GLn(R)GL_n(\mathbb{R}) and permutation groups SnS_n for n3n \geq 3 are standard counterexamples. Always verify commutativity explicitly.