BINARY OPERATION

ABSTRACT ALGEBRA
OBJECTIVES
 Explain the definition of a group and identify as well
as produce examples and non-examples;
 Prove the elementary properties of a group;
 Construct and/or complete cayley tables for finite
groups;
 Use the elementary properties of a group in proving
related propositions.
 Use technology to communicate solutions and proofs
to whole class
 WHAT IS ABSTRACT ALGEBRA?

 Abstract algebra is the branch of algebra dealing with the study of

algebraic systems or structures with one or more mathematical
operations associated with elements with an identifiable pattern,
differing from the usual number systems. In abstract algebra, the
elements combined to perform mathematical operations are not
interpretable as numbers, hence its abstract nature.
Set
WHAT IS SET?
In mathematics, a set is defined as a well-
defined collection of objects. Sets are named
and represented using capital letters. In the
set theory, the elements that a set comprises
can be any kind of thing: people, letters of
the alphabet, numbers, shapes, variables,
etc.
SET OF REAL NUMBERS

Definition:
The set of real numbers, denoted as R,
includes all possible values that can be found
on the number line. This set is comprised of
both rational and irrational numbers.
Rational Numbers (Q):
Numbers that can be expressed as the quotient of two integers,
where the denominator is not zero.
 Integers (Z): {..., -3, -2, -1, 0, 1, 2, 3, ...}
 Positive Integers (Z+): {1, 2, 3, ...}
 Non-positive Integers: {..., -3, -2, -1, 0}
 Negative Integers (Z−): {..., -3, -2, -1}
 Natural Numbers (N): {1, 2, 3, ...}
 Fractions: Numbers like 1/2, -3/7, 4/1 (which is also an integer).
Irrational Numbers:

Numbers that cannot be expressed as the

quotient of two integers. Their decimal
representations are non-repeating and non-
terminating.
Examples include ​, π, and the Euler's number e.
BINARY OPERATION
BINARY OPERATION
 A binary operation on a set S is a function that takes two
elements from S and assigns them to another element of S.
Formally, if ∗ is a binary operation on S, then ∗ is a
function:
∗:S×S→S
 This means for every pair of elements (a,b) in S, the binary
operation ∗ produces another element in S, which can be
represented as a∗b
EXAMPLE
Addition on Integers:
Set: S=Z (the set of integers)
Binary Operation: +
For every pair of integers a and b, the
sum a+b is also an integer.
Example: 3+(−5)=−2
Multiplication on Real Numbers

Set: S=R (the set of real numbers)

Binary Operation: ×
For every pair of real numbers a and b, the
product a×b is also a real number.
Example: 2.5×1.2=3.02.5×1.2=3.0
 Matrix Multiplication:

 Set: S is the set of all 2×2 matrices.

 Binary Operation: Matrix
Multiplication
 For every pair of 2×2 matrices A and B,
the product AB is also a 2×2 matrix.
Example: Given two 2×2 matrices
String Concatenation:

Set: S is the set of all strings.

Binary Operation: Concatenation
For every pair of strings a and b, the result a⋅b is their
concatenation.
Example: If "a="hello" and b="world", then
"a⋅b="helloworld".
Properties of Binary
Operations
 Closure:

A set S is said to be closed under a binary operation

∗ if, for every pair of elements a,b in S, the result
a∗b is also in S.
Example: The set of integers Z is closed under
addition since the sum of any two integers is also an
integer.
EXAMPLE

Addition on the Set of Integers Z

Every time you add two integers, you get
another integer.
For example: 3+(−5)=−2
EXAMPLE

Multiplication on the Set of Natural Numbers N

Every time you multiply two natural numbers,
you get another natural number.
For example: 4×3=12
EXAMPLE

Addition on the Set of Real Numbers R

When you add any two real numbers, the result
is always a real number.
For example: 3.14+(−1.92)=1.22
EXAMPLE

Matrix Multiplication on the Set of 2x2

Matrices
If you multiply two 2x2 matrices, the result is
always another 2x2 matrix.
Example:
EXAMPLE

Composition on the Set of Functions from R to R

If f and g are functions from the real numbers to
the real numbers, then the composition f∘g
(where f∘g(x)=f(g(x))) is also a function from the
real numbers to the real numbers.
EXAMPLE

Union on the Power Set of a Set S

