2 - Subgroups

Subgroup

let G be a group, then a subset H of G is a subgroup of G if it a group, inheriting the operator from G. In such a case we write HG. if HG, we write H<G.

necessary and sufficient conditions for subgroups

let G be a group, H, a subset of G is a subgroup if and only if the following properties hold:

  1. The identity eG is also in H.
  2. x,yH implies that xyH (H is closed under the product operator inherited from G).
  3. xH implies that x1H (H is closed under inverses).

\begin{proof} if H is a subgroup, 1,2,3 follow by definition. Now suppose HG. Then the above three conditions guarantee that H is a group, with associativity following from inheriting the operator from G.

\end{proof}


A simpler condition to guarantee subgroups

let G be a group, and H a subset of G. then H is a subgroup if and only if H is non empty, and x,yH implies xy1H.

\begin{proof} Suppose H was a subgroup of G. then obviously, H is non empty (it at least contains e, the identity) and x,yH implies xy1H. Now, suppose H was a non empty subset of G, and that x,yH implies xy1H. We will show that eH: notice that xH implies xx1=eH. Now we show that H is closed under inverses: Since eH, for any element xH, ex1=x1H. Finally, we will show that H is closed under products: Suppose x,yH. Then y1H, (as shown earlier). Hence x(y1)1H. Hence xyH. Therefore by [[#^97f5ee]] H is a subgroup of G.

\end{proof}


The intersection of subgroups

Let G be a group, and H,K be subgroups of G. Then, HK is a subgroup of G.

\begin{proof} since e is in both H and K, HK is non empty. Suppose x,yHK . Then x,y is in both H and K. Therefore, xy1 is in both H and K. Hence, xy1HK. See :[[#^5c6133]].

\end{proof}


The intersection of finitely many Subgroups is a subgroup

Let H1,H2,Hn All be subgroups of a group G. Then, i=1nHi is a subgroup of G.

Proof Outline

Use [[#^c26bc4]] with a natural induction argument.


Finiteness with product closure are sufficient conditions for a subgroup

Let H be finite subset of a group G, such that the identity eH. If x,yH implies xyH, then H is a subgroup of G.

An intuition for the above idea:

![[diagram-20240712 (2).svg#invert_B]]
Imagine a finite set H, closed under products, with the identity element e in it. Starting from an arbitrary element x, start taking left products, h1x, h2h1x and so on... each of these products are the images of x under distinct left coset maps. so eventually, we have to hit e, (we will show that we can't loop around without ever hitting e), basically allowing us to get closure under inverses.

\begin{proof}
Since H is finite, let |H|=n, we can index the elements of H={h0=e,h1,hn1}. We claim that the left coset maps L(H) are well defined from H to H. suppose xH and hiH. then fhi(x)=hixH due to product closure.
Now, Consider the set of orbits of xH under each map in L(H) defined as Orb(x)={hix:hiH}. By two left coset maps never agree on the image of a particular element if hix=hjx, then in G which has inverses, hi=hj meaning that they are the identical left coset map in G, Hence, they are identical in H. Therefore Orb(x) has n distinct elements, each of which lie in H. Hence Orb(x)=H, given that H is finite. Since Orb(x)=H there exists some hjH such that hjx=h0=e. This is the inverse of an element x. Hence H is closed under inverses. see [[#^97f5ee]].

\end{proof}