# Abstract Algebra

**Abstract algebra** is a broad field of mathematics, concerned with algebraic structures such as groups, rings, vector spaces, and algebras.

Roughly speaking, abstract algebra is the study of what happens when certain properties of number systems are abstracted out; for instance, altering the definitions of the basic arithmetic operations result in a structure known as a ring, so long as the operations are consistent.

For example, the 12-hour clock is an example of such an object, where the arithmetic operations are redefined to use modular arithmetic (with modulus 12). An even further level of abstraction--where only one operation is considered--allows the clock to be understood as a group. In either case, the abstraction is useful because many properties can be understood without needing to consider the specific structure at hand, which is especially important when considering the relationship(s) between structures; the concept of a group isomorphism is an example.

#### Contents

## Levels of Abstraction in Abstract Algebra

It is possible to abstract away practically all of the properties found in the "usual" number systems, the tradeoff being that the resulting object--known as a **magma** (which consists of a set and a binary operation, that need not satisfy any properties other than closure)--is simply too general to be interesting. On the other extreme, it is possible to abstract out practically no properties, which allows for many results to be found, but the resulting object (the usual number systems) is too specific to solve more general problems.

Most of abstract algebra is dedicated to objects that have a reasonable balance between generality and structure, most notably **groups** and **rings** (discussed in more detail below) in which most of the basic *properties* of arithmetic are maintained, but their specifics are left free. Still, some higher levels of abstraction are occasionally useful; **quasigroups**, for instance, are related to Latin squares, and **monoids** are often used in computer science and are simple examples of categories.

## Group Theory

*Main article: Group theory*
Group theory is useful as an abstract notion of symmetry, which makes it applicable to a wide range of areas: the relationship between the roots of a polynomial (as in Galois theory) and the solution methods to the Rubik's cube are both prominent examples.

Informally, a **group** is a set equipped with a binary operation \(\circ\), so that operating on any two elements of the group also produces an element of the group. For example, the integers form a group under addition, and the nonzero real numbers form a group under multiplication. The \(\circ\) operation needs to satisfy a number of properties analogous to the ones it satisfies for these "normal" number systems: it should be **associative** (which essentially means that the order of operations doesn't matter), and there should be an **identity** element (0 in the first example above, and 1 in the second). More formally, a group is a set equipped with an operation \(\cdot\) such that the following axioms hold; note that \(\cdot\) **does not** necessarily refer to multiplication; rather, it should be viewed as a function on two variables (indeed, \(\cdot\) can even refer to addition):

Group Axioms

1)

Associativity.For any \(x, y, z \in G \), we have \( (x \cdot y) \cdot z = x \cdot (y \cdot z) \).

2)Identity.There exists an \( e \in G \), such that \( e \cdot x = x \cdot e = x \) for any \(x \in G \). We say that \(e\) is an identity element of \(G\).

3)Inverse.For any \(x \in G\), there exists a \(y \in G\) such that \(x \cdot y = e = y \cdot x \). We say that \(y\) is an inverse of \(x\).

It is also worth noting the closure axiom for emphasis, as it is important to verify closure when working with *subgroups* (groups contained entirely within another):

4)

Closure.For any \(x, y \in G \), \(x*y \) is also in \(G\).

Additional examples of groups include

- \(\mathbb{Z}_n\), the set of integers \(\{0, 1, \ldots, n-1\}\) with the operation addition modulo \(n\)
- \(S_n\), the set of permutations of \(\{1, 2, \ldots, n\}\) with the operation of composition.

\(S_3\) is worth special note as an example of a group that is not **commutative**, meaning that \(a \cdot b = b \cdot a\) does *not* generally hold. Formally speaking, \(S_3\) is **nonabelian** (an **abelian group** is one in which the operation is commutative). When the operation is not clear from context, groups are written in the form \((\text{set}, \text{op})\); e.g. the nonzero reals equipped with multiplication can be written as \((\mathbb{R}^*, \cdot)\).

