Group (mathematics)

The possible manipulations of this Rubik's Cube form a group.

In mathematics, a group is an algebraic structure consisting of a set together with an operation that combines any two of its elements to form a third element. To qualify as a group, the set and the operation must satisfy a few conditions called group axioms, namely closure, associativity, identity and invertibility. While these are familiar from many mathematical structures, such as number systems—for example, the integers endowed with the addition operation form a group—the formulation of the axioms is detached from the concrete nature of the group and its operation. This allows one to handle entities of very different mathematical origins in a flexible way, while retaining essential structural aspects of many objects in abstract algebra and beyond. The ubiquity of groups in numerous areas—both within and outside mathematics—makes them a central organizing principle of contemporary mathematics.

Groups share a fundamental kinship with the notion of symmetry. A symmetry group encodes symmetry features of a geometrical object: it consists of the set of transformations that leave the object unchanged, and the operation of combining two such transformations by performing one after the other. Such symmetry groups, particularly the continuous Lie groups, play an important role in many academic disciplines. Matrix groups, for example, can be used to understand fundamental physical laws underlying special relativity and symmetry phenomena in molecular chemistry.

The concept of a group arose from the study of polynomial equations, starting with Évariste Galois in the 1830s. After contributions from other fields such as number theory and geometry, the group notion was generalized and firmly established around 1870. Modern group theory—a very active mathematical discipline—studies groups in their own right.Template:Cref To explore groups, mathematicians have devised various notions to break groups into smaller, better-understandable pieces, such as subgroups, quotient groups and simple groups. In addition to their abstract properties, group theorists also study the different ways in which a group can be expressed concretely (its group representations), both from a theoretical and a computational point of view. A particularly rich theory has been developed for finite groups, which culminated with the monumental classification of finite simple groups completed in 1983. Since mid-1980s geometric group theory, which studies finitely generated groups as geometric objects, has become a particularly active area in group theory.

Definition and illustration

First example: the integers

One of the most familiar groups is the set of integers Z which consists of the numbers

..., −4, −3, −2, −1, 0, 1, 2, 3, 4, ...

The following properties of integer addition serve as a model for the abstract group axioms given in the definition below.

1. For any two integers a and b, the sum a + b is also an integer. In other words, the process of adding integers two at a time can never yield a result that is not an integer. This property is known as closure under addition.
2. For all integers a, b and c, (a + b) + c = a + (b + c). Expressed in words, adding a to b first, and then adding the result to c gives the same final result as adding a to the sum of b and c, a property known as associativity.
3. If a is any integer, then 0 + a = a + 0 = a. Zero is called the identity element of addition because adding it to any integer returns the same integer.
4. For every integer a, there is an integer b such that a + b = b + a = 0. The integer b is called the inverse element of the integer a and is denoted −a.

Definition

The integers, together with the operation "+", form a mathematical object belonging to a broad class sharing similar structural aspects. To appropriately understand these structures without dealing with every concrete case separately, the following abstract definition is developed to encompass the above example along with many others, one of which is the symmetry group detailed below.

A group is a set, G, together with an operation "•" that combines any two elements a and b to form another element denoted Template:Nowrap. The symbol "•" is a general placeholder for a concretely given operation, such as the addition above. To qualify as a group, the set and operation, Template:Nowrap, must satisfy four requirements known as the group axioms:

Closure

For all a, b in G, the result of the operation a • b is also in G.Template:Cref

Associativity

For all a, b and c in G, the equation (a • b) • c = a • (b • c) holds.

Identity element

There exists an element e in G, such that for all elements a in G, the equation Template:Nowrap begine • a = a • e = aTemplate:Nowrap end holds.

Inverse element

For each a in G, there exists an element b in G such that a • b = b • a = e, where e is the identity element.

The order in which the group operation is carried out can be significant. In other words, the result of combining element a with element b need not yield the same result as combining element b with element a; the equation

Template:Nowrap begina • b = b • aTemplate:Nowrap end

may not always be true. This equation does always hold in the group of integers under addition, because Template:Nowrap begina + b = b + aTemplate:Nowrap end for any two integers (commutativity of addition). However, it does not always hold in the symmetry group below. Groups for which the equation Template:Nowrap begina • b = b • aTemplate:Nowrap end always holds are called abelian (in honor of Niels Abel). Thus, the integer addition group is abelian, but the following symmetry group is not.

Second example: a symmetry group

The symmetries (i.e., rotations and reflections) of a square form a group called a dihedral group, and denoted D₄. The following symmetries occur:

id (keeping it as is)	r1 (rotation by 90° right)	r2 (rotation by 180° right)	r3 (rotation by 270° right)
fv (vertical flip)	fh (horizontal flip)	fd (diagonal flip)	fc (counter-diagonal flip)
The elements of the symmetry group of the square (D4). The vertices are colored and numbered only to visualize the operations.

• the identity operation leaving everything unchanged, denoted id;
• rotations of the square by 90° right, 180° right, and 270° right, denoted by r₁, r₂ and r₃, respectively;
• reflections about the vertical and horizontal middle line (f_h and f_v), or through the two diagonals (f_d and f_c).

Template:Clear Any two symmetries a and b can be composed; i.e., applied one after another. The result of performing first a and then b is written symbolically from right to left as

