Tour:Subgroup: Difference between revisions
No edit summary |
m (9 revisions) |
(No difference)
| |
Revision as of 23:40, 7 May 2008
This article adapts material from the main article: Subgroup
This page is part of the Groupprops Guided tour for beginners (Jump to beginning of tour)
PREVIOUS: Abelian group |UP: Introduction one (beginners) | NEXT: Trivial group
Given below is the definition of subgroup. A subgroup of a group is, roughly speaking, a subset that's also a group. The definition of subgroup is given in a number of equivalent ways below. Before proceeding further, make sure that you fully understand why all the definitions are equivalent, and why they tally with whatever definitions you see in textbooks.
Proceed to Guided tour for beginners:Trivial group OR return to Guided tour for beginners:Abelian group OR Read the complete article on subgroup
Definition
The universal algebraic definition
Let be a group. A subset of is termed a subgroup if all the three conditions below are satisfied:
- Whenever belong to , so does (here denotes the product of the two elements)
- Whenever belongs to , so does (the multiplicative inverse of )
- belongs to (where denotes the identity element)
Definition via the subgroup condition
The equivalence of this definition with the earlier one is often called the subgroup condition. For full proof, refer: Sufficiency of subgroup condition
It has two forms (left and right):
- A subset of a group is termed a subgroup if it is nonempty and is closed under the left quotient of elements. In other words, a subset of a group is termed a subgroup if and only if is nonempty and whenever
- A subset of a group is termed a subgroup if it is nonempty and is closed under the right quotient of elements. In other words, a subset of a group is termed a subgroup if and only if is nonempty and whenever
Definition in terms of injective homomorphisms
A subgroup of a group can also be defined as another abstract group along with an injective homomorphism (or embedding) from that abstract group to the given group. Here, the other abstract group can be naturally identified via its image under the homomorphism, which is the subgroup in a more literal sense.
Often, when we want to emphasize the subgroup not just as an abstract group but in its role as a subgroup, we use the term embedding and think of it as an injective homomorphism.
Equivalence of subgroups
Given a subgroup and a subgroup , we say that these two subgroups are equivalent if there is an isomorphism from to such that maps to under that isomorphism.
In particular, if , then and are equivalent as subgroups if there is an automorphism of under which maps to .
This notion of equivalence of subgroups is important when dealing with and defining the notion of subgroup property.
This article is about a basic definition in group theory. The article text may, however, contain advanced material.
VIEW: Definitions built on this | Facts about this: (facts closely related to Subgroup, all facts related to Subgroup) |Survey articles about this | Survey articles about definitions built on this
VIEW RELATED: Analogues of this | Variations of this | Opposites of this |[SHOW MORE]
This article defines a property of subsets of groups
View other properties of subsets of groups|View properties of subsets of abelian groups|View subgroup properties
Definition
The universal algebraic definition
Let be a group. A subset of is termed a subgroup if all the three conditions below are satisfied:
- Whenever belong to , so does (here denotes the product of the two elements)
- Whenever belongs to , so does (the multiplicative inverse of )
- belongs to (where denotes the identity element)
Definition via the subgroup condition
The equivalence of this definition with the earlier one is often called the subgroup condition. For full proof, refer: Sufficiency of subgroup condition
It has two forms (left and right):
- A subset of a group is termed a subgroup if it is nonempty and is closed under the left quotient of elements. In other words, a subset of a group is termed a subgroup if and only if is nonempty and whenever
- A subset of a group is termed a subgroup if it is nonempty and is closed under the right quotient of elements. In other words, a subset of a group is termed a subgroup if and only if is nonempty and whenever
Definition in terms of injective homomorphisms
A subgroup of a group can also be defined as another abstract group along with an injective homomorphism (or embedding) from that abstract group to the given group. Here, the other abstract group can be naturally identified via its image under the homomorphism, which is the subgroup in a more literal sense.
Often, when we want to emphasize the subgroup not just as an abstract group but in its role as a subgroup, we use the term embedding and think of it as an injective homomorphism.
Equivalence of subgroups
Given a subgroup and a subgroup , we say that these two subgroups are equivalent if there is an isomorphism from to such that maps to under that isomorphism.
In particular, if , then and are equivalent as subgroups if there is an automorphism of under which maps to .
This notion of equivalence of subgroups is important when dealing with and defining the notion of subgroup property.
Examples
Examples in Abelian groups
If we consider the Abelian group (reals under addition) then the group of integers is a subgroup of this group. Similarly, the group of rational numbers is an example of a subgroup of the group of reals.
On the other hand, the set of positive integers is not a subgroup of the group of integers, although it is closed under the group operation. This is because the additive inverse (or negative) of a positive integer isn't a positive integer.
Examples in non-Abelian groups
Consider the group of all permutations of the set of elements . This is termed the symmetric group on elements. The group of permutations that fix is a subgroup of this group.
Subgroups usually arise as elements of the group satisfying some additional conditions, where that condition is preserved under taking inverses, preserved under multiplication, and satisfied by the identity element.