Difference between revisions of "Group"
ComplexZeta (talk | contribs) |
m |
||
(9 intermediate revisions by 4 users not shown) | |||
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]]). | ||
* 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> ([[ | + | * 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]] 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 [[permutation]]s or symmetries of collections of objects. For example, the rigid motions of <math>\mathbb{R}^2</math> that fix a certain regular <math>n</math>-gon is a group, called the [[dihedral group]] and denoted in some texts <math>D_{2n}</math> (since it has <math>2n</math> elements) and in others <math>D_n</math> (since it preserves a regular <math>n</math>-gon). Another example of a group is the [[symmetric group]] <math>S_n</math> of all permutations of <math>\{1,2,\ldots,n\}</math>. | ||
+ | |||
+ | ==See Also== | ||
+ | *[[Field]] | ||
+ | *[[Ring]] | ||
+ | *[[Group theory]] | ||
{{stub}} | {{stub}} | ||
+ | |||
+ | [[Category:Definition]] | ||
+ | [[Category:Group theory]] |
Revision as of 23: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).
(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.