Template:Nowrap beginb • aTemplate:Nowrap end ("apply the symmetry b after performing the symmetry a". The right-to-left notation stems from composition of functions).

The group table on the right lists the results of all such compositions possible. For example, rotating by 270° right (r₃) and then flipping horizontally (f_h) is the same as performing a reflection along the diagonal (f_d). Using the above symbols, highlighted in blue in the group table:

Template:Nowrap beginf_h • r₃ = f_d.Template:Nowrap end

Group table of D₄

•	id	r1	r2	r3	fv	fh	fd	fc
id	id	r1	r2	r3	fv	fh	fd	fc
r1	r1	r2	r3	id	fc	fd	fv	fh
r2	r2	r3	id	r1	fh	fv	fc	fd
r3	r3	id	r1	r2	fd	fc	fh	fv
fv	fv	fd	fh	fc	id	r2	r1	r3
fh	fh	fc	fv	fd	r2	id	r3	r1
fd	fd	fh	fc	fv	r3	r1	id	r2
fc	fc	fv	fd	fh	r1	r3	r2	id
The elements id, r1, r2, and r3 form a subgroup, highlighted in red (upper left region). A left and right coset of this subgroup is highlighted in green (in the last row) and yellow (last column), respectively.

Given this set of symmetries and the described operation, the group axioms can be understood as follows:

1. The closure axiom demands that the composition Template:Nowrap beginb • aTemplate:Nowrap end of any two symmetries a and b is also a symmetry. Another example for the group operation is

   Template:Nowrap beginr₃ • f_h = f_c,Template:Nowrap end

   i.e. rotating 270° right after flipping horizontally equals flipping along the counter-diagonal (f_c). Indeed every other combination of two symmetries still gives a symmetry, as can be checked using the group table.
2. The associativity constraint deals with composing more than two symmetries: given three elements a, b and c of D₄, there are two possible ways of computing "a then b then c". The requirement

   Template:Nowrap begin(a • b) • c = a • (b • c)Template:Nowrap end

   means that the composition of the three elements is independent of the priority of the operations, i.e. composing first a after b, and c to the result Template:Nowrap thereof amounts to performing a after the composition of b and c. For example, Template:Nowrap begin (f_d • f_v) • r₂ = f_d • (f_v • r₂)Template:Nowrap end can be checked using the group table at the right

   (fd • fv) • r2	=	r3 • r2	=	r1, which equals
   fd • (fv • r2)	=	fd • fh	=	r1.

3. The identity element is the symmetry id leaving everything unchanged: for any symmetry a, performing id after a (or a after id) equals a, in symbolic form,

   Template:Nowrap beginid • a = a,Template:Nowrap end

   Template:Nowrap begina • id = a.Template:Nowrap end

4. An inverse element undoes the transformation of some other element. Every symmetry can be undone: each of transformations—identity id, the flips f_h, f_v, f_d, f_c and the 180° rotation r₂—is its own inverse, because performing each one twice brings the square back to its original orientation. The rotations r₃ and r₁ are each other's inverse, because rotating one way and then by the same angle the other way leaves the square unchanged. In symbols,

   Template:Nowrap beginf_h • f_h = id,Template:Nowrap end

   Template:Nowrap beginr₃ • r₁ = r₁ • r₃ = id.Template:Nowrap end

In contrast to the group of integers above, where the order of the operation is irrelevant, it does matter in D₄: Template:Nowrap beginf_h • r₁ = f_cTemplate:Nowrap end but Template:Nowrap beginr₁ • f_h = f_d.Template:Nowrap end In other words, D₄ is not abelian, which makes the group structure more difficult than the integers introduced first.

History

Template:Main The modern concept of an abstract group developed out of several fields of mathematics. The original motivation for group theory was the quest for solutions of polynomial equations of degree higher than 4. The 19th-century French mathematician Évariste Galois, extending prior work of Paolo Ruffini and Joseph-Louis Lagrange, gave a criterion for the solvability of a particular polynomial equation in terms of the symmetry group of its roots (solutions). The elements of such a Galois group correspond to certain permutations of the roots. At first, Galois' ideas were rejected by his contemporaries, and published only posthumously. More general permutation groups were investigated in particular by Augustin Louis Cauchy. Arthur Cayley's On the theory of groups, as depending on the symbolic equation θⁿ = 1 (1854) gives the first abstract definition of a finite group.

Geometry was a second field in which groups were used systematically, especially symmetry groups as part of Felix Klein's 1872 Erlangen program. After novel geometries such as hyperbolic and projective geometry had emerged, Klein used group theory to organize them in a more coherent way. Further advancing these ideas, Sophus Lie founded the study of Lie groups in 1884.

The third field contributing to group theory was number theory. Certain abelian group structures had been used implicitly in Carl Friedrich Gauss' number-theoretical work Disquisitiones Arithmeticae (1798), and more explicitly by Leopold Kronecker. In 1847, Ernst Kummer led early attempts to prove Fermat's Last Theorem to a climax by developing groups describing factorization into prime numbers.

