ALGEBRASYLLABUS IMTB 301)
Matrices 2Questions
MuitplHaon ot matricesitow to write general element in a product). Hermitian and Skew hermitian
matnces dna tneir properties. Every square matru A can be expressed as Ped, where P is n e r s a n
and is Skew hermitian. Every square matrix cam be expressed as P * a where P and a are
herrmifian m a t r i c e s . A d j o i n t of a m a t r i x . If A is a square matrix then A ( AdjAl - ( A d A L A *
IAliverse of a matrix, Inverse is unique. The necessary and sutficient conditHon for a square
matrix A to be invertible is that (A] 0Singular and non- singular matrices. Reversal law for the
inverse of product of two matrices The operatians of transposing and imverting are commutative
operations. Sub matrix of a matrix Minors of a matrix Elementary transtormations, Imverse ot a
ts S o t i o n s or
eementary row translormiations. Rank of a matrix and calcuaton.
usng
homogeneous and non homogeneous equations
sroups: Q estions
Semi-groups, monoids and their examples. Groups and their examples, finite and intnte
erouns ( R).(c.J.V..U G(2, R)- linear group of 2x2
non singular nmo
nth
roots of unity, quaternion group ( Z m I mod m, (Z .x) mod p. where p s prime. sasic
"
properties Or groups
soiutiOng n
V a D have
G IS à t and only it the equations x*DanO =
neore3: A Semi Broup group
Tailsr
A
e
sem group in w i c h h e cancelidtion l a w s hoid is a Broup. when
thi tnecrem
A BrOUp n which every element is its own i n v e r s e s abeian. A BrOup w ta belian
A grOup with faur or tewer elements s necessary a
SuB-RrOU & 5d sub grOup or a and oniy
i"
Jset ora group
vaEH, be H ab EH
(i)v a EH a * E #. H ot à G to be a
sufhicient condition
and tor à non ermpty Subset group
Iheorem necessary
The
Subgroup of G is tiat
a E H , bE IH atb" E H
and only if
H of a group G is a sub group ot G it
FOr adcitive subgroups
A non
ermply subset
GEH, DE Dt .
EXamples on subgroups.
H of a group G to be a
and surficient condition for
à non empty Tinite subset
The necessary
Iheorem
subgroup of G is
ta bE H abEgroup
EH, subgroups H of a G Is again a subgroup of G.
Theorem The intersection of two
of . ubgroups is again
a subgroup o0
Cor. It A,t ruDs need not be a
Rerhat union of two sub groups ot subgro a Is a suugroup or a ànd oniy
i one is contained in
Iheorem
ot two sub
groups o aBroup
Pomomorphism
MonomOrphism, epiiorphism (onto.
homomorplism, exarmpies.
nition ot group groups also.
àdditrve as well as muitiplicative
somurphism, zero homomorphism,
exampies for
then
G be homhomorphisn
Iheorem Let t: G
G and respectively.
()f e)e' where e
and e' are identifies in
G
0)T ( a = f ( a ) " aE
V G
homormorphisms
is
agaim a homomorphism.
Cormposite or group
Theorem
Note: The above t tue tor somorphisms atso
of
rt
ent humDers then *R
roup8Ivenreal nurmbers and (R*. )be the multiplicatie group of positive
by t[a) =e and g R REve Dy B
Theorem The relation of being isonorphic in the set af all groups is an alence relatio
LeofeLet t: G - G be a hormomorphism H and 1t' be subgroups of G and G respectvey then
i0)f"n) is a subgrDup or
ubgroup Benerated by a subset a group (conLept
o oy
order 91 an eiement
p w e s o an eiemen oa
Definition: Drder of an af a
Eroup and its
element group examples.
a e if and anly if m = n u for some integerq.
( p is prime to n then, o t a ) n
of
order or a order
*
a
( tgE Gthen o (a)= o(B
(n a,b u, then d D o
B)
omorphism then o (a) =o
(p(a).
Cyclic Groups Definition of cyclic group and its examples. if a s a Beneraoo
group then a ' is also a generator. Every cyclic group is abelian An ntinite c y r o p
oy t Eeeraros.
Let o De n nte doEln Broup tmen o
tab
s a avisOT
1od, o101
D a y i n c o u p is Equal to the Draer or t s Renerator
"a Tiniite Eroup u ot order n contains an element of order n, then G must
be cycic
eon
Theorem: A subgroup of a cyclic group is cyelic. If G s infinite, t h e n r any art
then a wil generate cyce
integer m will generate cyclic subgroups of G and if olG) n,
=
subgroup of G if m is a divisor ot
enerated by a.
id the order of a is zero then G2L
ermutations: Definition and exampies. Sa forms a group under mutiphcation o
à
permutations a n d is r o n Lycic pErmutaions, Cycle represented by
abelnian ror n >
4.
is commutative.
Proauct disjoint Cycles
a cyene permutation. or
perrmutatiOn. i n v e r s e or
and their properties. Every permutation c a n be
franspositions, even and odd permutations
xpressed às product Or transpo5itions.
heorem: Or the n' permutations on n symbols, (n/2] are even permutations and (n/2)
dd permutations.
of
Ieorem:
ihe set of even permiutations A, In S, Is a
subgroup S
This result is riot true in the tase of odd permutations. To tind the order ot product of cycles
and tränspositiong.tayiey s Ineorem and its corolary
Cosets
tosets. IT subgroup of
à a
group G then the number ot left cosets of H in G
eft and right
5 equal to the number
HIs
ot rgnt cosets or H inG. Ihere is a one to one correspondence
between the set of left cosets of Hin G and the set of right cosets of H in GLagranges
function, and its in finding the generators ofa juit
theorem and their corollaries. Euler's p use
cyclie group. Fermats theorem.
Normal subRroups: Definition and examples
Iheorem: HSa normal subgroup of G iff aH = Ha V a EG.
Theorem: Subgroup Hof a group G is normal iff
VgEG and Vh EH. 9 "hg E .
d**
O a l subgroup of Gif and only if gHg=
H. KeY
heorem Let tG Gbe a homomorphism then Ker f is a normal subgroup G.
A Subgroup of an abelian group is a normal sub-group., however the converse is not true
EVery subgroup ot index 2 is a normal sub-group. A I5 a normai suErOup o
Let H and K be subgroups of a group G of orders 14 and 21 respectively and H nK
e).Then HOKis a normal
subgroup of H
Theorem: Let f: G- G be a onto homomorphism. H and H be normal subgroups of G and G
respectively then
()t (H) is a normal subgroup of G
u) f*(H°') is a normal subgroup of G.
Productof 5ubgrougs
H and K are subgroups of a group G t h e n HK IS a subgroup of G it a n d o n l y if HK = KH.
of G then HK Is a sub8roup of G
Cor.1: lt either H or Kis a normal subgroup
Cor 2: IfG is an abelian group then Hk is a
subgroup oO H.
i H subgroup
is a of G and N I5 a norrmal subgroup G then HnN s a normal
Subgroup of
a normal subgroup ot a group. Quotient groups. Natural map or
Multiplication of cosets of
canonical map.Fundamental theoremor homomorpnisin ror grou
G whereH is normal in G then
Iheorem: If H and Kare subgroups of a group
H and K are two normal subgroups
of G Such that S R, then
heorem
MTB-302: Differential Equations: Extended Syllabus (39 – 40 hrs)
Basic
Definition, independent and dependent variables; ODE & PDE; Order and degree of ODE; Linearity, homogeneity (in context of
degree); Linear ODE of higher order with constant and variable coefficients; Homogeneous/non-homogeneous conditions: Dirichlet,
Neumann & Mixed type; Initial and Boundary conditions; General solution and Particular Solution. 3 hrs – ½ Q
ODE of first order 10 hrs – 1 Q
(A) ODE of First Order and First Degree, Variables are separable, Reducible to separation of variables Linear ODE, Reducible to
linear ODE, Solutions by some specific substitution, 3 hrs
(B) Exact differential Equations. 3 hrs
(C) ODE of First Order and Higher Degree (i) expressed as factors of linear ODEs (ii) differentiable wrt x and y, respectively, (iii)
Clairaut’s form, (iv) Envelope, Singular solutions, Determination of singular solution by general case. 3-4 hrs
Linear ODE of higher order with constant coefficients 4 hrs – 1 Q
Linear ODE with constant coefficients: Auxiliary equation of homogeneous ODE having (a) different roots, (b) equal roots and (c)
complex roots. Linearly independent solutions. Complementary function (CF) of non-homogeneous ODE, Particular integral (PI) due
to non-homogeneous term: eax, xm, sin ax, cos ax, f(x)eax and xf(x). Particular integrals: (D2+a2)-1f(x), where f(x) = tan ax, sec ax, cosec
ax, cot ax. ODE with variable coefficients reducible to constant coefficients, using z = ln x . Euler-Cauchy form. Construction of
homogeneous ODE if its linealy independent solutions are known.
Linear second order ODE with variable coefficients:
(A) Exact ODE, condition for exactness; Solution when (i) one of the two parts of CF is known, (ii) both parts of CF are known
(method of variation of parameters), and (iii) none of the two is known but is obtained by removal of first derivative and reducing the
ODE to normal form. Solution by changing the independent variable. 4 hrs – 1 Q
(B) + (C): 8 hrs – 1 Q
(B) Power series solutions of the ODE y + p ( x) y + q ( x) y = 0 . 3 hrs
Analytic function, x = 0 as ordinary or regular singular point of the ODE. Power series solution about ordinary point x = 0.
(C) 5 hrs
Series solution about regular singular point x = 0, Frobenius method. Indicial equation: m(m − 1) + mp (0) + q (0) = 0 .
To construct the ODE if roots of its indicial equation are known
Case 1: Roots of indicial equation are distinct and do not differ by an integer.
Case 2: Roots of indicial equation differ by an integer (m1 − m2 = n) : then solution for smaller root by using:
y2 = (m1 − m2 ) y ( x, m) (if second solution by Frobenius method fails).
m m = m2
Case 3: Roots of indicial equation are equal (m1 = m2 ) , then second solution by using y2 = y ( x, m) .
m m = m1
(D) + (E): 10 hrs – 1 & 1/2 Qs
(D) Legendre ODE (example of x = 0 being ordinary point) and its solution, Rodrigue’s formula, Legendre polynomials of first kind,
Recurrence relations, Orthogonal conditions of Legendre polynomials, Expression of polynomials in terms of Legendre polynomials,
Generating function. 5-6 hrs
(E) Bessel ODE (example of x = 0 being regular singular point) and its solution, Bessel function of first kind, Expression of J 1/2(x),
J-1/2(x), J3/2(x) and J-3/2(x) etc in terms of trigonometrical functions, Generating function, Recurrence relations. 4-5 hrs
