Difference between revisions of "Group"
m |
m (added reference to monoid) |
||
Line 7: | Line 7: | ||
* There exists an element <math>e\in G</math> so that for all <math>g\in G</math>, <math>ge=eg=g</math> ([[identity]]). | * There exists an element <math>e\in G</math> so that for all <math>g\in G</math>, <math>ge=eg=g</math> ([[identity]]). | ||
* 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]]). | ||
+ | |||
+ | |||
+ | One can also thing of groups as [[monoid]]s 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 14:51, 16 October 2006
This article is a stub. Help us out by expanding it.
A group is a set of elements together with an operation (the dot is frequently supressed) satisfying the following conditions:
- For all , (associativity).
- There exists an element so that for all , (identity).
- For any , there exists so that ( inverses).
One can also thing of groups as monoids 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 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 (since it has elements). Another example of a group is the symmetric group of all permutations of .