The convergence of these various sources into a uniform theory of groups started with Camille Jordan's Traité des substitutions et des équations algébriques (1870). Walther von Dyck (1882) gave the first statement of the modern definition of an abstract group. As of the 20th century, groups gained wide recognition by the pioneering work of Ferdinand Georg Frobenius and William Burnside, who worked on representation theory of finite groups, Richard Brauer's modular representation theory and Issai Schur's papers. The theory of Lie groups, and more generally locally compact groups was pushed by Hermann Weyl, Élie Cartan and many others. Its algebraic counterpart, the theory of algebraic groups, was first shaped by Claude Chevalley (from the late 1930s) and later by pivotal work of Armand Borel and Jacques Tits.

The University of Chicago's 1960–61 Group Theory Year brought together group theorists such as Daniel Gorenstein, John G. Thompson and Walter Feit, laying the foundation of a collaboration that, with input from numerous other mathematicians, classified all finite simple groups in 1982. This project exceeded previous mathematical endeavours by its sheer size, in both length of proof and number of researchers. Research is ongoing to simplify the proof of this classification. These days, group theory is still a highly active mathematical branch crucially impacting many other fields.Template:Cref

Simple consequences of the group axioms

Template:Main Basic facts about all groups that can be obtained directly from the group axioms are commonly subsumed under elementary group theory. For example, repeated applications of the associativity axiom show that the unambiguity of

a • b • c = (a • b) • c = a • (b • c)

generalizes to more than three factors. Because this implies that parentheses can be inserted anywhere within such a series of terms, parentheses are usually omitted.

The axioms may be weakened to assert only the existence of a left identity and left inverses. Both can be shown to be actually two-sided, so the resulting definition is equivalent to the one given above.

Uniqueness of identity element and inverses

Two important consequences of the group axioms are the uniqueness of the identity element and the uniqueness of inverse elements. There can be only one identity element in a group, and each element in a group has exactly one inverse element. Thus, it is customary to speak of the identity, and the inverse of an element.

To prove the uniqueness of an inverse element of a, suppose that a has two inverses, denoted l and r. Then

l	=	l • e		as e is the identity element
	=	l • (a • r)		because r is an inverse of a, so e = a • r
	=	(l • a) • r		by associativity, which allows to rearrange the parentheses
	=	e • r		since l is an inverse of a, i.e. l • a = e
	=	r		for e is the identity element

Hence the two extremal terms l and r are connected by a chain of equalities, so they agree. In other words there is only one inverse element of a.

Division

In groups, it is possible to perform division: given elements a and b of the group G, there is exactly one solution x in G to the equation Template:Nowrap beginx • a = bTemplate:Nowrap end. In fact, right multiplication of the equation by a⁻¹ gives the solution Template:Nowrap beginx = x • a • a⁻¹ = b • a⁻¹Template:Nowrap end. Similarly there is exactly one solution y in G to the equation Template:Nowrap begina • y = bTemplate:Nowrap end, namely Template:Nowrap beginy = a⁻¹ • bTemplate:Nowrap end. In general, x and y need not agree.

Basic concepts

The following sections use mathematical symbols such as X = {x, y, z} to denote a set X containing elements x, y, and z, or alternatively x ∈ X to restate that x is an element of X. The notation Template:Nowrap means f is a function assigning to every element of X an element of Y.

