--%>

Theorem-Group is unique and has unique inverse

Let (G; o) be a group. Then the identity of the group is unique and each element of the group has a unique inverse.

In this proof, we will argue completely formally, including all the parentheses and all the occurrences of the group operation o. As we proceed with later work, we will very soon relax our level of formality, omitting avoidable parentheses and uses of the operation symbol.

E

Expert

Verified

Proof:

First, we prove uniqueness of the identity. Suppose that e; e' ≡ G both have the property stated in the axiom for the identity; that is,

g o e = e o g = g and g o e' = e' o g = g

for all g ≡ G. For uniqueness, we need to prove that e = e'.

Applying the First equation above to g = e' and the second to g = e, we get

e'o e = e o e' = e' and e o e' = e'o e = e:

Comparing these gives e = e', as required.

Second, we prove that each element of G has a unique inverse. Suppose that for a fixed g ≡ G there are elements h and k which both have the property required of an inverse; that is,

g o h = h o g = e and g o k = k o g = e:

We need to prove that h = k.

Multiplying through the equation k o g = e on the right by h gives

(k o g) o h = e o h;

associativity gives

k o (g o h) = e o h;

and then since g o h = e we have

k o e = e o h:

Using the fact that e is the identity, we nally

get k = h, as required.

   Related Questions in Mathematics

  • Q : Examples of groups Examples of groups:

    Examples of groups: We now start to survey a wide range of examples of groups (labelled by (A), (B), (C), . . . ). Most of these come from number theory. In all cases, the group axioms should be checked. This is easy for almost all of the examples, an

  • Q : Explain lognormal stochastic

    Explain lognormal stochastic differential equation for evolution of an asset.

  • Q : Law of iterated expectations for

     Prove the law of iterated expectations for continuous random variables. 2. Prove that the bounds in Chebyshev's theorem cannot be improved upon. I.e., provide a distribution that satisfies the bounds exactly for k ≥1, show that it satisfies the bounds exactly, and draw its PDF. T

  • 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 : Linear programming model of a Cabinet

    A cabinet company produces cabinets used in mobile and motor homes. Cabinets produced for motor homes are smaller and made from less expensive materials than those for mobile homes. The home office in Dayton Ohio has just distributed to its individual manufacturing ce

  • Q : Set Theory & Model of a Boolean Algebra

    II. Prove that Set Theory is a Model of a Boolean Algebra The three Boolean operations of Set Theory are the three set operations of union (U), intersection (upside down U), and complement ~.  Addition is set

  • Q : Problem on Prime theory Suppose that p

    Suppose that p and q are different primes and n = pq. (i) Express p + q in terms of Ø(n) and n. (ii) Express p - q in terms of p + q and n. (iii) Expl

  • Q : Econ For every value of real GDP,

    For every value of real GDP, actual investment equals

  • Q : First-order formulas over the

    Consider the unary relational symbols P and L, and the binary relational symbol On, where P(a) and I(a) encode that a is apoint and a (sraight) line in the 2-dimensional space, respectively, while On(a,b) encodes  that a is a point, b is a line, and o lies on b.

  • 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.