Home › Mathematics › Abstract Algebra › Group Theory
Abstract Algebra Updated: Nov 3, 2024 ~12 min read Verified by 4 domain experts

Group Theory

Group theory is a foundational branch of mathematics that studies the algebraic structures known as groups—sets equipped with a single associative binary operation that satisfies closure, identity, and inverse axioms. It provides a unifying framework for understanding symmetry, transformations, and structural invariants across physics, chemistry, cryptography, and computer science.

Contents

Definition & Axioms

A group is an ordered pair \((G, *)\) consisting of a set \(G\) and a binary operation \(*: G \times G \to G\) that satisfies the following four axioms:

📘 Definition

For \((G, *)\) to be a group, it must satisfy:

  • Closure: \(\forall a, b \in G, \; a * b \in G\)
  • Associativity: \(\forall a, b, c \in G, \; (a * b) * c = a * (b * c)\)
  • Identity: \(\exists e \in G \) such that \(\forall a \in G, \; e * a = a * e = a\)
  • Inverse: \(\forall a \in G, \; \exists a^{-1} \in G \) such that \(a * a^{-1} = a^{-1} * a = e\)

If the operation is also commutative (\(a * b = b * a\)), the group is called abelian (or commutative). Most introductory examples are abelian, but non-abelian groups are essential for modeling complex symmetries.

Historical Development

The origins of group theory trace back to the early 19th century, primarily through the work of Évariste Galois, who introduced permutation groups to determine the solvability of polynomial equations by radicals. His work laid the groundwork for what is now known as Galois theory.

Subsequent formalization came from Arthur Cayley, who provided the first abstract definition of a finite group in 1854, and Felix Klein, whose 1872 Erlangen Program redefined geometry as the study of invariants under transformation groups.

The 20th century saw the classification of finite simple groups (completed in 2004 after 150 years of effort), a landmark achievement involving hundreds of mathematicians and spanning over 10,000 pages of proofs.

Fundamental Concepts

📐 Theorem: Lagrange's Theorem

For any finite group \(G\) and any subgroup \(H \subseteq G\), the order (number of elements) of \(H\) divides the order of \(G\):

$$|H| \mid |G|$$

Subgroups & Cosets

A subgroup \(H\) of \(G\) is a subset that itself forms a group under the same operation. Left and right cosets partition \(G\) into disjoint sets of equal size, forming the basis for quotient structures.

Homomorphisms & Isomorphisms

A group homomorphism is a structure-preserving map \(\phi: G \to H\) such that \(\phi(a * b) = \phi(a) \cdot \phi(b)\). If \(\phi\) is bijective, it is an isomorphism, indicating \(G\) and \(H\) are structurally identical.

Quotient Groups

When \(N \triangleleft G\) is a normal subgroup, the set of cosets \(G/N\) forms a group under \((aN)(bN) = (ab)N\). Quotient groups are central to the isomorphism theorems and modular arithmetic.

Key Examples

💡 Example 1: Integers under Addition

\((\mathbb{Z}, +)\) is an infinite abelian group. Identity: \(0\). Inverse of \(n\): \(-n\).

💡 Example 2: Symmetric Group \(S_n\)

The set of all permutations of \(n\) elements under composition. Non-abelian for \(n \geq 3\). Order: \(n!\).

💡 Example 3: Modular Arithmetic \(\mathbb{Z}_n^*\)

Units modulo \(n\) under multiplication. Forms a finite abelian group of order \(\phi(n)\), crucial in RSA cryptography.

Other notable families include cyclic groups \(\mathbb{Z}_n\), dihedral groups \(D_n\) (symmetries of regular polygons), and general linear groups \(GL(n, \mathbb{F})\) (invertible matrices).

Applications

  • Crystallography & Chemistry: Space groups classify crystal structures; point groups describe molecular symmetry and spectroscopy.
  • Particle Physics: Lie groups (e.g., \(SU(3) \times SU(2) \times U(1)\)) underpin the Standard Model of quantum field theory.
  • Cryptography: Elliptic curve cryptography relies on the group structure of rational points on cubic curves.
  • Computer Science: Group theory informs automata theory, quantum algorithms (Shor's algorithm), and error-correcting codes.
  • Robotics & Computer Vision: Special Euclidean group \(SE(3)\) models rigid body transformations in 3D space.

References & Further Reading

Primary Sources

  1. Dummit, D. S., & Foote, R. M. (2004). Abstract Algebra (3rd ed.). Wiley.
  2. Rotman, J. J. (2015). An Introduction to the Theory of Groups (5th ed.). Springer.
  3. Artin, M. (2011). Algebra (2nd ed.). Pearson.
  4. Galois, É. (1846). "Réflexions sur la résolution algébrique des équations." Journal de Mathématiques Pures et Appliquées.

External Knowledge Links

  1. Wikipedia. "Group (mathematics)." Wikimedia Foundation.
  2. ncat Lab. "Group theory." Open Knowledge Base.
  3. ATLAS of Finite Group Representations. University of Auckland.
}