Template:See To understand groups beyond the level of mere symbolic manipulations as above, more structural concepts have to be employed.Template:Cref There is a conceptual principle underlying all of the following notions: to take advantage of the structure offered by groups (which for example sets—being "structureless"—don't have) constructions related to groups have to be compatible with the group operation. This compatibility manifests itself in the following notions in various ways. For example, groups can be related to each other via functions called group homomorphisms. By the mentioned principle, they are required to respect the group structures in a precise sense. The structure of groups can also be understood by breaking them into pieces called subgroups and quotient groups. The principle of "preserving structures"—a recurring topic in mathematics throughout—is an instance of working in a category, in this case the category of groups.

Group homomorphisms

Template:Main Group homomorphismsTemplate:Cref are functions that preserve group structure. A function Template:Nowrap begina: G → HTemplate:Nowrap end between two groups is a homomorphism if the equation

Template:Nowrap begina(g • k) = a(g) • a(k).Template:Nowrap end

holds for all elements g, k in G, i.e. the result is the same when performing the group operation after or before applying the map a. This requirement ensures that Template:Nowrap begina(1_G) = 1_HTemplate:Nowrap end, and also Template:Nowrap begina(g)⁻¹ = a(g⁻¹)Template:Nowrap end for all g in G. Thus a group homomorphism respects all the structure of G provided by the group axioms.

Two groups G and H are called isomorphic if there exist group homomorphisms Template:Nowrap begina: G → HTemplate:Nowrap end and Template:Nowrap beginb: H → GTemplate:Nowrap end, such that applying the two functions one after another (in each of the two possible orders) equal the identity function of G and H, respectively. That is, Template:Nowrap begina(b(h)) = hTemplate:Nowrap end and Template:Nowrap beginb(a(g)) = gTemplate:Nowrap end for any g in G and h in H. From an abstract point of view, isomorphic groups carry the same information. For example, proving that Template:Nowrap beging • g = 1Template:Nowrap end for some element g of G is equivalent to proving that Template:Nowrap begina(g) • a(g) = 1,Template:Nowrap end because applying a to the first equality yields the second, and applying b to the second gives back the first.

Subgroups

Template:Main Informally, a subgroup is a group H contained within a bigger one, G. Concretely, the identity element of G is contained in H, and whenever h₁ and h₂ are in H, then so are Template:Nowrap and h₁⁻¹, so the elements of H, equipped with the group operation on G restricted to H, form indeed a group.

In the example above, the identity and the rotations constitute a subgroup Template:Nowrap beginR = {id, r₁, r₂, r₃}Template:Nowrap end, highlighted in red in the group table above: any two rotations composed are still a rotation, and a rotation can be undone by (i.e. is inverse to) the complementary rotations 270° for 90°, 180° for 180°, and 90° for 270° (note that rotation in the opposite direction is not defined). The subgroup test is a necessary and sufficient condition for a subset H of a group G to be a subgroup: it is sufficient to check that Template:Nowrap for all elements Template:Nowrap beging, h ∈ HTemplate:Nowrap end. Knowing the subgroups is important in understanding the group as a whole.Template:Cref

Given any subset S of a group G, the subgroup generated by S consists of products of elements of S and their inverses. It is the smallest subgroup of G containing S. In the introductory example above, the subgroup generated by r₂ and f_v consists of these two elements, the identity element id and Template:Nowrap beginf_h = f_v • r₂Template:Nowrap end. Again, this is a subgroup, because combining any two of these four elements or their inverses (which are, in this particular case, these same elements) yields an element of this subgroup.

Cosets

Template:Main In many situations it is desirable to consider two group elements the same if they differ by an element of a given subgroup. For example, in D₄ above, once a flip is performed, the square never gets back to the r₂ configuration by just applying the rotation operations (and no further flips), i.e. the rotation operations are irrelevant to the question whether a flip has been performed. Cosets are used to formalize this insight: a subgroup H defines left and right cosets, which can be thought of as translations of H by arbitrary group elements g. In symbolic terms, the left and right coset of H containing g are

Template:Nowrap begingH = {gh, h ∈ H}Template:Nowrap end and Template:Nowrap beginHg = {hg, h ∈ H}Template:Nowrap end, respectively.

The cosets of any subgroup H form a partition of G; that is, the union of all left cosets is equal to G and two left cosets are either equal or have an empty intersection. The first case Template:Nowrap beging₁H = g₂HTemplate:Nowrap end happens precisely when Template:Nowrap, i.e. if the two elements differ by an element of H. Similar considerations apply to the right cosets of H. The left and right cosets of H may or may not be equal. If they are, i.e. for all g in G, gH = Hg, then H is said to be a normal subgroup. One may then simply refer to N as the set of cosets.

In D₄, the introductory symmetry group, the left cosets gR of the subgroup R consisting of the rotations are either equal to R, if g is an element of R itself, or otherwise equal to Template:Nowrap beginU = f_vR = {f_v, f_d, f_h, f_c}Template:Nowrap end (highlighted in green). The subgroup R is also normal, because Template:Nowrap beginf_vR = U = Rf_vTemplate:Nowrap end and similarly for any element other than f_v.

Quotient groups

Template:Main In addition to disregarding the internal structure of a subgroup by considering its cosets, it is desirable to endow this coarser entity with a group law called quotient group or factor group. For this to be possible, the subgroup has to be normal. Given any normal subgroup N, the quotient group is defined by

G / N = {gN, g ∈ G}, "G modulo N".

This set inherits a group operation (sometimes called coset multiplication, or coset addition) from the original group G: Template:Nowrap begin(gN) • (hN) = (gh)NTemplate:Nowrap end for all g and h in G. This definition is motivated by the idea (itself an instance of general structural considerations outlined above) that the map Template:Nowrap that associates to any element g its coset gN be a group homomorphism, or by general abstract considerations called universal properties. The coset Template:Nowrap begineN = NTemplate:Nowrap end serves as the identity in this group, and the inverse of gN in the quotient group is Template:Nowrap begin(gN)⁻¹ = (g⁻¹)N.Template:Nowrap endTemplate:Cref

•	R	U
R	R	U
U	U	R
Group table of the quotient group Template:Nowrap.

The elements of the quotient group Template:Nowrap are R itself, which represents the identity, and Template:Nowrap beginU = f_vRTemplate:Nowrap end. The group operation on the quotient is shown at the right. For example, Template:Nowrap beginU • U = f_vR • f_vR = (f_v • f_v)R = RTemplate:Nowrap end. Both the subgroup Template:Nowrap beginR = {id, r₁, r₂, r₃}Template:Nowrap end, as well as the corresponding quotient are abelian, whereas D₄ is not abelian. Building bigger groups by smaller ones, such as D₄ from its subgroup R and the quotient Template:Nowrap is abstracted by a notion called semidirect product.

Quotient and subgroups together form a way of describing every group by its presentation: any group is the quotient of the free group over the generators of the group, quotiented by the subgroup of relations. The dihedral group D₄, for example, can be generated by two elements r and f (for example, r = r₁, the right rotation and f = f_v the vertical (or any other) flip), which means that every symmetry of the square is a finite composition of these two symmetries or their inverses. Together with the relations

r ⁴ = f ² = (rf)² = 1,

the group is completely described. A presentation of a group can also be used to construct the Cayley graph, a device used to graphically capture discrete groups.

Sub- and quotient groups are related in the following way: a subset H of G can be seen as an injective map Template:Nowrap, i.e. any element of the target has at most one element that maps to it. The counterpart to injective maps are surjective maps (every element of the target is mapped onto), such as the canonical map Template:Nowrap.Template:Cref Interpreting subgroup and quotients in light of these homomorphisms emphasizes the structural concept inherent to these definitions alluded to in the introduction. In general, homomorphisms are neither injective nor surjective. Kernel and image of group homomorphisms and the first isomorphism theorem address this phenomenon.

Examples and applications

Template:Main Template:Multiple image Examples and applications of groups abound. A starting point is the group Z of integers with addition as group operation, introduced above. If instead of addition multiplication is considered, one obtains multiplicative groups. These groups are predecessors of important constructions in abstract algebra.

Groups are also applied in many other mathematical areas. Mathematical objects are often examined by associating groups to them and studying the properties of the corresponding groups. For example, Henri Poincaré founded what is now called algebraic topology by introducing the fundamental group. By means of this connection, topological properties such as proximity and continuity translate into properties of groups.Template:Cref For example, elements of the fundamental group are represented by loops. The second image at the right shows some loops in a plane minus a point. The blue loop is considered null-homotopic (and thus irrelevant), because it can be continuously shrunk to a point. The presence of the hole prevents the orange loop from being shrunk to a point. The fundamental group of the plane with a point deleted turns out to be infinite cyclic, generated by the orange loop (or any other loop winding once around the hole). This way, the fundamental group detects the hole.

In more recent applications, the influence has also been reversed to motivate geometric constructions by a group-theoretical background.Template:Cref In a similar vein, geometric group theory employs geometric concepts, for example in the study of hyperbolic groups. Further branches crucially applying groups include algebraic geometry and number theory.

In addition to the above theoretical applications, many practical applications of groups exist. Cryptography relies on the combination of the abstract group theory approach together with algorithmical knowledge obtained in computational group theory, in particular when implemented for finite groups. Applications of group theory are not restricted to mathematics; sciences such as physics, chemistry and computer science benefit from the concept.

Numbers

Many number systems, such as the integers and the rationals enjoy a naturally given group structure. In some cases, such as with the rationals, both addition and multiplication operations give rise to group structures. Such number systems are predecessors to more general algebraic structures known as rings and fields. Further abstract algebraic concepts such as modules and vector spaces also form groups.

Integers

The group of integers Z under addition, denoted (Z, +), has been described above. The integers, with the operation of multiplication instead of addition, (Z, ·) do not form a group. The closure, associativity and identity axioms are satisfied, but inverses do not exist: for example, Template:Nowrap begina = 2Template:Nowrap end is an integer, but the only solution to the equation Template:Nowrap begina · b = 1Template:Nowrap end in this case is b = 1/2, which is a rational number, but not an integer. Hence not every element of Z has a (multiplicative) inverse.Template:Cref

Rationals

The desire for the existence of multiplicative inverses suggests considering fractions

$\frac{a}{b}.$

Fractions of integers (with b nonzero) are known as rational numbers.Template:Cref The set of all such fractions is commonly denoted Q. There is still a minor obstacle for Template:Nowrap the rationals with multiplication, being a group: because the rational number 0 does not have a multiplicative inverse (i.e., there is no x such that Template:Nowrap beginx · 0 = 1Template:Nowrap end), (Q, ·) is still not a group.

However, the set of all nonzero rational numbers Template:Nowrap beginQ \ {0} = {q ∈ Q, q ≠ 0}Template:Nowrap end does form an abelian group under multiplication, denoted Template:Nowrap.Template:Cref Associativity and identity element axioms follow from the properties of integers. The closure requirement still holds true after removing zero, because the product of two nonzero rationals is never zero. Finally, the inverse of a/b is b/a, therefore the axiom of the inverse element is satisfied.

The rational numbers (including 0) also form a group under addition. Intertwining addition and multiplication operations yields more complicated structures called rings and—if division is possible, such as in Q—fields, which occupy a central position in abstract algebra. Group theoretic arguments therefore underlie parts of the theory of those entities.Template:Cref

Nonzero integers modulo a prime

For any prime number p, modular arithmetic furnishes the multiplicative group of integers modulo p. Its elements are integers not divisible by p, considered modulo p, i.e. two numbers are considered equivalent if their difference is divisible by p. For example, if Template:Nowrap beginp = 5Template:Nowrap end, there are exactly four group elements 1, 2, 3, 4: multiples of 5 are excluded and 6 and −4 are both equivalent to 1 etc. The group operation is given by multiplication. Therefore, Template:Nowrap begin4 · 4 = 1Template:Nowrap end, because the usual product 16 is equivalent to 1, for 5 divides Template:Nowrap begin16 − 1 = 15Template:Nowrap end, denoted

16 ≡ 1 (mod 5).

The primality of p ensures that the product of two integers neither of which is divisible by p is not divisible by p either, hence the indicated set of classes is closed under multiplication.Template:Cref The identity element is 1, as usual for a multiplicative group, and the associativity follows from the corresponding property of integers. Finally, the inverse element axiom requires that given an integer a not divisible by p, there exists an integer b such that

a · b ≡ 1 (mod p), i.e. p divides the difference Template:Nowrap.

The inverse b can be found by using Bézout's identity and the fact that the greatest common divisor Template:Nowrap equals 1. In the case Template:Nowrap beginp = 5Template:Nowrap end above, the inverse of 4 is 4, and the inverse of 3 is 2, as Template:Nowrap begin3 · 2 = 6 ≡ 1 (mod 5).Template:Nowrap end Hence all group axioms are fulfilled. Actually, this example is similar to (Q\{0}, ·) above, because it turns out to be the multiplicative group of nonzero elements in the finite field F_p, denoted F_p^×. These groups are crucial to public-key cryptography.Template:Cref

Cyclic groups

The 6th complex roots of unity form a cyclic group. z is a primitive element, but z² is not, because the odd powers of z are not a power of z².

A cyclic group is a group all of whose elements are powers (when the group operation is written additively, the term 'multiple' can be used) of a particular element a. In multiplicative notation, the elements of the group are:

..., a⁻³, a⁻², a⁻¹, a⁰ = e, a, a², a³, ...,

where a² means a • a, and a⁻³ stands for a⁻¹ • a⁻¹ • a⁻¹=(a • a • a)⁻¹ etc.Template:Cref Such an element a is called a generator or a primitive element of the group.

A typical example for this class of groups is the group of n-th complex roots of unity, given by complex numbers z satisfying Template:Nowrap beginzⁿ = 1Template:Nowrap end (and whose operation is multiplication). Any cyclic group with n elements is isomorphic to this group. Using some field theory, the group F_p^× can be shown to be cyclic: for Template:Nowrap beginp = 5,Template:Nowrap end 3 is a generator since Template:Nowrap begin3¹ = 3,Template:Nowrap end Template:Nowrap begin3² = 9 ≡ 4,Template:Nowrap end Template:Nowrap begin3³ ≡ 2,Template:Nowrap end and Template:Nowrap begin3⁴ ≡ 1.Template:Nowrap end An infinite cyclic group is isomorphic to (Z, +), the group of integers under addition introduced above. As these two prototypes are both abelian, so is any cyclic group.

The study of abelian groups is quite mature, including the fundamental theorem of finitely generated abelian groups; and reflecting this state of affairs, many group-related notions, such as center and commutator, describe the extent to which a given group is not abelian.

Symmetry groups

Template:Main Template:Seealso Symmetry groups are groups consisting of symmetries of given mathematical objects—be they of geometric nature, such as the introductory symmetry group of the square, or of algebraic nature, such as polynomial equations and their solutions. Conceptually, group theory can be thought of as the study of symmetry.Template:Cref Symmetries in mathematics greatly simplify the study of geometrical or analytical objects. A group is said to act on another mathematical object X if every group element performs some operation on X compatibly to the group law. In the rightmost example below, an element of order 7 of the (2,3,7) triangle group acts on the tiling by permuting the highlighted warped triangles (and the other ones, too). By a group action, the group pattern is connected to the structure of the object being acted on.

Rotations and flips form the symmetry group of a great icosahedron.

In chemical fields, such as crystallography, space groups and point groups describe molecular symmetries and crystal symmetries. These symmetries underlie the chemical and physical behavior of these systems, and group theory enables simplification of quantum mechanical analysis of these properties. For example, group theory is used to show that optical transitions between certain quantum levels cannot occur simply because of the symmetry of the states involved.

Not only are groups useful to assess the implications of symmetries in molecules, but surprisingly they also predict that molecules sometimes can change symmetry. The Jahn-Teller effect is a distortion of a molecule of high symmetry when it adopts a particular ground state of lower symmetry from a set of possible ground states that are related to each other by the symmetry operations of the molecule.

Likewise, group theory helps predict the changes in physical properties that occur when a material undergoes a phase transition, for example, from a cubic to a tetrahedral crystalline form. An example is ferroelectric materials, where the change from a paraelectric to a ferroelectric state occurs at the Curie temperature and is related to a change from the high-symmetry paraelectric state to the lower symmetry ferroelectic state, accompanied by a so-called soft phonon mode, a vibrational lattice mode that goes to zero frequency at the transition.

Such spontaneous symmetry breaking has found further application in elementary particle physics, where its occurrence is related to the appearance of Goldstone bosons.

Buckminsterfullerene displays icosahedral symmetry.	Ammonia, NH3. Its symmetry group is of order 6, generated by a 120° rotation and a reflection.	Cubane C8H8 features octahedral symmetry.	Hexaaquacopper(II) complex ion, [Cu(OH2)6]2+. Compared to a perfectly symmetrical shape, the molecule is vertically dilated by about 22% (Jahn-Teller effect).	The (2,3,7) triangle group, a hyperbolic group, acts on this tiling of the hyperbolic plane.

Finite symmetry groups such as the Mathieu groups are used in coding theory, which is in turn applied in error correction of transmitted data, and in CD players. Another application is differential Galois theory, which characterizes functions having antiderivatives of a prescribed form, giving group-theoretic criteria for when solutions of certain differential equations are well-behaved.Template:Cref Geometric properties that remain stable under group actions are investigated in (geometric) invariant theory.

General linear group and representation theory

Two vectors (the left illustration) multiplied by matrices (the middle and right illustrations). The middle illustration represents a clockwise rotation by 90°, while the right-most one stretches the x-coordinate by factor 2.

Matrix groups consist of matrices together with matrix multiplication. The general linear group Template:Nowrap beginGL(n, R)Template:Nowrap end consists of all invertible n-by-n matrices with real entries. Its subgroups are referred to as matrix groups or linear groups. The dihedral group example mentioned above can be viewed as a (very small) matrix group. Another important matrix group is the special orthogonal group SO(n). It describes all possible rotations in n dimensions. Via Euler angles, rotation matrices are used in computer graphics.

Representation theory is both an application of the group concept and important for a deeper understanding of groups. It studies the group by its group actions on other spaces. A broad class of group representations are linear representations, i.e. the group is acting on a vector space, such as the three-dimensional Euclidean space R³. A representation of G on an n-dimensional real vector space is simply a group homomorphism

ρ: G → GL(n, R)

from the group to the general linear group. This way, the group operation, which may be abstractly given, translates to the multiplication of matrices making it accessible to explicit computations.Template:Cref

Given a group action, this gives further means to study the object being acted on.Template:Cref On the other hand, it also yields information about the group. Group representations are an organizing principle in the theory of finite groups, Lie groups, algebraic groups and topological groups, especially (locally) compact groups.

Galois groups

Template:Main Galois groups have been developed to help solve polynomial equations by capturing their symmetry features. For example, the solutions of the quadratic equation Template:Nowrap beginax² + bx + c = 0Template:Nowrap end are given by

$x=\frac{-b\pm \sqrt{b^2-4ac}}{2a}.$

Exchanging "+" and "−" in the expression, i.e. permuting the two solutions of the equation can be viewed as a (very simple) group operation. Similar formulae are known for cubic and quartic equations, but do not exist in general for degree 5 and higher. Abstract properties of Galois groups associated with polynomials (in particular their solvability) give a criterion for polynomials that have all their solutions expressible by radicals, i.e. solutions expressible using solely addition, multiplication, and roots similar to the formula above.

The problem can be dealt with using field theory: considering the splitting field of a polynomial shifts the problem into the realm of field theory. Modern Galois theory generalizes the above type of Galois groups to field extensions and establishes—via the fundamental theorem of Galois theory—a precise relationship between fields and groups, underlining once again the ubiquity of groups in mathematics.

Finite groups

Template:Main A group is called finite if it has a finite number of elements. The number of elements is called the order of the group G. An important class is the symmetric groups S_N, the groups of permutations of N letters. For example, the symmetric group on 3 letters S₃ is the group consisting of all possible swaps of the three letters ABC, i.e. contains the elements ABC, ACB, ..., up to CBA, in total 6 (or 3 factorial) elements. This class is fundamental insofar as any finite group can be expressed as a subgroup of a symmetric group S_N for a suitable integer N (Cayley's theorem). Parallel to the group of symmetries of the square above, S₃ can also be interpreted as the group of symmetries of an equilateral triangle.

The order of an element a in a group G is the least positive integer n such that a ⁿ = e, where a ⁿ represents

$\underset{n\text{ factors}}{\underbrace{a\cdots a}},$

i.e. application of the operation • to n copies of a. (If • represents multiplication, then aⁿ corresponds to the n^th power of a.) In infinite groups, such an n may not exist, in which case the order of a is said to be infinity. The order of an element equals the order of the cyclic subgroup generated by this element.

More sophisticated counting techniques, for example counting cosets, yield more precise statements about finite groups: Lagrange's Theorem states that for a finite group G the order of any finite subgroup H divides the order of G. The Sylow theorems give a partial converse.

The dihedral group (discussed above) is a finite group of order 8. The order of r₁ is 4, as is the order of the subgroup R it generates (see above). The order of the reflection elements f_v etc. is 2. Both orders divide 8, as predicted by Lagrange's Theorem. The groups F_p^× above have order Template:Nowrap.

Classification of finite simple groups

Template:Main Mathematicians often strive for a complete classification (or list) of a mathematical notion. In the context of finite groups, this aim quickly leads to difficult and profound mathematics. According to Lagrange's theorem, finite groups of order p, a prime number, are necessarily cyclic (abelian) groups Z_p. Groups of order p² can also be shown to be abelian, a statement which does not generalize to order p³, as the non-abelian group D₄ of order 8 = 2³ above shows. Computer algebra systems can be used to list small groups, but there is no classification of all finite groups.Template:Cref An intermediate step is the classification of finite simple groups.Template:Cref A nontrivial group is called simple if its only normal subgroups are the trivial group and the group itself.Template:Cref The Jordan-Hölder theorem exhibits finite simple groups as the building blocks for all finite groups. Listing all finite simple groups was a major achievement in contemporary group theory. 1998 Fields Medal winner Richard Borcherds succeeded to prove the monstrous moonshine conjectures, a surprising and deep relation of the largest finite simple sporadic group—the "monster group"—with certain modular functions, a piece of classical complex analysis, and string theory, a theory supposed to unify the description of many physical phenomena.

Groups with additional structure

Many groups are simultaneously groups and examples of other mathematical structures. In the language of category theory, they are group objects in a category, meaning that they are objects (that is, examples of another mathematical structure) which come with transformations (called morphisms) that mimic the group axioms. For example, every group (as defined above) is also a set, so a group is a group object in the category of sets.

Topological groups

The unit circle in the complex plane under complex multiplication is a Lie group and, therefore, a topological group. It is topological since complex multiplication and division are continuous. It is a manifold and thus a Lie group, because every small piece, such as the red arc in the figure, looks like a part of the real line (shown at the bottom).

Some topological spaces may be endowed with a group law. In order for the group law and the topology to interweave well, the group operations must be continuous functions, that is, Template:Nowrap and g⁻¹ must not vary wildly if g and h vary only little. Such groups are called topological groups, and they are the group objects in the category of topological spaces. The most basic examples are the reals R under addition, Template:Nowrap, and similarly with any other topological field such as the complex numbers or p-adic numbers. All of these groups are locally compact, so they have Haar measures and can be studied via harmonic analysis. The former offer an abstract formalism of invariant integrals. Invariance means, in the case of real numbers for example:

$\int f(x)dx=\int f(x+c)dx$

for any constant c. Matrix groups over these fields fall under this regime, as do adele rings and adelic algebraic groups, which are basic to number theory. Galois groups of infinite field extensions such as the absolute Galois group can also be equipped with a topology, the so-called Krull topology, which in turn is central to generalize the above sketched connection of fields and groups to infinite field extensions. An advanced generalization of this idea, adapted to the needs of algebraic geometry, is the étale fundamental group.

Lie groups

Template:Main Lie groups (in honor of Sophus Lie) are groups which also have a manifold structure, i.e. they are spaces looking locally like some Euclidean space of the appropriate dimension. Again, the additional structure, here the manifold structure, has to be compatible, i.e. the maps corresponding to multiplication and the inverse have to be smooth.

Template:ClearA standard example is the general linear group introduced above: it is an open subset of the space of all n-by-n matrices, because it is given by the inequality

det (A) ≠ 0,

where A denotes an n-by-n matrix.

Lie groups are of fundamental importance in physics: Noether's theorem links continuous symmetries to conserved quantities. Rotation, as well as translations in space and time are basic symmetries of the laws of mechanics. They can, for instance, be used to construct simple models—imposing, say, axial symmetry on a situation will typically lead to significant simplification in the equations one needs to solve to provide a physical description.Template:Cref Another example are the Lorentz transformations, which relate measurements of time and velocity of two observers in motion relative to each other. They can be deduced in a purely group-theoretical way, by expressing the transformations as a rotational symmetry of Minkowski space. The latter serves—in the absence of significant gravitation—as a model of space time in special relativity. The full symmetry group of Minkowski space, i.e. including translations, is known as the Poincaré group. By the above, it plays a pivotal role in special relativity and, by implication, for quantum field theories. Symmetries that vary with location are central to the modern description of physical interactions with the help of gauge theory.

Generalizations

Template:Group-like structures In abstract algebra, more general structures are defined by relaxing some of the axioms defining a group. For example, if the requirement that every element has an inverse is eliminated, the resulting algebraic structure is called a monoid. The natural numbers N (including 0) under addition form a monoid, as do the nonzero integers under multiplication Template:Nowrap, see above. There is a general method to formally add inverses to elements to any (abelian) monoid, much the same way as Template:Nowrap is derived from Template:Nowrap, known as the Grothendieck group. Groupoids are similar to groups except that the composition a • b need not be defined for all a and b. They arise in the study of more complicated forms of symmetry, often in topological and analytical structures, such as the fundamental groupoid. Finally, it is possible to generalize any of these concepts by replacing the binary operation with an arbitrary n-ary one (i.e. an operation taking n arguments). With the proper generalization of the group axioms this gives rise to an n-ary group. The table gives a list of several structures generalizing groups.

See also

• Group ring
• Group algebra
• Euclidean group
• Free group
• Finitely presented group
• Fundamental group
• Grothendieck group
• Symmetry in physics

Notes

Template:Clear Template:Div col Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Cnote Template:Div col end

References

General references

• Template:Citation, Chapter 2 contains an undergraduate-level exposition of the notions covered in this article.
• Template:Citation, Chapter 5 provides a layman-accessible explanation of groups.
• Template:Fulton-Harris.
• Template:Citation, an elementary introduction.
• Template:Citation.
• Template:Citation.
• Template:Lang Algebra
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.

Special references

• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Fr icon Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:De icon Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation
• Template:Citation.
• Template:Citation.
• Template:Neukirch ANT.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:Citation.

Historical references

• Template:Citation
• Template:Citation.
• Template:Citation.
• Template:Citation.
• Template:De icon Template:Citation.
• Template:Fr icon Template:Citation (Galois work was first published by Joseph Liouville in 1843).
• Template:Fr icon Template:Citation.
• Template:Citation.
• Template:De icon Template:Citation.
• Template:Citation
• Template:Citation.
• Template:Citation.