Group (mathematics)

form the Rubik's Cube group.|alt=A Rubik's cube with one side rotated In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 32 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

form the Rubik's Cube group.|alt=A Rubik's cube with one side rotated In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set. The following conditions must hold: the operation is associative, it has an identity element, and every element of the set has an inverse element.

For example, the integers with the addition operation form a group. The concept of a group was elaborated for handling, in a unified way, many mathematical structures such as numbers, geometric shapes and polynomial roots.

Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics. In geometry, groups arise naturally in the study of symmetries and geometric transformations: the symmetries of an object form a group, called the symmetry group of the object, and the transformations of a given type form a general group.

Lie groups appear in symmetry groups in geometry, and also in the Standard Model of particle physics. The Poincaré group is a Lie group consisting of the symmetries of spacetime in special relativity. Point groups describe symmetry in molecular chemistry.

The concept of a group arose in the study of polynomial equations.…

form the Rubik's Cube group.|alt=A Rubik's cube with one side rotated In mathematics, a group is a set with an operation that combines any two elements of the set to produce a third element within the same set. The following conditions must hold: the operation is associative, it has an identity element, and every element of the set has an inverse element.

For example, the integers with the addition operation form a group. The concept of a group was elaborated for handling, in a unified way, many mathematical structures such as numbers, geometric shapes and polynomial roots.

Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics. In geometry, groups arise naturally in the study of symmetries and geometric transformations: the symmetries of an object form a group, called the symmetry group of the object, and the transformations of a given type form a general group.

Lie groups appear in symmetry groups in geometry, and also in the Standard Model of particle physics. The Poincaré group is a Lie group consisting of the symmetries of spacetime in special relativity. Point groups describe symmetry in molecular chemistry.

The concept of a group arose in the study of polynomial equations. Évariste Galois, in the 1830s, introduced the term group (French: ) for the symmetry group of the 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 18701.

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 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. \Z = \{\ldots,-4,-3,-2,-1,0,1,2,3,4,\ldots\} together with addition. For any two integers a and , the sum a+b is also an integer; this closure property says that + is a binary operation on .

The following properties of integer addition serve as a model for the group axioms in the definition below. For all integers , b and  , one has . 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  .

This property is known as associativity. If a is any integer, then 0+a=a and . Zero is called the identity element of addition because adding it to any integer returns the same integer.

For every integer , there is an integer b such that a+b=0 and . The integer b is called the inverse element of the integer a and is denoted  . 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. Inverse element : For each a in , there exists an element b in G such that a\cdot b=e and , where e is the identity element. For each , the element b is unique; it is called the inverse of a and is commonly denoted .

Note: Uniqueness of the identity and uniqueness of inverse elements are not part of the axioms; they are consequences of the three axioms. The definition of a group does not require that a\cdot b=b\cdot a for all elements a and b 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 functions, the operation is often function composition ; then the identity may be denoted id.

In the more specific cases of geometric transformation groups, 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. | header = The elements of the symmetry group of the square, .

Vertices are identified by color or number. | perrow = 4 | image1 = group D8 id.svg | alt1 = A square with its four corners marked by 1 to 4 | caption1 = \mathrm{id} (keeping it as it is) | image2 = group D8 90.svg | alt2 = The square is rotated by 90° clockwise; the corners are enumerated accordingly. | caption2 = r_1 (rotation by 90° clockwise) | image3 = group D8 180.svg | alt3 = The square is rotated by 180° clockwise; the corners are enumerated accordingly. | caption3 = r_2 (rotation by 180°) | image4 = group D8 270.svg | alt4 = The square is rotated by 270° clockwise; the corners are enumerated accordingly. | caption4 = r_3 (rotation by 270° clockwise) | image5 = group D8 fv.svg | alt5 = The square is reflected vertically; the corners are enumerated accordingly. | caption5 = f_{\mathrm{v}} (vertical reflection) | image6 = group D8 fh.svg | alt6 = The square is reflected horizontally; the corners are enumerated accordingly. | caption6 = f_{\mathrm{h}} (horizontal reflection) | image7 = group D8 f13.svg | alt7 = The square is reflected along the SW–NE diagonal; the corners are enumerated accordingly. | caption7 = f_{\mathrm{d}} (diagonal reflection) | image8 = group D8 f24.svg | alt8 = The square is reflected along the SE–NW diagonal; the corners are enumerated accordingly. | caption8 = f_{\mathrm{c}} (counter-diagonal reflection) | total_width = 600 }} Two figures in the plane are congruent if one can be changed into the other using a combination of rotations, reflections, and 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 symmetries. A square has eight symmetries.