Given any two subsets A and B of a
set S, their union A∪B is also a
subset of S.
Associativity:

A binary operation ∗ on set S is associative if, for

all elements a,b, and c in S, the equation
(a∗b)∗c=a∗(b∗c) holds.
Example: Addition of real numbers is associative
because (x+y)+z=x+(y+z) for all real numbers x,y,
and z.
EXAMPLE

Addition on the Set of Integers Z

For any integers a,b,c: (a+b)+c=a+(b+c)
Example: (3+5)+7=3+(5+7)
EXAMPLE

Multiplication on the Set of Integers Z

For any integers a,b,c: (a×b)×c=a×(b×c)

Example: (2×3)×4=2×(3×4)(2×3)×4=2×(3×4)
EXAMPLE

Matrix Multiplication on the Set of n×n

Matrices
For any n×n matrices A,B, and C:
(A⋅B)⋅C=A⋅(B⋅C)
EXAMPLE

Composition of Functions from R to R

If f, g, and ℎh are functions from the real
numbers to the real numbers, then for all x in R:
(f∘g)∘h(x)=f∘(g∘h)(x)
EXAMPLE

Union and Intersection on the Power Set of a

Set S
For any subsets A,B,C of a set S:
(A∪B)∪C=A∪(B∪C)
(A∩B)∩C=A∩(B∩C)
EXAMPLE

Concatenation on the set of all strings

