Group

The textbook definition (with symbols)
A group is a set $$G$$ with a binary operation $$*: G \times G \to G$$ (termed the multiplication or product and denoted with infix notation -- so the product of $$x,y$$ is denoted $$x * y$$) such that the following hold:

The data describing a group include both the set and the binary operation. In other words, if we're just given a set, it doesn't make sense to ask whether it's a group. If we're given a set with a binary operation, it makes sense to ask whether the set and the binary operation together define a group structure. In particular, different binary operations on the same set could define different group structures.

The group can therefore be explicitly described as the pair $$(G,*)$$.

Note on closure axiom: Some texts include a closure axiom in the group definition, which says that for all $$x,y \in G$$, $$x * y \in G$$. This condition is not explicitly stated here because it is part of the definition of binary operation, and checking closure is part of checking that the binary operation is well-defined.

The video below includes both the textbook and the universal algebra definitions.

The universal algebra definition (with symbols)
A group is a set $$G$$ equipped with three operations:

satisfying the following three compatibility conditions:

The entire collection of information describing a group is sometimes written as a $$4$$-tuple: $$(G,*,e,{}^{-1})$$. In this definition, the compatibility conditions are universally quantified equations which demonstrate that (i) groups form a variety of algebras and that (ii) groups can be subject to the techniques of universal algebra.

Equivalence of definitions
The textbook definition includes only the set and the binary operation in the group structure, whereas the universal algebra definition additionally includes the identity element and the inverse operation in the group structure. To show that these definitions are equivalent, we need to demonstrate that the binary operation on the set uniquely determines the identity element and the inverse map. There are two parts to the proof:


 * Binary operation on magma determines neutral element, which in turn follows from equality of left and right neutral element
 * Two-sided inverse is unique if it exists in monoid, which in turn follows from equality of left and right inverses in monoid

Further term: abelian
For a group, $$*$$ may not be commutative, viz., it may not be true that $$a * b = b * a$$ for all $$a$$ and $$b$$ in the group. If the group satisfies the additional property that $$a * b = b * a$$ for all $$a,b$$ in the group, it is termed abelian.

Notation for group operations and expressions
The binary operation of the group is often called multiplication and its application is termed product. Because it is associative, we can drop the operator symbol as well as parenthesization (refer associative binary operation).

The inverse map is denoted by a superscript postfix (applied to $$g$$, it looks like $$g^{-1}$$).

The identity element is denoted by $$e$$, or sometimes, by $$1$$.

Notations are somewhat different for an abelian group.

Here is a summary of important things to remember:


 * 1) Because the group operation is associative, we often drop both the bracketing and the group multiplication symbols while writing products of elements in the group. Thus:
 * 2) * $$(a * (b * d)) * c$$ is written as $$abdc$$
 * 3) * $$a * (c * g)^{-1}$$ is written as $$a(cg)^{-1}$$
 * 4) The identity element is often denoted as $$1$$ or $$e$$.
 * 5) Repeated multiplication map is denoted by powers. So $$x * x$$ is $$x^2$$ while $$x^{-1} * x^{-1}$$ is $$x^{-2}$$. Similarly, $$x * (x * x) = xxx$$ is written in short as $$x^3$$.
 * 6) The inverse superscript binds only to the immediately preceding variable or parenthesized expression. So $$xy^{-1}$$ means $$x * (y^{-1})$$ rather than $$(x * y)^{-1}$$.
 * 7) Power superscripts, like the inverse superscript, also bind to the immediately preceding variable. For instance, $$xy^2$$ means $$x * (y^2)$$ rather than $$(x * y)^2$$.

Notation for the group and its set-theoretic constructions
Groups are typically denoted by capital English or Greek letters such as $$G,H,K$$ or $$\Gamma, \Lambda$$. Usually a group is confused with its underlying set, so we can talk of subset of a group. It must be remembered, however, that meaning is associated to the set only with the extra structure of the group operations.

Elements of the group are denoted by small letters (such as $$g, h$$). The identity element is denoted as $$e$$ or $$1$$. (For abelian groups, the identity element is denoted by $$0$$).

