bm session 5
TRANSCRIPT
![Page 1: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/1.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 1/64
Copyright @ Amity University1
MSc-ITSemester - I
Basic Mathematics
![Page 2: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/2.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 2/64
Copyright @ Amity University
Binary operation
• Binary Operations: A binary operation is
simply a rule for combining two objects of agiven type, to obtain another object of that type.
• Through elementary school and most of high
school, the objects are numbers, and the rule for
combining numbers is addition, subtraction,
multiplication or division.
![Page 3: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/3.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 3/64
Copyright @ Amity University
• Binary operation on a set S. A binary
operation on a set S is a rule which
assigns to each ordered pair a,b of
elements in S a unique element
• c = ab.
.
![Page 4: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/4.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 4/64
Copyright @ Amity University
• Closure: A set S is closed with respect toa binary operation if and only if every
image ab is in S for every a,b in S.
![Page 5: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/5.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 5/64
Copyright @ Amity University
Elementary terms and notation• Set – a collection of objects – not otherwise defined in
naïve set theory
• Correspondence – can be one-to-one or many-to-one orone-to-many
• Common symbols
Belongs to – is a member of
For all
There exists (at least one)
Not equal
![Page 6: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/6.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 6/64
Copyright @ Amity University
Common relationships and definitions
• Equality – relationship is an equality relationship if:
– Reflexive a = a
– Transitive a = b and b = c imply a = c
– Symmetric a = b implies b = a
– Objects do not need to be equal numerically to satisfyan equivalence relationship – example, similar
triangles
![Page 7: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/7.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 7/64
Copyright @ Amity University
• Closure a,b S implies a b S
• Associativity a (b c) = (a b) c – can be writtena b c
• Identity e S such that a S e a = a, a e = a
• Inverse a S a’ S such that a’ a = e, a a’ = e
• Commutativity a,b S a b = b a
• Distributivity a(b + c) = ab + ac
![Page 8: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/8.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 8/64
Copyright @ Amity University
Properties of Binary operations:
• Commutative operation: A binary operation
on a set S is called commutative if
xy = yx for all x,y in S.
![Page 9: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/9.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 9/64Copyright @ Amity University
• Associative operation: A binaryoperation on a set S is called associative if
• (xy)z = x (yz) for all x,y,z in S.
![Page 10: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/10.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 10/64Copyright @ Amity University
• Distributive: Let S be a set on which two
operations ∙ and + are defined. The operation ∙ is
said to left distributive with respect to + if
a ∙(b + c ) = (a∙b) + (a∙c) for all a,b,c in S • and is said to be right distributive with respect to
+ if
(b + c)∙a = (b∙a) + (c∙a) for all a,b,c in S
![Page 11: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/11.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 11/64Copyright @ Amity University
• Existence of identity elements and
inverse elements:
![Page 12: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/12.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 12/64Copyright @ Amity University
• Identity element: A set S is said to have
an identity element with respect to a binary
operation on S if there exists an element e
in S with the property ex = xe = x for every
x in S.
![Page 13: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/13.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 13/64Copyright @ Amity University
• Inverse element: If a set S contains an
identity element e for the binary operation ,
then an element b S is an inverse of an
element a S with respect to if ab = ba = e .
• Note. There must be an identity element in
order for inverse elements to exist.
![Page 14: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/14.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 14/64Copyright @ Amity University
Field• A field is a set of two or more elements
F ={ , ,..} closed under two operations, +
(addition) and * (multiplication) with thefollowing properties
– F is an Abelian group under addition
– The set F −{0 } is an Abelian group under
multiplication, where 0 denotes the identityunder addition.
– The distributive law is satisfied:
( + +
![Page 15: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/15.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 15/64Copyright @ Amity University
Theorems :
![Page 16: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/16.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 16/64Copyright @ Amity University
• Theorem 1.
• A set S contains at most one identity for
the binary operation.
![Page 17: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/17.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 17/64Copyright @ Amity University
• An element e is called a left identity if
ea = a for every a in S.
• It is called a right identity ifae = a for every a in S.
• If a set contains both a left and a rightidentity, they are the same
![Page 18: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/18.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 18/64Copyright @ Amity University
• Theorem 2.
• An element of a set S can have at mostone inverse if the operation is associative
![Page 19: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/19.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 19/64Copyright @ Amity University
Theorem 3.
• Let a set S be closed with respect to an
associative binary operation. Then the
products formed from the factors
multiplied in that order, and with theparentheses placed in any positions
whatever, are equal to the general product
![Page 20: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/20.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 20/64Copyright @ Amity University
Operation Table
![Page 21: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/21.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 21/64Copyright @ Amity University
Interpretation
• We interpret this operation table in much the
same way that we would interpret an addition
table.• Using the operation symbol * as we would use +
to mean addition, the table shows us, among
other things, that
![Page 22: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/22.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 22/64Copyright @ Amity University
• Not A l l Operat ions Have the SamePropert ies
![Page 23: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/23.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 23/64Copyright @ Amity University
• Addition of numbers, for instance, is a
commutative operation -- meaning
that x+y= y+x for all numbers x and y .
• The operation on the set A defined by the
operation table above, however, is not
commutative, and there are several
instances of this lack of commutativity.
![Page 24: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/24.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 24/64Copyright @ Amity University
• Lack of commutativity
![Page 25: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/25.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 25/64Copyright @ Amity University
• For instance, since the table
shows that
• In general, commutativity is a property of
an operation, so it takes only one instance
of lack of commutativity to spoil that
property for the operation.
![Page 26: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/26.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 26/64Copyright @ Amity University
• It is easy to check whether an operation
defined by a table is commutative. Simply
draw the diagonal line from upper left to
lower right, and then look to see if thetable is symmetric about this line.
![Page 27: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/27.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 27/64Copyright @ Amity University
• In the illustration below, we see a lack of
symmetry: the table entries colored yellow
do not match, and the table entries colored
blue do not match
![Page 28: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/28.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 28/64
Copyright @ Amity University
• Lack of Associativity
![Page 29: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/29.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 29/64
Copyright @ Amity University
• Ex. Consider the operation defined on the set S= {1,2,3}
by the operation table below.
From the table, we see
2 (1 3)=2 3=2 but (2 1) 3=3 3=1
The associative law fails to hold in this groupoid(S, )
2
1
3
*1 2 3
1
2
3
1
3
2
3
2
1
![Page 30: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/30.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 30/64
Copyright @ Amity University
Groupoid
• The groupoid is an algebraic structure on a set with abinary operator.
• The only restriction on the operator is closure (i.e.,applying the binary operator to two elements of a givenset S returns a value which is itself a member of S ).
• Associativity, commutativity, etc., are not required.
• A groupoid can be empty.• An associative groupoid is called a semigroup.
![Page 31: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/31.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 31/64
Copyright @ Amity University
群胚 Groupoid
• A groupoid must satisfy
is closed under the rule of combination R
, R
R baR b,a
![Page 32: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/32.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 32/64
Copyright @ Amity University
• A semigroup is a groupoid whose operation
satisfies the associative law.
(groupoid)
Semigroup半群
c bac baR c, b,a
R baR b,a
![Page 33: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/33.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 33/64
Copyright @ Amity University
• A mathematical object defined for a set and a binary
operator in which the multiplication operation is
associative. No other restrictions are placed on a
semigroup; thus a semigroup need not have an identity
element and its elements need not have inverses withinthe semigroup.
• A semigroup is an associative groupoid.
• A semigroup with an identity is called a monoid.
• A semigroup can be empty.
![Page 34: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/34.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 34/64
Copyright @ Amity University
Monoid• A monoid is a set that is closed under an associative
binary operation and has an identity element such that
for all• Note that unlike a group, its elements need not have
inverses. It can also be thought of as a semigroup with
an identity element.
• A monoid must contain at least one element. A monoidthat is commutative is, not surprisingly, known as a
commutative monoid.
![Page 35: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/35.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 35/64
Copyright @ Amity University
• A semigroup having an identity elementfor the operation is called a monoid.
(groupoid)
(semigroup)
Monoid, R
aaeeaR a Re
e
R baR b,a
c bac baR c, b,a
![Page 36: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/36.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 36/64
Copyright @ Amity University
Ex. Both the semigroups and are instancesof monoids
for each
The empty set is the identity element for the unionoperation.
for each
The universal set is the identity element for the
intersection operation.
) ,(S U
) ,(S U
A A A U A
A AU U A U A
![Page 37: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/37.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 37/64
Copyright @ Amity University
Group
• A set is said to be a group "under" this operation.Elements A, B, C, ... with binary operation between Aand B denoted AB form a group if
1. Closure: If A and B are two elements in G, then the
product AB is also in G.2. Associativity: The defined multiplication is associative,
i.e., for all ,
3. Identity: There is an identity element I (a.k.a. 1, , or )such that for every element .
4. Inverse: There must be an inverse (a.k.a. reciprocal) ofeach element. Therefore, for each element A of G , theset contains an element such that
![Page 38: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/38.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 38/64
Copyright @ Amity University
• A group G is a finite or infinite set of elements
together with a binary operation (called the
group operation) that together satisfy the four
fundamental properties of closure, associativity,the identity property, and the inverse property.
The operation with respect to which a group is
defined is often called the "group operation,"
![Page 39: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/39.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 39/64
Copyright @ Amity University
Group: example
• A set of non-singular n n matrices of real
numbers, with matrix multiplication• Note; the operation does not have to be
commutative to be a Group.
• Example of non-group: a set of non-negative
integers, with +
![Page 40: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/40.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 40/64
Copyright @ Amity University
群 Group
• A monoid which each element of has
an inverse is called a group
(groupoid)
(semigroup)(monoid)
, R R
R baR b,a
c bac baR c, b,a
aaeeaR a Re
eaaaaR aR a 1-1-1
![Page 41: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/41.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 41/64
Copyright @ Amity University
Abelian group
• If the operation is commutative, the group
is an Abelian group.
– The set of m n real matrices, with + .
– The set of integers, with + .
![Page 42: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/42.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 42/64
Copyright @ Amity University
• If is a group and ,then
Proof. all we need to show is that
from the uniqueness of the inverse of
we would conclude
a similar argument establishes that
, R Rba,-1-1-1 abb)(a
eb)(a )a(b )a(bb)(a -1-1-1-1
ba
-1-1-1 abb)(a
eaa
)a(ea
)a )b((ba )a(bb)(a
1-
1-
-1-1-1-1
eb)(a )a(b -1-1
![Page 43: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/43.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 43/64
Copyright @ Amity University
Group theory• The study of groups is known as group theory.
• If there are a finite number of elements, the group is
called a finite group and the number of elements iscalled the group order of the group.
• A subset of a group that is closed under the groupoperation and the inverse operation is called a subgroup.
• Subgroups are also groups and many commonlyencountered groups are in fact special subgroups ofsome more general larger group.
![Page 44: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/44.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 44/64
Copyright @ Amity University
Commutative
可交換性
group
1-1-1
monoid
semigroup
groupoid
eaaaa Ra Ra
aaeea Re Ra
cb)(ac)(ba Rcb,a,
Rba Rba,
abba Rba,Commutative
groupoid Commutative
semigroup
Commutative monoid
Commutative group
![Page 45: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/45.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 45/64
Copyright @ Amity University
• Multiple choice questions:
![Page 46: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/46.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 46/64
Copyright @ Amity University
Ques.2: If ea = a for every a in S, then e is
called
• right identity
• left identity
• right inverse
• left inverse
![Page 47: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/47.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 47/64
Copyright @ Amity University
Ans: Left identity
![Page 48: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/48.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 48/64
Copyright @ Amity University
Ques.3: There must be an identity element
in order for inverse elements to exist
• Always true
• False
• Depends upon the elements of the set
• None
![Page 49: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/49.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 49/64
Copyright @ Amity University
Ans: Always true
![Page 50: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/50.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 50/64
Copyright @ Amity University
Ques.4: An algebric structure (G,*),
satisfying only the closure property and
the associative law, is called
• Semigroup
• Monoid
• Group
• Groupoid
![Page 51: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/51.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 51/64
Copyright @ Amity University
Ans: Semigroup
![Page 52: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/52.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 52/64
Copyright @ Amity University
Ques.5: A monoid each of whose elements
is invertible, is called
• Semigroup
• Cyclic group
• Group
• Groupoid
![Page 53: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/53.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 53/64
Copyright @ Amity University
Ans: Group
![Page 54: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/54.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 54/64
Copyright @ Amity University
Ques.6: Let S be a set on which two
operations ∙ and + are defined. The
operation ∙ is said to left distributive with
respect to + if for all a,b,c in S• a ∙(b + c ) = (b + c)∙a
• (b + c)∙a = b + c + a
• a ∙(b + c ) = (a∙b) + (a∙c)
• (b + c)∙a = (b∙a) + (c∙a)
![Page 55: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/55.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 55/64
Copyright @ Amity University
Ans: a ∙(b + c ) = (a∙b) + (a∙c)
![Page 56: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/56.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 56/64
Copyright @ Amity University
Ques.7: A semigroup with an identity
element, is called
• Cyclic group
• Monoid
• Group
• Groupoid
![Page 57: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/57.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 57/64
Copyright @ Amity University
Ans: Monoid
![Page 58: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/58.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 58/64
Copyright @ Amity University
Ques.8: Which one of the following is true
• A group must contain at least one element
• A monoid must contain at least one
element
• A semigroup can be empty
• All are true
![Page 59: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/59.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 59/64
Copyright @ Amity University
Ans: All are true
![Page 60: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/60.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 60/64
Copyright @ Amity University
Ques.9: An associative groupoid is called a
• a. Cyclic group
• b. Monoid
• c. Group
• d. Semigroup
![Page 61: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/61.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 61/64
Copyright @ Amity University
Ans: Semigroup
![Page 62: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/62.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 62/64
Copyright @ Amity University
Ques.10: A subset of a group that is closed
under the group operation and the inverse
operation is called
• Cyclic group
• Subgroup
• Abelian group
• Semigroup
![Page 63: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/63.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 63/64
Copyright @ Amity University
Ans: Subgroup
![Page 64: Bm Session 5](https://reader033.vdocuments.net/reader033/viewer/2022051008/5695d0eb1a28ab9b02946b13/html5/thumbnails/64.jpg)
7/23/2019 Bm Session 5
http://slidepdf.com/reader/full/bm-session-5 64/64
Thank You