For any strings ,s1​,s2​, and �3s3​: (s1​⊕s2​)⊕s3​
=s1​⊕(s2​⊕s3​)
Example with the concatenation symbol ⊕:
(hello"⊕"world")⊕"!"="hello"⊕("world"⊕"!")
Commutativity:

A binary operation ∗ on set S is commutative if,

for all elements a and b in S, the equation
a∗b=b∗a holds.
Example: Multiplication of real numbers is
commutative since x×y=y×x for all real numbers
x and y.
EXAMPLE

Addition on the Set of Integers Z

For any integers a and b: a+b=b+a
Example: 3+5=5+3
EXAMPLE

Multiplication on the Set of Integers Z

For any integers a and b:a×b=b×a
Example: 2×3=3×2
EXAMPLE

Addition on the Set of Real Numbers R

For any real numbers a and b: a+b=b+a
Example: 3.14+2.71=2.71+3.14
EXAMPLE

Multiplication on the Set of Real Numbers R

For any real numbers a and b: a×b=b×a
Example: 3.14×2.71=2.71×3.14
EXAMPLE

Union and Intersection on the Power Set of a

Set S
For any subsets A and B of a set S:
A∪B=B∪A
A∩B=B∩A
EXAMPLE

AND and OR operations in Boolean Algebra

For any boolean values p and q:
p∧q=q∧p (AND operation)
p∨q=q∨p (OR operation)
 Identity Element:

• An element e in set S is called an identity element for a

binary operation ∗ if, for every element a in S, the equation
e∗a=a∗e=a holds.
• Example: For addition in real numbers, the number 0 is the
identity element since x+0=0+x=x for all real numbers x.
EXAMPLE

Addition on the Set of Integers Z

The identity element for addition is 00.
For any integer a+0=a and 0+a=a.
EXAMPLE

Multiplication on the Set of Integers �Z

The identity element for multiplication is 11.
For any integer a: a×1=a and 1×a=a.
EXAMPLE

Addition on the Set of Real Numbers R

The identity element for addition is 00.
For any real number a: a+0=a and 0+a=a.
EXAMPLE

Multiplication on the Set of Real Numbers R

The identity element for multiplication is 11.
For any real number a: a×1=a and 1×a=a
 EXAMPLE

Matrix Multiplication on the Set of n×n Identity

Matrices
The identity matrix ​, which has ones on its diagonal
and zeros everywhere else, is the identity element
for matrix multiplication.
For any n×n matrix A×​=A and ​×A=A.
EXAMPLE

Union on the Power Set of a Set S

The empty set ∅ is the identity element for the
union operation.
For any subset A of S: A∪∅=A and ∅∪A=A
EXAMPLE

Intersection on the Power Set of a Set S

The set S itself is the identity element for the
intersection operation.
For any subset A of S: A∩S=A and S∩A=A.
EXAMPLE

Composition of Functions from R to R

The identity function id(x)=x is the identity
element for function composition.
For any function f from R to R: f∘id=f and
id∘f=f.
 Inverse Element:

• For a given element a in set S and a binary operation

∗ with identity element e, if there exists an element b
in S such that a∗b=b∗a=e, then b is called the
inverse of a with respect to the operation.
• Example: For addition in real numbers, the inverse of
x is −x since x+(−x)=0.
EXAMPLE

Addition on the Set of Integers Z

The identity element is 0.
The additive inverse of any integer a is −a.
For any integer a: a+(−a)=0
 EXAMPLE

Multiplication on the Set of Non-zero Real Numbers

R∗
The identity element is 1.
The multiplicative inverse of a non-zero real number a is
1/a or .
For any non-zero real number a:a×=1
 EXAMPLE

Matrix Multiplication on the Set of Invertible n×n Matrices

The identity matrix serves as the identity element.
The multiplicative inverse of an invertible matrix A is its
inverse matrix.
For any invertible n×n matrix A: A×=
 EXAMPLE

Union and Intersection on the Power Set of a Set S

Here, things get a bit tricky. While union and intersection
have identity elements (the empty set and the set S
respectively), they don't have inverses in the usual sense
because combining two subsets with either union or
intersection doesn't necessarily lead to those identities.
 EXAMPLE

Composition of Bijective Functions from R to R

The identity function id(x)=x serves as the
identity element.
The inverse of a bijective function f is its inverse
function , such that f∘(x)=x for all x in its domain.
 Distributivity:

One binary operation, say ⊕, is distributive over

another, say ⊙, on a set S if, for all elements a,b, and
c in S, the equation a⊕(b⊙c)=(a⊕b)⊙(a⊕c) holds.
Example: In real numbers, multiplication is
distributive over addition because x×(y+z)=(x×y)+(x×z)
for all real numbers ,x,y, and z.
 Example

Multiplication Distributing over Addition in the Real

Numbers R For all a,b,c∈R:
a×(b+c)=(a×b)+(a×c)
This property can be visually represented with the area
model in mathematics, where the area of a rectangle with
the width a and length b+c is the sum of two smaller
rectangles with areas a×b and a×c.
 EXAMPLE

Matrix Multiplication Distributing over Matrix

Addition for n×n Matrices For any matrices A,B, and C:
A×(B+C)=(A×B)+(A×C)
Note: Matrix multiplication is not commutative, so
(B+C)×A does not necessarily equal (B×A)+(C×A),
though distributivity still holds.
EXAMPLE

Boolean Operations: AND distributes over OR,

and OR distributes over AND For any boolean
values p,q, and r:
p∧(q∨r)=(p∧q)∨(p∧r)
p∨(q∧r)=(p∨q)∧(p∨r)
EXAMPLE

Set Operations: Intersection Distributes over

Union, and Union Distributes over Intersection
For any subsetsA,B, and C of a set S:
A∩(B∪C)=(A∩B)∪(A∩C)
A∪(B∩C)=(A∪B)∩(A∪C)
Idempotence:

A binary operation ∗ on a set S is idempotent if,

for every element a in S, the equation a∗a=a
holds.
Example: The "minimum" operation on the set
of real numbers is idempotent, since min(x,x)=x
for all real numbers x.
EXAMPLE

Union on Sets For any subset A of a set

S:
A∪A=A The union of a set with itself is
just the set itself.
EXAMPLE

Intersection on Sets For any subset A

of a set S:
A∩A=A The intersection of a set with
itself is the set itself.
EXAMPLE

Minimum (or "AND") Operation on

Boolean Values or Binary Lattices For
any boolean value p:
p∧p=p
EXAMPLE

Maximum (or "OR") Operation on

Boolean Values or Binary Lattices For
any boolean value p:
p∨p=p
EXAMPLE

Bitwise AND Operation on Binary Numbers For

any binary number b:
b AND b=b
EXAMPLE

Bitwise OR Operation on Binary Numbers

For any binary number b:
b OR b=b
Absorption:

One binary operation, say ⊕, absorbs another, say ⊙,

on a set S if, for all elements a and b in S, the
equation a⊕(a⊙b)=a holds.
Example: In logic, AND operation absorbs OR
(considering true as 1 and false as 0)
 EXAMPLE

Absorption in Set Theory: Union and Intersection For

any subsets A and B of a set S:
A∪(A∩B)=A
A∩(A∪B)=A
Essentially, the intersection of A with any subset of A is
absorbed by the union operation, and vice versa.
 EXAMPLE

Absorption in Boolean Algebra: AND and OR For any

boolean values p and q:
p∨(p∧q)=p
p∧(p∨q)=p
In the context of Boolean algebra, the OR operation absorbs
the AND operation and vice versa, under these conditions.
 Question 1
 1. Which of the following best defines a binary operation on a set S?
 a) An operation combining three elements of S.
 b) An operation combining two elements of S to produce a result outside S.
 c) An operation combining two elements of S to produce a result in S.
 d) An operation using one element of S.
 Question 2
 2. For an operation to be commutative, which must be true?
