The product of two subgroups is another important place where Lagrange's theorem and coset counting appear. If
H and
K are finite subgroups of a group
G, the set
HK consists of all products
h∘k with
h∈H and
k∈K. Even when
HK is not itself a subgroup, its number of elements can still be counted exactly. The overlap between
H and
K controls the repeated representations of elements of
HK. The result is the product formula
∣HK∣=∣H∣∣K∣/∣H∩K∣.
:::definition[Product of Two Subgroups]
Let
(G,∘) be a group and let
H and
K be subgroups of
G. The
product of
H and
K is the subset
HK={h∘k:h∈H,k∈K}.
:::
:::theorem
Let
(G,∘) be a group and let
H and
K be finite subgroups of
G. Then
∣HK∣=∣H∩K∣∣H∣∣K∣.
:::
:::proof
Given that
(G,∘) is a group and
H,K are finite subgroups of
G.
To prove that
∣HK∣=∣H∩K∣∣H∣∣K∣.
Consider the map
φ:H×K→HK defined by
φ(h,k)=h∘k.
By the definition of
HK, the map
φ is onto.
We determine the number of preimages of a fixed element of
HK. Let
x∈HK. Then there exist
h∈H and
k∈K such that
x=h∘k.
Let
(h′,k′)∈H×K such that
h′∘k′=x.
Then
h′∘k′=h∘k.
Therefore
h′∘k′=h∘k⟹h−1∘h′=k∘(k′)−1.
Since
h−1∘h′∈H and
k∘(k′)−1∈K, we get
h−1∘h′∈H∩K.
Let
t=h−1∘h′.
Then
t∈H∩K and
h′=h∘t.
Also, from
h′∘k′=h∘k, we get
h∘t∘k′=h∘k⟹t∘k′=k⟹k′=t−1∘k.
Thus each preimage of
x has the form
(h∘t,t−1∘k)
where
t∈H∩K.
Conversely, for every
t∈H∩K, the pair
(h∘t,t−1∘k)
belongs to
H×K, and
φ(h∘t,t−1∘k)=(h∘t)∘(t−1∘k)=h∘(t∘t−1)∘k=h∘e∘k=h∘k=x.
Therefore every element of
HK has exactly
∣H∩K∣ preimages under
φ.
Since
∣H×K∣=∣H∣∣K∣,
we get
∣H∣∣K∣=∣HK∣∣H∩K∣.
Therefore
∣HK∣=∣H∩K∣∣H∣∣K∣.
Hence,
∣HK∣=∣H∩K∣∣H∣∣K∣.
□
:::
We observe the map from
H×K onto the product set
HK. Choose the sizes of
H,
K, and
H∩K, and notice how the grid of ordered pairs is grouped into equal-size fibers. As
∣H∩K∣ increases, more pairs represent the same product, so the number of distinct elements in
HK decreases. Try setting
∣H∣=4,
∣K∣=3, and
∣H∩K∣=1 to match the example in
Z12.
:::scientific-preview[Subgroup Product Representation Explorer]
:::
The denominator
∣H∩K∣ is not an arbitrary correction factor. It is the exact number of repeated representations of each product element, so dividing by it converts ordered pairs into distinct elements of
HK.
:::corollary
Let
(G,∘) be a group and let
H,K be finite subgroups of
G. If
H∩K={e}, then
∣HK∣=∣H∣∣K∣.
:::
:::proof
Given that
(G,∘) is a group,
H,K are finite subgroups of
G, and
H∩K={e}.
To prove that
∣HK∣=∣H∣∣K∣.
Since
H∩K={e}, we get
∣H∩K∣=1.
By the product formula for finite subgroups,
∣HK∣=∣H∩K∣∣H∣∣K∣=1∣H∣∣K∣=∣H∣∣K∣.
Hence,
∣HK∣=∣H∣∣K∣.
□
:::
The formula counts the set
HK. It does not automatically say that
HK is a subgroup. In many courses, students mistakenly treat every product of subgroups as a subgroup. That is not valid without extra hypotheses. The counting formula remains true because it counts representations
h∘k, not because
HK must be closed under the group operation.
:::example[Product Formula in Integers Modulo Twelve]
Let
G=Z12 under addition modulo
12. Let
H={0,3,6,9}
and
K={0,4,8}.
Then
H∩K={0}.
Therefore
∣H+K∣=∣H∩K∣∣H∣∣K∣=14⋅3=12.
Indeed,
H+K=Z12.
:::
:::solved-problem[Counting a Product of Subgroups]
Let
(G,∘) be a group and let
H,K be finite subgroups of
G. Suppose
∣H∣=12,∣K∣=10,∣H∩K∣=2.
Find
∣HK∣.
:::
:::solution[Solution]
Let
(G,∘) be a group and let
H,K be finite subgroups of
G.
By the product formula for finite subgroups,
∣HK∣=∣H∩K∣∣H∣∣K∣=212⋅10=60.
Therefore
∣HK∣=60.
:::
We compute
∣HK∣ from the three numbers that control the product formula. Enter the orders of
H,
K, and their intersection, and check whether the division produces an integer. The output reminds us that the formula counts the subset
HK, not necessarily a subgroup. This distinction keeps the calculation connected to the proof rather than to an unproved closure assumption.
:::calculator[Product Formula Calculator]
:::
:::exercise[Exercises]
1. Let
H,K be finite subgroups of a group
G such that
∣H∣=8,
∣K∣=6, and
∣H∩K∣=2. Find
∣HK∣.
2. Let
H,K be finite subgroups of a group
G such that
H∩K={e},
∣H∣=5, and
∣K∣=7. Find
∣HK∣.
3. Let
H,K be finite subgroups of a group
G. Prove that
∣H∩K∣ divides
∣H∣∣K∣.
:::
:::answer[Answers]
1. By the product formula,
∣HK∣=28⋅6=24.
2. Since
H∩K={e}, we get
∣HK∣=∣H∣∣K∣=5⋅7=35.
3. Since
H∩K is a finite subgroup,
∣H∩K∣ is a positive integer. The product formula gives
∣H∣∣K∣=∣HK∣∣H∩K∣.
Therefore
∣H∩K∣ divides
∣H∣∣K∣.
:::
:::faq
Q: Is
HK always a subgroup?
A: No. The product
HK is always a subset, but it need not be a subgroup without extra conditions.
Q: Why does
∣H∩K∣ appear in the denominator?
A: Elements in
H∩K account for repeated representations of the same element of
HK.
Q: Does the formula require
G to be finite?
A: It requires
H and
K to be finite. The whole group
G need not be finite for this counting formula.
:::
:::call-to-action
subtitle: Continue with relatively prime subgroup orders and their consequences.
button: Next: Relatively Prime Subgroup Orders | published/abstract-algebra/subgroups-and-normal-subgroups/applications-of-lagrange-theorem/relatively-prime-subgroup-orders.md
:::