Sufficiency of subgroup criterion: Difference between revisions
No edit summary |
|||
| Line 1: | Line 1: | ||
{{basic fact}} | {{basic fact}} | ||
{{definition equivalence| | {{definition equivalence|subgroup}} | ||
==Statement== | ==Statement== | ||
Revision as of 16:41, 15 February 2008
This article gives the statement, and possibly proof, of a basic fact in group theory.
View a complete list of basic facts in group theory
VIEW FACTS USING THIS: directly | directly or indirectly, upto two steps | directly or indirectly, upto three steps|
VIEW: Survey articles about this
This article gives a proof/explanation of the equivalence of multiple definitions for the term subgroup
View a complete list of pages giving proofs of equivalence of definitions
Statement
For a subset of a group , the following are equivalent:
- is a subgroup, viz is closed under the binary operation of multiplication, the inverse map, and contains the identity element
- is a nonempty set closed under left quotient of elements (that is, for any in , is also in )
- is a nonempty set closed under right quotient of elements (that is, for any in , is also in )
Proof
We shall here prove the equivalence of the first two conditions. Equivalence of the first and third conditions follows by analogous reasoning.
First implies second
Clearly, if is a subgroup:
- is nonempty since contains the identity element
- Whenever are in so is and hence
Second implies first
Suppose is a nonempty subset closed under left quotient of elements. Then, pick an element from .
- is contained in , hence is in
- Now that is in , is also in , so is in
- Suppose are in . Then, is also in . Hence, is in , which tells us that is in .
Thus, satisfies all the three conditions to be a subgroup.