These are: the identity operation leaving everything unchanged, denoted \operatorname{id} ; rotations of the square around its center by 90°, 180°, and 270° clockwise, denoted by , r_2 and , respectively; reflections about the horizontal and vertical middle line ({{tmath|1= f_{\mathrm{v} } }} and {{tmath|1= f_{\mathrm{h} } }}), or through the two diagonals ({{tmath|1= f_{\mathrm{d} } }} and {{tmath|1= f_{\mathrm{c} } }}). These symmetries are functions.

Each sends a point in the square to the corresponding point under the symmetry. For example, r_1 sends a point to its rotation 90° clockwise around the square's center, and f_{\mathrm{h}} sends a point to its reflection across the square's vertical middle line. Composing two of these symmetries gives another symmetry.

These symmetries determine a group called the dihedral group of degree four, 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 a and then b is written symbolically from right to left as b\circ a ("apply the symmetry b after performing the symmetry "). This is the usual notation for the composition of functions. A Cayley table lists the results of all such compositions possible.

For example, rotating by 270° clockwise ( ) and then reflecting horizontally ({{tmath|1= f_{\mathrm{h} } }}) is the same as performing a reflection along the diagonal ({{tmath|1= f_{\mathrm{d} } }}). Using the above symbols, highlighted in blue in the Cayley 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: Binary operation: Composition is a binary operation.

That is, a\circ b is a symmetry for any two symmetries a 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 ({{tmath|1= f_{\mathrm{c} } }}). Indeed, every other combination of two symmetries still gives a symmetry, as can be checked using the Cayley table.

Associativity: 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 a and b into a single symmetry, then to compose that symmetry with .

The other way is to first compose b and , then to compose the resulting symmetry with . These two ways must always give the same result, that is, (a\circ b)\circ c = a\circ (b\circ c). For example, (f_{\mathrm{d}}\circ f_{\mathrm{v}})\circ r_2=f_{\mathrm{d}}\circ (f_{\mathrm{v}}\circ r_2) can be checked using the Cayley table: \begin{align} (f_\mathrm d\circ f_\mathrm v)\circ r_2 &=r_3\circ r_2=r_1\\ f_\mathrm d\circ (f_\mathrm v\circ r_2) &=f_\mathrm d\circ f_\mathrm h =r_1. \end{align} Identity element: The identity element is , as it does not change any symmetry a when composed with it either on the left or on the right.

Inverse element: Each symmetry has an inverse: , the reflections {{tmath|1= f_{\mathrm{h} } }}, {{tmath|1= f_{\mathrm{v} } }}, {{tmath|1= f_{\mathrm{d} } }}, {{tmath|1= f_{\mathrm{c} } }} and the 180° rotation r_2 are their own inverse, because performing them twice brings the square back to its original orientation. The rotations r_3 and r_1 are each other's inverses, because rotating 90° and then rotating 270° (or vice versa) yields a rotation over 360° which leaves the square unchanged.

This is easily verified in the table. In contrast to the group of integers above, where the order of the operation is immaterial, it does matter in , as, for example, f_{\mathrm{h}}\circ r_1=f_{\mathrm{c}} but {{tmath|1= r_1\circ f_{\mathrm{h} }=f_{\mathrm{d} } }}. In other words, \mathrm{D}_4 is not abelian.

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's 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 \theta^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 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 18841.

The third field contributing to group theory was number theory. Certain abelian group structures had been used implicitly in Carl Friedrich Gauss's 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 groups describing factorization into prime numbers.

The convergence of these various sources into a uniform theory of groups started with 's . 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 and wrote the first book about group theory in the English language: Theory of Groups of Finite Order, 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 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 concerning this classification proof is ongoing. Group theory remains a highly active mathematical branch, impacting many other fields, as the examples below illustrate. a\cdot b\cdot c=(a\cdot b)\cdot c=a\cdot(b\cdot c) generalizes to more than three factors (for example, a\cdot b\cdot c\cdot d is also unambiguous).

Because this implies that parentheses can be inserted anywhere within such a series of terms, parentheses are usually omitted. b &= b\cdot e && \text{(}e \text { is the identity element)}\\ &= b\cdot (a \cdot c) && \text{(}c \text { and } a \text{ are inverses of each other)}\\ &= (b\cdot a) \cdot c && \text{(associativity)}\\ &= e \cdot c && \text{(}b \text { is an inverse of } a\text{)}\\ &= c && \text{(}e \text { is the identity element and } b=c\text{)} \end{align} Therefore, it is customary to speak of the inverse of an element.

Division

