Scribd
Upload
2 views18 pages

binary-operations_1

The lecture discusses binary operations on non-empty sets, defining them as mappings that associate ordered pairs of elements to unique elements within the same set. It outlines examples of binary operations, such as addition and multiplication on various number sets, and introduces laws like commutativity, associativity, identity, and inverse elements. Additionally, it presents problems demonstrating these concepts with specific operations on integers and real numbers.

Uploaded by

rjklent.arsenio
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views18 pages

binary-operations_1

The lecture discusses binary operations on non-empty sets, defining them as mappings that associate ordered pairs of elements to unique elements within the same set. It outlines examples of binary operations, such as addition and multiplication on various number sets, and introduces laws like commutativity, associativity, identity, and inverse elements. Additionally, it presents problems demonstrating these concepts with specific operations on integers and real numbers.

Uploaded by

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

Lecture:

BINARY OPERATIONS
Dr. Soya Mathew
Following are the notations and definitions to represent the set of
numbers:
Binary Operations (Compositions)

Let S be a non-empty set. The mapping which associates each ordered


pair of the elements of S to a unique element of S, denoted by is called a
binary operation or a binary composition on S.

That is,

An operation on a non-empty set S is a binary operation if and only if

(S is closed under binary operation)


Examples:

1. The usual addition (+) and multiplication are binary operations on the set
of

(a) N of Natural Numbers (b) Z of integers

(c) Q of Rational Numbers (d) R of Real numbers

(e) C of Complex Numbers.

2. The usual subtraction is not a binary operation on the set N of natural


numbers. For,
Laws of Binary Operation

A binary operation on a non – empty set S


 is said to be commutative if

 is said to be associative if

 is said to have an identity element if

 is said to have an inverse element if


Problems
1. A binary operation is defined on the set Z of integers by

. Show that is commutative but not associative.

Solution:

By definition,

Now,

(Since usual multiplication is commutative)


Next

Let

Consider,
And,
2. In the set of non-zero real numbers the binary operations is defined by
. Show that the inverse of 9 is 1.

Solution:

By definition

Let be the identity element

Then
Also

Let be the inverse of

Then
Also
3. If in the set of real numbers other than, the operationis defined by .
Show that the identity element is and the inverse of is.

Solution:

By definition

Let be the identity element

Then
Since,

Also
Since,

Let be the inverse of

Then
Also
4. If the binary operation on the set of real numbers is defined by .
Show thatis commutative and associative. Also find the identity element
and the inverse of.

Solution:

By definition

Now,

(Since usual addition is commutative)


Thank You !!!

You might also like