Open In App

Intersection of two subgroups of a group is again a subgroup

Last Updated : 05 Mar, 2021
Like Article

It is a set equipped with a binary operation that combines any two elements to form a third element in such a way that three conditions called group axioms are satisfied, namely associativity, identity, and invertibility.

If a non-void subset H of a group G is itself a group under the operation of G, we say H is a subgroup of G.

To Prove :  
Prove that the intersection of two subgroups of a group G is again a subgroup of G.

Proof : 
Let H and H2 be any two subgroups of G.

H1 ∩  H2  ≠  ∅

Since at least the identity element ‘e’ is common to both H1 and H2 .
In order to prove that H ∩ H is a subgroup, it is sufficient to prove that

   a ∈ H1 ∩ H2 ,  b ∈ H1 ∩ H2
⇢ a b-1 ∈ H1 ∩ H2


   a ∈ H1 ∩ H2  
⇢ a ∈ H1  and   a ∈ H2
   b ∈ H1 ∩ H2
⇢ b ∈ H1  and   b ∈ H2

Since H1 and H2 are subgroups.

    a ∈ H1  ,  b ∈ H1
⇢  ab-1 ∈ H1 


   a ∈ H2 ,  b ∈ H2
⇢ ab-1 ∈ H2


   ab-1 ∈ H1    and     ab-1 ∈ H2
⇢ ab-1 ∈ H1 ∩ H2

Hence, H1 ∩  H2 is a subgroup of G and that is our theorem i.e. The intersection of two subgroups of a group is again a subgroup.

Similar Reads

Subgroup and Order of group | Mathematics
Prerequisite: Groups Subgroup - A nonempty subset H of the group G is a subgroup of G if H is a group under binary operation (*) of G. We use the notation H ≤ G to indicate that H is a subgroup of G. Also, if H is a proper subgroup then it is denoted by H < G . For a subset H of group G, H is a subgroup of G if, H ≠ φ if a, k ∈ H
4 min read
Prove that every subgroup of a cyclic group is cyclic
To Prove :Every subgroup of a cyclic group is cyclic. Cyclic Group :It is a group generated by a single element, and that element is called a generator of that cyclic group, or a cyclic group G is one in which every element is a power of a particular element g, in the group. That is, every element of G can be written as gn for some integer n for a
2 min read
Group Homomorphisms and Normal Subgroup
Prerequisite : Groups Homomorphism : A mapping (function) f from a group (G,*) to a group (G',+) is called a group homomorphism (or group morphism) from G to G' if, f(a*b) = f (a) + f(b) , for all a, b belong to set G. Example - The function f(x)=ax from (R,+) to (Ro,*), here R is the set of all real numbers and Ro is the set of all real numbers ex
5 min read
Prove that Every Cyclic Group is an Abelian Group
Groups, subgroups, rings, fields, integral domains, graphs, trees, cut sets, etc are one of the most important concepts in Discrete Mathematics. In this article, we are going to discuss and prove that every cyclic group is an abelian group. Before proceeding to the proof let's first understand some basic terminologies like what is an abelian group,
2 min read
Quotient Group in Group Theory
Prerequisite : Knowledge of Groups, Cosets. Introduction :We can say that "o" is the binary operation on set G if : G is an non-empty set & G * G = { (a,b) : a , b∈ G } and o : G * G --> G. Here, aob denotes the image of ordered pair (a,b) under the function / operation o.Example - "+" is called a binary operation on G (any non-empty set ) i
5 min read
Union and Intersection Operation On Graph
In graph theory, the data/objects belong to the same group but each piece of data differs from one other. In this article, we will see union and intersection operations on the graph. Union Operation Let G1(V1, E1) and G2(V2, E2) be two graphs as shown below in the diagram. The union of G1 and G2 is a graph G=G1∪G2, where vertex set V=V1 ∪ V2 and ed
2 min read
Cayley Table and Cyclic group | Mathematics
Cayley Table - If G is a finite group with the operation *, the Cayley table of G is a table with rows and columns labeled by the elements of the group. The entry in the row labelled by and the column labeled by his the element g*h. Example: Let's construct the Cayley table of the group Z5, the integers {0, 1, 2, 3, 4} under addition mod 5. Step #1
3 min read
Finite Group in Algebraic Structure
Prerequisite - Group Finite Group: A group of finite number of elements is called a finite group. Order of a finite group is finite. Examples: Consider the set, {0} under addition ({0}, +), this a finite group. In fact, this is the only finite group of real numbers under addition. Set {1} under multiplication ({1}, *) and set {1, -1} under multipli
1 min read
Abelian Group Example
Problem-: Prove that ( I, + ) is an abelian group. i.e. The set of all integers I form an abelian group with respect to binary operation '+'. Solution-: Set= I ={ .................-3, -2 , -1 , 0, 1, 2 , 3.................. }. Binary Operation= '+' Algebraic Structure= (I ,+) We have to prove that (I,+) is an abelian group. To prove that set of int
2 min read
Inverse of Permutation Group
Inverse of Permutation Group-: If the product of two permutations is the identical permutation then each of them is called inverse of each other. For Example-: The permutations [Tex]\begin{pmatrix} a1 &a2&a3&........&an\\ b1 & b2 & b3&........&bn \end{pmatrix} and \begin{pmatrix} b1 & b2 & b3&........
4 min read
Article Tags :