Given elements a and b of a group G , there is a unique solution x in G to the equation a\cdot x=b , namely a^{-1}\cdot b . It follows that for each a in G , the function G\to G that maps each x to a\cdot x is a bijection; it is called left multiplication by a or left translation by a . Similarly, given a and b in G , the unique solution x to x\cdot a=b is b\cdot a^{-1} . For each a , the function G\to G that maps each x to x\cdot a is a bijection called right multiplication by a or right translation by a . &=e \cdot (f \cdot f^{-1}) && \text{(left identity)}\\ &=((f^{-1})^{-1} \cdot f^{-1}) \cdot (f \cdot f^{-1}) && \text{(left inverse)}\\ &=(f^{-1})^{-1} \cdot ((f^{-1} \cdot f) \cdot f^{-1}) && \text{(associativity)}\\ &=(f^{-1})^{-1} \cdot (e \cdot f^{-1}) && \text{(left inverse)}\\ &=(f^{-1})^{-1} \cdot f^{-1} && \text{(left identity)}\\ &=e && \text{(left inverse)} \end{align} Similarly, the left identity is also a right identity: \begin{align} f\cdot e &= f \cdot ( f^{-1} \cdot f) && \text{(left inverse)}\\ &= (f \cdot f^{-1}) \cdot f && \text{(associativity)}\\ &= e \cdot f && \text{(right inverse)}\\ &= f && \text{(left identity)} \end{align} These results do not hold if any of these axioms (associativity, existence of left identity and existence of left inverse) is removed.

For a structure with a looser definition (like a semigroup) one may have, for example, that a left identity is not necessarily a right identity. The same result can be obtained by only assuming the existence of a right identity and a right inverse. However, only assuming the existence of a left identity and a right inverse (or vice versa) is not sufficient to define a group.

For example, consider the set G = \{ e,f \} with the operator \,\!\cdot satisfying e \cdot e = f \cdot e = e and . This structure does have a left identity (namely, ), and each element has a right inverse (which is e for both elements).

Furthermore, this operation is associative (since the product of any number of elements is always equal to the rightmost element in that product, regardless of the order in which these operations are applied). However, ( G , \cdot ) is not a group, since it lacks a right identity.

It would be natural to require also that \varphi respect identities, , and inverses, \varphi(a^{-1})=\varphi(a)^{-1} for all a in . However, these additional requirements need not be included in the definition of homomorphisms, because they are already implied by the requirement of respecting the group operation.

The identity homomorphism of a group G is the homomorphism \iota_G : G\to G that maps each element of G to itself. An inverse homomorphism of a homomorphism \varphi : G\to H is a homomorphism \psi : H\to G such that \psi\circ\varphi=\iota_G and , that is, such that \psi\bigl(\varphi(g)\bigr)=g for all g in G and such that \varphi\bigl(\psi(h)\bigr)=h for all h in .

An isomorphism is a homomorphism that has an inverse homomorphism; equivalently, it is a bijective homomorphism. Groups G and H are called isomorphic if there exists an isomorphism .

In this case, H can be obtained from G simply by renaming its elements according to the function ; then any statement true for G is true for , provided that any specific elements mentioned in the statement are also renamed. The collection of all groups, together with the homomorphisms between them, form a category, the category of groups.

An injective homomorphism \phi : G' \to G factors canonically as an isomorphism followed by an inclusion, G' \;\stackrel{\sim}{\to}\; H \hookrightarrow G for some subgroup of . Injective homomorphisms are the monomorphisms in the category of groups.

In the example of symmetries of a square, the identity and the rotations constitute a subgroup {{tmath|1= R=\{\mathrm{id},r_1,r_2,r_3\} }}, highlighted in red in the Cayley table of the example: 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°. The subgroup test provides a necessary and sufficient condition for a nonempty subset of a group to be a subgroup: it is sufficient to check that g^{-1}\cdot h\in H for all elements g and h in .

Knowing a group's subgroups is important in understanding the group as a whole. Given any subset S of a group , the subgroup generated by S consists of all products of elements of S and their inverses. It is the smallest subgroup of G containing .

In the example of symmetries of a square, the subgroup generated by r_2 and f_{\mathrm{v}} consists of these two elements, the identity element , and the element {{tmath|1= f_{\mathrm{h} }=f_{\mathrm{v} }\cdot r_2 }}. 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.

The left cosets of any subgroup H form a partition of ; 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 g_1H=g_2H happens precisely when , i.e., when the two elements differ by an element of . Similar considerations apply to the right cosets of .

The left cosets of H may or may not be the same as its right cosets. If they are (that is, if all g in G satisfy ), then H is said to be a normal subgroup.

