Example 3 :
Let G = {x element of G|x is not equal to 1}. On G, define * by a*b = a+b-ab. Determine whether the set G is a group under *.
G1 : (To show associativity of *)
Let a, b, c element of G & a,b, c is not equal to 1.
(a*b)*c = a*(b*c)
Thursday, August 12, 2010
GROUPS
Definition 1 (Group)
A group is a binary operation structure (G,*) is a nonempty set and * is a binary operation on G such that the following axioms are satisfied.
G1 : For all a, b, c in G,
G2 : There is an element e in G such that for all x in G,
G3 : Corresponding to each a in G, there ia an element a' in G such that
A group is a binary operation structure (G,*) is a nonempty set and * is a binary operation on G such that the following axioms are satisfied.
G1 : For all a, b, c in G,
(a*b)*c = a*(b*c)
Associativity of *
Associativity of *
G2 : There is an element e in G such that for all x in G,
e*x = x*e = x
Identity of *
Identity of *
G3 : Corresponding to each a in G, there ia an element a' in G such that
a*a' = a'*a = e
Inverse a' of a
Inverse a' of a
Note : If any of these axioms is not satisfied, then a binary structure is not a group.
BINARY OPERATIONS 4
sources :http://www.youtube.com/user/videomathtutor#p/a
Theorem 1 ( Uniqueness of Identity Element )
A binary structure (S,*)
To prove "uniqueness"
- suppose two different elements to be the element that we want to prove unique.
- finally, to show these two elements are actually same.
(To show the identity element in (S,*) is unique).
Let e & f be identity element of S
Then,
Since e is the identity element
e*f = f*e = f ----1
Also, since f is the identity element
e*f = f*e = e ----2
Hence,
from 1 & 2 f = e
Therefore, the identity element in (S,*) must be unique.
Wednesday, August 11, 2010
BINARY OPERATIONS 3
sources : http://www.learningupgrade.com
Some important words:
Not everywhere define - Operation * is called not everywhere defined on S it - no element can be assigned to each possible ordered pairs.
Not well defined - Operation * is called not well defined on S it - several element of S are assigned to S (ambiguity).
BINARY OPERATIONS 2
Definition 3 (Commutative operation)
A binary operation * on a set S is commutative if a*b = b*a for all a, b in S.
Example 1 :
On Q, define a binary operation * by a*b = ab + 1. Show that the binary operation * is commutative on Q.
Let a, b element of Q,
(To check whether a*b = b*a)
LHS : a*b
= ab+1
= ba+1 since multiplication is commutative on Q.
= b*a = RHS
Therefore, * is commutative on Q.
Example 2 :
On Z, define a*b = a-b. Determine whether * is commutative on Z.
Let a, b element of Z
To check whether a*b = b*a
Note that,
by using counter example
let 1, 2 in Z.
LHS : 1 - 2 = -1
RHS : 2 - 1 = 1
but, since LHS is not equal to RHS, then * is not commutative on Z.
A binary operation * on a set S is commutative if a*b = b*a for all a, b in S.
Example 1 :
On Q, define a binary operation * by a*b = ab + 1. Show that the binary operation * is commutative on Q.
Let a, b element of Q,
(To check whether a*b = b*a)
LHS : a*b
= ab+1
= ba+1 since multiplication is commutative on Q.
= b*a = RHS
Therefore, * is commutative on Q.
Example 2 :
On Z, define a*b = a-b. Determine whether * is commutative on Z.
Let a, b element of Z
To check whether a*b = b*a
Note that,
by using counter example
let 1, 2 in Z.
LHS : 1 - 2 = -1
RHS : 2 - 1 = 1
but, since LHS is not equal to RHS, then * is not commutative on Z.

