Loading [MathJax]/jax/output/HTML-CSS/jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

1.1: Binary operations

( \newcommand{\kernel}{\mathrm{null}\,}\)

Binary operation

Definition: Binary operation 

Let S be a non-empty set, and said to be a binary operation on S, if ab is defined for all a,bS. In other words, is a rule for any two elements in the set S.

Example 1.1.1:

The following are binary operations on Z:

  1. The arithmetic operations, addition +, subtraction , multiplication ×, and division ÷.
  2. Define an operation oplus on Z by ab=ab+a+b,a,bZ.
  3. Define an operation ominus on Z by ab=ab+ab,a,bZ.
  4. Define an operation otimes on Z by ab=(a+b)(a+b),a,bZ.
  5. Define an operation oslash on Z by ab=(a+b)(ab),a,bZ.
  6. Define an operation min on Z by ab=min{a,b},a,bZ.
  7. Define an operation max on Z by ab=max{a,b},a,bZ.
  8. Define an operation defect on Z by a3b=a+b3,a,bZ.

Lets explore the binary operations, before we proceed:

Example 1.1.2:

  1. 23=(2)(3)+2+3=11.
  2. 23=(2+3)(2+3)=25.
  3. 23=(2+3)(23)=5.
  4. 23=(2)(3)+23=5.
  5. 23=2.
  6. 23=3.

Exercise 1.1.2

  1. 23.
  2. 23.
  3. 23.
  4. 23.
  5. 23.
  6. 23.
Answer

5,1,5,2,3

Properties:

Closure property

Definition: Closure

Let S be a non-empty set. A binary operation on S is said to be a closed binary operation on S, if abS,a,bS.

Below we shall give some examples of closed binary operations, that will be further explored in class.

Example 1.1.3: Closed binary operations

The following are closed binary operations on Z.

  1. The addition +, subtraction , and multiplication ×.
  2. Define an operation oplus on Z by ab=ab+a+b,a,bZ.
  3. Define an operation ominus on Z by ab=ab+ab,a,bZ.
  4. Define an operation otimes on Z by ab=(a+b)(a+b),a,bZ.
  5. Define an operation oslash on Z by ab=(a+b)(ab),a,bZ.
  6. Define an operation min on Z by ab=min{a,b},a,bZ.
  7. Define an operation max on Z by ab=max{a,b},a,bZ.
  8. Define an operation defect on Z by a3b=a+b3,a,bZ.

Exercise 1.1.1

Determine whether the operation ominus on Z+ is closed?

Answer

The operation ominus on Z+ is closed.

Example 1.1.4: Counter Example

Division (÷ ) is not a closed binary operations on Z.

2,3Z but 23Z.

Summary of arithmetic operations and corresponding sets:
  + × ÷
Z+ closed closed not closed not closed
Z closed closed closed not closed
Q closed closed closed closed (only when 0 is not included)
R closed closed closed closed (only when 0 is not included)
         

Associative property

Definition: Associative

Let S be a subset of Z. A binary operation on S is said to be associative , if (ab)c=a(bc),a,b,cS.

