# Difference between revisions of "Group"

I like pie (talk | contribs) m |
m |
||

Line 5: | Line 5: | ||

* For any <math>g\in G</math>, there exists <math>g^{-1}\in G</math> so that <math>gg^{-1}=g^{-1}g=e</math> ([[Inverse with respect to an operation | inverses]]). | * For any <math>g\in G</math>, there exists <math>g^{-1}\in G</math> so that <math>gg^{-1}=g^{-1}g=e</math> ([[Inverse with respect to an operation | inverses]]). | ||

− | (Equivalently, a group is a [[monoid]] | + | (Equivalently, a group is a [[monoid]] with inverses.) |

Note that the group operation need not be [[commutative]]. If the group operation is commutative, we call the group an [[abelian group]] (after the Norwegian mathematician Niels Henrik Abel). | Note that the group operation need not be [[commutative]]. If the group operation is commutative, we call the group an [[abelian group]] (after the Norwegian mathematician Niels Henrik Abel). |

## Revision as of 21:42, 1 September 2008

A **group** is a set of elements together with an operation (the dot is frequently supressed, so is written instead of ) satisfying the following conditions:

- For all , (associativity).
- There exists an element so that for all , (identity).
- For any , there exists so that ( inverses).

(Equivalently, a group is a monoid with inverses.)

Note that the group operation need not be commutative. If the group operation is commutative, we call the group an abelian group (after the Norwegian mathematician Niels Henrik Abel).

Groups frequently arise as permutations or symmetries of collections of objects. For example, the rigid motions of that fix a certain regular -gon is a group, called the dihedral group and denoted in some texts (since it has elements) and in others (since it preserves a regular -gon). Another example of a group is the symmetric group of all permutations of .

## See Also

*This article is a stub. Help us out by expanding it.*