In , the group of symmetries of a square, with its subgroup R of rotations, the left cosets gR are either equal to , if g is an element of R itself, or otherwise equal to U=f_{\mathrm{c}}R=\{f_{\mathrm{c}},f_{\mathrm{d}},f_{\mathrm{v}},f_{\mathrm{h}}\} (highlighted in green in the Cayley table of ). The subgroup R is normal, because f_{\mathrm{c}}R=U=Rf_{\mathrm{c}} and similarly for the other elements of the group.

(In fact, in the case of , the cosets generated by reflections are all equal: {{tmath|1= f_{\mathrm{h} }R=f_{\mathrm{v} }R=f_{\mathrm{d} }R=f_{\mathrm{c} }R }}.) G/N = \{gN \mid g\in G\} denotes its set of cosets. Then there is a unique group law on G/N for which the map G\to G/N sending each element g to gN is a homomorphism.

Explicitly, the product of two cosets gN and hN is , the coset eN = N serves as the identity of , and the inverse of gN in the quotient group is . The group , read as " modulo ", is called a quotient group or factor group. The quotient group can alternatively be characterized by a universal property.

The elements of the quotient group \mathrm{D}_4/R are R and {{tmath|1= U=f_{\mathrm{v} }R }}. The group operation on the quotient is shown in the table. For example, {{tmath|1= U\cdot U=f_{\mathrm{v} }R\cdot f_{\mathrm{v} }R=(f_{\mathrm{v} }\cdot f_{\mathrm{v} })R=R }}.

Both the subgroup R=\{\mathrm{id},r_1,r_2,r_3\} and the quotient \mathrm{D}_4/R are abelian, but \mathrm{D}_4 is not. Sometimes a group can be reconstructed from a subgroup and quotient (plus some additional data), by the semidirect product construction; \mathrm{D}_4 is an example.

The first isomorphism theorem implies that any surjective homomorphism \phi : G \to H factors canonically as a quotient homomorphism followed by an isomorphism: . Surjective homomorphisms are the epimorphisms in the category of groups. The group of integers \Z under addition, denoted , has been described above.

The integers, with the operation of multiplication instead of addition, \left(\Z,\cdot\right) do not form a group. The associativity and identity axioms are satisfied, but inverses do not exist: for example, a=2 is an integer, but the only solution to the equation a\cdot b=1 in this case is , which is a rational number, but not an integer.

Hence not every element of \Z has a (multiplicative) inverse. \frac{a}{b}. Fractions of integers (with b nonzero) are known as rational numbers. The set of all such irreducible fractions is commonly denoted .

There is still a minor obstacle for , the rationals with multiplication, being a group: because zero does not have a multiplicative inverse (i.e., there is no x such that ), \left(\Q,\cdot\right) is still not a group. However, the set of all nonzero rational numbers \Q\smallsetminus\left\{0\right\}=\left\{q\in\Q\mid q\neq 0\right\} does form an abelian group under multiplication, also denoted .

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 , therefore the axiom of the inverse element is satisfied.

The rational numbers (including zero) also form a group under addition. Intertwining addition and multiplication operations yields more complicated structures called rings and – if division by other than zero 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.

12. Here, .|alt=The clock hand points to 9 o'clock; 4 hours later it is at 1 o'clock. Modular arithmetic for a modulus n defines any two elements a and b that differ by a multiple of n to be equivalent, denoted by .

Every integer is equivalent to one of the integers from 0 to , and the operations of modular arithmetic modify normal arithmetic by replacing the result of any operation by its equivalent representative. Modular addition, defined in this way for the integers from 0 to , forms a group, denoted as \mathrm{Z}_n or , with 0 as the identity element and n-a as the inverse element of .

A familiar example is addition of hours on the face of a clock, where 12 rather than 0 is chosen as the representative of the identity. If the hour hand is on 9 and is advanced 4 hours, it ends up on , as shown in the illustration. This is expressed by saying that 9+4 is congruent to 1 "modulo " or, in symbols, 9+4\equiv 1 \pmod{12}.

For any prime number , there is also the multiplicative group of integers modulo . Its elements can be represented by 1 to . The group operation, multiplication modulo , replaces the usual product by its representative, the remainder of division by .

For example, for , the four group elements can be represented by . In this group, , because the usual product 16 is equivalent to : when divided by 5 it yields a remainder of . The primality of p ensures that the usual product of two representatives is not divisible by , and therefore that the modular product is nonzero.

The identity element is represented by  , and associativity follows from the corresponding property of the integers. Finally, the inverse element axiom requires that given an integer a not divisible by , there exists an integer b such that a\cdot b\equiv 1\pmod{p}, that is, such that p evenly divides .

