Prove: If a∈G, a^m,a^n∈S, m,n are relatively prime, then a∈S

  • Thread starter Thread starter TimNguyen
  • Start date Start date
  • Tags Tags
    Groups
Click For Summary

Homework Help Overview

The discussion revolves around a proof in group theory, specifically concerning the properties of elements in a group and their relationship to subgroups. The original poster presents a problem involving an element \( a \) in a group \( G \) and two integers \( m \) and \( n \) that are relatively prime, with the goal of proving that if \( a^m \) and \( a^n \) are in a subgroup \( S \), then \( a \) must also be in \( S \).

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the implications of \( m \) and \( n \) being relatively prime, questioning the meaning of common factors and divisors in the context of group elements. They discuss the application of Euclid's Algorithm and the potential relationships between the powers of \( a \) in \( S \).

Discussion Status

The discussion is active, with participants engaging in clarifying concepts and exploring mathematical relationships. Some guidance has been provided regarding the properties of subgroups and the manipulation of group elements, though no consensus or resolution has been reached yet.

Contextual Notes

Participants are encouraged to avoid direct references to the group and subgroup while discussing the properties of coprime integers and their implications. There is an emphasis on understanding the definitions and relationships without jumping to conclusions about the proof itself.

TimNguyen
Messages
79
Reaction score
0
Let (G,*) be a group and (S,*) a subgroup of G. Prove that if for an element a in G, there exists m,n in Z, which are relatively prime, such that a^m and a^n is in S, then a is in S.

At the moment, I think the problem is trivial but something just tells me it is not.
 
Physics news on Phys.org
What do you know about relatively prime integers? There's a well-known characterization of them which could be used here.
 
So m and n have no common factors?
Thus if a^m is in S and a^n is in S, a^m share no common divisors with a^n and vice versa so a must be in S?
 
It doesn't make sense to talk about divisors in a group like that. What does it mean to talk about common divisors of two rotations of a polygon? It isn't that m and n have no common factors: they do, all numbers have common factors, and one called the highest common factor springs to mind.
 
Oh... that's what I meant. So if (m,n)=1, then only a could factors both a^n and a^m?
 
That still doesn't make any sense. Don't think in G or S for now.If I were to say: let m and n be coprime, then what must your first reaction be? (Don't mention G or S at all, please)
 
Then the greatest common divisor for m and n is 1.
 
Well, obviously, since that is the definition of coprime, but what can you deduce from that (still ignoring G and S)? You have done Euclid's Algorithm?
 
Yes, I've done Euclid's algorithm. So it states that dividing m and n over and over until there's a remainder that cannot be factored again will be the greatest common divisor. But since m and n are relatively prime, then I could find integers, p and q, such that mp + nq = 1?
 
  • #10
Yes, and now what can you do with those when we allow ourselves to think about G and S and in particular a?
 
  • #11
Oh... I think I get it. Am I supposed to think in terms of a^mp + a^nq = a^1?
 
  • #12
you can't add elements of the group like that. remember that multiplication of powers of an object adds the indices, ie (x^r)(x^s)=x^(r+s)
 
  • #13
So... if a^m is in S and a^n is in S, then neccessarily (a^m)(a^n) is in S which is equal to a^(m+n)?
 
  • #14
yes, that is certainly true, but if x is in S, then x^p is also in S, isn't it, since S is a subgroup. I haven't picked p at random, and y^q would also be suggestively useful.
 
  • #15
Wow, thanks for all your help Matt.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
3
Views
2K
Replies
1
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 1 ·
Replies
1
Views
1K