Quick elementary group question

This is easy, probably: if I want to prove that H is a subgroup of G.
why is it sufficient to show that the identity is in H and that H is
closed? How does this secure the existence of inverse elements?

Thanks :-)
Coyn
.

Relevant Pages

  • Re: Complexity of computing normal subgroup
    ... >>the testing of existence of a normal subgroup ... for a finite group input as a finite list of generators ... > of a subgroup of a symmetric group S_n, ... This of course includes the case of a finite group input by ...
    (comp.theory)
  • group of order 726 necessarily simple
    ... How to show group of order 726 necessarily simple (i.e., no proper ... nontrivial normal subgroup)? ... how to work the contradiction if we assume existence of such normal ...
    (sci.math)