Conditions on H and K if H ∪ K is a subgroup

Click For Summary
SUMMARY

The discussion centers on the proof that if the union of two subgroups, H and K, of a group G is itself a subgroup, then either H is a subset of K or K is a subset of H. The proof employs a contradiction approach, demonstrating that if neither subgroup is contained within the other, it leads to contradictions regarding the closure properties of subgroups. Key elements include the use of subgroup properties and the implications of the union being a subgroup.

PREREQUISITES
  • Understanding of group theory concepts, specifically subgroups.
  • Familiarity with the properties of group operations and inverses.
  • Knowledge of proof techniques, particularly proof by contradiction.
  • Basic comprehension of set operations, including unions and intersections.
NEXT STEPS
  • Study the properties of subgroups in group theory.
  • Learn about the implications of subgroup intersections and unions.
  • Explore proof techniques in abstract algebra, focusing on contradiction.
  • Investigate examples of groups where unions of subgroups are analyzed.
USEFUL FOR

Mathematics students, particularly those studying abstract algebra, group theorists, and educators looking to deepen their understanding of subgroup properties and proof techniques.

Mr Davis 97
Messages
1,461
Reaction score
44

Homework Statement


Let H and K be subgroups of G. Prove that if ##H \cup K## is a subgroup of ##G## then ##H \subseteq K## or ##K \subseteq H##

Homework Equations

The Attempt at a Solution


Suppose that ##H \cup K \le G##. For contradiction, suppose that neither H nor K is a subset of the other. This implies that there exists an ##h \in H## that is not in ##K## and a ##k \in K## that is not in ##H##. Since ##H## and ##K## are individually subgroups, ##h^{-1} \in H## and ##k^{-1} \in K##. Now since ##h \in H \cup K## and ##k \in H \cup K##, we know that ##hk \in H \cup K##, since we supposed it's a subgroup. We have three cases to check: If ##hk \in (H \cap K)##, then ##(hk)k^{-1} = h \in K##, a contradiction. If ##hk \in (H \cup K) - H## then ##(hk)k^{-1} = h \in K##, a contradiction. If ##hk \in (H \cup K) - K## then ##h^{-1}(hk) = k \in H##, a contradiction.
 
Physics news on Phys.org
Mr Davis 97 said:

Homework Statement


Let H and K be subgroups of G. Prove that if ##H \cup K## is a subgroup of ##G## then ##H \subseteq K## or ##K \subseteq H##

Homework Equations

The Attempt at a Solution


Suppose that ##H \cup K \le G##. For contradiction, suppose that neither H nor K is a subset of the other. This implies that there exists an ##h \in H## that is not in ##K## and a ##k \in K## that is not in ##H##. Since ##H## and ##K## are individually subgroups, ##h^{-1} \in H## and ##k^{-1} \in K##. Now since ##h \in H \cup K## and ##k \in H \cup K##, we know that ##hk \in H \cup K##, since we supposed it's a subgroup.
I wouldn't say suppose here as it sounds as if it could be wrong. It is our given condition, i.e. we accept it as given truth. "... since ##H \cup K## is a subgroup." would be better.
We have three cases to check: If ##hk \in (H \cap K)##, then ##(hk)k^{-1} = h \in K##, a contradiction. If ##hk \in (H \cup K) - H## then ##(hk)k^{-1} = h \in K##, a contradiction. If ##hk \in (H \cup K) - K## then ##h^{-1}(hk) = k \in H##, a contradiction.
I think you don't need the cases. Just look at ##hk##. It's either in ##H## in which case ##k## is as well, or vice versa for the other possibility. You can say w.l.o.g. ##hk \in H## (the problem is symmetric in ##H## and ##K##) and have only one case to consider.
 
  • Like
Likes   Reactions: Mr Davis 97

Similar threads

Replies
7
Views
2K
  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
5
Views
2K
Replies
1
Views
13K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K