Abelian group: Difference between revisions
imported>Barry R. Smith (New page: {{subpages}} In mathematics, more specifically, in abstract algebra, an '''abelian group''' is a type of group in which the group operation is commutative ...) |
imported>Barry R. Smith No edit summary |
||
| Line 1: | Line 1: | ||
{{subpages}} | {{subpages}} | ||
In [[mathematics]], more specifically, in [[abstract algebra]], an '''abelian group''' is a type of [[group (mathematics)|group]] in which the group operation is commutative -- abelian groups are also known as '''commutative groups'''. Many common number systems, such as the [[integer]]s, the [[rational number]]s, the [[real number]]s, and the [[complex number]]s are abelian groups with the group operation being addition. In contrast, symmetry groups and permutation groups, which describe the symmetry of a figure and the ways to rearrange the elements in a list respectively, are often non-commutative. | In [[mathematics]], more specifically, in [[abstract algebra]], an '''abelian group''' is a type of [[group (mathematics)|group]] in which the group operation is commutative -- abelian groups are also known as '''commutative groups'''. Abelian groups are named for the mathematician [[Niels Henrik Abel]]. Many common number systems, such as the [[integer]]s, the [[rational number]]s, the [[real number]]s, and the [[complex number]]s are abelian groups with the group operation being addition. In contrast, symmetry groups and permutation groups, which describe the symmetry of a figure and the ways to rearrange the elements in a list respectively, are often non-commutative. | ||
Computations with an abelian group operation are usually easier than computations with non-abelian operations because one is allowed to rearrange the group elements in the computation and collect "like terms". The structure of abelian groups is generally easier both to obtain and to describe than that of non-abelian groups. When an abelian group is also [[finitely generated]], the possible group structure is exceptionally simple, being described by the [[fundamental theorem of finitely generated abelian groups]]. | Computations with an abelian group operation are usually easier than computations with non-abelian operations because one is allowed to rearrange the group elements in the computation and collect "like terms". The structure of abelian groups is generally easier both to obtain and to describe than that of non-abelian groups. When an abelian group is also [[finitely generated]], the possible group structure is exceptionally simple, being described by the [[fundamental theorem of finitely generated abelian groups]]. | ||
Revision as of 08:45, 13 May 2008
In mathematics, more specifically, in abstract algebra, an abelian group is a type of group in which the group operation is commutative -- abelian groups are also known as commutative groups. Abelian groups are named for the mathematician Niels Henrik Abel. Many common number systems, such as the integers, the rational numbers, the real numbers, and the complex numbers are abelian groups with the group operation being addition. In contrast, symmetry groups and permutation groups, which describe the symmetry of a figure and the ways to rearrange the elements in a list respectively, are often non-commutative.
Computations with an abelian group operation are usually easier than computations with non-abelian operations because one is allowed to rearrange the group elements in the computation and collect "like terms". The structure of abelian groups is generally easier both to obtain and to describe than that of non-abelian groups. When an abelian group is also finitely generated, the possible group structure is exceptionally simple, being described by the fundamental theorem of finitely generated abelian groups.