• a) a∗b=b∗a for all a,b in the set.
• b) a∗b=a for all a,b in the set.
• c) a∗b=b for all a,b in the set.
• d) a∗a=a for all a in the set
 Question 3
 3. Which property ensures (a∗b)∗c=a∗(b∗c)?
• a) Commutativity
• b) Closure
• c) Associativity
• d) Inversion
 Question 4
 4. If the set S with operation ∗ has an identity element e, what is true?
• a) a∗e=e∗a=a for all a in S.
• b) a∗e=e∗a=e for all a in S.
• c) a∗a=e for all a in S.
• d) e∗e=e.
 Question 5
 5. In which of these sets paired with addition as the operation will you
NOT find an inverse for every element?
• a) Real numbers
• b) Integers
• c) Natural numbers
• d) Rational numbers
 Question 6
 6. What does closure property ensure for a set S and binary operation
∗∗?
• a) a∗b always has a unique solution in S.
• b) a∗b is always a member of S.
• c) a∗b=b∗a for all a,b in S.
• d) a∗b is always equal to a or b.
 Question 7
 7. If the operation ⊕ on set S satisfies a⊕b=a+b+1 where + is standard
addition, what is the identity element?
• a) 0
• b) 1
• c) -1
• d) 2
 Question 8
 8. If the binary operation ∗ on set S satisfies a∗b=a for all a,b in S, the
operation is termed:
• a) Idempotent
• b) Commutative
• c) Associative
• d) Distributive
 Question 9
 9. Which set and operation pair is NOT a group?
• a) Integers with addition
• b) Non-zero real numbers with multiplication
• c) Natural numbers with addition
• d) Real numbers excluding 0 with division
 Question 10
 10. If for all a in set S, a∗a=e where e is the identity element, what is the
inverse of each element?
• a) 1/a
• b) -a
• c) e
• d) Itself
 Question 11
 11. In the set of integers, what is the inverse element for the operation of
addition?
• a) 1
• b) 0
• c) -1
• d) None
 Question 12
 12. What property is satisfied by matrix multiplication but NOT by
matrix addition?
• a) Closure
• b) Associativity
• c) Commutativity
• d) Identity
 Question 13
 13. Which operation on real numbers is NOT associative?
• a) Addition
• b) Multiplication
• c) Division
• d) Subtraction
 Question 14
 14. In the set of real numbers with multiplication as the operation, which
is the identity element?
• a) 0
• b) -1
• c) 1
• d) None
 Question 15
 15. For the set S of all strings and concatenation as the operation, which
of these is the identity element?
• a) "identity"
• b) "zero"
• c) "one"
• d) ""
 Question 16
 16. Which property ensures that for each element a in set S, there exists
an element b in S such that a∗b=e?
• a) Identity
• b) Inverse
• c) Associativity
• d) Closure
 Question 17
 17. If in set S, for any two distinct elements a and b, \a∗b=a, the
operation is:
• a) Commutative
• b) Idempotent
• c) Associative
• d) Distributive
 Question 18
 18. Which set paired with addition does NOT satisfy the closure
property?
• a) Natural numbers
• b) Integers
• c) Rational numbers
• d) Real numbers
 Question 19
 19. Which of these operations on real numbers is commutative but NOT
associative?
• a) Addition
• b) Multiplication
• c) Subtraction
• d) Division
 Question 20
 20. For which binary operation is every element its own inverse?
• a) Standard addition in integers
• b) Standard multiplication in non-zero real numbers
• c) String concatenation
• d) Set union
Assignment:

What is Cayley table?

Give at least example.