Lagrange theorem and subgroup help

Click For Summary
SUMMARY

The discussion centers on proving that if H and K are subgroups of a group G with coprime orders, then their intersection H ∩ K contains only the identity element. Participants reference Lagrange's Theorem, which states that the order of a subgroup divides the order of the group. They conclude that if the orders of H and K are coprime, the only common element can be the identity, as any element in both subgroups would lead to a contradiction regarding their orders. The discussion also touches on the implications for infinite groups, questioning the applicability of Lagrange's Theorem in such cases.

PREREQUISITES
  • Understanding of Lagrange's Theorem in group theory
  • Knowledge of subgroup properties and definitions
  • Familiarity with the concept of the order of an element in a group
  • Basic grasp of finite versus infinite groups
NEXT STEPS
  • Study the implications of Lagrange's Theorem for finite groups
  • Explore the properties of cyclic groups and their relevance to subgroup intersections
  • Investigate the concept of group orders and their significance in group theory
  • Learn about the structure of infinite groups and the limitations of Lagrange's Theorem
USEFUL FOR

Mathematics students, particularly those studying abstract algebra, group theory enthusiasts, and educators seeking to deepen their understanding of subgroup interactions and Lagrange's Theorem.

annoymage
Messages
360
Reaction score
0

Homework Statement



Let G be group, H<G , K<G, if gcd(lHl,lKl)=1, prove that H\bigcapK={1}

Homework Equations





The Attempt at a Solution



so Lagrange theorem says that lHl l lGl, lKl l lGl,
and of course 1 is inside both H and K, but how when they are coprime, the element are all different except their identity? i cannot see T_T
 
Physics news on Phys.org


What must be true about the order of an element of a group
 


i don't know much about, order of an element, but i noticed the corollary from lagrange theorem, state that order on an element divides order of the group, provided that it is a finite group,

i use oG for order of G for simplicity.

so, gcd(oH,oK)=1 , let h in H, k in K,

so oh l oH and ok l oK, would imply gcd(oh,ok)=1

so their orders are coprime, still cannot see, why their element are different, T_T,

is, cyclic group involved? i still didn't go through cyclic yet
 


Well, suppose we have an element g which is in both H and K.

What is the order of g? You almost calculated it in your post
 


yeaaa, i can see now, the order is 1, therefore 1 is the element in both H and K, correct?
 


No, 1 is in H and K because H and K are subgroups of G.

Are you sure you can assume finiteness here?

Here is a different way to approach. Pick an arbitrary element,k, in K. Now state something about the order of k. Now what happens if you assume k is in H? What is true about all the elements of H?
 


annoymage said:
yeaaa, i can see now, the order is 1, therefore 1 is the element in both H and K, correct?

i mean, 1 is the "only" element in H and K, if it is finite...

hmmmm, so maybe can i divide it into 2 cases? but i do no know what to do if they are infinite, cause i can't use lagrange.

anyway,

icantadd said:
Here is a different way to approach. Pick an arbitrary element,k, in K. Now state something about the order of k. Now what happens if you assume k is in H? What is true about all the elements of H?

let order of k is n, so kn=1, Suppose k also in H, then kn also in H, is that what you mean? T_T and i don't know how to continued
 


annoymage said:
let order of k is n, so kn=1, Suppose k also in H, then kn also in H, is that what you mean? T_T and i don't know how to continued

You can get there!

Yup, okay, we have k^n = 1. Now what can you tell me, using Lagrange about n and |K|?

Write that down. Now if you assume k is also in H, what does that imply?
 


yes, but i thought i can only use lagrange for finite group,

and if it is finite, and if k also in H k^n also in H, so n divides both l K l and l H l, will imply gcd(n,n)=1, so n must equal to 1, so order of k is 1, will imply k=1, so 1 is the only element in K and H,
but i did it in the last post, T_T what if it is infinite? i cannot use Lagrange right?
 
  • #10


annoymage said:
what if it is infinite? i cannot use Lagrange right?

Yeah, I was thinking about that...
Does taking the gcd of a group with infinite order make sense?
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
5
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 23 ·
Replies
23
Views
3K