CSIR NET MATHEMATICS | Abstract Algebra | Best Solution Finitely Generated Group June 2019 Booklet A Section B Example 38 June 2019 Booklet B Section B Example 34 June 2019 Booklet C Section B Example 36 June 2019 Abstract Algebra, Group, Abelian Group, Finitely Generated Group, Diagonalized Matrix CSIR NET Answer Key June 2019, Mathematical Science Helpful those who are preparing for NET, GATE, SET, SLET exams Thanks to :::::::::::::::::::: Artist: Otis McDonald Album: Innovations in Booty Shaking Music (Part 2)
:::::::::::::::::::: for the beautiful intro music
Please Visit:
AI Generated·May contain errors
Video Summary
AI Generated
This video provides a step-by-step mathematical analysis of a problem from the CSIR NET June 2019 exam regarding a specific set of matrices $G$. The instructor evaluates four different algebraic properties of the set to determine which statement is true, ultimately proving that $G$ is a finitely generated group under multiplication.
Welcome friends,
in this video we are going
to discuss the problem
of abstract algebra
from CSIR NET June 2019.
Example number 36 from booklet C, marks 3.
Consider the set of matrices G is equal
to S0B1 where B belongs to integer set and S
belongs to minus 1 1 then
which of the following is true first option G forms a
group under addition second option G forms an abelian group under
multiplication third option every element in G is diagonalizable over C
and the fourth option G
is a finitely generated group under multiplication so
we have given G contain the matrices as B 0 1
so there is only two possibility
for s which is minus 1 or 1 and B is any
integer now first option G forms a group
under addition so we are going to check
the closure property of the group so we
begin with the two elements from the group 1
is M 1 equal to 1 2 0 1 second
element 1 1 0 1 take the addition
between m1 and m2 we have 2 3 0 2
as per the condition of set
this first element s should be the element of minus 1 1 here 2
which does not belongs to the
set minus 1 1 and this last element should
be 1 here we'll get 2 therefore this addition m1 plus
m2 does not belong to G, that means m1
and m2 are the element of G, but m1 plus m2 does not
belong to G, therefore first option G forms
a group under addition is wrong. Now the second
option which is G forms
an abelian group under multiplication. Similarly we begin with the two
elements of G, m1 and m2 equal
to minus 1 1 0 1, so we'll multiply m1
and m2, so we have first result
m1 cross m2 and its value is minus 1 3 0 1, now
for the abelian group we will check the
commutative property m2 cross m1
so now we multiply m2 with m1, then we have result is
minus 1 minus 1 0 1, that means m1 cross m2
not equal to m2 cross m1, so it is not abelian
therefore the second option
is also wrong. Now option number three, every element in G is
diagonalizable over C, so matrix is diagonalizable
or diagonalized if its algebraic and geometric
multiplicity are equal. We begin with one element of G
which is 1 2 0 1, now we are going to find
the eigenvalues, determinant m minus lambda equal to 0
so roots of this characteristic equation
will give the eigenvalue, then we have determinant
1 minus lambda 2 0 1 minus lambda equal to 0
so it is 1 minus lambda square therefore
lambda has one one equal eigenvalues therefore
algebraic multiplicity of lambda equal to 1 is 2
because it is repeated 2 times
now we are going to calculate the eigenvectors eigenvectors
are the solution of equation m
minus lambda I into x is equal to 0
so lambda equal to 1 therefore M minus I into x is equal
to 0 then we have subtract 1 from the diagonal entries
or lambda equal to 1 so 1 minus 1 0 1
minus 1 0 so we have 0 0 0 x
y and this equation has solution y equal to 0 which does
not have any value of x therefore eigenvector
for lambda equal to 1 is v equal to 1 0 so that is
only one eigenvector associated with the eigenvalue lambda hence
the geometric multiplicity of lambda
equal to 1 is 1 which is not equal
to algebraic multiplicity 2 hence it is non-diagonalizable
matrix so the option number 3 is also wrong
so fourth option which must be true so we are going
to check it G is a finitely generated group
if it has finite generating set S so that every element
of G can be written as the combination under
the group operation of finitely many elements
of finite set S. So, first we begin with elements
of G. So, the condition is S B where S belongs
to minus 1 1. So, there is a 2 possibility for S
and B is a set of integer. So, if we
rewrite or rethink the G. So, G has this 6 possibility of element.
First possibility
1 n 0 1 where n is a positive integer second
option 1 minus n 0 1 so this positive integer
we have negative integer
and s has value 1 now another possibility of s is minus 1 so other
elements are minus 1 n 0 1 minus 1
minus n 0 1 next element 1 0 0 1
and minus 1 0 0 1 now
we are going to find the set S which generate all
this element of G. Consider the set S 1 1 0 1
second element 1 minus 1 0 1 and minus 1 0 0 1.
Now the first element has property 1 1 0 1 power
n is equal to 1 n 0 1. One can easily multiply
this element n times then we have result 1 n 0 1
and which will give the first element of the set.
Now for the nth power of second element we have 1
minus n 0 1 and which will give the second type
of element of the set. Now if we multiply third
element with 1 minus n 0 1
then result is minus 1 n 0 1
which will give the third element. Now
multiply this third element of the set s with 1
and 0 1 the resultant vector is minus 1 minus n
0 1 which is a fourth type of element of set g now
for the fifth type of element we multiply first
and second vector of s then we have 1 1 0 1
multiplied 1 minus 1 0 1 which is a fifth type
of element of g
and this sixth element is already element of S
so this S generate all the element of
G and moreover S is finite so we can say
that the given set G is finitely generated group and which
is generated by set S which has only three element
so the fourth option is correct thanks for watching
For more videos, like, share, subscribe,
press the bell icon of Next Gen.