Linear Algebra
Linear Algebra
NAME : J.LOGESHWARI
ROLL NO : 2302012
CLASS : I M.SC MATHS
Example 4 :
The determinant of the n*n matrix is 1. we prove this assertion by mathematical induction on n. The
result is clearly true for the 1*1 identity matrix. Assume that the determinant of the (n-1)*(n-1)
Identity matrix is 1 for n>=2, and let I denote the n*n identity matrix. Using cofactor expansion along the first row of
I, we obtain
det(I) = (-1)^2(1). Det(I11)+ (-1)^3(0).det(I12)+……….+(-1)^1+n(0). Det(I1n)
= 1(1)+0+0…….+0
=1
because I11 is the (n-1)*(n-1) identity matrix .This shows that the determinant of the n*n identity matrix is 1,
and so the determinant of ant matrix is 1 by the principle of mathematical induction.
As is illustrated in ex.3 ,the calculation of a determinant using the recursive definition is
extremely tedious , even fie the matrices as well as 4*4. Later in this section, we present a more efficient method for
evaluating determinants , but we must first learn more about them.
THEOREM 4.3
The determinant of an n*n matrix is a linear function of each row when the remaining rows are held
fixed that is , fir 1<=r<= we have
a1 a1
. .
det ar-1 = det ar-1 + k det
u+ku u
ar+1 ar+1
an an
PROOF:
The proof is by mathematical induction on n. The result is immediate if n=1. Assume thet formsome integer
n>=2 the determinant of any (n-1)*(n-1) matrix is a linear function of each row when the remaining rows are held
fixed. Let A be an n*n matrix with rows a1,a2,…….an, respectively and suppose that fir r(1<=r<=n) we have ar= u+
ku for some u , v belongs to f^n and some scalars k.
Let u= (b1,b2,…….bn) and v=(c1,c2,…….,cn), and Let B and c be th matrices obtained from A by replacing row of
A by u and v respectively. We must prove det(A)= det(B)+ kdet(c). We have thee proff of this fact to the reader for
the case r=1. For r>1 and 1<=j<=, the rows Aij,Bij and cij are the same except for the row r-1.
(b1+kc1……bj-1+kcj-1bj+1 + Rcj+1,…….,bn+Kcn)
Which is the sum of row r-1 of Bij and k times row r-1 of cij. Since Bij and cij are (n-1)*(n-1)
Matrices, We have
det (A ij) = det(Bij)+kdet(cij)
= det(B) + det(c)
This shows that the theorem is true for n*n matrices, and so the theorem is true foe square matrices by
mathematical induction.
THANK YOU!