--%>

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 : Elasticity of Demand For the demand

    For the demand function D(p)=410-0.2p(^2), find the maximum revenue.

  • Q : Logic and math The homework is attached

    The homework is attached in the first two files, it's is related to Sider's book, which is "Logic for philosophy" I attached this book too, it's the third file.

  • Q : Define Well-formed formulas or Wffs

    Wffs (Well-formed formulas): These are defined inductively by the following clauses:    (i) If  P  is an n-ary predicate and  t1, …, tn are terms, then P(t1, …, t

  • Q : Econ For every value of real GDP,

    For every value of real GDP, actual investment equals

  • Q : Explain Factorisation by trial division

    Factorisation by trial division: The essential idea of factorisation by trial division is straightforward. Let n be a positive integer. We know that n is either prime or has a prime divisor less than or equal to √n. Therefore, if we divide n in

  • Q : State Fermat algorithm The basic Fermat

    The basic Fermat algorithm is as follows: Assume that n is an odd positive integer. Set c = [√n] (`ceiling of √n '). Then we consider in turn the numbers c2 - n; (c+1)2 - n; (c+2)2 - n..... until a perfect square is found. If th

  • Q : State Measuring complexity Measuring

    Measuring complexity: Many algorithms have an integer n, or two integers m and n, as input - e.g., addition, multiplication, exponentiation, factorisation and primality testing. When we want to describe or analyse the `easiness' or `hardness' of the 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 : Abstract Algebra let a, b, c, d be

    let a, b, c, d be integers. Prove the following statements: (a) if a|b and b|c. (b) if a|b and ac|bd. (c) if d|a and d|b then d|(xa+yb) for any x, y EZ

  • Q : Problem on augmented matrix Consider

    Consider the following system of linear equations.  (a) Write out t