Much of group theory (and abstract algebra in general) is centered around the concept of a **group homomorphism**, which essentially means a mapping from one group to another that preserves the structure of the group. In other words, the mapping of the product of two elements should be the same as the product of the two mappings; intuitively speaking, the product of two elements should not change under the mapping. Formally, a homomorphism is a function \(\phi: G \rightarrow H\) such that

\[\phi(g_1) \cdot_H \phi(g_2) = \phi(g_1 \cdot_G g_2),\]

where \(\cdot_H\) is the operation on \(H\) and \(\cdot_G\) is the operation on \(G\). For example, \(\phi(g) = g \pmod n\) is an example of a group homomorphism from \(\mathbb{Z}\) to \(\mathbb{Z}_n\). The concept of potentially differing operations is necessary; for example, \(\phi(g)=e^g\) is an example of a group homomorphism from \((\mathbb{R},+)\) to \((\mathbb{R}^{*},\cdot)\).

## Ring Theory

*Main article: Ring theory*

**Rings** are one of the lowest level of abstraction, essentially obtained by overwriting the addition and multiplication functions simultaneously (compared to groups, which uses only one operation). Thus a ring is--in some sense--a combination of multiple groups, as a ring can be viewed as a group over either one of its operations. This means that the analysis of groups is also applicable to rings, but rings have additional properties to work with (the tradeoff being that rings are less general and require more conditions).

The definition of a ring is similar to that of a group, with the extra condition that the distributive law holds as well:

A

ringis a set \( R \) together with two operations \( + \) and \( \cdot \) satisfying the following properties (ring axioms):(1) \( R \) is an abelian group under addition. That is, \( R\) is closed under addition, there is an additive identity (called \( 0 \)), every element \(a\in R\) has an additive inverse \(-a\in R \), and addition is associative and commutative.

(2) \( R \) is closed under multiplication, and multiplication is associative: \(\forall a,b\in R\quad a.b\in R\\ \forall a,b,c\in R\quad a\cdot ( b\cdot c ) =( a\cdot b ) \cdot c.\)

(3) Multiplication distributes over addition: \(\forall a,b,c\in R\\ a\cdot \left( b+c \right) =a\cdot b+a\cdot c\quad \text{ and }\quad \left( b+c \right) \cdot a=b\cdot a+c\cdot a.\)

A ring is usually denoted by \(\left( R,+,. \right) \) and often it is written only as \(R\) when the operations are understood.

For example, the integers \(\mathbb{Z}\) form a ring, as do the integers modulo \(n\) \((\)denoted by \(\mathbb{Z}_n).\) Less obviously, the square matrices of a given size also form a ring; this ring is noncommutative. Commutative ring theory, or commutative algebra, is much better understood than noncommutative rings are.

As in groups, a ring homomorphism can be defined as a mapping preserving the structure of *both* operations.

Rings are used extensively in algebraic number theory, where "integers" are reimagined as slightly different objects (for example, Gaussian integers), and the effect on concepts such as prime factorization is analyzed. Of particular interest is the fundamental theorem of arithmetic, which involves the concept of unique factorization; in other rings, this may not hold, such as

\[6 = 2 \cdot 3 = \big(1+\sqrt{-5}\big)\big(1-\sqrt{-5}\big).\]

Theory developed in this field solves problems ranging from sum of squares theorems to Fermat's last theorem.

## Other Applications of Abstract Algebra

Abstract algebra also has heavy application in physics and computer science through the analysis of vector spaces. For example, the Fourier transform and differential geometry both have vector spaces as their underlying structures; in fact, the Poincare conjecture is (roughly speaking) a statement about whether the fundamental group of a manifold determines if the manifold is a sphere.

Related to vector spaces are modules, which are essentially identical to vector spaces but defined over a ring rather than over a field (and are thus more general). Modules are heavily related to representation theory, which views the elements of a group as linear transformations of a vector space; this is desirable to make an abstract object (a group) somewhat more concrete, in the sense that the group is better understood by translating it into a well-understood object in linear algebra (as matrices can be viewed as linear transformations, and vice versa).

The relationships between various algebraic structures are formalized using category theory.

## See Also

**Cite as:**Abstract Algebra.

*Brilliant.org*. Retrieved from https://brilliant.org/wiki/abstract-algebra/