Subsets of the group are again denoted by capital letters, and subset inclusions are denoted by $$\subseteq$$. When talking of subgroups, we typically use $$\le$$ to emphasize that the subset also has a group structure.

Complete descriptions of groups

 * To describe a group with the textbook definition, we need to provide both the underlying set and the binary operation. To emphasize this, we write the group as a tuple of the set and the binary operation. For instance, we write $$(G,*)$$ to denote the group $$G$$ with binary operation $$*$$.
 * To describe a group with the universal algebra definition, we must also specify the identity element and the inverse operation as part of the group structure. For this, we write the group as a 4-tuple of the set, binary operation, identity element and inverse map. For instance: $$(G,*,e,{}^{-1})$$ denotes the group $$G$$ with binary operation $$*$$, identity element $$e$$ and inverse map $${}^{-1}$$.

Origin of the concept
In the beginning, before Galois and Abel, group meant a collection of permutations, and group multiplication the composition of permutations. The abstract notion of group, as a set in its own right, did not exist.

Galois first identified the abstract notion of groups. Although Galois did not clarify his abstractions, subsequent work by others led to notions (e.g., solvable group, normal subgroup) that would have been difficult to develop by viewing a group merely as a collection of transformations.

This abstraction of the group concept proved very helpful when there was a general switch from permutation representations to linear representations as the tool of choice for studying groups.

Origin of the term
The term group dates back to the early nineteenth century. It comes from the earlier phrase group of transformations which was how groups were perceived.

The formal definition of group (as abstract group) was given by von Dyck in the 1880s.

Occurrence of groups
Groups occur in many avatars. Examples of abelian groups include the additive groups of real numbers, of rational numbers, of complex numbers, and of integers, and the multiplicative groups of nonzero real numbers, of nonzero rational numbers, of nonzero complex numbers. In particular:

On the other hand, the following are not groups:


 * 1) The nonnegative integers under addition: There is an identity element, namely 0. However, the additive inverse of a nonnegative integer is not always a nonnegative integer, so the set of nonnegative integers does not have additive inverses. Hence, it is not a group.
 * 2) The nonzero integers under multiplication: There is an identity element: $$1$$. However, not every integer has a multiplicative inverse, so this set does not have multiplicative inverses. Hence, it is not a group.
 * 3) The set of all rational numbers under multiplication: There is an identity element: $$1$$. However, the element 0 does not have a multiplicative inverse, so the rational numbers do not form a group.

The most common avatar of (possibly) non-abelian groups is as automorphisms of a structure, which could be a set with some additional data. These include permutations of sets, linear automorphisms of vector spaces, self-homeomorphisms of topological spaces, Galois groups of field extensions, and diffeomorphisms of differential manifolds. In particular:


 * 1) Given a finite set, the permutations of that set form a group, where the group operation is composition, the identity element is the identity permutation, and the inverse of a permutation is its inverse as a function. For a finite set $$S$$, this group is termed the symmetric group on $$S$$, and is denoted by $$\operatorname{Sym}(S)$$.
 * 2) Given a vector space ,the invertible linear transformations of that vector space form a group under composition, where the identity element is the identity map and the inverse of a given transformation is its inverse as a function. For a vector space $$V$$, this group is denoted $$GL(V)$$, and is termed the general linear group on $$V$$.

On the other hand, the following do not form groups:


 * 1) Given a finite set $$S$$, the set of all functions $$f:S \to S$$, under composition. That's because if a function from $$S$$ to $$S$$ is not bijective, it does not have an inverse function.
 * 2) Given a vector space $$V$$, the set of all linear transformations $$\sigma:V \to V$$, under composition. That's because many linear transformations, like the zero map, do not have inverses.

Other instances include the mapping class group, the ideal class group, the divisor class group, the fundamental group and so on.

List of particular groups
For detailed information on particular groups (i.e. groups fixed uniquely upto isomorphism) refer:

Category:Particular groups

Viewpoints on the collection of groups
The collection of groups can be viewed in its totality as a category, as a variety, and in many other ways. For a list of articles on such viewpoints, refer:

Category:Views of the collection of groups