We shall assume the fact that the addition (+) and the multiplication (×) are associative on Z+. (You don't need to prove them!).

Below is an example of proof when the statement is True.

Example 1.1.5: Associative

Determine whether the binary operation oplus is associative on Z.

We shall show that the binary operation oplus is associative on Z.

 
Proof:

Let a,b,cZ. Then consider, (ab)c=(ab+a+b)c=(ab+a+b)c+(ab+a+b)+c=(ab)c+ac+bc+ab+a+b+c.

On the other hand, a(bc)=a(bc+b+c)=a(bc+b+c)+a+(bc+b+c)=a(bc)+ab+ac+a+bc+b+c.

Since multiplication is associative on Z, (ab)c=a(bc).

Thus, the binary operation oplus is associative on Z.

 
 

Below is an example of how to disprove when a statement is False.

Example 1.1.6: Not Associative

Determine whether the binary operation subtraction () is associative on Z.

Answer: The binary operation subtraction () is not associative on Z.

Counterexample:

Choose a=2,b=3,c=4, then (23)4=14=5, but 2(34)=2(1)=2+1=3.

Hence the binary operation subtraction () is not associative on Z.

Commutative property

Definition: Commutative property

Let S be a non-empty set. A binary operation on S is said to be commutative, if ab=ba,a,bS.

We shall assume the fact that the addition (+) and the multiplication( ×) are commutative on Z+. (You don't need to prove them!).

Below is the proof of subtraction () NOT being commutative.

Example 1.1.7: NOT Commutative

Determine whether the binary operation subtraction is commutative on Z.

Counterexample:

Choose a=3 and b=4.

Then ab=34=1, and ba=43=1.

Hence the binary operation subtraction is not commutative on Z.

Example 1.1.8: Commutative

Determine whether the binary operation oplus is commutative on Z.

We shall show that the binary operation oplus is commutative on Z.

Proof:

Let a,bZ.

Then consider, (ab)=(ab+a+b).

On the other hand, (ba)=ba+b+a.

Since multiplication is associative on Z, (ab)=(ba).

Thus, the binary operation oplus is commutative on Z.

Identity

Definition: Identity

A non-empty set S with binary operation , is said to have an identity eS, if ea=ae=a,aS.

Note that 0 is called additive identity on (Z,+), and 1 is called multiplicative identity on (Z,×).

Example 1.1.9: Is identity unique?

Let S be a non-empty set and let be a binary operation on S. If e1 and e2 are two identities in (S,), then e1=e2.

Proof:

Suppose that e1 and e2 are two identities in (S,).

Then e1=e1e2=e2.

Hence identity is unique.

Example 1.1.10: Identity

Does (Z,) have an identity?

Answer

Let e be the identity on (Z,).

Then ea=ae=a,aZ.

Thus ea+e+a=a, and ae+a+e=a aZ.

Since ea+e+a=a aZ, ea+e=0e(a+1)=0 aZ.

Therefore e=0.

Now 0a=a0=a,aZ.

Hence 0 is the identity on (Z,).

Example 1.1.11:

Does (Z,) have an identity?

Answer

Let e be the identity on (Z,).

Then ea=ae=a,aZ.

Thus (e+a)(e+a)=(a+e)(a+e)=a,aZ.

Now, (a+e)(a+e)=a,aZ.

a2+2ea+e2=a,aZ.

Choose a=0 then e=0.

If e=0 then a2=a,aZ.

This is a contradiction. Thus e=0 is not an identity. Hence e0.

Choose a=1. Then 2e+e2=0\implese(2+e)=0. Since e0, e=2 This will not work for a=0.

For any other values of e will not work a=0

Hence, (Z,) has no identity.

Distributive Property

Definition: Distributive property

Let S be a non-empty set. Let 1 and 2 be two different binary operations on S.

Then 1 is said to be distributive over 2 on S if a1(b2c)=(a1b)2(a1c),a,b,c,S.

Note that the multiplication distributes over the addition on Z. That is, 4(10+6)=(4)(10)+(4)(6)=40+24=64.

Further, we extend to (a+b)(c+d)=ac+ad+bc+bd (FOIL).

F-First

O-Outer

I-Inner

L-Last

This property is very useful to find (26)(27) as shown below:

Example 1.1.12: Find (26)(27)

  20 6
20 400 120
7 140 42

Hence (26)(27)=400+120+140+42=702.

Let's play a game!

Example 1.1.13:

Does multiplication distribute over subtraction?

Example 1.1.14:

Does division distribute over addition?

Answer

Counterexample:

Choose a=2,b=3, and c=4.

Then a÷(b+c)=2÷(3+4)

=2÷7.

=27.

and (a÷b)+(a÷c)=23+24.

=76.

Since 2776, the binary operation ÷ is not distributive over +.

Example 1.1.15:

Does distribute over on Z ?

Answer

Counterexample:

Choose a=2,b=3, and c=4.

Then 2(34)=2[(3)(4)+3+4]

=219

=(2+19)(2+19)

=441

and (23)(24)=[(2+3)(2+3)][(2+4)(2+4)]

=2536

=(25)(36)+25+36

=961.

Since 441961,  the binary operation is not distributive over on Z.

 

Summary

In this section, we have learned the following for a non-empty set S:

  1. Binary operation,
  2. Closure property,
  3. Associative property,
  4. Commutative property,
  5. Distributive property, and
  6. Identity.

 


This page titled 1.1: Binary operations is shared under a CC BY-NC-SA 4.0 license and was authored, remixed, and/or curated by Pamini Thangarajah.

Support Center

How can we help?