Difference between revisions of "Group"
m |
m |
||
| Line 1: | Line 1: | ||
| − | A '''group''' <math>G</math> is a [[set]] of elements together with an [[operation]] <math>\cdot:G\times G\to G</math> (the dot is frequently | + | A '''group''' <math>G</math> is a [[set]] of elements together with an [[operation]] <math>\cdot:G\times G\to G</math> (the dot is frequently suppressed, so <math>ab</math> is written instead of <math>a\cdot b</math>) satisfying the following conditions: |
* For all <math>a,b,c\in G</math>, <math>a(bc)=(ab)c</math> ([[associative|associativity]]). | * For all <math>a,b,c\in G</math>, <math>a(bc)=(ab)c</math> ([[associative|associativity]]). | ||
Revision as of 22:19, 14 October 2009
A group 
is a set of elements together with an operation 
(the dot is frequently suppressed, 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).
, 
(
so that for all 
, 
(
so that 
((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.
