Scribd
Upload
264 views

Linear Algebra - Binary Operations

A binary operation on a non-empty set S is a mapping that takes two elements of S and produces a third element of S. A binary operation satisfies the closure property if applying the operation to any two elements of S always results in an element of S. Examples of binary operations include addition and multiplication of real and rational numbers. For a binary operation to be a group, it must satisfy four properties: closure, associativity, identity, and inverse. Fields extend groups by including two binary operations where one distributes over the other.

Uploaded by

Arivanandam R
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
264 views

Linear Algebra - Binary Operations

A binary operation on a non-empty set S is a mapping that takes two elements of S and produces a third element of S. A binary operation satisfies the closure property if applying the operation to any two elements of S always results in an element of S. Examples of binary operations include addition and multiplication of real and rational numbers. For a binary operation to be a group, it must satisfy four properties: closure, associativity, identity, and inverse. Fields extend groups by including two binary operations where one distributes over the other.

Uploaded by

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

Binary Operations:

A binary operation on a non empty set is a calculation


involving two elements of the set to produce another element of
the same set.
(or)
A binary operation on a non empty set S is a mapping of the
elements of the Cartesian product S × S to S.
*: S  S → S

(or)
An operation * on a non-empty set A is said to be a binary
operation if a  A & b  A, then a * b A
(Closure Property)
4.1
4.2
4.3
4.4
Examples:
The
. set ℝ with the operation a + b
+
The set Q with the operation a × b
The set ℝ-{0} with the operation a / b
The set ℤ with the operation a - b
The set ℚ with the operation
Check: The operation ⋆ on the set
defined by

Let with the operation defined as

4.5
Examples not binary:
The set ℝ with the operation a / b
The set ℚ with the operation (a + b )
The set ℝ-{0} with the operation a - b
The set ℤ with the operation a / b
+
The set Q with the operation a + b – ab.
Check:
Let with the operation defined as
( x1 , y1 ) * ( x2 , y2 ) = ( x1 + x2 , y1 − y2 )

( x1 , y1 ) * ( x2 , y2 ) = ( x1 + x2 , y1 / y2 )

( x1 , y1 ) * ( x2 , y2 ) = ( x1 + x2 , y1 + y2 )
4.6
Associative property:
A binary operation * on a set S is said to satisfy the associative
property if u * (v * w) = (u * v) * w for all u, v, w ∈ S.

The set ℝ with the operation a + b


a + (b + c) = a + b + c = (a + b) + c
+
The set Q with the operation a × b
The set ℝ-{0} with the operation a / b
4 / (6 / 2) = 4/3  1/3 = (4 / 6) / 2
Check:
The set ℤ with the operation a - b
The set ℚ with the operation
The operation ⋆ on the set
defined by 4.7
Identity:
A binary operation * on a set S is said to have an identity element
if there exists an element e ∈ S such that u * e = e * u = u for
all u ∈ S.
The set ℝ with the operation a + b, then e = 0.
+
The set Q with the operation a × b, then e = 1.
The set ℝ-{0} with the operation a / b, here identity not exists.
The set ℤ with the operation a - b , here identity not exists.

Check:
The set ℚ with the operation
The operation ⋆ on the set

4.8
Inverse:
A binary operation * on a set S with identity element e, is said
to have an inverse for the element u ∈ S if there exists an
element v ∈ S such that u * v = v * u = e. Then v is said to an
−1
inverse of u and denote by u .

The set ℝ with the operation a + b, then the element a having


inverse -a.
+
The set Q with the operation a × b, then the element a having
inverse 1/a.
The set ℝ-{0} with the operation a / b, here identity not exists.
Check:
The set ℚ with the operation

4.9
Commutative:
A binary operation * on a set S is said to satisfy the
commutative if u * v = v * u for all u, v ∈ S.
The set ℝ with the operation a + b, then a + b = b + a.
+
The set Q with the operation a × b, then a b = b a.
The set ℝ-{0} with the operation a / b, then a / b ≠ b / a.
Let with the operation defined as

( x1 , y1 ) * ( x2 , y2 ) = ( x1 + x2 , y1 + y2 )
= ( x2 + x1 , y2 + y1 )
= ( x2 , y2 ) * ( x1 , y1 )
Check:
Set of all matrix with matrix multiplication.
4.10
Group:
A non empty set S with the binary operation * is said to be
group if it satisfies the following conditions;
1. Closure property: a  S & b  S, then a * b S;
2. Associative property: u * (v * w) = (u * v) * w for all
u, v, w ∈ S; (Semi group)
3. Identity property: there exists an element e ∈ S such that
u * e = e * u = u for all u ∈ S. ( Monoid )

4. Inverse property: For every u ∈ S, there exists an element


v ∈ S such that u * v = v * u = e. Then v is said to an
−1 (Group)
inverse of u and denote by u .
5. Commutative property: u * v = v * u for all u, v ∈ S.
(Abelian Group)

4.11
The set ℝ with the operation usual addition is group.

+
The set Q with the operation usual multiplication is a group.

Let with the operation defined as

is a group.

Set of all matrix with usual matrix addition is a group.

The set ℝ-{0} with usual multiplication is a group.

4.12
Distributive:
Two binary operations * and # on a set S is said to satisfy the
1. Distributive property of * over # if
u * (v # w) = ( u * v ) # ( u * w ) for all u, v, w ∈ S.

2. Distributive property of # over * if


(u * v) # w = (u # w) * ( v # w ) for all u, v, w ∈ S.

A non- empty set S with two binary operations * and # is said to


be field if

1. S is an abelian group under * (addition);


2. S – {0} is an abelian group under # (multiplication);

3. S satisfy the distributive property of # over * .


4.13
The set ℝ with the operations usual addition and multiplication is
a field.

The set ℚ with the operations usual addition and multiplication is


a field.

The set ℂ with the operations usual addition and multiplication is


a field.

The set ℤ with the operations usual addition and multiplication is


not a field.

4.14
4.15

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy