Proof of (a^-1)^-1 = a in Group (G, ⋅) | Inverse Property

  • Thread starter Thread starter 4Fun
  • Start date Start date
4Fun
Messages
10
Reaction score
0

Homework Statement



Let (G,\circ) be a group. Show that \foralla\inG (a^{-1})^{-1} = a

The Attempt at a Solution



I came up with the following. a^{-1} is the inverse of (a^{-1})^{-1}, therefore we have:

a^{-1} \circ (a^{-1})^{-1} = e
But for a^{-1} \circ (a^{-1})^{-1} to be equal to e, it has to be the case that:
a^{-1} \circ a = e
, therefore (a^{-1})^{-1} has to be equal to a.

Now I think the proof is incorrect, but I'm not sure. I think the mistake is trying to imply that (a^{-1})^{-1} is equal to a, just because both a^{-1} \circ (a^{-1})^{-1} and a^{-1} \circ a are equal to a. Is this a valid proof technique?
 
Physics news on Phys.org
Well, isn't a group associative?
Thus,

We have:
a^-1(ring)(a^-1)^-1=e

so that:
a(ring)(a^-1(ring)(a^-1)^-1))=a(ring)e (*)

Invoking associativity on LHS in (*) should do the trick.
 
Ah yes, didn't think of that option. Thanks a lot for your help.

In general if you try to prove equalities like this, what should you think about? Should you just consider all definitions that are valid and then just try some things out until you come up with the desired equality or what should the process of a finding a proof for a statement like this look like?
 
There isn't any foolproof method to kill all the problems you might encounter.

But, as you do more of such problems, your brain sort of figures out the structure, and clever ideas might start popping up by themselves.
 
  • Like
Likes 1 person
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