SPECTRUM ENGINEERING MATHEMA TICS-Il B.Tech. Semester-II 1.K.G.P.T.U., JALANDHA Dr. RAJESH KUMAR NARULA SUMEET GOYAL Assistant Professor, Associate Professor, Deptt. of Mathematical Sciences, Deptt. of Applied Sciences, \.K. Gujral Punjab Technical University, CGC College of Engineering, JALANDHAR. LANDRAN. Dr. NITIN KALRA SAPNA RIKHI Assistant Professor, Assistant Professor, Deptt. of Applied Sciences, Deptt. of Applied Sciences, D.A.. Institute of Engineering and Technology, Chandigarh Engineering College, LANDRAN JALANDHAR. MOHALI. IS SHARMA PUBLICATIONS N.D. 118, Tanda Road, Jalandhar. Phone : 0181-2284080, 6280996429 Email-ld : sharmapublication.sharma@gmail.com Website : www.sharmapublications.comAll rights Reserved with the Publisher (This book or a part thereof may not be reproduced in any form without the written permission of the Publisher) digarh Engg. College ANORAN, MOHALI han L Neither Sharma Publications nor its authors guarantee the accuracy or completeness of any information published herein, and neither Sharma Publications nor its authors shall be responsible for any errors, omissions, or damages arising out| lof use of this information. FIRST EpiITion : 2024 PRICE : 7 650/- ISBN : 978-93-5181-247-0 Every Copy of this book has the hologram of S P ps 4 Students should buy only that book which has the hologram. Published By : Prof. D.R. Sharma for Sharma Publications, N.D. 118, Tanda Road, Jalandhar.PREFACE Engineering Mathematics-II is intended mainly for the Students of B.Tech (2"¢ Semester) of Engineering Mathematics-II. In this book different related basics as well as advanced topics have been considered. This book mainly emphasizes on the practical applications of the concepts discussed in the chapters. The unsolved exercises are provided section wise for practice. Suggestions for making the book still more valuable to the students will be thankfully considered for the future editions of the book. AUTHORSSYLLABUS Bachelor of Technology (B.Tech. 1° Year batch 2023 & Onwards) BTAM201-23 ENGINEERING MATHEMATICS-II (I.K.G.P.T.U., JALANDHAR) Course Objective : The objective of the Engineering Mathematics-II is to enable the students to understand the concepts of elimination methods or solving linear system of equations, inverse of matrices etc. Students will study concepts of vector spaces, solve ordinary and partial differential equations. So that they can apply these techniques to solve engineering problems. Laboratory Outcomes : At the end of the course students will be col able to verify some of the theoretical concepts learnt in the theory course. CO2__| trained to visualize and conceptualize the’ engineering problems. C03 _| to model the engineering problem mathematically using theory of matrices ODE and PDE. co4 learn to draw conclusions from data and develop skills in industrial problems. COS | to determine the solution of the studied engineering problem from application point of view. Detailed Syllabus : PART-A Unit-I System of Linear Equations : Rank of matrix, Echelon form of matrix, Homogenous and Non-homogenous system of linear equations, consistency and inconsistency of system of equations, Gauss elimination method, Inverse of a matrix, Gauss-Jordon method.Unit-I1 Vector Spaces : Vector spaces, Subspaces, Linear independence and Linear dependence of vectors, Dimension and basis, Linear transformation, rank and nullity theorem (without proof), matrix associated with Linear Transformation, eigen values, eigen vectors, Cayley-Hamilton theorem, algebraic multiplicity, geometric multiplicity, similar and diagonalizable matrices. PART-B Unit-I Ordinary Differential Equations : Formation of Differential Equations, Solution of Differential Equations, Initial and Boundary value problems, Solution of equations in separable form equations reducible to separable form, Exact differential equations, integrating factors, Linear first order equations, Bernoulli equation, Riccati equation, Clairaut’s equation, Higher order differential equation with constant coefficient and variable coefficients, Method of variation of parameters, Method of undetermined coefficients, finding particular integrals. Applications to electric RLC circuit, Deflection of beams, Simple harmonic motion, Simple population decay model, Orthogonal trajectories of a given family of curves. Unit-IV Partial Differential Equations : Formation of first and second order equations, solution of first order equations : Lagrange’s equation, surfaces orthogonal to a given family of surfaces, non-linear first order equations, Charpit’s method, Higher order Linear equations with constant coefficient.9. 10. CONTENTS Rank of Matrix System of Linear Equations Vector Spaces Linear Transformations Eigen Values and Eigen Vectors Cayley — Hamilton Theorem Ordinary Differential Equations Application of Differential Equations Partial Differential Equations 1 Higher Order Linear Equations with Constant Coefficients 1-31 32-60 61-172 173 —237 238 — 298 299-310 311-497 498 — 548 549 - 692 693 — 8001 RANK OF MATRIX 1.1. Rank of a Matrix We know that (i) Submatrix of a given matrix A is either the matrix A itself or a matrix obtained from A after deleting some rows or columns or both. (ii) The determinant of an r-rowed square submatrix of a matrix A is called a minor of order r of A (iti) every r-rowed minor of A is zero, then every minor of order higher than r is also zero. ‘Now we are in a position to define the rank of a matrix. Definition of Rank of a Matrix (P.T.U. 2016) A number r is said to be rank of a non-zero matrix A if (A) _ there exists at least one minor of order r of A which does not vanish, and (ii) every minor of order (r + 1), if any, vanishes The rank of a matrix A is denoted by p (A). we havep (A)=r Another definition of Rank of matrix The rank of a non-zero matrix is the largest order of any non-vanishing minor of the matrix. Remarks From the above definition of the rank of the matrix, we observe that (9 the rank of a zero matrix is zero i, p (0) = 0 where O is a zero matrix, (i) the rank of n x m non-singular matrix is n, (P.T.U. 2016) Git) p (A) Sr, ifevery minor of order (r + 1) vanishes, (iv) p (A) 2 r, if there is a minor of order r which does not vanish. @) p(A)=plA) Equivalent Matrix : When an elementary transformation is applied to a matrix, there results a matrix of the same order and same rank. The resulted matrix is called equivalent to the given matrix and we use the symbol ~ to mean “‘has the same order and rank as” or is equivalent to. Brief Outline of the method to find the rank of a matrix by reducing it to an equivalent matrix. Let A be any given matrix. In the process to find rank, we do the following steps : @__ Use row or column transformations, if necessary, to obtain a non-zero element (preferably 1) in the first row and the first column of the given matrix.(i) Divide the first row by this element, if it is not 1. (iii) Subtract suitable multiples of the first row from the other rows so as to obtain zeros in the remainder of the first column. () Subtract suitable multiples of the first column from the other columns so as to get zeros in the remainder of the first row. (v) Repeat the steps (i) — (iv) starting with the elements in the second-row and the second column, (vf Continue in this way down the “main diagonal” either until the end of the diagonal is reached or until all the remaining elements in the matrix are zero. The rank of this matrix, which is equivalent to the given matrix A, can be determined by inspection and consequently the rank of the given matrix A can be determined. Normal Form of a Matrix Using elementary operation any non zero matrix A can be reduced to any one of the following forms 1, 1 : 0 @ 1, (5) [lp 0) © @|.. a ° 0: 0 which are called Normal Forms of A. Remarks. (1) The number ‘r’ is called rank of A . 1, ° 2) The normal form .. | is called first canonical form of A. ° ° Result : For a matrix A of order m n, there exist two non-singular square matrices P of order m x m and Q of order * nm such that PAQ is normal form of A. ILLUSTRATIVE EXAMPLES] Example 1. Determine the rank of each of the following matrices : 1-1 0} aes 2 3 °«°5 wy |2 -3 0] @-7.v.2013,2016 (i) |3 6 12] Wy} 4 6 10 3-31 24 8 -8 -12 -20 [: -10 Sol. () HereA=|2 -3 0 b 31 1-10 Al=|2 -3 0 (-3+2)=1C1=-1#0 3-3 1 | A| #0 = A isnon-singular matrix plAy=3.RANK OF MATRIX 3 eee 3 2 GletA=|3 6 12 4.8 Ve : n|-a|$ ee Bl ale ‘| oe la 8 2 8 i) 2. | = 2 (48 — 48) — 3 (24-24) + 3 (12-12) =2(0)-3 (0) +3 O) =0-0+0=0 |A|=0 ie, only minor of order 3 of A vanishes. Now we consider any minor of order 2. 3 Consider} 2-9=340 *. _ there is a minor of order 2 of A which does not vanish p(A)=2. 2 3 5 (i) Let A=] 4 6 10 e812) 20 2 3 5 JAl=] 4 6 -10| =0 -§ -2 + <2 tl Also every minor of order 2 vanishes, “elements of 2nd row are equimultiples of the elements of Ist row] But minors of order | i.e., the elements of the matrix are non-zero. p(Ay=1 Example 2. Using elementary transformations, find the rank of the matrix. toro @ @\i a 4 @) 2 14 1 4 3 203-1 -1 1 2 7 3 fant 2 C,-C, 0 1 3 |, by Ri Ro 0 0 3), by Rs > R;—2R, 6 0 0} , byC; +C;—3C; 6 0 1 00 0 | is3 asthe minor |0 -1 0] of order 3 does not vanish 6 0 0 6 2 7 ‘ 4 2 -3 |, by R: * Ra—4Rj, Ry + Ry —3R; -2 2 1 1 +-- aR 2 1}, by Ry > Rs Ro 0RANK OF MATRIX 10 0 ~|0 2 1|,by C)+C;-3C), Cy > C-2C, Ot) 100 ; ~|0 2 O}byG=G- 5G 0 0 0 1020 fee Therankof]0 2 0| is 2 as minor 3g] oF order 2 does not vanish Onc p(A)=2. O tt Asoo ges ~|0 0 2 -1 |, byR; > R.+2R,,R3 > Rs-Ri ae 2 =i esse geese 3 ~|}0 0 2 -1},byR;+R;-R> o 0 0 0 Since every minor of order 3 of A vanishes and there exists a minor -1 03 ie _3|= 1-6=-5#0 of order 2 of A which does not vanish P(A) =2 eae 1-1-2 - @ be asl s = 6 3 0-7s SPECTRUM ENGINEERING MATH 1-1-2 -4 Oster atta Jo 4 9 gg POVRe > Rr-2Ry, Ry > Rr3Ri, Re > Re ORs 0 9 12 17 ieee oe Gatti 0 4 9 19 | bY R2 > Re-Rs OOH IaH, 1-1 -2 -4 Jo 1 -6 -3 0 0 3329 | bY Rs *Rs—4Ra, Ry > Ry 9Ro 0 0 66 44 1-1 -2 -4 itis ties |i 0 0 33 22] bYRs +R 2Rs o 0 0 oO 10 0 0 OAs Oe “To 0 33 2gfrby CoP Crt Cn Cs > Gt 2Cy, Ca C4 AC (iae JaeeetBeeeas TOE HOO: OHH EEHIOTE EHO, ci > 1 Cy > Cy # 3C: 0 0 33. 2p fr bY Ca PCat 6C2, Cam Ca¥ 3Ce OORT OHO. TPO a0 o 1 0 0 0 3 0 0 0 eae The rank of| © is 3 as minor|0 1 0) =(1) (1) (3) = 33 # 0 of order 3 of A 0 0 3 0 0 60 33) 0 0 0 0 does not vanish. p(A)=3.RANK OF MATRIX i 22 2 Example 3, Reduce to the normal form the matrix A=| 1 2 1 | and find its rank. 343 Hence find p(A). 22 2 Sol. A=|1 2.1 a 43 121 ~|2 2 2|,byReR 2043 12 | ~|0 -2 0], byR,>R,-2Rj, Rs > R;-3R; 0 -2 0 1 ~|0 s by Ry >R3-R> 0 1 ~\o s by C, + C)~2C), C3 + C3-C, 0 1 ~{o byR, +-1 R, = 2 0 “(is 0 oo p(A) =2 Example 4. Find the matrices P and Q such that PAQ is in the normal form, when A is the matrix 11 2 12 3 (P.T.U. 2013, 2018) 0-1-1 112 Sol. A=l1 2ybyR2> Ro- Ri 0|, by Cp-* Cp Ci, C3 * C3201 1 -2 0}, by Rs * Rs + Re -I =1], by Cs #G;—-Cr 10 0 1-1-1 where P=|/-1 1 0|,Q=/0 1 -I -l1 11 o o 1 Also p(A) =2 Example 5, Find the matrices P and Q such that PAQ is in the normal form, when A is the matrix 1-1 2 -1 A=|4 2 -1 2 2 2 -2 «0 -1 2 -1 Sol A=|4 2 -1 2 2 2 -2 0 cone ecoRANK OF MATRIX by Cz + Cr + Cy, Cy * Cy —2C), Cy > Cy + Cy 1 =R: ra by Cs > + Ca, Cy > Cy—- Cz 7 2 slanlat © =PAQ (Us O} >100 Tabor 214 2 whereP=| 3 6 |, Q= Tage pes 2 “tit 0 0 4 7 oo 0 THEO eat] Example 6. Reduce the matrix ‘ aig ; to the normal form and hence, find its rank. -22 80 1021 Mie an ee 1-1 40 22 80 He Ora o 1-2 1 ~Jo a1 2 [7 Y R3R3-Ra Ry Rg 42K 0 2 12 2 10 00 Oe 2Hl ~|o 12 ay] bY C3 2E3-2C1,C4 9 C4=C, 0212 2 10 00 01-21 loo 0 07 BY Ra PR3+R2vRa Ry -2Rp 00 60 10 00 o100 7 » by Cy 4 C3 +2C),Cy Cy -C 00 0 0] LY C3 PE3F2CC4 C4 Co 0016 0 1000 0100 1 ao Ry>tR 0 0 0 of R476 Ra 0010RANK OF MATRIX u (RANKOPMATRIX 0 1000 0100 - s by RZ OR, 0010 0000 a 1; 0 00 p(A)=3. 21 3 4 0 41 : Example 7, Reduce the matrix | , 7 5 | t@thenormal fom and hence, find its rank. 2 i 6 Dl 4 (oe _ 23 7G 25 il 6 | Ta 34 | 41 1 | ~ by C> =C | 1 Sie 1s (1 6 1403 4 O34 1 elo 4 4 1 | by Rs > Rs— Ri, Ra * Re Ri 0 6 8 2 10 0 O34 1 yg gp pP¥C2 tCr# Cy Cy Cy 34, Cr Cy—4Cy 06 8 2 10 0 0 oo 01 4 4) ee 0 Gg i 0 0 O14 4 | “To 0 0 1 [bY Rs*Ra— Ras Ra Ra 2K 000012 SPECTRUM EI i ———— oA i ——eernor—rvssa' 1000 0 100 “To 0 9 fhe cs ® C42, Cy Cx 3C2 0000 10 0 0 0 0 o : 0 ~}9 0 1: Of bycec, 0 0 0 0 _fb o oo + p(Ay=3. 1-1-2 = Example 8. Reduce the matrix A = ; i d to the normal form and find its rank. 0 0 2 1-1 -2 -3 41 Sol. Let A= ace o 3 1 4 0 0 2 1-1-2 -3 o 5 84 a. s by Ri > Rp-AR, Osea HHA NHtat Goa aie (ie net eer) 10 0 0 o5 8 4 1g [RVC tC t CnC C520, Cr+ 30, Oe on) 2 100 0 o 10 2 as by Ry = 03 1 aye o 5 8 14 100 0 : Hf OT ey Ry = Ry—3Rs, Re > Ry—SRe eee 00 8RANK OF MATRIX foo 0 eee eeece 0 - ' ‘4 Cy—2C; 0 0 1-2 [PCr Ce“ 2C oe ec 0 o 10 6 ~ > Ry 8R; 6 01 by Ry > Ry 3 2 OO 0 0 Se 0 ~ , by Cy > Cy + 2 00 1 phy cee Cat 2s ies ae: eee | To 0 0 oe 1 : iy O00) Oe eee A~ I, which is required normal form and rank = 4. EXERCISE 1 (a) 1, Determine the rank of each of the following matrices : 116) 2, 45 Oy (P.T.U. 2018) (i) |2 6 8 3.8 -1),, G22) 12-1 a a Gi) 31 0 OG 2-101 -6 -8 -10 2. Using elementary transformations, find the rank of the matrix 2a el a ©] 21 2 @{io3 -2 al 2.2 1o-nog 3. Using elementary transformations, find the rank of the matrix 1-1 1 5 12 oe O |2. 2 @ {2 6 -3 -3 30-1 -1 007 3. 10 -6 -suu SrecTRUM E! MATICS-1) Ao oOvOr__O aoe ecseaeeeileaanig, 13 2 2 4 Using elementary transformations, find the rank ofthematrix A=], 3g Sea 5. Reduce the following matrices to the normal form and hence find their ranks 123 eal 3-12 P-l-1 @ A=/23 4 Gi -1 -1 (i) |-6 24 @ flo1 4 aeesiag, Seeley -3 12 Sere fee 6. (i) Forthe matrix A=|1 2 3, find two non-singular matrices P and Q such that 0-1 -1 PAQ is in the normal form and hence find out rank of matrix A. deseeael ee (ii) Find the matrices P and Q such that PAQ is in the normal form where A=]1 -1 1}. Sea Also find the rank of the matrix A, 023 4 7. () Reduce the matrix ]2 3 5 4 | tothe normal form and hence determine the rank. 48 13 12 8 1 36 (ii), Reduce the matrix] 0 3 . 2 2|,to the normal form and hence determine the rank. -8 -1-3 4 (P.T.U. 2012) ah oO 4 loss 8 () Reducethematrix| 5 5 _¢ | tononmal form. Hence find the rank of the mati. 6 4 10 2 1-1 2-3 eae 2 y (ii) Reduce the matrix A= |) || tothe normal form and find its rank. oO 10 2RANK OF MATRIX 15 Rank ori” 9. Reduce the following matrices the normal form and hence find their ranks 01-3 -1 23 1 i 10 11 | ii i 2 4 © |, 4 9 9) @-TU-2012,2018) Oi Aw 11-2 0 Ga Oy ANSWERS 1 @ 3 (i) 3 Gi) 2 (wy) 1 2 2 (i) 2 3.) 3 @ 2 3 5. () 2 i) 2 Gi) 2 Ww) 2 10 0 1-1 -f 6 () P=|-1 1 0f,Q=/0 1 -1/;p(A)=2 -1 11 Oo 0 1 a 1-1 -t @ P=|> -7 0/,.Q=|0 1 Ofsp(ay=3 7 0 0 | 2 2 1.0 2 W) 3 & (2 (i) 4 9 2 (i) 3 1.2. To Compute Inverse with Elementary Transformations (Gauss-Jordan Method) If we are to find inverse of A, we write A =I A and go on performing row transformations on the product and the prefactor of A till we reach the result I= BA, then B is the inverse of A. ILLUSTRATIVE EXAMPLES 2 bel Example 1. Find the inverse of the matrix.|0 2 1| using Gauss Jordan method. (P.T.U. 2018) 52-3 21 1 SolLetA=|0 2 1 $2 -3 Now A=1A* SPECTRUM ENGINEERING MATHEMATICS.] ieee Teel 0 2 a= oe 2 2 21-1! Ji 00 02 alo 1 of Adee igual $f OPA DY RS +R, FF. Re gta 4 24 21-1 I oe 02 I =/0 1 O}byRy +R: C4), 00 1} fio -1 -4 210 Mo-1 4 0 2 Of =|-10 2 4} Ry >R,+Rs,R, > Rr-Rs oot lo -1 -4 200 16 -2 -6 020/=|-10 2 4 RoR FR 001 10 -1 -4 100 8-1 -3 010/-l-5 1 2 AbyR) +2R),R; > 5R: oo 1} [10 -1 -4 8 -1 -3 a At=|-s5 1 2 10 -1 -4 “ ie -1 12 Example 2. Using Gauss-Jordan method, find the inverse of the matrix | 3 -1 1]. (P.T.U. 2017) “134 -1 12 Sol. Let A=| 3 -1 1 -1 34 Now A=IA -1 12] [100 : 3-1 1}={0 1 ola -1 34] foodola 4 1-1 -2 O27 02 2 1-1 -2 O02 7 0 0 -s 1-1 -2 oi 2 2 © 0 1 1-10 1 Ole O00 100 0 1 ol= 001 ATA ae 10 at=|-8 10 a 10 -100 0 1 OJA,by Ry>-R, oot ae 31 0] Ayby R, R,-3R,,R, >R; +R, 101 -1 00 =| 3. 1 O/A,byR,>R,-R, -4-11 -10 0 a1 1 Blo 4) 0 A, by R, >>Ry.R3> ak 595 5 22 B27 “Wo Tio Tol AeY Bi Ri #2RyR OR, 0 58 9 22 1 19 10 7 10 10 7047 Ri PR +R, ae 10 10 10 oe 10 10 7203 2 7/1 -— a |=—|-13 -2 7 10 10 1 2-2 10 10SPECTRUM ENGINEERING MATHEMATICS.) 18 0.2 Example 3. Use Gauss-Jordan method to find the inverse of the matrix 2-1 3). PT. 2019 415 0.2) Sol. Let A=/2 -1 3 415 Now A=1A 1 02] fiao 2-1 3/=|o 1 ofa 4 1s] joo. 102 on) = fo -1 -1]=|-2 1 0] A,by R,>R,-2R),R, OR; -4R, OF tes iet Ol 10 210.) 2 earns o1 10 00 0 2 -1 0/ A,by R, 9R;-R, 00 11 02] 1 = plete a 0] AstyR,+-2R, Ged oa [2 -- — 44 ; ed ved gtd Ot Ole liar g A, by R, >R,-R3,R, 9R, -2R; ool 6 I 1 4°44 I= Ata ee aa yaar) Sea? ba tao Seal reeled aeRANK OF MATRIX 19 axe Example 4. Compute the inverse of =I 1 2 -1 -3 1 -5 1 -3 1 2 0 -I 0 -3 1 with the help of the method based on the fact that every non singular matrix can by a series of elementary row transformations, be reduced to unit matrix -1 -3 -3 =I L LetA= 1 i Sol. Let GG oto | Now A=1A ) 2-5 2 -3 -l 1 0 1 Performing Rz > Rz + Rj, Rs > Rs + 2Ry, Ry > Ry—Rj, we get -1 0-30-30 =1 0 -2 -4 -1 0 -1l -4 -5 0 43 2 Performing R > Rs + 4 ol 3 | 0 -2 -4 -1 o o w ft 2 0 0 -5 0 Performing Ry > Ry+ 3 R, f-l -3-3 0 0-2 -4 0 o o w t 2 Oo 9 & 36 0 1 0 0 & ooo 0 0 1 0 cuce =e ot Slax] -cce -co8o 2, Ry > Ry + 2Rs, we get -oc°o eco eco20 specrRUM ENGIN Performing Ry > Ry + Seu Re Ret 38 Ra Rye Ry SER WeEEE s 6 Wy 36 “1-3 -3 0 Siase 5 Ce ee eee) 8 a 2 = 3 oo B 9 B 2 36|* OO Oe 316 “10 36 a gna 360368 : 3 4 Performing Ry > Ri + rh Ri > Rot Tg Re went ee ee “1-3 0 0 Sans 5 Ou 2tt 00 2 2 2 2 o 0 18 - “) 1 ee 2 00 0 3 10 10 bs eee 363618 Performing R, + Ry — $Rs we get ee 1000 flee ale o 10 0 \"5 5 3 Ore O-c2 2,0 [ae eee ee eree ig eee 5 10 10 CO Geoeiee & J 36 1h , 3% ae 5 IEERING MATHEMATICNRANK OF MATRIX 0 a -1.| 5 ot 5 i 5 4|Ssleui4| EXERCISE 1 (5) 1. Use Gauss-Jordan method to find the inverse of the matrix 20-1 @ [51 0 O13 13,3 @) [143 13 2. Using elementary operations, find inverse of the matrix 843 © \2 11 121 113 Gi) | 13 -3 -2 -4 -4 1 2 el Oli 4 2 2-101 3. Use Gauss-Jordan method to find the inverse of the matrix esp eul= Ad Belawly (iii) ow) Rul 1 1 1 I 1 Hl 1 ' I 1 al-slunio 2 5 0 12 @ ia 1 Od -1 ANSWERS 3 Go| -15 5 7 @) |-1 2 (P.T.U .2012, 2013) onan ' = sulSPECTRUM ENGINEERING MA‘ 22 s << -_—aerermnma—_s_»_voosv“u—' u Seae ius EES 2@-[5 3 eee eiccee ADEs eteO | : aot | Baas | | -21 01 | 1 | - 0 2-1 eas ea | -10 -2 2 1.3. A matrix A is said to be a row (column) equivalent to a matrix B if B can be obtained from A after 4 finite number of elementary row (column) operations, and we write A ® Bor A © B. 1.4. Echelon Form A matrix A = [a,,] is said to be in the echelon form if (The zero rows of A occur below all the non-zero rows of A (ii) The number of zeros before the first non-zero element in a row is less than the number of such) zeros in the next row. (ii) If Ry,R3,.... are non-zero rows of A. then first non-zero entry in these rows is 1. Matrix ij called row reduced echelon form when in addition to above conditions, if a column contains the first non, zero entry of any row, then every other entry in that column is zero. The first non-zero element in each non-zero row is called distinguished element of the echelon matrix. For example = > 4 s7[23 5 § E 4 | 0 0 1 0 | are in echelon form but not in row-reduced echelon form. o 000 2405 2 4 0 6 (: ; | 0 0 1 0 | are in row-reduced echelon form. 0000 Similarly matrix A is said to be in column echelon form iff the number of zeros after the non-z# elements of a column increases column by column. The elements in the last column or columns may be all zero. The first non-zero elements in the columns of an echelon matrix A are called distinguished elemens of A. ‘An echelon matrix is said to be a column reduced echelon matrix iff dist equal to | and are the only non-zero elements in their respective rows. suished elements are ea0 0 20 0 ! 40.0 The matrix | 10 | is column echelon matrix and the matrix | 6g | f # column tiaties reduced echelon matrix. Row and Column Rank of a Matrix Let A be any matrix. Row rank of A, written as pq (A) , is defined as the number of non-zero rows in an row echelon form of A, Similarly, column rank of A, written as pc(A), Is defined as the number of non-zero columns in a column echelon form of A. We will prove later on that row rank of A = Column rank of A, ILLUSTRATIVE EXAMPLES 2 1-4 Example 1. Find the rank of the matrix | 3. § —7], (P.T.U. 2019) 4-5 -6 2 1-4 SoLLetA=|3 5 -7 4-5 -6 2 «1-4 ~ [1 4 -3],byR,>R, 4-5 -6 1 4 -3 21 -4/,byR, OR, 4 -S -6 I 4-3 ete rby Rp > R,-2 Ry, KR; HR, -4R, 0-21 6y 24 SPECTRUM ENGINEERING MATHENATICy 1 4 -3 i « jo = | 7 2 by Rs >R,-3R, 0 0 0 4-3 2 1 ~ jo 1 “ZpRa> -FRy 0 0 Since number of non-zero rows in Echelon form is 2 p(A)=2. 1-2 -1 4 Example 2. Reduce to row echelon form the matrixA=| 2 -4 3 5 -1 2 67 Also find the row rank of A. 1-2 -1 4 Sol. A=| 2 -4 3. 5 -2 -1 «4 ~|0 0 5 ~3 |,byR2>Re-2Ri,Rs>Ro+Ri 0 0 5-3 1-2-1 4 1 ~|o 1 Zp by Rat SR 0 0 $s -3 Ls ~ 7 ~]0 0 1 =% |, bys Rs-SRe 0 0 0 0 which is in row echelon form. ‘Since there are two non-zero rows in row echelon form. pA) =2 1023 4 ; -2 -3 1 2 Example 3. Reduce the matrix A=] “75g | torow-echelon form and hence finds 1 3 0 4RANK OF MATRI 28 1023 4 ca kel Tt te 3-4 5 8 1 3 0 14 12 3 4 o 1 7 10 2 1h 29 fp PYRE Re + 2Ri, Rs > Rs +3R,, Ree Re—Ri 0 1 -3 10 12 3 4 o 1 7 10 “lo 0-10 9 |reyRse Re 00 0 0 123 4 fo 17 Wl dR oo 1 0 000 0 which is in row echelon form. Since there are three non-zero rows in row echelon form. P(A) =3. 1 2 -1 0 Example 4.Findtherowrankof A=|3 1 4 2 1-3 6 2 1 2 -1 0 Sol. A=|3 1 4 2 1-3 6 | 1 2 -1 0 ~|0 -5 2 mann toteonm 1-5 2 1 ~| 30 1-5 10 “Jo. 00 which is in row-reduced echelon from. PRCA) =2.1 Example §, Find the column rank of the matrix A=|2 4 2 123 2 123 1 Sol. A 246 2 123 2 10 0 0 ~]2 9 0 Of, by Cy» C~2C;, Cy + Cy-3C1, Ca > Ca— Cr 1001 1 0 0 o ~/2 0 0 o|,byqec, 1 10 0 which is column echelon form having two non-zero columns. column rank = 2. 193 2 4 . 2 0 1 Example 6. Find the row rank and column rank of 4-4-7 -7 5 6 10 1 3 2 4 2 0 1 30-4 -4 -7 -7 5 6 10 2 4 -10 -19 er . ~ Rz ~ R2—5R,, Rs > R3 — 3Rj, Ry > Ry + w yo wtp { bY Re* Ra SRr, Ro Ry—3R), Re Re+7Ry 20 38 1 3 2 4 0-13-10 -19 ~ , by Ry» Ry —Ro, Ry > Ry + 2K, 0 0 0 | bY Rs + Rs Ro, Ra Re + 2 . o 0 0 0 13 2 4 eo! ix B by R, sae “loo 3 3 frby Bem 7g R 00 0 0 which is in row-echelon form. tRANK OF MATI 27, Since there are two non-zero rows in the row-echelon form row rank of A is 2 302064 5 oo. we ee ll ok - 5 6 10 1 0 0 0 5-13-10 -19 3-13-10 -19 -7 6 20 38 by Cp + C2—3C), Cy * Cy 2C), Cy * Cy—4C, 1 0 0 0 Ss 1-10 -19 1 7 +O -—¢ 31-10 nig PCO “GG -7 -2 20 38 1 0 0 0 5 100 ~ i > C+ 1002, Cy > C, + 15C. 3 0 9 [Pp byCs Cat 10C2, Cs > Cy 2 -7 -2 0 0 which is column echelon form having two non-zero columns. column rank = 2. EXERCISE 1 (c) 1, Find a row echelon matrix which is row equivalent to oo -2 3 1 24 1 3 aay yo 2 famdfind 09 (A). 48 23 5 2. Reduce to row reduced echelon form the matrix o 1 3 -1 4 2.0 -4 1 2 A=|1 4 2 0 =I Jand find pp (A). 3094 -2 1 1 69 -l 1 628 SPECTRUM ENGINEERING MATHEMATICS 3. Reduce to a row reduced echelon form, the matrix o 1 3-1 3 4 1930 23 2 6 13g | aNd find QCA) - 4°12 -2 10 7 61 3 8 -l 4. Reduce to row-echelon form the matrix a=| 4 2 & 10 3 9 7 16 4 12 15 Also find the row rank of A. §. Reduce to a row reduced echelon form, the matrix o 1 3 -1 4 20 -4 1 2 A=-|1 4 2 0 =I |and find pg (A). 304 -2 1 1 6 9 -1 1 6 102 -1 3 . . 4 12 1 6. Find the row rank ofthe matrix A=] 5) 5 1 2 01 2 3 -1 -1 _ fl -1 -2. -4 _ 7. Find the rank of the matrix |, , —-_>.| by reducing it to echelon form, 6 3 0 -7 ANSWEKS 13 2 3 3.3 42 53 1.5.Definition of n-vector ‘An ordered set of n numbers is called an n-vector. For example (x) 5 X25 x) i8 an n-vector. 1.6. () Linearly Dependent Set of Vectors ‘A set Vi, Vo, «ny V; of vectors is said to be linearly dependent set, if there exists ¢ scalars py P2 not all zero, such that piVi + p2V2 +... + pV, = O, where O is a n-vector with all components zero.RANK OF MATRIX, 29 (RANK OF MATRIX, (ii Linearly independent Set of Vectors Any set of vectors, which is not linearly dependent, is called linearly independent. Or A set Vi, V2 5 V, of n-vectors is said to be linearly independent if every relation of the form piVit p2V2+...+pN,= O implies p, =p; Working Method to Determine L.I. or L.D. Set Method I: Let V;, V2,.... V, be given n-vectors, Consider the relation DV, + B2Vp tmnt pV, =O If this relation implies p, = p =. p, = 0, then the given set of vectors is Lil Ifabove relation gives p,, p,..- P, not all zero, then the given set of vectors is L.D. Method II : If determinant formed by the given vectors is not zero, then given vectors form a L.L. set, If the determinant vanishes, then given set of vectors is L.D. set. inear Combination of Vectors A vector V is said to be a linear combination of the vectors Vi, V2, LUSTRATIVE EXAMPLES} Example 1. Is the system of vectors [—1, 1, 2], 2, -3, 1], [10, ~1, 0] linearly independent or dependent ? Vif V = py Vit pa Va t one + Py Vey Where Pr, Pos -o Pyare scalars. Sol. Given vectors are V,=[-1, 1,2) V2= (2, -3, 1, Vs =[10, -1, 0] Consider the relation KV, + kyVq + kgV3 =O or ky [=1, 1,2] + ky (2, -3, 1] + 3 [10, -1, 0] = [0, 0, 0] = ky +2k, +10k; =0 0) ky-3 ky o 2k, +hy =0 ) From (3), ky =- 2h from (2), > ky +6 ky ~kyfrom (1), —k 44, + 70k, AV + AaVo + hgV3 OF hy = ky = hy given set of vectors is LI. Example 2. Examine the linear independence or dependence of the rows of the matrix A = hence find its rank. Sol. A=/1 0 2 |Al= a 2 4 1 1 =3(0+2)-2(-1-2)+4(¢-1-0) =3@)-2(-3)+4C1)=6+6-4=8 20 Ais non-singular matrix. three rows of A are L.I. rows of matrix A form a L.I. set pA) =3. Example 3. Examine the linear independence or dependence of the system of vectors (2, — 1, 3), (8, 2,0) and (0, 1, - 2). Find relation between them. Sol. Given vectors are Vi = @,-1,3), V2 = (8, 2,0), V3 = (0, 1,-2) Consider the relation KV, + V2 + V3 =O or ,(2,-1, 3) +k, (8, 2, 0) + ks (0,1, 2) =(0, 0, 0) (2k, +8 ky, —ky +2 ky + ky, 3 ky ~2 ky) = (0,0, 0) eal) a) GB) > 2h +8k, =0 ~ hy t2ky thy =0 3h-2k, =0RANK OF MATRIX 31 “em From(1), 2k=-8k; > ky=-4ky @ ky = From(3), 24; =3k, = b= 3h, Take all the three equations (1), (2), (3) are satisfied when ky =4, ky =-1, ky =6 Vis Vin Vs ive. (2,~ 1, 3), (8, 2, 0), (0, 1, —2) are linearly dependent Relation between them is 4V, -V, +6V, =O EXERCISE 1 (d) 1. Show that the vectors (3,2, 4)‘, (1, 0, 2)‘, (I, -1,—1)' are linearly independent, where ‘r’ denotes transpose. 2. (i) Show that the vectors (1, 1, 1), (I,— 1, 1), G,—I, 3) are linearly independent. (P.T.U. 2012) (ii) Show that the vectors (1, 2, 1), (2, 1, 4), (4, 5, 6), (1, 8, -3) are linearly dependent. (P-T.U. 2010) 123) 3. Show that the column vectors of the matrix A = [ 21 } are linearly dependent. |. Show that vectors (k, 1, 1), (0, 1, 1), (&, 0, &) in R? are linearly independent for all non-zero values of k. 1 (P.T.U. 2010, 2012)2 SYSTEM OF LINEAR EQUATIONS 2.1. Consistency and Solution of Linear Equations The system of linear equations yp Ay + OY XZ + +t Ay Ly = Dy yy Xy + py Xz +... + Oy Xp = by Gig 1X1 + Og 282+ oes + Opn y= Dp isa set of m linear equations in m unknowns x, , x, « sXe The above set of linear equations can be written as a2 x ay ay xy] mt Im 4mm yy. Oy 4 a, 4, 4%, », ie, AX =B where A=| 9?! “7? 2 2 Gm nz Gan} Le] [by The matrix A is called the coefficient matrix. The matrix [AB] is called the augmented matrix for the equation AX = B. The above system of equations is known as a system of Non-homogeneous Linear Equations. If B = O, then above system of equations becomes AX = O, which is called a system of Homogeneous Linear Equations. 1. Any set of values x1, x), . of the system. + %n hich satisfy simultaneously the m equations is called a solutios 2. A system of equations, which has a solution, is called consistent or compatible. If the system doe not have any solution, it is called inconsistent. Consistent Equations : A system of equations having one or more solutions is called a consisted! system of equations. Inconsistent Equations : A system of equations having no solution is called an inconsistent system of equations. . oe ———— 32SYSTEM OF LINEAR EQUATIONS 33 SE SS 2.2. State conditions under which a set of homogeneous equations possess a (i) trivial solution or (i non-trivial solution, why ? Proof : Let there be m equations in m unknowns. So the coefficient matrix A is of type m x n, Let r be rank of A. Noweither r R.-3R, o 1 -4{Lz] Lo| SYSTEM OF LINEAR EQUATIO’ 7 a 1-2 1)fx 0 0 5 -1]}} y}=| 0}, by Ri>5Rs o 5 -1}[e 0 1 -2 I x 0 0 5 -1}] y=] 0 |, by R>Rs-R> 0 0 ojl: 0 x-2ytz as 4 Ht Sy-z=0 = Synz @yage 2 eka, 3 Put 2=k solutions are Example 3. Discuss for all values of , the system of equations Gk-8)x+3y+32=0, 3x+GK-8)yt32=0,3x4+3y+(3k—8)z2=0 Sol. The given equations are Gk-8)x+3y+32=0 3x+Gk-8)y+3z2=0 3x+3y+(Gk-8)z=0 which can be written as 3k-8 3 = x 0 3 3k-8 3 yf=lo 3 3 3k-8 4] 2 0 3k-8 3 3 Let A 3 3k-8 3 3. 3k-8 3k-8 3 3 IAl=| 3) 3k-8 3 3 3 3k-8 3k-2 3 3 =|3k-2 3k-8 3 |, by Cy > C+C,+C, 3k-2 3 3k-838 Mane 1 a 3 i 3 fb » 4 : W200 34-1) RRR RL RR © o we t-atay sds try-ee ae Now the following ance ae Ld Oe ba TT nem me coven set ot solution In this case the oanzne oe Cate i totem a to Here Aa 6 4 and Mo fw 2 4 there cxats 2 mince of cede F of Nowihacs dare soe wanes waar > the given set of equatoe Matoats } Dj bmeah makepenient sohaton u C Case HL IE thea A> 33 3 3 3 A Vand alwo every minor of order 2 vannhes p(AY Las minor of order | ic the clement’ are non. rere < the given set of equations has only 31-2 lmcarfy mdependent wiutions Example 4. Solve completely the system of equanons x7 y-2=0. O.35 Sye4 Sol. The given equations are x y-r-0SYSTEM OF LINEAR EQUATIONS, which can be written as toro 2 -1 -3 30-504 1oi7 4 Pood 0-3-5 0-8 1 0 6 3 1 ot 0 -3 -5 0 -24 «3 0 48 «9 boro4 9 -3 -5 0 0 43 0 0 89 boro 0, -3 -5 0 0 43 o 0 0 Now rank of A= 3,1 =3 given system of equations has 3 ~ 3 = 0 linearly independent solution. there is only trivial solution x = y 2Ri, Ri > Ry Ry 3Ry «by Ry > ~ 8Rs, Ry + 16Ry 89 1e- = Ry .byR a noe 0. 1-4 7 ] Example 5. Check the system of linear equations given by | 3. 8-2 | 7 -8 26 | or not if consistent, then find solution of the system, Sol. The system of given equati 1-407 3. 8 -2 7 -8 26 jon is x y|= eo oe BR Ri > Ry 39 AX O} R, 8 is consistent | (P.T.U. 2017)= SrecTRUM ENGINEERING MATHEMATICy, 1-40 7)7fx 0 20-23 |} y |= | ~18 J, by Ry + R:—3Rn Rs RTH o 2 -23\/2] | -s3 as » by Ry * Rs Ro He at 0 0 ojlz -35 1-4 1-4 7 8 Nowrank of | 0 20 ~-23 | is2whilethatof | 0 20 -23 -18 | is3. o 0 0 0 0 0 -35 given equations are not consistent. Example 6, Determine the system x+y+z=3, 3x-9y+2z=-4, Sx-3y+42=6 is consistent find the solution, if the system is consistent. (P-T.U. 207 Sol. The given equations are which can be written as 1 1 ij[x 3 3-9 2||y|=|-4 5-3 4} [2 6 1 1 ifx 3 o -12 -1|} y | =| -13 [by R,>R,-3R),R;>R;-SR, o -8 -1|| 2 -9 1 1 Ofx 3 o -12 -1|] y |=] -13],byR;>3R, 0 -24 -3|| = -27 1 1 fx 3 o -12 -1]| y |=] -13 |, by R; 9R,-2R, 0 0 -1}] z -1 roid 111 3 Now rank of |0 -12 -1| aswellasof |0 -12 -1 -13] is3 0 0-1 0 0-1 -1 given equations are consistent and solution is given by‘SYSTEM OF LINEAR EQUATIONS 41 2-13 = -12y=-12 * y= 3 ex=l solution is x=1, y=1, z Example 7. Test the consistency of the system of equations xt2y-z=1, 3x-2y+2z=2, 7x-2y+3z=5 and if consistent then solve it completely. (P-T.U, 2018) Sol. The given equations are xt2y-z=1 3x-2y+22-2 Tx-2y+32=5 ‘These equation can be written as 1 2 -1/[x 1 3-2 2/|y]=|2 7-2 3i[z 5 eee ele o -8 Ssilyl= 0 -16 10]} z ede | lee 1 or jo -8 5|| y|=|-1|,by R,>R,-2R, 0 0 offz 0 1231 12-11 Now rankof |0 -8 5] aswellasof}0 -8 5 -1| is2 0 0 0 0-0 0 0 given system of equation is consistent. Also x+2y-z=1 1 ~8ytSan-1 @ ym 1452 % ym ates is complete solution,NGINEERING MATHEMATICS, = SPECTR Example 8. Test the following system of equations for consistency and solve xt2ytz=3, 2x+3yt2z=5, 3x—Sy+52=2, 3xt 9-274 (P-T.U. 2016 Sol. The given equations are xt+2ytz=3 Qx+3y+22=5 3x-Sy+5z 3x+9y-z which can be written as x yle= z sby R,9R,-2R,,R,R,-3R,.R, OR, -3R, ooo the roe nS OW 0 ty ey cocoon ° 3 * =, *1= sby R, 9R,-1IR,,R, 9R, +3R, z 3 *) faa : =| 4 [ety Ry OR, +2, z o| - cocoon onon 121 3 0-10 -1 ll as of is melt ag a 0 00 0 00 0 given system of equations is consistent and solution is given by xt2yt+z2=3 -y=-lsyel 22=4 = 7=2 x+24+2=3 ex=-1 : solution is x=-1, y oon ' Noe Now rank ofSYSTEM OF IATIONS, 43 aavae oS Example 9. Use the rank method to test the consistency of the system of equations xt2y+2=2, Sxt+y—2z=1, 4x-3y—2=3, 2x+4y+22=4, if consistent, then solve it completely. (P.T.U. 2016) Sol. The given equations are xt2y+z=2 3xty-22=1 4x—3y-2 53 Qxtdyt22=4 which can be written as | Teer ean | Satie) ja | ee ee 2 4 2fb7s fa Teo 2 o -5 -35||* |_|] -s o -u -s||7 |>] -s : 0 of L? 0 12 2 — fo -5 -5}}* | _]-s “Jo -6 off 7] ] 0 | o o ofl” 0 fae) ee Nowrankor|° ~> ~5) sswettasof|? > ~> ~?]iss 0-6 0 0-6 0 0 0 0 0 0 00 0 given system of equations is consistent. xt2ytz=2 -5y-5 —6y=0 = y=0 0-Sz--S oz xt0+1=2 @x=1 solution isx=1, y=0, z= 1.Example 10. Use the rank method to find the value of A for which the system ‘of equations Bx-yt42=3, x42y-3 2 6x+Sy44z~—3 has (unique solution (ii) infinitely many solutions. Determine the soution in each case | Determine the solution in each case. (P.T.U. 2016) | Sol. The given equations are | Bx-y+4z= 3 x+2y-3 6x+Sytdz | which can be written as | 3-1 4][x 3 | 1 2 -3/| » |=] -2 | 6 5 Aallz -3 1 2-3] [x -2 3-1 4}]y]=] 3 6 5 Alle -3 ie 3) |x -2 0-7 13/]} y| =| 9 |,byR, R,-3R,,R,>R,-6R, 0-7 a+is}| = 9 1 2 -3|[ x -2 0-7 13/| y]=] 9 |,byR,>R,-R, O 0 4e5i2 0 This system of equations has unique solution 1 2 -3 i |0 -7 13/40 [+ AX=B has unique has when | A | # 0] 0 0 A445 ie. if -7G+5) #0 ie. if Ae-S In this case, solution is given by 7 x42y-32=-2 " -Ty+132=9SYSTEM OF LINEAR EQUATIONS 45 ——_SYSTEM OF LINEAR EQUATIONS 0S -Ty+0=9 oyn-3 18 ‘ an 4 unique solution is x= =, y If A=~5,wehave 1 2 -3|[x -2 0-7 13/|y]=| 9 0 0 Ojjz 0 1 2 +3 1 2-3 -2 Now rank of |0 —7 13| aswellasof]O -7 13 9] is2 0 0 0 0 0 0 0 given equations have infinite solution. These are given by xt2y-32=-2 _ 132-9 —Ty+13z=9 = 7y=132-9 > y= 7 x4 218 5 a8) wo xn3z- 262718 paisa 26 z= 7 Take z=k 4-5k 13k-9 77 , 2=, where k is a pararneter. ‘xample 11. For what value of r, the system of equations x—2 y a (f) no solution (if) unique solution (i) infinitely many solutions. ol. The given equations are x-2y- 3x-yt22=1 Oxtytrz=1SPECTRUM ENGINEERING MATHEMATICS-1 which can be written as 2 el (ex -1 3-1 2]/yf=fa o 1 rile 1 or AX=B -2 -1 -1 30-1 «cof? i lor a 1 2 32 IA] =]3) -1 2 | i |-als o ler 7 7 =1(-1r-2)+2@Gr-0)-1G -0)=-r-2+6r-3=5r-5 The given system has unique solution if | A | #0 ie if Sr-5#0 . = r#l When 1-2 -1 -1 [AB] =|sie 1) pe 1 v t t ~|}0 5 5 4], byRe>R.—3Ri 1’ 1 v tL L 10-2 -1 -1 ~|}0 1 1 1), byR3>R3-SRz 0 0 0 =I 7 | | p(A)=2 and p[A B]=3 given system is inconsistent. It is clear that for no value of r, the given system has infinite solutions.SYSTEM OF LINEAR EQUATIONS 47 Example 12. Investigate for what values of a, b the following equations xty+$2=6,x+2y+3az~b,x+3ytaz=1 have 1. no solution 2. unique solution 3. an infinite number of solutions. Sol. The given equations are xtyts x+2y+3az—=b xt+3ytaz=1 which can be written as 11 5 x 6 ie, AX=B where A=|1 2 3a],X=| y |,B=| 6 13 a z 1 The given equations will have a unique solution. 141s if 1 2 3al%0 13 a 11 os - he, if}0 1 3a-5| #0, byR:-*R2—R,,R3*R3-R, 0 2 a-s 1 5 i 0 1 3a-S | #0,byR,+R,-2R, 0 0 ~Sa+s » if -Sa+5#0 ie, ifa¥l given equations will have a unique solution when a # 1 and b has any value. When a=1,SPECTRUM 11s ~ JO 1 =2], byR:*R2-Ri,Rs>Rs-Ri 0 2 -4 14s ~ |o 1 -2], byR,+R)-2R, 00 0 p(A)=2 1 5 6 [A B]=/1 2 3 6 13 1 11 5s 6 ~|0 1 -2 6-6], byR,->R2—Ry,Rs>Rs-R, 02-4 -5 11 5 6 ~|0 1-2 6-6], byR;+R,-2R, 0 0 0 ~26+7. Rank of (A Blissif b= 2 *. rank of A and[A B] are not equal if b + 2 a ; , ‘5 . 6 # =, the given set of equations does not have any solution. If a=1, b= :. the given system of equations has an infinite number of solutions. Example 13. Investigate for what values of k, A the simultaneous equations xtytz=6,x+2y+32=10, x+2y+hz=A, have (H no solution (i) a unique solution (iif) an infinite number of solutions. Sol, The given equations are xty+z=6 x+2y4+32=10 x+2ytke=2 « then the ranks of A and [A B] are equal and A is singular. \G MATHEMATICS-II (P.T.U, 2018) OS‘SYSTEM OF LINEAR EQUATIONS 49 which can written as 11 ifx 6 12 3]|y]}=[10 12 k|z a 11d 6 ie, AX=B where A=|1 2 3],B=| 10 12k a (i) The given equations will have a unique solution 11 tio 2 3) 0ie,it}o 1 2 | #0 2k 01 k-1 ie, Ifk-3 #0 ie, ifk# 3 if k # 3, the given set of equations has a unique solution, no matter what is the value of 2. @ Take k=3 1 1 A=|1 2 3 2 t oon 6 g 2 ‘ 2 1 P 2 + 2 1 2 ~|0 1 2],byR;+R,-R 000 p(A)=2 1 11 6 [A B]=|1 2 3 10 123 yp rank of[ A B]is3ifa #10.50 SPECTRUM E rank of Aand [AB Jare not equal if + 10, if k=3 and # 10, the given set of equations does not have any solution. Case III. if = 3,4 = 10, then ranks of A and [AB J are equal and A is singular. the given system of equations has an infinite number of solutions. Example 14. Using matrix method, find the values of 4 and 1 so that system of equation Qx-3y+S2=12,3x+ pthe =myx-7y+82=17 has (i) a unique solution (ii) infinite solutions and (iii) no solution. Sol. The given equations are 2x-3y+52=12 3xt ythz =p x-Ty+82=17 which can be written as 2-3 Ss]fx] fiz 3001 Ally lela 1-7 8jlz]} L17 2-35 12 301 AlBe| a 7 ie, AX =B where A 1-7 8 2 -3 5 (a The given equations will have a unique solution if]3. 1-2) #0 1-7 8 Al.}3 af..f3 1 3 5 alfa alt | -7/7° ie, if2(8+74)+3 24-2) +5(-21-1) #0 ie, if 16+144+72-34-110 #0 ie, if 14-22 #0 ie, if #2 if # 2, the given system of equation has a unique solution, no matter what is the value of (ii), (ii) Takeda =2 2-35 Aats) 1) 2 1 7 8 NEERING MATHEMATICS-IIpita) [A B] ° 1 0 22 -22 w-Si|,by R; >R,-+ Tan 2 0 -7 0 31 8 2|, byRi Ry 5 8 -22 |, by Ry > Ry—3R3, Ry > Rs —2R, -il =I1}, by Rr Ry -22 = 11 |, by Ry > Ry—2Ry 8 17 17 sbyR eR; N ® 12. 8 7 -22 w-SI],by R, >R,-3R,, -Il -22 ety 0 Rank of [A B]is3 if ¢ #7 if A= 2, # 7, the given system of equations does not have any solution. If A=2,4=7, then the ranks of A and [AB] are equal and A is singular given system of equations has an infinite number of solutions.ING MATHEMATICS-I 32 SPECTRUM ENGI vxtdy+10z=/7? havea Example 15. For what value of the equationsx +y+z=1, x+2y+4z solution and solve them completely in each case, Sol. The given equations are xtytzel a xt+2y+4: x+4y+10z which can be written as 11 1)fx 1 12 4/}y]=] a 1 4 wl: Re 11 iyfz 1 ie [0 1 3] /y]=| 2-1 |,byR,>R2-Ry,Rs>Rs—Rr 0 3 9}l= R-1 ria 1 ie |0 13]}y]=| A-1 |,byRs>R:-3Re 00 0}: B-3A+2 if A= 1,2 as in that case rank of The given equations have a solution if 47-3 2+2 =0 1 1 1 is same as that of | 0 3 a-l 1 1 0 0 0 #-3A+2 oun 1 1 0 oon given equations are consistent for 4 = 1, 2. Case I. If = 1, we get, rod x 1 Ot) Sly ie) 0 0 0 oflz 0 is the solution of given equations. 1 x yyq}t z Case I. 1f4 =2, then | 0 1 1 0 0 e xtytze yr3z=1SYSTEM OF LINEAR EQUATIONS, 53 wz, 2522 Let x=2a, y=-1—3a, 2= ais the required solution. EXERCISE 2 (a) 1, Show that the only real value of 4 for which the equations x+2ytz=Ax, xty+2z= equations for A = 4. y, 2x+y+z=Az have a non-trivial solution is 4. Also solve the 2. Ifequations x= cy +bz, y=az+cex, 2=6x+ ay havea non-trivial solution, then show that the solutions are given by x=AvI-a?, y=A Vi-b? Vi-c? where d is any real number. 3. (a) Find the value of such that the system of equations xtky+32=0, 4x+3y+kz=0, 2x+y+22=0 has non-trivial solution. (®) Determine the value of so that the equations 2x+y+22=0,x+y+32=0,4x+3y+Az have non-zero solution, “102 1]fx 4. For what value of A, does the system | 3 -1 2] y | =Ohas o 1 alle @a unique solution (ii) more than one solution. 5. For what values of 4 do the equations ax+by=Axand ex+d) x=0, y=0. i y have a solution other than 6 (a) Using matrix method, test for consistency, the system of equations 1 -3,6y-182=~-1 are not x-4y472=8,3x+8y-22=6,7x-8y +262 (6) Show that the equations 2x+6y=-11, 6x+20y-6 consistent. (© Test for consistency the equations 2x-3y+7z=5, 3x+y—3z 3, 2x+ 19 y—42=32, (P-T.U. 2012) 7. (@ Solve the equations x—y+2=5,2x+y-z=-2,3x-y-z=-7, (®) Use the rank method to test the consistency of the system of equations 4x-y=12, -x-Sy2z=0,-2y+4z=8 (P.T.U. 2012) (© Solve the following equations : @ x+y+2=6,x-ytz 2xty- (i) Axty-z2=0, x-y+32=8, Wt2yt2-9 (@ Examine the consistency of the following equations and if consistent, find the complete solution x+2y-293, 3x-yt2z=1, 2x-2y4310. i 12. 13. 14. 15. (a) Examine the consistency of the following equations and if consistent, find the complete solution 4x—2y+62=8, x+y <1, ISx-3y+92=21, (5) Show that the system of equations x + y+z=4, 2x+Sy-2z consistent and solve it 3, x+Ty-72=-6is (c) Show that the system of equations, 3.x +y— consistent and hence solve them. I, Sxt2y+3z2=2, Bx+3y+22=3 js (d Examine the consistency of the following equations and if consistent, find the complete solution x-y+22=4, 3x+y+4z2=6,x+y+ (c) Find whether the following system of linear equations is consistent and if so, solve it : Sx+3y+7 -3x+26y+22=9,7x+2y+102=5 (a) Solve completely the equations | xty teal xt2y +3204, xt3yt52=7, xt4yt72=10 (b) Show that the following equations are consistent and solve them : () x+2y- (i) x42 =5,2x+3y w4x-Sytz=-3 (a) For what value of k the system of equations x+y +2=2, x+2y+z=-2,x+y+(k-5) has no solution ? (P.T.U. 2012) (b) For what values of A, does the equationsx+ y +42=6, x+2y-22=6,Ax+y+ 276 have (i) unique solution (if) infinitely many solutions. Investigate for what values of 4, the simultaneous equations xeytr=6, x+2y+32=10, x+2y+Az=p, have (i no solution (i) aunique solution (i) an infinite number of solutions. For what value of k, the equations x+y +z=1, 2x+y+4 solution and solve them completely in each case ? k 4xty+10z= k? havea Show that the equations 3x+4y+Sz=a, 4x+Sy+6z=b, Sx+6y+72= cdo nothavea solution unless a+ ¢=26. (P.T.U. 2011) Show that the equations -2x+y+z=a,x—2y+z=b,x+y—22=c haveno solution unless a+ b+c=0, in which case, they have infinitely many solutions. Find these solutions when a= 1, b= 1,e= —2. ey Investigate for what values of a, b the following equations x-2y+32=1,x¢y-z=4, 2x-2ytaz=b a have 1. no solution 2. unique solution 3. an infinite number of solutions.SYSTEM OF LINEAR EQUATIONS ———————SSFSFSOFOeEFSFSFSFSSSSSSSSSSSSSSSSSS ANSWERS x= ky y= ky2= k, where k isa parameter. > 3. (a) fa (b) A=8 4) LEN (ARN 5. 2=a,b=0;A=d,c=0 6. (a) inconsistent (c) inconsistent 48 7. (a) x=1,y=3,2=7 () x © Ox=1y=2,2=3 wo Syed, 8 (a) x=1,y=-24+3h2=k (© x=Sky=-l4k+1,z=k 16,7 k a= eZ, yak Oxy i 9. (@) x =-2 +k, y=3-2k z=k ® @ x=-1y=42=4 xh 3 3 10. (a) k=6 () (Ae z (ii) for no value of A ll. (@A=3, 4410 (i) A#3 (iif) A=3,u=10 V2. k= 1,2; x=-32,y=14+24,2=2; x= 1-30-20 14, x=k-1, y=k-1, z=k 15. a= bea Ww a ©, pany value (i) aX ee mn Method Gaussian elimination method is an exact method which solves a given system of equations in n unknowns by transforming the coefficient matrix into an upper triangular matrix and then solve for the unknowns by back substitution. 2.7. Gauss-Jordan Elimination Method Let AX = B be a given system of m non-homogeneous equations in n variables and r be rank of coefficient matrix A. Write the augmented matrix [A B]. Apply elementary row operations on both A and B such that a reduces to the normal form 1, . Then the solution is obtained without back substitution.SPECTRUM ENGINEERING MATHEMATICS-I ILLUSTRATIVE EXAMPLES Example 1. Solve the system by (i) Gaussian elimination method (ii) Gauss-Jordan method Qxty+4z=12 8x-3y+2z=20 4x+lly-2=33 Sol. The given equation are Qxty+42=12 8x-3y+22=20 4x+lly-2=33 which can be written as 2 1 4f[ x] | 12 8-3 2{| |=] 20 4 u-t[z 33 21 Alle 12 o -7 -14|| y |=] -28 |, by R, >R,-4R,,R; 9R;-2R, 0 9 -9}} 2 9 21 Ale 12 f ' A hy |= 4 sby Ry 9-7Ry Ry 9-9 ale 21 4) [x 12 0 1 2/{|y]=] 4 [by R; >R3+R, 00 3}}z 3 21 4}fx] [12 : 7 5Rs oo ils 1 2Qxty+4z=12 yt2znd 1 yt2=4 = y=2 Qxt2+4=12 or 2x=6 2 x=3 solution is x=3, y=2, 2=1SYSTEM OF LINEAR EQUATION 37 SYSTEM OF LINEAR EQUATIONS Gauss-Jordan Method 2:21, 0)) fx 8 0 1 O}| y}=/2|,byR,R,-4R,,R,»R,-2R, 00 1j;z 1 20 ojf[x] [eo 0 1 O/] »|=|2],byR,>R,-R, oo ifz 1 2x=6, y=2,2=1 x=3, y=2, z= 1 is required solution. Example 2. Solve the system by (i) Gaussian elimination method (if) Gauss-Jordan method 2x, 45x) +24,-3x,=3 3x, +6x, +54, +2x,=2 4x, 45x, 414x, +14, =11 Sx, +10x, +8x, +42, =4 Sol. The given equations are 2x, 45x, +2x,-3x, = 3x, +6x, +54, +22, 4x, +52x, +14x, +14x, = 11 5x, +10x, +82, 44x, =4 which can be written as 25) 2) 3\ 3 Be 6.52 |e elea 4 514 14]} x3] Ju 510 8 4] x, 4 2 5 2 -3)[% 3 1 Ss 8 S| 2 |e| a | ove R,-R, 4 5 14 14|| x, WL tie 510 8 4] x, 4 1103 sifx,] [-1 25 2-3//5/ 1 3) Ror, 4 5 14 14]] x, un 510 8 4] x, 4Siete) ioioie =) tenso cocoon econ See Ce ee cone -4 2 -7 enne -13 -21 x -1 ie 7 =] 45 frby Ry PRy-2Ry Ry PRy-4R,Ry HR, -SR, 9 -1 15 =] yf by RoR, 9 -l || =] gg [bY Rs PR3~3RaRy PRy-SRy 66 -1 Is 1 = by R, 9-—R 4a [tPY Bs P75 Ba -66 -1 “|e R,+17R. |G teed 2 -1 15 2R =| og [OY Rs P2Ry Ry 92K, 4 12 > x, =62 412-24 =15 or x, 4, +27+18+20 -1 or x,+65=-1 > x, 5 > x, 2 2 solution is x, =-66, x, =27, x3 =6, x47 Gauss-Jordan Method ooo- coo Soo Soon 4 13 0][ x -21 12 oll, |_| 39 6 lal sby R, 9R,-5Ry,R,9R, +6Rg Ry PR; +Ry 0 0 1\| x5 4 13 o]f x -21 12 o]| x 39 1 = sby R, 9oR. 0 1 ol] x (jel eras) oo 1| x, 4 1 10 olf x -39 10 oj] x, 20 ale cialis sby R, 9R, -2R,,R, 9R,-3Rs 00 1] x 4 0 0 olf x 66 10 0|| |e) 27 o 1o0l/x,] | 6 oe oo ily 4 66, x, =27, x, =6, x, =4 which is required solution. EXERCISE 2 (b) Solve the following system of equation by Gaussian elimination method and Gauss-Jordan elimination Method : 1. 2x- Ty+42=9 x+9y-62=1 —3x+8y+52=660 2x +x, +2, =10 xj 42x, 43x x +4x, +92; = 16 =Tx,43.x,45 10x, -7x, +34, +5, “6x, +8, —x, -4x, =5 3x, +x, +44, +11,3 VECTOR SPACES 3.1. Introduction : First of all we define field FIELD : A non-empty set F having atleast two elements with two binary compositions “+” and =." (ie. addition and multiplication) is called a field iff the following postulates (axioms) are satisfied. (A) Properties of Addition @ VabeF = atbeF [Closure Property] Gi) V ab cEF 2 (atb)tc=at(b+0) [Associative Property} (iit) Va GF, 30 EF such that [Existence of Additive Identity] a+0=a=0+a (i) V a © F,3 - a EF such that [Existence of Additive inverse] at+(-a) =0=(-a+a @) V4,b,EF > atb=bta {Commutative Property] (B) Properties of Multiplication @ VabeF aber [Closure Property] (i) VabcEF 2 albc)=(ab)c [Associative Property] (if) V a EF, there exists 1 EF such that 1.a=a=a.1 Here 1 is called unity of F. Gv) V a(# 0) EF, 3b EF such that a.b=b.a=1 [Existence of Multiplicative Inverse] Here b is called inverse of a. @) Va,bEF a.b= (©) Distributive Laws VabcEF a [Commutative Property] a(b+c) =a.bt+a.c (b+0).a =b.ate.a, ‘Now we consider another important algebraic system known as ‘Linear Veetor Space’ or simply Vector Space. The definition of vector space involves two sets, the set of vectors V and the set of scalars F (which is always a field). We shall be using two operations in the definition of a vector space, one is internal composition on the elements of V and the other is an external compos by the elements of F. We shall now define these compositions. eee er 61 fion on the elements of V— SPECTRU BINARY COMPOSITIONS Def. 1. Internal Composition : Let A be a set, then the mapping f: A X A + A is called interna) composition in it. For example () Let A=R, the set of all reals If f:R X R~ Ris defined as f(x,y)=xy W (xy) ERX R; x,y are reals. Then fis internal composition in R. (if) Let A= set of all m x matrices over reals. If f:A x A> Ais defined as f(P, =P +Q, V (P,Q) EA XA; P, Qare nx n matrices over reals. Then fis an internal composition in A. Def. 2. External Composition. Let A and F be two non-empty sets. Then a mapping f: AX F > A is called an external composition on A by the elements of F. For example. Let A= set of all n x matrices over reals F = set of all reals, If f:A x F > Ais defined as (P, A) =kP forall PEA and kEF where & P means the multiplication of matrix P by scalar k. Then fis an external composition in A over F. 3.2. Vector Spaces Def. 3. Vector Space. Let (F, +, -) be a given field and V be a non empty set with two compositions, one is internal binary composition on V, called addition of vectors and is denoted by + or ® and the other is external binary composition on V by the elements of F, called scalar multiplication and is denoted multiplicatively, then the given set V is called a vector space or linear space over the field F iff the following axioms are satisfied. L PROPERTIES OF ADDITION : Acl Closure Property: V x,y EV Wehave x+yEV ‘A-2 Associative Property. V x,y,z EV we have (x +y)+z=x+(y +2). A-3. Existence of Addative Identity. There exists an element 0 € V such that x+0=O+x=x VxEV Here 0 is known as zero vector in V or addative identity.Vecror sp. ‘A-4_ Existence of Addative Inverse. For each element x € V, there exists an element —x € V such that x+(-x)=0=(-x)t+x ‘The element — x is called addative inverse of x. A-S Commutative Property. W x,y €V We have x+y=y+x. I. PROPERTIES OF SCALAR MULTIPLICATION M-l. WV @EF, x€V wehave axeV M2. V a,BEF, xEV wehave(2+f)x=ax+px M-3. V a@&F, x,yEV wehave a(x+y)=axtay 6x) M-5. Vx V, wehave 1.x=x where | is the unity element of F. M-4, V a, EF, x€V wehave (aA) Remarks : 1. The properties A-1 to A-S imply that V is an abelian group under +. 2. We may not always explicity mention the operations on V and F. Generally, we shall be writing “V is a vector space over F” or “V (F) is a vector space.” 3. The zero element of V is written as 0 in bold type and the zero element of F is written as 0. Generally, we shall use x,y,z... for elements or vectors of a vector space V and a, f,y...... for elements (scalars) of the field F. 5. Let V = {0} be a trivial group and F be a field. We define @0=0 VaEF Then vector space V (F) is called a rational vector space or a real vector space or a complex vector space according as F is the field of rational numbers or the field R of reals or the field C of complex numbers. ILLUSTRATIVE EXAMPLES) Example 1. Let R be the field of reals and V be the set of vectors in a plane, Show that V (R) is a vector space with vector addition as intemal binary composition and scalar multiplication of the elements of R with those of V as external binary composition. Sol. Given V={(,y) |x,» ER} (The elements of V are ordered pairs as V is a set of vectors in a plane) Here, we define addition of vectors in V as (x, y) + (1, 2)=(x +4 y +z). for x,y, 4.2 © Rand the scalar multiplication of a © Rand (x,y) € Vas a(x,y)=(@x, ay).= SPECTRUM ENGINE! BINARY COMPOSITIONS Def. 1, Internal Composition : Let A be a set, then the mapping f: A x A + A is called intemay composition in it. For example () Let A=R, the set of all reals, If f:R XR Ris defined as f(x,y)=xy V (x,y) ERX R; x,yare reals. Then fis internal composition in R. (ii) Let A= set of all n X n matrices over reals. If f: AX A= Ais defined as f(P, Q)=P+Q, V (P,Q EA XA;P, Qare 1X n matrices over reals. Then fis an internal composition in A. Def. 2. External Composition. Let A and F be two non-empty sets. Then a mapping f: A X F > A is called an external composition on A by the elements of F. For example. Let A =set of all n X n matrices over reals F = set of all reals P forall PEA and KEF If f:A X FAs defined as f(P, k where &P means the multiplication of matrix P by scalar k. in A over F. Then fis an external compositi 3.2. Vector Spaces Def. 3. Vector Space. Let (F, +.) be a given field and V be a non empty set with two compositions, one is internal binary composition on V, called addition of vectors and is denoted by + or ® and the other is | external binary composition on V by the elements of F, called scalar multiplication and is denoted multiplicatively, then the given set V is called a veetor space or linear space over the field F iff the following axioms are satisfied. I. PROPERTIES OF ADDITION : A-1 Closure Property : V x,y €V Wehave x+yEV A-2. Associative Property. V x,y,7€V we have (x +y)+z=x+(y +2). A-3. Existence of Addative Identity, There exists an element 0 € V such that x+0=O+x=" VxEV Here 0 is known as zero vector in V or addative identity. |Wecronsraces A-4_ Existence of Addative Inverse. For each element x € V, there exists an element —x € V such that x+Cx=0=Cxtx The element — x is called addative inverse of x. A-S Commutative Property. V x,y€V We have x+y=y+x. Il. PROPERTIES OF SCALAR MULTIPLICATION Mel. V @EF, xEV wehave axEV M2. V a,BEF, x€V wehave(a+f)x=ax+px M3. V a@&F, xyEV wehave a(r+y)=axtay M-4. V a,B EF, x EV wehave (af) x=a (6x) M-S. Wx @V, wehave 1.x=x where 1 is the unity element of F. Remarks : 1, The properties A-1 to A-S imply that V is an abelian group under +. 2. We may not always explicity mention the operations on V and F. Generally, we shall be writing “V is a vector space over F” or “V (F) is a vector space.” 3. The zero element of V is written as 0 in bold type and the zero element of F is written as 0. 4. Generally, we shall use x,y,z... for elements or vectors of a vector space V and @, 8, ...... for elements (scalars) of the field F. 5. Let V = {0} be a trivial group and F bea field. We define @0=0 WV a@€F 6. Then vector space V (F) is called a rational vector space or a real vector space or a complex vector space according as F is the field of rational numbers or the field R of reals or the field C of complex numbers. ILLUSTRATIVE EXAMPLES Example 1. Let R be the field of reals and V be the set of vectors in a plane, Show that V (R) is a vector space with vector addition as internal binary composition and scalar multiplication of the elements of R with those of V as external binary composition. Sol. Given scalar multiplication of a € Rand (x,y) € Vas a (x,y) V= {(@,y) [x,y ER} (The elements of V are ordered pairs as V is a set of vectors in a plane) Here, we define addition of vectors in V as (x, y) + (2) =(x + hy +2). for x,y, 4,2 © R and the64 SPECTRUM ENGINEER! 1. Properties under addition . O22) EV A-L Closure. Let (x1. PU WER 2 tnt wER Gy) + G2 a2) = Gitar rity) EV. > Vis closed under addition. A-2 Associative. Let (1.91), G22). 3.98) EV Now [61 ,91) + 2,92 )] + 3,95) = [Or +42, +92] + Os Ws) = (Gi +22) +35, Cnty) +95) = Ort Ge tas ont C2 +95) [+ Associative Property hold in Reals] = 1.91) + G2 $35.92 +95) = 61.91) + [G2.32) + 03,98)] > addition is associative in V. A-3_ Existence of addative identity. For all (x.y) © V, there exists (0,0) € V such that (x,,y1) + (0, 0)= (i +0, 1 +0)= (1,91) and (0,0) +(x ,91) =@+1,0+1) =@i.y1) > (0,0) is addative identity in V. A-4 Existence of addative inverse. Let (x,y) be any element of V = Gu ey [Since x,y Reals > - Now (,y) +(x, -y)=@+C2), ¥+ Cy) = (0,0) and (-x,-y)+@y) =Cxtx,-y+y) = (0,0) ' G&N+Cx-Y) =O.0=Cx-y)+@y) => (—x,-9) is the addative inverse of (x, y) for each (x, y) € V. Let (1,91), G22) EV 4 A-S Commutative. Now (x1 591) + 2.92 )= Oi +325 + ¥2) eQatm, ty) [+ addition is commutative in reals] =G2.92)+ Or, Hd = addition is commutative in V.VECTOR SPACES 65 IL. Properties under scalar multiplication. M-1 Leta ER, (%,») EV; YER Then @ (x, y) = (ax, ay) ev [v @€Rand x4yER > ax,ayER] M-2 Let @ER and (x1,91), (42,2) EV Now ali) +@2.y)=alete, n+y)) = Git), a(t) =@xtan, ayitayr) =x ,ay1)+(@x,ay2)=a (x,y) +e (2 +¥2)- M-3 Leta,BER and (,y,)EV Now (@+B)@i.91) =(@+A)x1, +B) )=@n+Pu, ayi+By) = Gx .ayi) + (Bx, By )=@ (er, y1) +B (191). M-4 Leta, BER and (x,y) EV Now (@B) (>) = (@A)x, (a A)»)= (a (Bx), (By) =a(BxBy)=2(B &y))- M-5 Let 1ER and (4, ,)EV Now 1.64 ,91)=(1-xn 1.91) = Gs yi) Hence V is a vector space over R. Note : A plane vector is an ordered pair (x, y) of reals. The plane vector (x, y) and the directed line segment OP where O is origin and P< (x, y) are same ie. OP =(,y). Example 2. Let R be field of real numbers and V be the set of all ordered pairs (x, y) where x, y are reals. Define (x1 »¥1) + @as¥2)= Gi tx2, ity) V (1,91), 2.92) EV and a (1.91) =(@x.¥,) for @ER and (x, 1) € V. Show Vis not a vector space under the above defined operations. Sol. Given V = {(x, y) |x,» © Reals} I. Properties under addition. The properties A-1 to A-5 under addition are satisfied under the above defined operation ‘addition’ (Proof of properties is same as in Example 1.) I. Properties under scalar multiplication, M-1 Let (xy) V 3 x,y are reals Leta@ER Then a (x,y) =(ax,y) EV C vER > axyER]Ee = SPECTRUM ENGINEERING MATHEMATICS.11 et M-2 Leta, € Rand (x,y) EV Then (a +A)(x,y) =((a+B)x,y) {by def. of scalar multiplication as defined in statement) =(ax+Pxy) ol) and a(x, y) +B (x,y) =(ax,y) + (Bx,y) =(ax+fx,2y) 22) | From (1) and (2) (a + f) (x,y) # a (x,y) + B (x, ») in general. Thus V is not a vector space over reals. Example 3. Let V be set of all real valued continuous (differentiable or integrable) functions defined in closed interval [a, 6], Then show that V is a vector space over R with addition and scalar multiplication defined as (f+ g)(z)=f(x)+ ge) VW f,gEV and (af)(x)=af(x) VaER, SEV. Sol. Given | V = {/(fis real valued continuous function defined on (a, b]} L._ Properties under addition Acl. Closure. Let ,g€V = f.g.are real valued continuous function on {a, b] and (f+ g) (x)=f(x) + g(x) V x € [a, 6]. Since f(x) and g (x) are real valued continuous functions on {a, 6] and sum of two real valued | continuous functions is a real valued continuous function sof (x) + g (x) is a real valued continuous function on [a 5) = (f+ g) (2) is areal valued continuous function on [ab] > f+g€V forall £gEV Thus V is closed under addition. A-2. Associative. Let f, g,h © V and x € (a, b} Now [(f+ g)+ A] @) =(f+ 9) (x) +h) =(fG)+g@)+h@) =£)+ [g) + 4G] | [-» SG), g Ge), h (%) are reals and associative property holds in reals] =sG)+@+h@) -U+ eth] @ ¥ x€ [ad] f+ athe f+ th) v. > addition is associative A-3. Existence of addative identity, Firstly, define a function O on [a 5] as O(x)=0 W x €[a, 5) ‘Thus O is a real valued continuous function on (a, 6) = O€EVVECTOR SPACES o7 Now for all /€ V, x € (a, 4] (O+f)() = OG) +f) = 0+ f)=fuy, = (O+f/) =f) V rE fab] = Ors =s and (f+O)(x) =f(x) + OG) =flx) + 0= SG) = (f+ ON) =f(x) V x€ [a,b] > sO =f Thus O0+f=/=/+0. > Oiis the addative identity. A-4. Existence of addative inverse. For each fE V, we define ~fE Vas (-f)(x)=-f(x) VW x E [a,b] => —Jis real valued continuous function in V = -sfev Now [1+ -D]@) =S)+(-N)=/6)-s) =0=O(x) V xE [a,b] = St Efr0. ¥ SEV and [-9) +S] @) =CN@)+/)=-s@) +s) =O(x) V x€ [a,b] > CN+sf =O Vv sev * S#CN=O-CN+f ¥ sev > —fis the addative inverse of f. A-5S. Commutative. Let f,g€V Now (f+ 8) @)=fl) +20) =8G)+f@) [+ f(),g (x) are reals and commutative property holds in reals) =@+N@) * F+9O)= tN V rE [4,6] => St+g=gtf forall gev. => addition is commutative in V. IL Properties under scalar multiplication. M-l. Let @ER and SEV Now (af) (x)=af(x) V x€ [a,b] (by def.) => afev (a scalar multiple of real valued continuous function is a real valued continuous function]Let @ ER and LREV Now [a (P+ OO" alF+ YO] =e LO) +e0] FEOF ERWHENWHE QMO" @/tag) Vx lad] - ast grasrag, M3. Let af ER and EV Now [+A] =@+A/W) Vx [ad] =a fo +BfQ) [Since distributive law holds in reals} HE NO+ BAW = ESF BNW > (et As =afrBe M-h Let ef Rand fEV Now [EA] = EASE =a(Bsw) [Since associative law holds in reals] =e (BNC) =[e(BN]@ V x E [ad] > (As =a(Bf. M-A&. Let LER and SEV Now (AQ) =1./) (by def) =f) V x€[a 4] = lf =fV fEV Hence V is a vector space over R. Example 4. Let V set of all real valued continuous firnctions defined on [0, 1] such that s(3) =2. Show V is not a vector space over R (reals) under addition and scalar multiplication defined as U- 9 @=-f@)+2@ V SgEV (ef)@)=af(x) V @ER, SEV. | F If is veal valued continuous function defined Sol. Given V = } on (0, 1] such thar 1(3) La fg EV 2 2 > fand gare real valued continuous functions defined on {0, 1] such that f| 5] =2 and 8 |=TOR SP. 69 ooo ww onl) =a 242-4 = f+ eV, whereas fg V. For example, let (x) = x € [0, 1] > fis real valued continuous function defined on (0, 1] and 1(3) =3 (2) =2 sotha EV Let g(x) =2, x € [0,1] ‘ 2 "> gis real valued continuous function defined on (0, 1] and g [=] ~2 Now f+ g isa real valued continuous function [Since sum of two real valued continuous functions is again a real valued continuous function} me uso 3) o(B)-e(3) 22 > f+ e EV whereas LeEV > closure property does not hold. Hence V is not a vector space over R. Example S. Let F be an arbitrary field and Mm x » (F) be the set of all m x m matrices over F. Prove that Mm x» (F) is a vector space over F under the addition of matrices and multiplication of matrix by a scalar as internal and external compositions in Mm x n (F). Sol. Given Min xn (F)= {A| A= lai ]m nary €F} Let A,B,C © Minn (F) Then A=[41)}m n+ B=[biy}mxn and C=[e,))m sn where aj;, bij, ci) € F. I. Properties under addition. Al. Closure. Let A,B E My xn (F) Now A+B=[aij]mxn+ [is ]mxn.=lai* by lm EMoxn (> aij, biy EF > ayy +h) EF as F, being field is closed under addition] “+ Mm xn (F) is closed under addition.SPECTRUM ENGINEERING MATHEMATIC A-2. Associative. Let A.B.C © May 2 (F) exe) = [ay Dm cn* [byt Cy mn Now A=(B=C) = [a,]axn* (by ]mcn * = [ay y= eM mcn = [lay* by )* eye xe ij + 64j) a,j +0 =(a; ; + b,j) + 6 j asassociative law holds in field F = [ary~ bry len ley lmxn A+B)+C > addition is associative in Mx xn (F). A-3. Existence of addative identity Let O = [0] = x » Where 0 is identity element of F Now A+O =[ayJmxn7[0]mxn VAEMmxn(F) =[o1)+ Oman = [ay Im =A [+ aij +0= aj; since 0 is addative identity of F] A+O =A Also O=A =[0]mxn>(aiy]mxn=(0* aij ]mxn = [ay ]mxn=A O+A =A Thus O+A =A+O=A > — Cis addative identity in Mm x n (F). A-t. Existence of addative inverse Let A=[4,,]mxn © Mm xn(F) Then -A=[- aij] mxn ©Mmxn(F) ay, F and Fis field > —ajj €F] Now A+(-A) =[aij]mxntaylmxn =[aj+ Cayman + (-ajj)=0 as — ayy is addative inverse of a, ul] = [0mm Uv ay =O A+(-A) =O