View source for Subgroup

{{basicdef}}

{{group subset property}}

<section begin=beginner/>
==Definition==

===Definition in terms of closure under binary operation===

This definition of subgroup corresponds to the textbook definition of group.

Let <math>G</math> be a group. A [[subset of a group|subset]] <math>H</math> of <math>G</math> is termed a '''subgroup''' if the following two conditions hold:

* Whenever <math>a,b</math> belong to <math>H</math>, the product <math>ab</math> belongs to <math>H</math>.
* With this induced multiplication, <math>H</math> becomes a group in its own right (i.e., it has an identity element, and every element has a two-sided inverse). Note that associativity in <math>H</math> follows automatically from associativity in <math>G</math>.

===The universal algebraic definition===

This definition of subgroup corresponds to the universal algebraic definition of group.

Let <math>G</math> be a group. A [[subset of a group|subset]] <math>H</math> of <math>G</math> is termed a '''subgroup''' if all the three conditions below are satisfied:

* Whenever <math>a, b</math> belong to <math>H</math>, so does <math>ab</math> (here <math>ab</math> denotes the product of the two elements)
* <math>e</math> belongs to <math>H</math> (where <math>e</math> denotes the [[identity element]])
* Whenever <math>a</math> belongs to <math>H</math>, so does <math>a^{-1}</math> (the multiplicative inverse of <math>a</math>)

