TheInfoList

form the Rubik's Cube group. In
mathematics Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). It has no generally ...
, a group is a set equipped with a
binary operation In mathematics, a binary operation or dyadic operation is a calculation that combines two elements (called operands) to produce another element. More formally, a binary operation is an Operation (mathematics), operation of arity two. More specif ...
that combines any two elements to form a third element in such a way that three conditions called group
axiom An axiom, postulate or assumption is a statement that is taken to be true, to serve as a premise or starting point for further reasoning and arguments. The word comes from the Greek ''axíōma'' () 'that which is thought worthy or fit' or 'tha ... s are satisfied, namely
associativity In mathematics Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). ...
, identity and invertibility. One of the most familiar examples of a group is the set of
integer An integer (from the Latin wikt:integer#Latin, ''integer'' meaning "whole") is colloquially defined as a number that can be written without a Fraction (mathematics), fractional component. For example, 21, 4, 0, and −2048 are integers, while 9 ...
s together with the
addition Addition (usually signified by the plus symbol ) is one of the four basic operations of arithmetic Arithmetic (from the Ancient Greek, Greek wikt:en:ἀριθμός#Ancient Greek, ἀριθμός ''arithmos'', 'number' and wikt:en:τική#An ...
operation, but groups are encountered in numerous areas within and outside mathematics, and help focusing on essential structural aspects, by detaching them from the concrete nature of the subject of the study. Groups share a fundamental kinship with the notion of
symmetry Symmetry (from Greek συμμετρία ''symmetria'' "agreement in dimensions, due proportion, arrangement") in everyday language refers to a sense of harmonious and beautiful proportion and balance. In mathematics, "symmetry" has a more pre ...
. For example, a symmetry group encodes symmetry features of a geometrical object: the group 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.
Lie group In mathematics Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). ...
s arise as symmetry groups in geometry but appear also in the
Standard Model The Standard Model of particle physics is the theory describing three of the four known fundamental forces (the Electromagnetism, electromagnetic, Weak interaction, weak, and Strong interaction, strong interactions, and not including gravity) ... of
particle physics Particle physics (also known as high energy physics) is a branch of physics Physics (from grc, φυσική (ἐπιστήμη), physikḗ (epistḗmē), knowledge of nature, from ''phýsis'' 'nature'), , is the natural science that ...
. The
Poincaré group The Poincaré group, named after Henri Poincaré (1906), was first defined by Hermann Minkowski (1908) as the Group (mathematics), group of Minkowski space#Lorentz transformations and symmetry, Minkowski spacetime isometries. It is a ten-dimensi ...
is a Lie group consisting of the symmetries of spacetime in special relativity. Point groups describe Molecular symmetry, symmetry in molecular chemistry. The concept of a group arose from the study of polynomial equations, starting with Évariste Galois in the 1830s, who introduced the term of ''group'' (''groupe'', in French) for the symmetry group of the zero of a function, roots of an equation, now called a Galois group. After contributions from other fields such as number theory and geometry, the group notion was generalized and firmly established around 1870. Modern group theory—an active mathematical discipline—studies groups in their own right. 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, both from a point of view of representation theory (that is, through the group representation, representations of the group) and of computational group theory. A theory has been developed for finite groups, which culminated with the classification of finite simple groups, completed in 2004. Since the mid-1980s, geometric group theory, which studies finitely generated groups as geometric objects, has become an active area in group theory.

# Definition and illustration

## First example: the integers

One of the more familiar groups is the set of integers :$\mathbb = \$ together with
addition Addition (usually signified by the plus symbol ) is one of the four basic operations of arithmetic Arithmetic (from the Ancient Greek, Greek wikt:en:ἀριθμός#Ancient Greek, ἀριθμός ''arithmos'', 'number' and wikt:en:τική#An ...
. For any two integers ''a'' and ''b'', the Summation, sum ''a'' + ''b'' is also an integer; this ''Closure (mathematics), closure'' property says that + is a
binary operation In mathematics, a binary operation or dyadic operation is a calculation that combines two elements (called operands) to produce another element. More formally, a binary operation is an Operation (mathematics), operation of arity two. More specif ...
on $\mathbb$. The following properties of integer addition serve as a model for the group axioms in the definition below. *For all integers ''a'', ''b'' and ''c'', one has (''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''. This property is known as ''
associativity In mathematics Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). ...
''. *If ''a'' is any integer, then and . Zero is called the ''identity element'' of addition because adding it to any integer returns the same integer. *For every integer ''a'', there is an integer ''b'' such that and . The integer ''b'' is called the ''inverse element'' of the integer ''a'' and is denoted −''a''. The integers, together with the operation +, form a mathematical object belonging to a broad class sharing similar structural aspects. To appropriately understand these structures as a collective, the following definition is developed.

## Definition

A group is a set ''G'' together with a
binary operation In mathematics, a binary operation or dyadic operation is a calculation that combines two elements (called operands) to produce another element. More formally, a binary operation is an Operation (mathematics), operation of arity two. More specif ...
on ''G'', here denoted , that combines any two elements ''a'' and ''b'' to form an element of ''G'', denoted , in a way such that the following three requirements, known as ''group axioms'', are satisfied: ;Associativity: For all ''a'', ''b'', ''c'' in ''G'', one has (''a'' ⋅ ''b'') ⋅ ''c'' = ''a'' ⋅ (''b'' ⋅ ''c''). ;Identity element: There exists an element ''e'' in ''G'' such that, for every ''a'' in ''G'', one has and . Such an element is unique (#Uniqueness of identity element, see below). It is called ''the identity element'' of the group. ;Inverse element: For each ''a'' in ''G'', there exists an element ''b'' in ''G'' such that and , where ''e'' is the identity element. For each ''a'', the element ''b'' is unique (#Uniqueness of inverses, see below); it is called ''the inverse'' of ''a'' and is commonly denoted ''a''−1.

## Notation and terminology

Formally, the group is the ordered pair of a set and a binary operation on this set that satisfies the group axioms. The set is called the ''underlying set'' of the group, and the operation is called the ''group operation'' or the ''group law''. A group and its underlying set are thus two different mathematical objects. But to avoid cumbersome notation, it is common to abuse of notation, abuse notation by using the same symbol to denote both. This reflects also an informal way of thinking, that the group is the same as the set except that it has been enriched by additional structure provided by the operation. For example, consider the set of real numbers $\mathbb R$, which has the operations of addition $a+b$ and multiplication $ab$. Formally, $\mathbb R$ is a set, $\left(\mathbb R,+\right)$ is a group, and $\left(\mathbb R,+,\cdot\right)$ is a field (mathematics), field. But it is common to write $\mathbb R$ to denote any of these three objects. The ''additive group'' of the field $\mathbb R$ is the group whose underlying set is $\mathbb R$ and whose operation is addition. The ''multiplicative group'' of the field $\mathbb R$ is the group $\mathbb^$ whose underlying set is the set of nonzero real numbers $\mathbb \setminus \$ and whose operation is multiplication. More generally, one speaks of an ''additive group'' whenever the group operation is notated as addition; in this case, the identity is typically denoted , and the inverse of an element is denoted . Similarly, one speaks of a ''multiplicative group'' whenever the group operation is notated as multiplication; in this case, the identity is typically denoted , and the inverse of an element is denoted . In a multiplicative group, the operation symbol is usually omitted entirely, so that the operation is denoted by juxtaposition, instead of . The definition of a group does not require that for all elements and in . If this additional condition holds, then the operation is said to be commutative, and the group is called an abelian group. It is a common convention that for an abelian group either additive or multiplicative notation may be used, but for a nonabelian group only multiplicative notation is used. Several other notations are commonly used for groups whose elements are not numbers. For a group whose elements are function (mathematics), functions, the operation is often function composition $f\circ g$; then the identity may be denoted . In the more specific cases of geometric transformation groups, symmetry (mathematics), symmetry groups, permutation groups, and automorphism groups, the symbol $\circ$ is often omitted, as for multiplicative groups. Many other variants of notation may be encountered.

## Alternative definition

An equivalent definition of group consists of replacing the "there exist" part of the group axioms by operations whose result is the element that must exist. So, a group is a set equipped with three operations, a
binary operation In mathematics, a binary operation or dyadic operation is a calculation that combines two elements (called operands) to produce another element. More formally, a binary operation is an Operation (mathematics), operation of arity two. More specif ...
, which is the group operation, a unary operation, which provides the inverse of its single operand, and a nullary operation, which has no operand and results in the identity element. Otherwise, the group axioms are exactly the same. This variant of the definition avoids existential quantifiers. It is generally preferred for computational group theory, computing with groups and for computer-aided proofs. This formulation exhibits groups as a variety of universal algebra. It is also useful for talking of properties of the inverse operation, as needed for defining topological groups and group objects.

## Second example: a symmetry group

Two figures in the plane are congruence (geometry), congruent if one can be changed into the other using a combination of rotation (mathematics), rotations, reflection (mathematics), reflections, and translation (geometry), translations. Any figure is congruent to itself. However, some figures are congruent to themselves in more than one way, and these extra congruences are called symmetry, symmetries. A square has eight symmetries. These are: * the identity operation leaving everything unchanged, denoted id; * rotations of the square around its center by 90°, 180°, and 270° clockwise, denoted by , and , respectively; * reflections about the horizontal and vertical middle line ( and , or through the two diagonals ( and ). These symmetries are function (mathematics), functions. Each sends a point in the square to the corresponding point under the symmetry. For example, sends a point to its rotation 90° clockwise around the square's center, and sends a point to its reflection across the square's vertical middle line. Function composition, Composing two of these symmetries gives another symmetry. These symmetries determine a group called the dihedral group of degree 4, denoted . The underlying set of the group is the above set of symmetries, and the group operation is function composition. Two symmetries are combined by composing them as functions, that is, applying the first one to the square, and the second one to the result of the first application. The result of performing first and then is written symbolically ''from right to left'' as $b\circ a$ ("apply the symmetry after performing the symmetry "). (This is the usual notation for composition of functions.) The group table on the right lists the results of all such compositions possible. For example, rotating by 270° clockwise () and then reflecting horizontally () is the same as performing a reflection along the diagonal (). Using the above symbols, highlighted in blue in the group table: :$f_\mathrm h \circ r_3= f_\mathrm d.$ Given this set of symmetries and the described operation, the group axioms can be understood as follows. ''Composition is a binary operation.'' That is, $a\circ b$ is a symmetry for any two symmetries and . For example, :$r_3\circ f_\mathrm h = f_\mathrm c,$ that is, rotating 270° clockwise after reflecting horizontally equals reflecting along the counter-diagonal (). Indeed every other combination of two symmetries still gives a symmetry, as can be checked using the group table. The ''associativity axiom'' deals with composing more than two symmetries: Starting with three elements , and of , there are two possible ways of using these three symmetries in this order to determine a symmetry of the square. One of these ways is to first compose and into a single symmetry, then to compose that symmetry with . The other way is to first compose and , then to compose the resulting symmetry with . These two ways must give always the same result, that is, :$\left(a\circ b\right)\circ c = a\circ \left(b\circ c\right),$ For example, $\left(f_\mathrm d\circ f_\mathrm v\right)\circ r_2 = f_\mathrm d\circ \left(f_\mathrm v\circ r_2\right)$ can be checked using the group table at the right: :$\begin \left(f_\mathrm d\circ f_\mathrm v\right)\circ r_2 &=r_3\circ r_2=r_1\\ f_\mathrm d\circ \left(f_\mathrm v\circ r_2\right) &=f_\mathrm d\circ f_\mathrm h =r_1. \end$ The ''identity element'' is , as, it does not changes any symmetry when composed with it either on the left or on the right. All symmetries have an ''inverse'': , the reflections , , , and the 180° rotation are their own inverse, because performing them twice brings the square back to its original orientation. The rotations and are each other's inverses, because rotating 90° and then rotation 270° (or vice versa) yields a rotation over 360° which leaves the square unchanged. This is easily verified on the table. In contrast to the group of integers above, where the order of the operation is irrelevant, it does matter in , as, for example, $f_\mathrm h\circ r_1=f_\mathrm c$ but $r_1\circ f_\mathrm h=f_\mathrm d$ In other words, is not abelian.

# History

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 root of a function, 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 θn = 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 geometry, 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 group In mathematics Mathematics (from Ancient Greek, Greek: ) includes the study of such topics as quantity (number theory), mathematical structure, structure (algebra), space (geometry), and calculus, change (mathematical analysis, analysis). ...
s 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 made early attempts to prove Fermat's Last Theorem by developing class group, 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) introduced the idea of specifying a group by means of generators and relations, and was also the first to give an axiomatic definition of an "abstract group", in the terminology of the time. 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 studied 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 the 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, led to the classification of finite simple groups, with the final step taken by Michael Aschbacher, Aschbacher and Smith in 2004. 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, impacting many other fields.

# Elementary consequences of the group axioms

Basic facts about all groups that can be obtained directly from the group axioms are commonly subsumed under ''elementary group theory''. For example, Mathematical induction, 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 inverse element, 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

The group axioms imply that the identity element is unique: If ''e'' and ''f'' are identity elements of a group, then ''e'' = ''e'' ⋅ ''f'' = ''f''. Therefore it is customary to speak of ''the'' identity.

## Uniqueness of inverses

The group axioms also imply that the inverse of each element is unique: If a group element ''a'' has both ''b'' and ''c'' as inverses, then : Therefore it is customary to speak of ''the'' inverse of an element.

## Division

Given elements and of a group , there is a unique solution in to the equation , namely . (One usually avoids using notations such as $\tfrac$ or , unless is abelian, because of the ambiguity of whether they mean or .) It follows that for each in , the function given by is a bijection; it is called ''left multiplication by '' or ''left translation by ''. Similarly, given and , the unique solution to is . For each , the function given by is a bijection called ''right multiplication by '' or ''right translation by ''.

# Basic concepts

: When studying sets, one uses concepts such as subset, function (mathematics), function, and quotient by an equivalence relation. When studying groups, one uses their analogues: subgroup, group homomorphism, homomorphism, and quotient group, respectively. These are explained below.

## Group homomorphisms

Group homomorphisms are functions that respect group structure; they may be used to relate two groups. A ''homomorphism'' from a group to a group is a function such that : for all elements , in . It would be natural to require also that and for all in , but this is not necessary, because these conditions are already implied by the definition above. The ''identity homomorphism'' of a group is the homomorphism defined by . An ''inverse homomorphism'' of a homomorphism is a homomorphism such that and , i.e., such that for all in and for all in . An ''group isomorphism, isomorphism'' is a homomorphism that has an inverse homomorphism; equivalently, it is a bijective homomorphism. Groups and are called ''isomorphic'' if there exists an isomorphism ; in this case, can be obtained from simply by renaming its elements according to the function ; then any statement true for is true for , provided that any specific elements mentioned in the statement are also renamed.

## Subgroups

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''1 and ''h''2 are in ''H'', then so are and ''h''1−1, so the elements of ''H'', equipped with the group operation on ''G'' restricted to ''H'', indeed form a group. In the example above, the identity and the rotations constitute a subgroup 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 conditions, necessary and sufficient condition for a nonempty subset ''H'' of a group ''G'' to be a subgroup: it is sufficient to check that for all elements . Knowing lattice of subgroups, the subgroups is important in understanding the group as a whole. 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 r2 and fv consists of these two elements, the identity element id and . 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

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 D4 above, once a reflection is performed, the square never gets back to the r2 configuration by just applying the rotation operations (and no further reflections), i.e., the rotation operations are irrelevant to the question whether a reflection 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'' cosets of ''H'' containing ''g'' are : and respectively. The left cosets of any subgroup ''H'' form a Partition of a set, partition of ''G''; that is, the Union (set theory), union of all left cosets is equal to ''G'' and two left cosets are either equal or have an empty set, empty Intersection (set theory), intersection. The first case happens if and only if, precisely when , 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'', , then ''H'' is said to be a ''normal subgroup''. In D4, 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 (highlighted in green). The subgroup ''R'' is also normal, because and similarly for any element other than fc. (In fact, in the case of D4, observe that all such cosets are equal, such that .)

## Quotient groups

In some situations the set of cosets of a subgroup can be endowed with a group law, giving a ''quotient group'' or ''factor group''. For this to be possible, the subgroup has to be normal subgroup, normal. Given any normal subgroup ''N'', the quotient group is defined by :''G'' / ''N'' = , "''G'' modulo ''N''". This set inherits a group operation (sometimes called coset multiplication, or coset addition) from the original group ''G'': 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 that associates to any element ''g'' its coset ''gN'' be a group homomorphism, or by general abstract considerations called universal property, universal properties. The coset serves as the identity in this group, and the inverse of ''gN'' in the quotient group is . The elements of the quotient group are ''R'' itself, which represents the identity, and . The group operation on the quotient is shown at the right. For example, . Both the subgroup as well as the corresponding quotient are abelian, whereas D4 is not abelian. Building bigger groups by smaller ones, such as D4 from its subgroup ''R'' and the quotient is abstracted by a notion called semidirect product. Quotient groups and subgroups together form a way of describing every group by its ''presentation of a group, presentation'': any group is the quotient of the free group over the ''Generating set of a group, generators'' of the group, quotiented by the subgroup of ''relations''. The dihedral group D4, for example, can be generated by two elements ''r'' and ''f'' (for example, ''r'' = r1, the right rotation and ''f'' = fv the vertical (or any other) reflection), which means that every symmetry of the square is a finite composition of these two symmetries or their inverses. Together with the relations :''r ''4 = ''f ''2 = (''r'' ⋅ ''f'')2 = 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 , i.e., any element of the target has at most one preimage, 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 . 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 (algebra), Kernel and Image (mathematics), image of group homomorphisms and the first isomorphism theorem address this phenomenon.

# Examples and applications

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 functor, 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, Glossary of topology, topological properties such as Neighbourhood (mathematics), proximity and continuous function, continuity translate into properties of groups. 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 homotopy, 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 number, 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. 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 ring (mathematics), rings and field (mathematics), fields. Further abstract algebraic concepts such as module (mathematics), modules, vector spaces and algebra over a field, algebras also form groups.

### Integers

The group of integers $\mathbb$ under addition, denoted $\left\left(\mathbb,+\right\right)$, has been described above. The integers, with the operation of multiplication instead of addition, $\left\left(\mathbb,\cdot\right\right)$ do ''not'' form a group. The associativity and identity axioms are satisfied, but inverses do not exist: for example, is an integer, but the only solution to the equation in this case is , which is a rational number, but not an integer. Hence not every element of $\mathbb$ has a (multiplicative) inverse.

### Rationals

The desire for the existence of multiplicative inverses suggests considering fraction (mathematics), fractions :$\frac.$ Fractions of integers (with ''b'' nonzero) are known as rational numbers. The set of all such irreducible fractions is commonly denoted $\mathbb$. There is still a minor obstacle for $\left\left(\mathbb,\cdot\right\right)$, the rationals with multiplication, being a group: because the rational number 0 (number), 0 does not have a multiplicative inverse (i.e., there is no ''x'' such that ), $\left\left(\mathbb,\cdot\right\right)$ is still not a group. However, the set of all ''nonzero'' rational numbers $\mathbb\setminus\left\=\left\$ does form an abelian group under multiplication, generally denoted $\mathbb^*$. 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 ring (mathematics), rings and—if division is possible, such as in $\mathbb$—field (mathematics), fields, which occupy a central position in abstract algebra. Group theoretic arguments therefore underlie parts of the theory of those entities.

## Modular arithmetic In modular arithmetic, two integers are added and then the sum is divided by a positive integer called the ''modulus.'' The result of modular addition is the remainder of that division. For any modulus, ''n'', the set of integers from 0 to forms a group under modular addition: the inverse of any element ''a'' is , and 0 is the identity element. This is familiar from the addition of hours on the face of a 12-hour clock, clock: if the hour hand is on 9 and is advanced 4 hours, it ends up on 1, as shown at the right. This is expressed by saying that 9 + 4 equals 1 "modulo 12" or, in symbols, :9 + 4 ≡ 1 modulo 12. The group of integers modulo ''n'' is written $\mathbb_$ or $\mathbb/n\mathbb$. For any prime number ''p'', there is also the multiplicative group of integers modulo n, multiplicative group of integers modulo ''p''. Its elements are the integers 1 to . The group operation is multiplication modulo ''p''. That is, the usual product is divided by ''p'' and the remainder of this division is the result of modular multiplication. For example, if , there are four group elements 1, 2, 3, 4. In this group, , because the usual product 16 is equivalent to 1, which divided by 5 yields a remainder of 1. for 5 divides , 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. 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 . The inverse ''b'' can be found by using Bézout's identity and the fact that the greatest common divisor equals 1. In the case above, the inverse of 4 is 4, and the inverse of 3 is 2, as . Hence all group axioms are fulfilled. Actually, this example is similar to $\left\left(\mathbb\setminus\left\,\cdot\right\right)$ above: it consists of exactly those elements in $\mathbb/p\mathbb$ that have a multiplicative inverse. These groups are denoted F''p''×. They are crucial to public-key cryptography.

## Cyclic groups

A ''cyclic group'' is a group all of whose elements are power (mathematics), powers of a particular element ''a''. In multiplicative notation, the elements of the group are: :..., ''a''−3, ''a''−2, ''a''−1, ''a''0 = ''e'', ''a'', ''a''2, ''a''3, ..., where ''a''2 means ''a'' ⋅ ''a'', and ''a−3'' stands for ''a''−1 ⋅ ''a''−1 ⋅ ''a''−1 = (''a'' ⋅ ''a'' ⋅ ''a'')−1 etc. Such an element ''a'' is called a generator or a Primitive root modulo n, primitive element of the group. In additive notation, the requirement for an element to be primitive is that each element of the group can be written as : ..., −''a''−''a'', −''a'', 0, ''a'', ''a''+''a'', ... In the groups Z/''n''Z introduced above, the element 1 is primitive, so these groups are cyclic. Indeed, each element is expressible as a sum all of whose terms are 1. Any cyclic group with ''n'' elements is isomorphic to this group. A second example for cyclic groups is the group of root of unity, ''n''-th complex roots of unity, given by complex numbers ''z'' satisfying . These numbers can be visualized as the vertices on a regular ''n''-gon, as shown in blue at the right for . The group operation is multiplication of complex numbers. In the picture, multiplying with ''z'' corresponds to a clockwise, counter-clockwise rotation by 60°. Using some field theory (mathematics), field theory, the group F''p''× can be shown to be cyclic: for example, if , 3 is a generator since , , , and . Some cyclic groups have an infinite number of elements. In these groups, for every non-zero element ''a'', all the powers of ''a'' are distinct; despite the name "cyclic group", the powers of the elements do not cycle. An infinite cyclic group is isomorphic to , the group of integers under addition introduced above. As these two prototypes are both abelian, so is any cyclic group. The study of finitely generated 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 (group theory), center and commutator, describe the extent to which a given group is not abelian.

## Symmetry groups

''Symmetry groups'' are groups consisting of symmetry, 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. Symmetry in mathematics, Symmetries in mathematics greatly simplify the study of geometrical or analysis, analytical objects. A group is said to Group action (mathematics), act on another mathematical object ''X'' if every group element can be associated to some operation on ''X'' and the composition of these operations follows 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. . In chemical fields, such as crystallography, space groups and point groups describe molecular symmetry, molecular symmetries and crystal symmetries. These symmetries underlie the chemical and physical behavior of these systems, and group theory enables simplification of quantum mechanics, 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 ferroelectric 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. Finite symmetry groups such as the Mathieu groups are used in coding theory, which is in turn applied in forward error correction, 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. Geometric properties that remain stable under group actions are investigated in geometric invariant theory, (geometric) invariant theory.

## General linear group and representation theory

(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 Matrix (mathematics), matrices together with matrix multiplication. The ''general linear group'' consists of all invertible matrix, invertible ''n''-by-''n'' matrices with real number, 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 matrix, 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 action (mathematics), 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 R3. 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. Given a group action, this gives further means to study the object being acted on. 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

''Galois groups'' were developed to help solve polynomial equations by capturing their symmetry features. For example, the solutions of the quadratic equation are given by :$x = \frac.$ 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 equation, cubic and quartic equations, but do ''not'' exist in general for quintic equation, degree 5 and higher. Abstract properties of Galois groups associated with polynomials (in particular their solvable group, solvability) give a criterion for polynomials that have all their solutions expressible by radicals, i.e., solutions expressible using solely addition, multiplication, and Nth root, roots similar to the formula above. The problem can be dealt with by shifting to field theory (mathematics), field theory and considering the splitting field of a polynomial. 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

A group is called ''finite'' if it has a finite set, finite number of elements. The number of elements is called the order of a group, order of the group. An important class is the ''symmetric groups'' S''N'', the groups of permutations of ''N'' objects. For example, the symmetric group on 3 letters dihedral group of order 6, S3 is the group of all possible reorderings of the objects. For example, the three letters ''ABC'', can be reordered into ''ABC'', ''ACB'', ''BAC'', ''BCA'', ''CAB'', ''CBA'', forming in total 6 (factorial of 3) elements. The operation is the composition of the reorderings. The neutral element is keeping the ordering the same. 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'', according to Cayley's theorem. Parallel to the group of symmetries of the square above, S3 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''''n'' = ''e'', where ''a''''n'' represents : $\underbrace_,$ that is, application of the operation "⋅" to ''n'' copies of ''a''. (If "⋅" represents multiplication, then ''a''''n'' 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 (group theory), Lagrange's Theorem states that for a finite group ''G'' the order of any finite subgroup ''H'' divisor, 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 r1 is 4, as is the order of the subgroup ''R'' it generates (see above). The order of the reflection elements fv etc. is 2. Both orders divide 8, as predicted by Lagrange's theorem. The groups F''p''× above have order .

## Classification of finite simple groups

Mathematicians often strive for a complete classification theorems, classification (or list) of a mathematical notion. In the context of finite groups, this aim leads to difficult 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''2 can also be shown to be abelian, a statement which does not generalize to order ''p''3, as the non-abelian group D4 of order 8 = 23 above shows. Computer algebra systems can be used to List of small groups, list small groups, but there is no classification of all finite groups. An intermediate step is the classification of finite simple groups. A nontrivial group is called ''simple group, simple'' if its only normal subgroups are the trivial group and the group itself. The Jordan–Hölder theorem exhibits finite simple groups as the building blocks for all finite groups. List of finite simple groups, Listing all finite simple groups was a major achievement in contemporary group theory. 1998 Fields Medal winner Richard Borcherds succeeded in proving the monstrous moonshine conjectures, a surprising and deep relation between the largest finite simple sporadic group (the "monster group") and certain modular functions, a piece of classical complex analysis, and string theory, a theory supposed to unify the description of many physical phenomena.

# The category of groups

If one considers all groups at once, and all the homomorphisms between them, one gets a category (mathematics), category. In fact, the category of groups is one of the motivating examples for the definition of category; the axioms in the definition of category reflect properties of group homomorphisms, such as the fact that homomorphisms and can be composed to produce a homomorphism . There is no cardinal number that bounds the cardinality of every group, so there cannot be a set whose members are all the groups; instead the collection of all groups is a proper class. This means that the category of groups is not a small category. On the other hand, given groups and , the collection of all homomorphisms is a set (it may be viewed as a subset of the power set of ), so the category of groups is a locally small category.

Many groups are simultaneously groups and examples of other mathematical structures. In the language of category theory, they are group objects in a category (mathematics), 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

Image:Circle as Lie group2.svg, 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 Neighbourhood (mathematics), 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; informally, and ''g''−1 must not vary wildly if ''g'' and ''h'' vary only a 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 group of real numbers under addition and the group of nonzero real numbers under multiplication. Similar examples can be formed from any other topological field, such as the field of complex numbers or the field of p-adic number, ''p''-adic numbers. These examples are locally compact topological group, locally compact, so they have Haar measures and can be studied via harmonic analysis. Other locally compact topological groups include the group of points of an algebraic group over a local field or adele ring; these are basic to number theory. Galois groups of infinite algebraic field extensions are equipped with the Krull topology, which plays a role in Fundamental theorem of Galois theory#Infinite case, infinite Galois theory. A generalization used in algebraic geometry is the étale fundamental group.

## Lie groups

A ''Lie group'' is a group that also has the structure of a differentiable manifold; informally, this means that it diffeomorphism, looks locally like a Euclidean space of some fixed dimension. Again, the definition requires the additional structure, here the manifold structure, to be compatible: the multiplication and inverse maps are required to be smooth map, smooth. A 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 modern physics: Noether's theorem links continuous symmetries to conserved quantities. Rotation, as well as translation (geometry), 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. Another example is the group of 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 spacetime in special relativity. The full symmetry group of Minkowski space, i.e., including translations, is known as the
Poincaré group The Poincaré group, named after Henri Poincaré (1906), was first defined by Hermann Minkowski (1908) as the Group (mathematics), group of Minkowski space#Lorentz transformations and symmetry, Minkowski spacetime isometries. It is a ten-dimensi ...
. By the above, it plays a pivotal role in special relativity and, by implication, for quantum field theories. Local symmetry, Symmetries that vary with location are central to the modern description of physical interactions with the help of gauge theory.

# Generalizations

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 , see above. There is a general method to formally add inverses to elements to any (abelian) monoid, much the same way as is derived from , known as the Grothendieck group. Groupoids are similar to groups except that the composition need not be defined for all ''a'' and ''b''. They arise in the study of more complicated forms of symmetry, often in topology, topological and mathematical analysis, analytical structures, such as the fundamental groupoid or stack (mathematics), stacks. Finally, it is possible to generalize any of these concepts by replacing the binary operation with an arbitrary arity, ''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, ''n''-ary group. The table gives a list of several structures generalizing groups.

* List of group theory topics

# References

## General references

* , Chapter 2 contains an undergraduate-level exposition of the notions covered in this article. * , Chapter 5 provides a layman-accessible explanation of groups. * , an elementary introduction. * . * . * * . * . * . * .

## Special references

* . * . * . * . * . * . * . * . * . * . * . * . * * . * . * * . * . * . * . * . * . * . * * . * . * * . * . * . * . * . * . * * . * . * . * . * .

## Historical references

* * . * * . * . * (Galois work was first published by Joseph Liouville in 1843). * . * . * . * * . * .