Sufficiency of subgroup criterion

From Groupprops

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 H of a group G, the following are equivalent:

  1. H is a subgroup, viz H is closed under the binary operation of multiplication, the inverse map, and contains the identity element
  2. H is a nonempty set closed under left quotient of elements (that is, for any a,b in H, b1a is also in H)
  3. H is a nonempty set closed under right quotient of elements (that is, for any a,b in H, ab1 is also in H)

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 H is a subgroup:

  • H is nonempty since H contains the identity element
  • Whenever a,b are in H so is b1 and hence b1a

(2) implies (1)

Suppose H is a nonempty subset closed under left quotient of elements. Then, pick an element u from H. (VIDEO WARNING: In the embeddded video, the letter a is used in place of u, which is a little unwise, but the spirit of reasoning is the same).

  • e is in H: Set a=b=u to get u1u is contained in H, hence e is in H
  • xHx1H: Now that e is in H, set b=x,a=e to get x1e is also in H, so x1 is in H
  • x,yHxyH: Set a=y,b=x1. The previous step tells us both are in H. So (x1)1y is in H, which tells us that xy is in H.

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