Groups and Subgroups - Core Definitions
A group is one of the most fundamental structures in abstract algebra, providing a framework for studying symmetry and transformations.
A group is a set together with a binary operation satisfying:
- Associativity: for all
- Identity: There exists such that for all
- Inverses: For each , there exists such that
If additionally for all , the group is called abelian or commutative.
- Integers under addition : The identity is 0, and the inverse of is
- Non-zero rationals under multiplication : The identity is 1, and the inverse of is
- Symmetric group : All permutations of elements under composition
- General linear group : All invertible matrices under multiplication
A subset is a subgroup of (written ) if:
- The identity
- is closed under the group operation: if , then
- is closed under inverses: if , then
Equivalently, if and only if is non-empty and for all , we have .
The subgroup criterion provides an efficient test for verifying subgroup structure. Every group has at least two subgroups: the trivial subgroup and itself. Subgroups that are neither trivial nor the whole group are called proper subgroups.
The subgroup structure of a group reveals much about its internal symmetry. For finite groups, Lagrange's theorem constrains possible subgroup orders, establishing that the order of any subgroup must divide the order of the group.
Understanding groups begins with recognizing patterns in concrete examples like symmetries of geometric objects, number systems, and matrix groups. The abstraction to axiomatic group theory allows these diverse phenomena to be studied uniformly.