0% found this document useful (0 votes)
115 views18 pages

Group Theory: Binary Operations

This document discusses binary operations on sets. A binary operation on a set S is a rule that assigns an element of S to each ordered pair of elements of S. Examples of binary operations include addition, multiplication, subtraction, and minimum on various sets. A binary operation is commutative if a*b = b*a for all a and b in S, and associative if (a*b)*c = a*(b*c) for all a, b, c in S. Addition and multiplication are examples of operations that are commutative and associative on sets like the integers, while subtraction is neither on the integers.

Uploaded by

sajId146
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
115 views18 pages

Group Theory: Binary Operations

This document discusses binary operations on sets. A binary operation on a set S is a rule that assigns an element of S to each ordered pair of elements of S. Examples of binary operations include addition, multiplication, subtraction, and minimum on various sets. A binary operation is commutative if a*b = b*a for all a and b in S, and associative if (a*b)*c = a*(b*c) for all a, b, c in S. Addition and multiplication are examples of operations that are commutative and associative on sets like the integers, while subtraction is neither on the integers.

Uploaded by

sajId146
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 18

Group Theory

Binary Operations
Binary Operations

 Let S be a set and


a, b  S .
Binary Operations

 Let S be a set and


a, b  S .
 A binary operation 
on S is a rule which
assigns to any ordered
pair (a, b) an element
a b  S.
Binary Operations

Examples
 For S  , , , , ,
a b  a  b
Binary Operations

Examples
 For S  , , , , ,
a b  a  b
 For S  , , , , ,
a  b  ab

Binary Operations

Examples
 For S  , , , , ,
a b  a  b
 For S  , , , , ,
a  b  ab
 For S , , , ,
a b  a  b
Binary Operations

Examples
 For S  , , , , ,
a b  a  b
 For S  , , , , ,
a  b  ab
 For S  , , , ,
a b  a  b
 For S  , , , ,
a  b  min(a, b)
Binary Operations

Examples
 For S  1, 2,3
a b  b
Binary Operations

Examples
 For S  1, 2,3
a b  b
 For example
1  2  2,
1 1  1,
2  3  3.
Binary Operations

Examples
 For S  , a  b  a / b is not everywhere
defined since no rational number is assigned by
this rule to the pair (3, 0).
Binary Operations

Examples
 For S  , a  b  a / b is not everywhere
defined since no rational number is assigned by
this rule to the pair (3, 0).
 For S   , a  b  a / b is not a binary operation
on  since  is not closed under .
Binary Operations

Definition
 A binary operation 
on a set S is
commutative if and
only if a  b  b  a
for all a, b  S .
Binary Operations

Definition
 A binary operation 
on a set S is
associative if
(a  b)  c  a  (b  c)
for all a, b, c  S .
Binary Operations

Examples
 The binary operation  defined by
a b  a  b
is commutative and associative in .
Binary Operations

Examples
 The binary operation  defined by
a b  a  b
is commutative and associative in .
 The binary operation  defined by
a  b  ab
is commutative and associative in .
Binary Operations

 The binary operation defined by a  b  a  b


is not commutative in .
Binary Operations

 The binary operation defined by a  b  a  b


is not commutative in .
 The binary operation given by a  b  a  b is
not associative in .
Binary Operations

 The binary operation defined by a  b  a  b


is not commutative in .
 The binary operation given by a  b  a  b is
not associative in .
 For instance,
(a  b)  c  (4  7)  2  5
but
a  (b  c)  4  (7  2)  1.

You might also like