Question

the question says: prove that if a is an element of a group G, then the...

the question says:
prove that if a is an element of a group G,
then the order of a = order of its inverse.
my attempt:
Let order of a=n , so aⁿ=e , and so (a)ⁿ(a^-1)ⁿ=e=(a^-1)ⁿ , so order of a divides order of a^-1
let order of a^-1 =m. so (a^-1)^m=e if and only if a^m =e , so order of a^-1 divides order of a
so they are equal.
Q.E.D
is the proof correct?

Homework Answers

Answer #1

You Proof is correct, what you did is that you showed order of 'a' divides order of a^-1 and order of a^-1 divides order of a. So they should be equal, I am writing down your proof in other simple way.

But this proof is valid when order of 'a' is finite. Can you think a proof when a is of infinite order?

Just proof that in later case order of a^-1 is not finite. To prove this assume order of a^-1 is finite then proceed in same manner and you will get a contradiction that order of 'a' is also finite.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
2. Let a and b be elements of a group, G, whose identity element is denoted...
2. Let a and b be elements of a group, G, whose identity element is denoted by e. Prove that ab and ba have the same order. Show all steps of proof.
1. Let a and b be elements of a group, G, whose identity element is denoted...
1. Let a and b be elements of a group, G, whose identity element is denoted by e. Assume that a has order 7 and that a^(3)*b = b*a^(3). Prove that a*b = b*a. Show all steps of proof.
Group theory: Show that the quaternionic group Q is a group. So my text book says...
Group theory: Show that the quaternionic group Q is a group. So my text book says the quaterionic group Q consists of 8 elements: 1, -1, i, -i, j, -j, k, and k. To prove that they are a group do I just run through the three axioms that prove associativity, existence of an inverse, and existence of an element? How would I do this? Thank you.
4. Let f : G→H be a group homomorphism. Suppose a∈G is an element of finite...
4. Let f : G→H be a group homomorphism. Suppose a∈G is an element of finite order n. (a) Prove that f(a) has finite order k, where k is a divisor of n. (b) If f is an isomorphism, prove that k=n.
Let G be a group (not necessarily an Abelian group) of order 425. Prove that G...
Let G be a group (not necessarily an Abelian group) of order 425. Prove that G must have an element of order 5. Note, Sylow Theorem is above us so we can't use it. We're up to Finite Orders. Thank you.
Let G be a group and a be an element of G. Let φ:Z→G be a...
Let G be a group and a be an element of G. Let φ:Z→G be a map defined by φ(n) =a^{n} for all n∈Z. Find the image φ(Z) and prove that φ(Z) a subgroup of G
Let G be a group of order 4. Prove that either G is generated by a...
Let G be a group of order 4. Prove that either G is generated by a single element or g^2 =1 for all g∈G.
Let G be a group with subgroups H and K. (a) Prove that H ∩ K...
Let G be a group with subgroups H and K. (a) Prove that H ∩ K must be a subgroup of G. (b) Give an example to show that H ∪ K is not necessarily a subgroup of G. Note: Your answer to part (a) should be a general proof that the set H ∩ K is closed under the operation of G, includes the identity element of G, and contains the inverse in G of each of its elements,...
Suppose G = < a > is a cyclic group of order N. Consider an element...
Suppose G = < a > is a cyclic group of order N. Consider an element of G, g = ak . Show that the order of g is equal to N/GCD(N,k)
Let G be a group of order n and a in G such that a^n =...
Let G be a group of order n and a in G such that a^n = e. Prove or disprove: G = <a>