Properties over groups
A property over groups, or a group property, is something that, for every group, is either true or false. For instance, the property of being abelian is a group property, because, given any group, it is either abelian or not abelian.

Group properties are very important tools in our attempts to understand the wide and vast array of groups. Typical group properties include being abelian, nilpotent, solvable, and so on.

A full listing of group properties is available at

Category: Group properties

Homomorphism
A homomorphism of groups is a function from one group to another that preserves the group structure.

As per the textbook definition, a homomorphism of groups $$G$$ and $$H$$ is a map $$\phi: G$$ &rarr; $$H$$ such that for any $$a, b$$ in $$G$$, $$\phi(ab) = \phi(a)\phi(b)$$.

$$G$$ is termed the source group and $$H$$ the image group.

As per the universal algebraic definition, a homomorphism of groups $$G$$ and $$H$$ is a map $$\phi: G$$ &rarr; $$H$$ such that $$\phi$$ satisfies:


 * $$\phi(ab) = \phi(a)\phi(b)$$ (for all $$a, b$$ in $$G$$) viz $$\phi$$ preserves the binary operation
 * $$\phi(e) = e$$ viz $$\phi$$ maps the identity element to the identity element
 * $$\phi(a^{-1}) = (\phi(a))^{-1}$$

Both these definitions are equivalent.

Subgroup
A subgroup of the group is a subset of the group that inherits a group structure by restricting the operations.

As per the universal algebraic definition, a subset $$H$$ of a group $$G$$ is termed a subgroup if :


 * Whenever $$a, b$$ belong to $$H$$, so does $$ab$$
 * Whenever $$a$$ belongs to $$H$$, so does $$a^{-1}$$
 * $$e$$ belongs to $$H$$

There are two other equivalent definitions of subgroup:


 * A subset of a group is termed a subgroup if it is nonempty and is closed under the left quotient of elements
 * A subset of a group is termed a subgroup if it is nonempty and is closed under the right quotient of elements

A subgroup of a group can also be viewed as another group along with an injective homomorphism to the given group.

Quotient
A quotient group of a group is the image of the group under a surjective homomorphism.

Isomorphism
An isomorphism of groups is a homomorphism from one group to another for which there exists an inverse homomorphisms. In symbols, an isomorphism $$\phi:G $$ &rarr;$$H$$ is a homomorphism such that there exists a map $$\sigma: H$$ &rarr;$$G$$ with the property that $$\phi \circ \sigma$$ is the identity on $$H$$ and $$\sigma \circ \phi$$ is the identity on $$G$$.

Two groups are said to be isomorphic if there exists an isomorphism between them. If two groups are isomorphic, then all their group-theoretic constructions are equivalent. In fact, we can use an isomorphism to map any group-theoretic construct of one to a group-theoretic construct of the other.

Automorphisms and endomorphisms
An endomorphism of a group is a homomorphism from the group to itself. If the endomorphism has an inverse map which is also an endomorphism, it is termed an automorphism. Automorphisms can be viewed as symmetries of groups.

Variations on the notion of group
There are many variations to the notion of group, such as the notion of semigroup, monoid, magma, etc. A full list of variations is available.


 * Variety of groups: This term is used in universal algebra, where we view all groups as algebras of an equational variety, where the equational variety is defined as having the three operations subject to the three identities.
 * Category of groups: This term is used in category theory, where we view all groups as objects of a category, and homomorphisms between groups as morphisms of the category
 * First-order theory of groups: Here, we view each group as a model for the first-order theory of groups.

Textbook references

 * , Page 1-2
 * , Page 16-17 (formal definition)
 * , Page 3-4 (introduces groups as a particular kind of monoid)
 * , Page 27 (formal definition)
 * , Page 42 (formal definition, based on components defined through pages 38-41)
 * , Page 1 (formal definition)
 * , Page 32 (formal definition)
 * , Page 52, Section 1.3.1 (formal definition)
 * , Page 24, Definition 1.1 (formal definition)
 * , Page 41

Mathjourneys links

 * Group Theory: A First Journey is an article giving the basic definitions of group
 * Group Theory: The Journey Continues (Part I) is an article building on the First Journey to develop the notions of group acting on a set and the ideas of coset space.