Let < G , ∗ > be a group, if:
(1) S is a nonempty subset of G ;
(2) < S , ∗ > is a group.
Then < S , ∗ > is a subgroup of < G , ∗ > , denoted as S ≤ G .
All group G have subgroup { e } and G , called Trivial subgroup, the nontrivial subgroup of G is called the proper subgroup, denoted as S < G .
Let S be a nonempty subset of group G , then the following three propositions are equivalent:
(1) S is a subgroup of G .
(2) For ∀ a , b ∈ S , have a b ∈ S and a − 1 ∈ S (The first subgroup criterion theorem).
(3) For ∀ a , b ∈ S , have a b − 1 ∈ S (The second subgroup criterion theorem).
(The finite subgroup decision theorem)
Let S be a finite nonempty subset of group G , then the necessary and sufficient condition for S to be a subgroup of G is:
∀ a , b ∈ S , a b ∈ S Let G be a group, H 1 , H 2 are two subgroup of G (which means H 1 ≤ G , H 2 ≤ G ), then:
(1) H 1 ∩ H 2 ≤ G .
(2) H 1 ∪ H 2 ≤ G ⇔ H 1 ⊆ H 2 or H 2 ⊆ H 1 .
The subgroups of G must have inclusion relations, so that their union can be a subgroup of G . There must be an inclusion relationship between subgroups of G .