Glossary of group theory
Template:Short description Template:For Template:Also Template:Sister project Template:Group theory sidebar
A group is a set together with an associative operation that admits an identity element and such that there exists an inverse for every element.
Throughout this glossary, we use Template:Math to denote the identity element of a group.
AEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
CEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
DEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
EEdit
Template:Glossary Template:Term Template:Defn Template:Glossary end
FEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
GEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
HEdit
Template:Glossary Template:Term Template:Defn Template:Glossary end
IEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
LEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
NEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
OEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
PEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
QEdit
Template:Glossary Template:Term Template:Defn Template:Glossary end
REdit
Template:Glossary Template:Term Template:Defn Template:Glossary end
SEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
TEdit
Template:Glossary Template:Term Template:Defn Template:Term Template:Defn Template:Term Template:Defn Template:Glossary end
Basic definitionsEdit
Both subgroups and normal subgroups of a given group form a complete lattice under inclusion of subsets; this property and some related results are described by the lattice theorem.
Kernel of a group homomorphism. It is the preimage of the identity in the codomain of a group homomorphism. Every normal subgroup is the kernel of a group homomorphism and vice versa.
Direct product, direct sum, and semidirect product of groups. These are ways of combining groups to construct new groups; please refer to the corresponding links for explanation.
Types of groupsEdit
Finitely generated group. If there exists a finite set Template:Math such that Template:Math, then Template:Math is said to be finitely generated. If Template:Math can be taken to have just one element, Template:Math is a cyclic group of finite order, an infinite cyclic group, or possibly a group Template:Math with just one element.
Simple group. Simple groups are those groups having only Template:Math and themselves as normal subgroups. The name is misleading because a simple group can in fact be very complex. An example is the monster group, whose order is about 1054. Every finite group is built up from simple groups via group extensions, so the study of finite simple groups is central to the study of all finite groups. The finite simple groups are known and classified.
The structure of any finite abelian group is relatively simple; every finite abelian group is the direct sum of cyclic p-groups. This can be extended to a complete classification of all finitely generated abelian groups, that is all abelian groups that are generated by a finite set.
The situation is much more complicated for the non-abelian groups.
Free group. Given any set Template:Math, one can define a group as the smallest group containing the free semigroup of Template:Math. The group consists of the finite strings (words) that can be composed by elements from Template:Math, together with other elements that are necessary to form a group. Multiplication of strings is defined by concatenation, for instance Template:Math.
Every group Template:Math is basically a factor group of a free group generated by Template:Math. Refer to Presentation of a group for more explanation. One can then ask algorithmic questions about these presentations, such as:
- Do these two presentations specify isomorphic groups?; or
- Does this presentation specify the trivial group?
The general case of this is the word problem, and several of these questions are in fact unsolvable by any general algorithm.
General linear group, denoted by Template:Math, is the group of Template:Math-by-Template:Math invertible matrices, where the elements of the matrices are taken from a field Template:Math such as the real numbers or the complex numbers.
Group representation (not to be confused with the presentation of a group). A group representation is a homomorphism from a group to a general linear group. One basically tries to "represent" a given abstract group as a concrete group of invertible matrices, which is much easier to study.