Sufficiency of subgroup criterion: Difference between revisions

From Groupprops
Line 24: Line 24:
===(2) implies (1)===
===(2) implies (1)===


Suppose <math>H</math> is a nonempty subset closed under left quotient of elements. Then, pick an element <math>a</math> from <math>H</math>.  
Suppose <math>H</math> is a nonempty subset closed under left quotient of elements. Then, pick an element <math>u</math> from <math>H</math>.  


* <math>a^{-1}a</math> is contained in <math>H</math>, hence <math>e</math> is in <math>H</math>
* <math>e</math> is in <math>H</math>: St <math>a = b = u</math> to get <math>u^{-1}u</math> is contained in <math>H</math>, hence <math>e</math> is in <math>H</math>
* Now that <math>e</math> is in <math>H</math>, <math>a^{-1}e</math> is also in <math>H</math>, so <math>a^{-1}</math> is in <math>H</math>
* <math>x \in H \implies x^{-1} \in H</math>: Now that <math>e</math> is in <math>H</math>, set <math>b = x, a =e </math> to get <math>x^{-1}e</math> is also in <math>H</math>, so <math>x^{-1}</math> is in <math>H</math>
* Suppose <math>a, b</math> are in <math>H</math>. Then, <math>a^{-1}</math> is also in <math>H</math>. Hence, <math>(a^{-1})^{-1}b</math> is in <math>H</math>, which tells us that <math>ab</math> is in <math>H</math>.
* <math>x,y \in H \implies xy \in H</math>: Set <math>a = y, b= x^{-1}</math>. The previous step tells us both are in <math>H</math>. So <math>(x^{-1})^{-1}y</math> is in <math>H</math>, which tells us that <math>xy</math> is in <math>H</math>.


Thus, <math>H</math> satisfies all the three conditions to be a subgroup.
Thus, <math>H</math> satisfies all the three conditions to be a subgroup.
<section end=main/>
<section end=main/>

Revision as of 02:06, 25 June 2012

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:

  1. is a subgroup, viz is closed under the binary operation of multiplication, the inverse map, and contains the identity element
  2. is a nonempty set closed under left quotient of elements (that is, for any in , is also in )
  3. 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.

(1) implies (2)

Clearly, if is a subgroup:

  • is nonempty since contains the identity element
  • Whenever are in so is and hence

(2) implies (1)

Suppose is a nonempty subset closed under left quotient of elements. Then, pick an element from .

  • is in : St to get is contained in , hence is in
  • : Now that is in , set to get is also in , so is in
  • : Set . The previous step tells us both are in . So is in , which tells us that is in .

Thus, satisfies all the three conditions to be a subgroup.