Proving something about right cosets of distinct subgroups of a group

  • Thread starter Thread starter athyra
  • Start date Start date
  • Tags Tags
    Cosets Group
Click For Summary
SUMMARY

The discussion centers on proving that a subset S of a group G cannot be a right coset of two distinct subgroups H and K of G. The key argument involves assuming F = Hg1 = Kg2 for elements g1 and g2 in G, leading to the conclusion that if an element m is in H, it must also be in K, and vice versa. This contradiction demonstrates that H and K must be equal if they share a right coset, thereby proving the initial claim. The discussion emphasizes the importance of understanding the definitions and properties of right cosets in group theory.

PREREQUISITES
  • Understanding of group theory concepts, specifically subgroups and cosets.
  • Familiarity with the definitions of right cosets in the context of group G.
  • Knowledge of basic proof techniques in mathematics, particularly proof by contradiction.
  • Ability to manipulate algebraic expressions involving group elements and operations.
NEXT STEPS
  • Study the properties of right cosets in group theory, focusing on their definitions and implications.
  • Explore proof techniques in abstract algebra, particularly proof by contradiction and direct proof methods.
  • Investigate the relationship between subgroups and cosets, including the concept of normal subgroups.
  • Learn about the structure of groups and how distinct subgroups interact within a group.
USEFUL FOR

Students of abstract algebra, mathematicians interested in group theory, and anyone studying the properties of cosets and subgroups in mathematical structures.

athyra
Messages
1
Reaction score
0

Homework Statement


Prove that a subset S of a group G cannot be a right coset of two different subgroups of G.



Homework Equations


The relevant equations are those involving the definitions of right cosets.
a is in the right coset of subgroup H of group G if a = hg where h is in H and g is in G, possibly in H.


The Attempt at a Solution


First I let a subset F of G be equal to right cosets of two distinct subgroups of G. So let H and K be subgroups of G such that H doesn't equal K. Now assume F = Hg_1 = Kg_2, where g_1, and g_2 are both in G. So F is now equal to two right cosets of distinct subgroups of G. So my idea was to let m be in H, and show it must be in K. I believe the argument for this will be reversible so it will be almost identical showing that if m is in K it must be in H. Then I would have found my contradiction. So what to do once assuming m is in H is where I am stuck. Any help would be greatly appreciated, as I have never written in a forum for help before.
 
Physics news on Phys.org
Showing if m is in H then it's in K and vice-versa would do it alright. But that's what you want to show in general to show two sets are equal and doesn't have anything in particular to do with groups or cosets. So it's not much of a start. Try thinking about this. If F=Hg_1=Kg_2 then H=K(g_2)(g_1)^(-1). That means H is a right coset of K, true? H contains the identity. How many right cosets of K contain the identity?
 
Last edited:

Similar threads

  • · Replies 21 ·
Replies
21
Views
3K
Replies
6
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 20 ·
Replies
20
Views
2K
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 2 ·
Replies
2
Views
4K
  • · Replies 3 ·
Replies
3
Views
2K