--%>

Theorem-G satis es the right and left cancellation laws

Let G be a group.

(i) G satis es the right and left cancellation laws; that is, if a; b; x ≡ G, then ax = bx and xa = xb each imply that a = b.

(ii) If g ≡ G, then (g-1)-1 = g.

E

Expert

Verified

Proof:

(i) From ax = bx, we have axx-1 = bxx-1, then ae = be, then a = b. Similarly for the other case.

(ii) Temporarily denote the inverse of g-1 by h (instead of (g-1)-1). Then the defining property of h, from the axiom for inverses applied to g-1, is that

g-1h = hg-1 = e:

But g itself satis es these equations in place of h, because the axiom for inverses applied to g says that

gg-1 = g-1g = e:

Hence, since inverses are unique, h = (g-1)-1 = g, as required.

   Related Questions in Mathematics

  • Q : Problem on inventory merchandise AB

    AB Department Store expects to generate the following sales figures for the next three months:                            

  • Q : Probability assignments 1. Smith keeps

    1. Smith keeps track of poor work. Often on afternoon it is 5%. If he checks 300 of 7500 instruments what is probability he will find less than 20substandard? 2. Realtors estimate that 23% of homes purchased in 2004 were considered investment properties. If a sample of 800 homes sold in 2

  • Q : Where would we be without stochastic

    Where would we be without stochastic or Ito^ calculus?

  • Q : Solve each equation by factoring A

    A college student invested part of a $25,000 inheritance at 7% interest and the rest at 6%.  If his annual interest is $1,670 how much did he invest at 6%?  If I told you the answer is $8,000, in your own words, using complete sentences, explain how you

  • Q : Define Big-O notation Big-O notation :

    Big-O notation: If f(n) and g(n) are functions of a natural number n, we write f(n) is O(g(n)) and we say f is big-O of g if there is a constant C (independent of n) such that f

  • Q : What is limit x tends to 0 log(1+x)/x

    What is limit x tends to 0  log(1+x)/x to the base a?

  • Q : What is Big-O hierarchy The big-O

    The big-O hierarchy: A few basic facts about the big-O behaviour of some familiar functions are very important. Let p(n) be a polynomial in n (of any degree). Then logbn is O(p(n)) and p(n) is O(an<

  • Q : Explain Factorisation by Fermats method

    Factorisation by Fermat's method: This method, dating from 1643, depends on a simple and standard algebraic identity. Fermat's observation is that if we wish to nd two factors of n, it is enough if we can express n as the di fference of two squares.

  • Q : Explain trading of call options Explain

    Explain trading of call options.

  • Q : Abstract Boolean Algebra I. Boolean

    I. Boolean Algebra Define an abstract Boolean Algebra, B,  as follows:  The three operations are:  +   ( x + y addition) ( x y multiplic