The inverse b can be found by using Bézout's identity and the fact that the greatest common divisor \gcd(a,p) equals  . In the case p=5 above, the inverse of the element represented by 4 is that represented by , and the inverse of the element represented by 3 is represented by  , as . Hence all group axioms are fulfilled.

This example is similar to \left(\Q\smallsetminus\left\{0\right\},\cdot\right) above: it consists of exactly those elements in the ring \Z/p\Z that have a multiplicative inverse. These groups, denoted , are crucial to public-key cryptography. \dots, a^{-3}, a^{-2}, a^{-1}, a^0, a, a^2, a^3, \dots, where a^2 means , a^{-3} stands for , etc. Such an element a is called a generator or a 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 \dots, (-a)+(-a), -a, 0, a, a+a, \dots. 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 .

Any cyclic group with n elements is isomorphic to this group. A second example for cyclic groups is the group of 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 in the image for .

The group operation is multiplication of complex numbers. In the picture, multiplying with z corresponds to a counter-clockwise rotation by 60°. From field theory, the group \mathbb F_p^\times is cyclic for prime p : 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 , 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 are all cyclic groups. 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 and commutator, describe the extent to which a given group is not abelian.

(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 -coordinate by factor 2.|alt=Two vectors have the same length and span a 90° angle. Furthermore, they are rotated by 90° degrees, then one vector is stretched to twice its length.

Matrix groups consist of matrices together with matrix multiplication. The general linear group \mathrm {GL}(n, \R) consists of all invertible -by- 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 . It describes all possible rotations in n dimensions.

Rotation matrices in this group 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 in which the group acts on a vector space, such as the three-dimensional Euclidean space . A representation of a group G on an n -dimensional real vector space is simply a group homomorphism \rho : G \to \mathrm {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. A group action 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 were developed to help solve polynomial equations by capturing their symmetry features. For example, the solutions of the quadratic equation ax^2+bx+c=0 are given by x = \frac{-b \pm \sqrt {b^2-4ac}}{2a}.

Each solution can be obtained by replacing the \pm sign by + or ; analogous formulae are known for cubic and quartic equations, but do not exist in general for degree 5 and higher. In the quadratic formula, changing the sign (permuting the resulting two solutions) can be viewed as a (very simple) group operation.

Analogous Galois groups act on the solutions of higher-degree polynomial equations and are closely related to the existence of formulas for their solution. Abstract properties of these groups (in particular their solvability) give a criterion for the ability to express the solutions of these polynomials using solely addition, multiplication, and roots similar to the formula above.

Modern Galois theory generalizes the above type of Galois groups by shifting to field theory and considering field extensions formed as the splitting field of a polynomial. This theory establishes—via the fundamental theorem of Galois theory—a precise relationship between fields and groups, underlining once again the ubiquity of groups in mathematics. \underbrace{a \cdots a}_{n \text{ factors}}, that is, application of the operation " " to n copies of .

(If " " represents multiplication, then a^n corresponds to the th power of .) 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 . The Sylow theorems give a partial converse. The dihedral group \mathrm{D}_4 of symmetries of a square is a finite group of order 8.

In this group, the order of r_1 is 4, as is the order of the subgroup R that this element generates. The order of the reflection elements f_{\mathrm{v}} etc. is 2. Both orders divide 8, as predicted by Lagrange's theorem.

The groups \mathbb F_p^\times of multiplication modulo a prime p have order . 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).|alt=A part of a circle (highlighted) is projected onto a line. 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, g \cdot h 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 -adic numbers . These examples are 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 infinite Galois theory. A generalization used in algebraic geometry is the étale fundamental group. \det (A) \ne 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 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.

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.

An important example of a gauge theory is the Standard Model, which describes three of the four known fundamental forces and classifies all known elementary particles. Nikulin, V. V. and Shafarevich, I. R.. Geometries and Groups. Translated from the 1983 Russian original by M. Reid.

Universitext. Springer-Verlag, Berlin, first published in English in 19871. "Transformation Groups from the Geometric Viewpoint", by H.S.M Coxeter (in Geometric Transformation Groups and Other Topics / Lincoln K. Durst, Editor) Committee on the Undergraduate Program in Mathematics, MAA Shlomo Sternberg, Group Theory and Physics, Cambridge University Press, 1994.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1378281957 under CC BY-SA 4.0; modifications have been made.

References

  1. ↩Wikipedia “Group (mathematics)” revision 1378281957 · retrieved 2026-10-20 publication date (×3) · confidence 0.95 revision URL