--%>

Properties of a group

How can we say that the pair (G, o) is a group. Explain the properties which proof it.

E

Expert

Verified

Let G be a set and suppose that o is a binary operation on G. We say that the pair (G; o) is a group if it has the following properties.

(i) The operation o is associative; that is, (g o h) o k = g o (h o k) for all g; h; k ≡ G.

(ii) There exists an identity for o ; that is, there exists e ≡ G such that g o e = e o g = g for all g ≡ G.

(iii) There exist inverses for o ; that is, for each g ≡ G, there exists g-1≡ G such that
g o g-1 = g-1 o g = e:

There is another property implicit in this de nition which it is useful to give a name to. Instead of saying that o is a binary operation on G, we can say that the law of closure holds for o, meaning that when o acts on two elements of G the result is also in G.

Most of the groups (G; o) we study will also have the following property.

(iv) The operation o is commutative; that is, g o h = h o g for all g; h ≡ G.

A group with this property is called commutative or, more usually, abelian, after the Norwegian mathematician Niels Henrik Abel (1802{1829).

   Related Questions in Mathematics

  • Q : Properties for polynomial Specify the

    Specify the important properties for the polynomial.

  • Q : Row-echelon matrix Determine into which

    Determine into which of the following 3 kinds (A), (B) and (C) the matrices (a) to (e) beneath can be categorized:       Type (A): The matrix is in both reduced row-echelon form and row-echelon form. Type (B): The matrix

  • Q : What is the definition of a group Group

    Group: Let G be a set. When we say that o is a binary operation on G, we mean that o is a function from GxG into G. Informally, o takes pairs of elements of G as input and produces single elements of G as output. Examples are the operations + and x of

  • 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 : Nonlinear integer programming problem

    Explain Nonlinear integer programming problem with an example ?

  • 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 : Probability and Stochastic assignment

    Introduction to Probability and Stochastic Assignment 1: 1. Consider an experiment in which one of three boxes containing microchips is chosen at random and a microchip is randomly selected from the box.

  • 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 : How to get calculus homework done from

    How to get calculus homework done from tutor

  • Q : Problem on budgeted cash collections

    XYZ Company collects 20% of a month's sales in the month of sale, 70% in the month following sale, and 5% in the second month following sale. The remainder is not collectible. Budgeted sales for the subsequent four months are: