Scribd
Upload
132 views

Binary Operation

This document defines and provides examples of binary operations on different sets. A binary operation assigns an element of a set S to each ordered pair of elements in S. Examples show binary operations like addition and multiplication on sets of numbers, matrices and functions. Later examples cover commutative, associative properties and exercises to determine if a given operation satisfies group properties.

Uploaded by

Sheryl Grace Padilla Delo
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
132 views

Binary Operation

This document defines and provides examples of binary operations on different sets. A binary operation assigns an element of a set S to each ordered pair of elements in S. Examples show binary operations like addition and multiplication on sets of numbers, matrices and functions. Later examples cover commutative, associative properties and exercises to determine if a given operation satisfies group properties.

Uploaded by

Sheryl Grace Padilla Delo
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 17

BINARY OPERATION

DEFINITIONS AND EXAMPLES


Definition 2.1
• A binary operation ∗ on a set S is a
rule that assigns to each ordered pair
𝑎, 𝑏 of elements of S some element
of S.
SOME WORDS OF WARNING
1. Exactly one element is assigned to
each possible ordered pair of
elements of S.
2. For each ordered pair of elements
of S, the element assigned to it is
again in S.
EXAMPLE 1
• Our usual addition + is a binary operation on the set
R. Our usual multiplication ∙ is a different binary
operation on R. In this example, we could replace R
by any of the set C, Z, R+ or Z+.

Example 2
• Let M(R) be the set of all matrices with real entries.
The usual matrix addition + is not a binary operation
on this set.
Reason:
A + B is not a defined for an ordered pair
𝐴, 𝐵 of matrices of different shapes.
Example 3
• Our Usual addition + is not a binary operation
on the set R* of nonzero real numbers.

Reason:
2 + (−2) is not in the set R*; that is, R* is not
closed under addition

Example 4
The usual matrix multiplication ∙ is a binary operation
on the set 𝑀4 (𝐶) of all 4 x 4 matrices, and the
product is again a 4 x 4 matrix.
Example 5
• Let F be the set of all real-valued functions f having as
domain the set R of real numbers. We are familiar with
binary operations + and ∙ on F; namely, for each
ordered pair 𝑓, 𝑔 of functions in F, we define ℎ = 𝑓 +
𝑔 to be the function with domain R such that
ℎ 𝑥 =𝑓 𝑥 +𝑔 𝑥 .
Similarly, we define 𝑘 = 𝑓 ∙ 𝑔 by
𝑘 𝑥 =𝑓 𝑥 𝑔 𝑥 .
Both h and k are again real-valued functions with
domain R, so that F is closed under both + and ∙ .
Example 6
• On 𝑍 + , we define a binary operation ∗ by 𝑎 ∗
𝑏 equals the smaller of 𝑎 or 𝑏 or the common
value if 𝑎 = 𝑏.
Thus
2 ∗ 11 = 2
15 ∗ 10 = 10
3∗3=3
Example 7
• On 𝑍 + , we define a binary operation ∗′ by
𝑎 ∗′ 𝑏 = 𝑎.
Thus
2 ∗′ 3 = 2
25 ∗′ 10 = 25
5 ∗′ 5 = 5
Example 8
• On 𝑍 + , we define a binary operation ∗′′ by
𝑎 ∗′′ 𝑏 = 𝑎 ∗ 𝑏 + 2, where ∗ is defined in
example 6. Thus
4 ∗′′ 7 = 6
25 ∗′′ 9 = 11
5 ∗′′ 5 = 7
Example 9
• On 𝑍 + , we define an operation ∗ by 𝑎 ∗ 𝑏 = 𝑐,
where c is the largest integer less than the
product of a and b. Is the set 𝑍 + together
with the operation ∗ a binary operation?
Example 10
• On 𝑍 + , we define an operation ∗ by 𝑎 ∗ 𝑏 = 𝑐,
where c is the integer greater than or equal to
the product of a and b. Is the set 𝑍 + together
with the operation ∗ a binary operation?
Commutative and Associative
Operation
• A binary operation on a set S is
commutative if 𝑎 ∗ 𝑏 = 𝑏 ∗ 𝑎 for all
𝑎, 𝑏 ∈ 𝑆.

• A binary operation on a set S is


associative if (𝑎 ∗ 𝑏) ∗ 𝑐 = 𝑎 ∗ (𝑏 ∗ 𝑐) for
all 𝑎, 𝑏, 𝑐 ∈ 𝑆.
Example 9
• Table 1.1 defines the binary operation ∗ on 𝑆 = 𝑎, 𝑏, 𝑐
by the following rule:

• 𝑖𝑡ℎ 𝑒𝑛𝑡𝑟𝑦 𝑜𝑛 𝑡ℎ𝑒 𝑙𝑒𝑓𝑡 ∗ 𝑗𝑡ℎ 𝑒𝑛𝑡𝑟𝑦 𝑜𝑛 𝑡ℎ𝑒 𝑙𝑒𝑓𝑡


𝑒𝑛𝑡𝑟𝑦 𝑜𝑛 𝑡ℎ𝑒 𝑖𝑡ℎ 𝑟𝑜𝑤 𝑎𝑛𝑑
=
𝑗𝑡ℎ 𝑐𝑜𝑙𝑢𝑚𝑛 𝑜𝑓 𝑡ℎ𝑒 𝑡𝑎𝑏𝑙𝑒
Thus 𝑎 ∗ 𝑏 = 𝑐 and 𝑏 ∗ 𝑎 = 𝑎, so ∗ is not commutative.
∗ a b C
a b c b
b a c b
c c b a

Table 1.1
Example 10
• Complete table 1.2 so that ∗ is a commutative
binary operation on the set 𝑆 = 𝑎, 𝑏, 𝑐, 𝑑 .

∗ a b C d
a b
b d a
c a c d
d a b b c
Example 11

• Complete table 1.2 so that ∗ is a


associative binary operation on the set
𝑆 = 𝑎, 𝑏, 𝑐, 𝑑 .
∗ a b C d
a a b c d
b b a c D
c c d c D
d
Exercises
• Determine whether the given set with the operator ∗
gives a group structure. Give property of binary
operation which is not satisfy.
a. X and Y are vectors in 𝑅3 and ∗ define as “dot product
of vector X and Y”.
b. * defined on Z by 𝑎 ∗ 𝑏 = 𝑎 − 𝑏
c. 𝑘 𝑥 𝑎𝑛𝑑 ℎ 𝑥 are linear functions and ∗ define as
“𝑘 𝑥 °ℎ 𝑥 ”.
2𝑎
d. * defined on Q by 𝑎 ∗ 𝑏 = .
𝑏
e. * defined on Z by 𝑎 ∗ 𝑏 = 𝑐 where 𝑐 is atmost 3
greater than the product of 𝑎 𝑎𝑛𝑑 𝑏 .
• Determine whether the binary operator *
defined is commutative and whether * is
associative.
1. * defined on Z by a*b= a-b
2. * defined on Q by a*b= ab+1
3. * defined on Q by a*b= ab/2
4. * defined on Z by a*b= 2𝑎𝑏

You might also like