<center>{{#widget:YouTube|id=6zzQLvvyTkQ}}</center>

===Definition via the subgroup condition===

The equivalence of this definition with the earlier one is often called the '''subgroup condition'''. {{proofat|[[Sufficiency of subgroup condition]]}}

It has two forms (left and right):
* A [[subset of a group]] is termed a subgroup if it is nonempty and is closed under the [[left quotient of elements]]. In other words, a subset <math>H</math> of a group <math>G</math> is termed a subgroup if and only if <math>H</math> is nonempty and <math>a^{-1}b \in H</math> whenever <math>a,b \in H</math>
* A [[subset of a group]] is termed a subgroup if it is nonempty and is closed under the [[right quotient of elements]]. In other words, a subset <math>H</math> of a group <math>G</math> is termed a subgroup if and only if <math>H</math> is nonempty and <math>ab^{-1} \in H</math> whenever <math>a,b \in H</math>
<section end=beginner/>
<section begin=revisit/>
===Definition in terms of injective homomorphisms===

A subgroup of a group can also be defined as another abstract group along with an ''injective'' homomorphism (or embedding) from that abstract group to the given group. Here, the other abstract group can be naturally identified via its image under the homomorphism, which is the ''subgroup'' in a more literal sense.

Often, when we want to emphasize the '''subgroup''' not just as an abstract group but in its role as a subgroup, we use the term '''embedding''' and think of it as an injective homomorphism.

===Equivalence of definitions===

{{further|[[Equivalence of definitions of subgroup]], [[Sufficiency of subgroup criterion]]}}

The equivalence of the two definitions (the definition in terms of closure under binary operation and the universal algebraic definition) relies on the following two facts: 
# ''If'' a subset of a group is closed under multiplication and has an identity element, then that identity element must equal the identity element of the group (this relies on the cancellation property in groups).
# ''If'' a subset of a group allows for multiplicative inverses, then the multiplicative inverses inside the subset are the same as the multiplicative inverses inside the whole group

The equivalence with the definition arising from the subgroup criterion is based on a short and elegant argument, refer [[sufficiency of subgroup criterion]].

The equivalence with the definition in terms of injective homomorphism relies on viewing the subgroup as a group in its own right and its inclusion in the whole group as an injective homomorphism.

==Equivalence of subgroups==

Given a subgroup <math>H_1 \le G_1</math> and a subgroup <math>H_2 \le G_2</math>, we say that these two subgroups are equivalent if there is an isomorphism <math>\sigma</math> from <math>G_1</math> to <math>G_2</math> such that <math>H_1</math> maps to <math>H_2</math> under that isomorphism.

In particular, if <math>G_1 = G_2 = G</math>, then <math>H_1</math> and <math>H_2</math> are equivalent as subgroups if there is an [[automorphism]] of <math>G</math> under which <math>H_1</math> maps to <math>H_2</math> (subgroups equivalent in this sense are termed [[automorphic subgroups]] or automorphs -- sometimes, stronger notions of equivalence, such as being [[conjugate subgroups]], are also useful).

This notion of equivalence of subgroups is important when dealing with and defining the notion of [[subgroup property]].
<section end=revisit/>
<section begin=beginner/>

==Notation==

If <math>H</math> is a subgroup of <math>G</math>, we typically write <math>H \le G</math> or <math>G \ge H</math>. Some people also write <math>H \subseteq G</math>, but the latter notation is typically used for arbitrary subsets that need not be subgroups.

If <math>H</math> is not equal to the whole of <math>G</math>, we say that <math>H</math> is a proper subgroup of <math>G</math>, and this is sometimes denoted by <math>H < G</math> or <math>G > H</math>.

==Examples==

===Examples in abelian groups===

If we consider the [[abelian group]] <math>(\R,+)</math> (reals under addition) then the group of integers <math>(\mathbb{Z},+)</math> is a subgroup of this group. Similarly, the group of rational numbers (<math>\mathbb{Q},+)</math>) is an example of a subgroup of the group of reals.

On the other hand, the set of positive integers is ''not'' a subgroup of the group of integers, although it is closed under the group operation. This is because the additive inverse (or negative) of a positive integer isn't a positive integer.
<section end=beginner/>
<section begin=revisit/>

===Examples in non-abelian groups===

Consider the group of all permutations of the set of elements <math>\{ 1,2,3, \ldots, n \}</math>. This is termed the [[symmetric group]] on <math>n</math> elements. The group of permutations that fix <math>n</math> is a subgroup of this group.

Subgroups usually arise as elements of the group satisfying some additional conditions, where that condition is preserved under taking inverses, preserved under multiplication, and satisfied by the identity element.
<section end=revisit/>

==Properties==

===Subgroup properties===

{{further|[[subgroup property]]}}

Given a group and a subgroup thereof, we want answers to various questions about how the subgroup sits inside the group. These answers are encoded in various ways. One of these is by checking whether the subgroup satisfies a particular [[subgroup property]]. A subgroup property is something that takes as input a group and subgroup and outputs true/false; moreover, the answer should be the same for ''equivalent'' group-subgroup pairs.

[[:Category:Subgroup properties]] is a complete list of subgroup properties; [[:Category:Pivotal subgroup properties]] is a list of important ones.

Note that the property of being a subgroup is ''itself'' a subgroup property; in logical terms, it is the ''tautology'' subgroup property: the one that's always true.

==Metaproperties==

{{intersection-closed}}

An arbitrary intersection of subgroups is a subgroup. {{proofat|[[Intersection of subgroups is subgroup]]}}
Thus, given any subset of a group, it makes sense to talk of the ''smallest'' subgroup containing that subset.

{{join-closed}}

Given any subset, we can talk of the subgroup generated by that subset. One way of viewing this is as the intersection of all subgroups containing that subset. Another way of viewing it is as the set of all elements in the group that can be expressed using elements of the subset, and the group operations.

Hence, in particular, given a family of subgroups, we can talk of the subgroup generated by them, as simply the subgroup generated by their union. This is the smallest subgroup containing all of them.

{{transitive}}

Any subgroup of a subgroup is again a subgroup. This follows directly from any of the equivalent definitions of subgroup.

{{trim}}

There are two extreme kinds of subgroups: the [[trivial group|trivial]] subgroup, which comprises only the identity element, and the whole group, which comprises all elements.

{{intsubcondn}}

The property of being a subgroup satisfies the [[intermediate subgroup condition]]. That is, if <math>H \le G</math> is a subgroup and <math>K</math> is a subgroup of <math>G</math> containing <math>H</math>, then <math>H</math> is a sub''group'' of <math>K</math> (not merely a subset).

{{imagecondn}}

The image of a subgroup under any [[homomorphism]] of groups is again a subgroup.

{{inverse image condition}}

The inverse image of a subgroup under any [[homomorphism]] of groups is again a subgroup.

{{ACU-closed}}

The union of any ascending chain of subgroups is again a subgroup. In fact, it is precisely the subgroup generated by the members of the ascending chain.

==References==
===Textbook references===
* {{booklink-defined|DummitFoote}}, Page 22, Exercise 26 (definition introduced in exercise), and Page 46 (formal definition)
* {{booklink-defined|AlperinBell}}, Page 2 (definition introduced in paragraph)
* {{booklink-defined|RobinsonGT}}, Page 8 (definition introduced in paragraph)
* {{booklink-defined|RobinsonAA}}, Page 46 (definition introduced in paragraph)
* {{booklink-defined|Lang}}, Page 9 (definition introduced in paragraph)
* {{booklink-defined|Fraleigh}}, Page 66 (formal definition)
* {{booklink-defined|Hungerford}}, Page 31, Definition 2.4 (formal definition)
* {{booklink-defined|Gallian}}, Page 57
* {{booklink-defined|Herstein}}, Page 37 (formal definition)
* {{booklink-defined|Artin}}, Page 44, Section 2 (formal definition)

==External links==

===Definition links===
* {{wp-defined|Subgroup}}
* {{planetmath-defined|Subgroup}}
* {{mathworld-defined|Subgroup}}
* {{sor-defined|S/s090860}}