# # Understanding Finite Groups: Classification and Geometric Relevance

Written on

## Introduction to Groups

A significant area of higher-level abstract algebra is group theory, which, as implied by its name, focuses on the study of groups. Groups are defined as abstract structures that consist of a collection of elements linked by an operation reminiscent of addition or multiplication. These elements and operations adhere to specific axioms.

To begin with, the operation must ensure that the result remains within the collection, known as closure. Additionally, there exists a unique element, termed the identity, which does not alter other elements when combined with them. Furthermore, for every element in the group, there exists an inverse that allows one to reverse the operation performed. Lastly, the operation must be associative, meaning that the order of operations does not affect the outcome.

Image by Siora Photography on Unsplash.

For those familiar with mathematical formalism, a group can be defined as follows:

A group G = (G,?) comprises a set G and a binary operation ? : G × G → G, satisfying these conditions:

- (associativity) (a?b)?c=a?(b?c) for all a,b,c ∈ G.
- (closure) for all a,b ∈ G, a?b ∈ G.
- (identity) there exists an element e, known as the identity element, such that e?a=a?e=a for all a ∈ G.
- (inverses) for every a ∈ G, there is an element b ∈ G such that a?b=b?a=e.

Two initial examples of groups include (?, +)—the integers with addition as the operation—and (?, ×)—the rational numbers with multiplication. It is important to note that (?, ×)—the integers with multiplication—fails to be a group due to the absence of inverses. For example, the integer 2 lacks a multiplicative inverse within the integers, since 1/2 is not an integer.

## Finite and Infinite Groups

When the collection of elements within a group is finite, the group is termed finite; conversely, if it is infinite, the group is classified as infinite. The examples mentioned above—(?, +) and (?, ×)—are both infinite groups.

While one might assume that finite groups are simpler to comprehend, this is not universally true. Finite groups play a crucial role in the evolution of algebra and mathematics overall, serving as a rich source of examples that have led to profound theories. They also provide valuable insights into infinite groups. However, the complexity of their structure can be quite remarkable.

The exploration of finite groups and their characteristics is known as finite group theory.

## Classification of Finite Simple Groups

To classify finite groups effectively, we need a precise method to categorize them into distinct classes, with each class containing groups of similar structures. This can be accomplished through the concept of isomorphism.

An isomorphism is a mapping between two groups, say G and H, that preserves their binary operations, ensuring that each element of G corresponds uniquely to an element of H. Moreover, the identity element of G must map to the identity element of H. Groups are considered isomorphic if such a mapping exists, implying they are fundamentally the same group with merely relabeled elements.

Image by Roger Mager on Unsplash.

When it comes to finite groups, we aim to categorize them into classes comprising groups that are isomorphic to each other. To facilitate classification, it is also useful to organize them by their size, or the number of elements within the set G. To achieve this, we need to identify all isomorphism classes of groups of sizes 2, 3, 4, 5, and so forth.

As the size of G increases, the complexity of identifying all possible isomorphism classes also escalates. A strategic approach is to pinpoint the fundamental building blocks of finite groups and understand how to construct new groups from these. Fortunately, these building blocks, known as simple groups, do exist.

Simple groups are a vital category of groups, and while a formal definition is not provided here, they can be viewed as the foundational components in the realm of groups. They possess no substructures and can be utilized to construct all other types of finite groups.

Remarkably, mathematicians have made significant progress in classifying finite simple groups. They have successfully cataloged all finite simple groups, which is one of the most extraordinary achievements in modern mathematics. This extensive classification is documented across thousands of pages in numerous journal articles authored by over a hundred contributors. The entire endeavor concluded in 2004, spanning approximately 50 years. The classification indicates that, up to isomorphism, groups can be categorized as:

- Cyclic
- Alternating
- Groups of Lie type
- Sporadic groups — a collection of 28 exceptional cases that do not fall into the first three categories.

While discussing the explicit definitions of these classes exceeds the scope of this article, I will cover some of them in future discussions.

## Exploring Groups and Symmetry

Groups facilitate the exploration of various symmetries, not only within mathematical contexts but also throughout the universe. They provide an algebraic framework for describing symmetries, which can be invaluable, particularly when visualizing transformations. With modern computational software such as GAP, MAGMA, Mathematica, SAGE, and Matlab, having an algebraic perspective on problems is essential.

The most frequently encountered classes of groups in the study of symmetry include symmetric groups (also known as permutation groups), dihedral groups, and, for more advanced topics, Galois groups.

Symmetric groups essentially describe all possible permutations of a set of n elements, where n is a natural number. The binary operation involved is composition—performing one permutation after another. Mathematically, the symmetric group on n elements is denoted as S_n, and these groups are finite with a size of n!.

Dihedral groups describe the symmetries of regular polygons. For a regular polygon with n vertices (e.g., n=3 for an equilateral triangle, n=4 for a square, n=5 for a pentagon, and so on), the dihedral group of an n-gon captures its symmetries, which consist of rotations and reflections. Like symmetric groups, the binary operation for dihedral groups is composition, with the group comprising 2n elements. There is some debate within the mathematical community regarding their notation; some prefer D_2n to emphasize the group's size, while others use D_n to highlight the number of vertices.

Galois groups are intriguing but require further background for proper definition. They are fundamental in the field of Galois theory, which I will address in a subsequent article.