Proving the Inclusion of <a> in H: A Permutation Group Proof

iamalexalright
Messages
157
Reaction score
0

Homework Statement


Suppose G is a group, H < G (H is a subgroup of G), and a is in G.

Prove that a is in H iff <a> is a subset of H.


Homework Equations


<a> is the set generated by a (a,aa,aa^-1,etc)


The Attempt at a Solution


For some reason this seems too easy:

1. Suppose a is in H.
Since H is a group, a^-1 is in H.
Since H is a group aa, is in H (as is aa^-1, etc.)
Thus <a> is a subset of H.

2. Suppose <a> is a subset of H.
Obviously a is in H.

And this completes the proof... or am I missing something?
 
Physics news on Phys.org
shameful bump
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top