Professional Documents
Culture Documents
INTRODUCTION
A. Rationalization of the importance of critical book review
Criticizing books is a scientific activity undertaken to provide feedback and
assessment of the contents of a book. The purpose of this book is to provide
comprehensive information or understanding of what appears and is revealed in a book.
It also gives consideration to the reader whether the book deserves a welcome from the
public or not. Critical books are useful to increase the essential knowledge of the criticized
book. Readers who want to know more about the entire contents of the book will then
look in the stores or sites that sell the books.
In this "Critical Book Review", the author reviews and analyzes a book entitled
"Introduction to Matrices and Linear Transformations". This book is written by Daniel
T. Finkbeiner. " Introduction to Matrices and Linear Transformations " was published in
1919 by W.H. Freeman and Company. The 471-page book consists of eleven chapters,
namely: 1) Chapter I, about linear equations; 2) Chapter II, about linear spaces, 3) Chapter
III, about linear mappings. 4) Chapter IV, on matrices, 5) Chapter V, on determinants, 6)
Chapter VI equivalence realitions on rectangular matrices, 7) Chapter VII a canonical
form for similariy, 8) Chapter VIII on inner product spaces, 9) Chapter IX on scalar-
valued functions, 10) Chapter X, Application: Linear Programming, and 11) Chapter XI,
Application: Linear Differential Equations. A brief explanation on this critical book about
Determinants, is in chapter V that will be explained briefly in Chapter II.
B. Goals of CBR
This Critical Book Review aims:
1. Review the contents of a book.
2. Finding and knowing the information contained in the book.
3. Train yourself to think critically in searching for information provided by each
chapter of the first and second books.
4. Compare the contents of the first book and the second book
5. Find the advantages and disadvantages of the first book content
C. Benefits of CBR
1) To fulfill the task of the course of Introduction to Matrices and Linear
Transformations.
2) To increase knowledge determinants.
D. Book Identity
1. Title : Introduction to Matrices and Linear Transformations.
2. Edition : Third Edition
3. Author : Daniel Talbot Finkbeiner
4. Publisher : W.H. Freeman and Company
5. City of Publication : America
6. Year of Publication : 1919
7. ISBN : 0-7167-0084-0
CHAPTER II
SUMMARY
A. Determinants
1. Basic Properties of Determinants
Althoung the case n = 1 is trivial, it is the obvious starting pint. The determinant of a
one-by-one matrix is defined by:
det (a) = a
For n = 2 the determinant of a two-by-two matrix is defined by:
11 12
( ) = 11 22 21 12
21 22
For n = 3 the determinant of a three-by-three matrix is defined by:
11 12 13
( 21 22 23 ) = 11 22 33 + 21 21 21 + 21 21 21
31 32 33
21 21 21 21 21 21 21 21 21
obviously the coputation reqired to verify these statements for n = 3 is much longer that
required to verify the corresponding atatements for n =2. it is aqually obvious that a
computational defenition of det A for n-by-n matrix will be quite awkward, so we shall
tha a different approach.
Defenition 1
a determinant is a function, denoted det, that assigns to each n-by-n matrix having column
vectors A1,......, An ascalar avlue det A that has the following three properties : for each
scalar c and each i = 1,....,n.
1) det (A1, ......, cAi, ......, An) = c det (A1, ..., Ai, ...., An)
2) det (A1, ..., Ai,..., Aj,...., An) = det (A1, ..., Ai + cAj, ...., An) for each ji
3) det (I) = 1.
Theorem 1
If det is a function having properties 1 and 2 of definition 1, the the following statements
hold for each 1, j = 1,...., n such that ji
a) det (A1, ..., Ai,..., Aj,...., An) = - det (A1, ..., Ai + cAj, ...., An). in words, intercahnge
of any columns of a reverses the sign of the determinant; or, det is an alternating
function of the column of A.
b) if the columns of A are linearly dependent, then det A = 0.
c) if the columns of B are a permutation of the columns of A, then det B = det A,
where the plus sign applies if that permutation can be performed by an even
number of transpositions (interchange of pairs of column), and the minus sign
applies if the permutation can be performed by an add number of tranformations.
d) det (A1, ..., Bi+Ci..., An) = det (A1, ..., Bi,...., An) + det (A1, ..., Ci,...., An). in words,
if column i is expressed as the sum of two column vectors, Ai=Bi + Ci, then det A
is the sum of the two indicated determinants; or det A is an additive function of
each column.
2. An Explicit Formula For Det A
Let A and B be any n-by-n matrices and let C = BA. we compute the elements in
Ck, column k of C:
1 = 11 1 + 12 2 + + 1
2 = 21 1 + 22 2 + + 2
.
.
= 1 + 2 2 + +
Letting Bj denote column j of B, we can write
1 = 11 1 + 12 2 + + 1 =
=1
Hence: det C = det (C1, C2,..., Cn) = det(=1 1, =1 2 , , =1 )
Theorem 2 An function det that has the three properties of defenition 1 must have the
form
det A = (1) (1) (2)2 ()
Theorem 3 If A and B are n-by-n matrices, then
det (BA) = (det B)(det A)
Theorem 4 An n-by-n matrix is nonsingular if and only if det A 0. if A is nonsingular,
det (A-1) = (det A)-1
theorem 5 If At is the transpose of A, then det (At) = det A.
Theorem 6 For each value of n = 1, 2, ...., there exists one and only one determinant
function for n-by-n matrices. its value is expressed by formula 1 and also by 2.
Theorem 7
= det
=1
= det
=1
2.2 The book of Elementary Linear Algebra Tenth Edition Howard Anton
2.1 Determinants by Cofactor Expansion
Definition 1
If A is a square matrix, then the minor of entry aij is denoted by Mij and is defined to be
the determinant of thesubmatrix that remains after the ith row and jth column are
deleted from A. The number (-1)i+jMij is denoted by Cijand is called the cofactor of
entry aij.
Definition of a General Determinant
Formula 4 is a special case of the following general result, which we will state without
proof.
Theorem 2.1.1
If A is annxn matrix, then regardless of which row or column of A is chosen, the number
obtained by multiplying theentries in that row or column by the corresponding cofactors
and adding the resulting products is always the same.
Definition 2
If A is annxn matrix, then the number obtained by multiplying the entries in any row or
column of A by thecorresponding cofactors and adding the resulting products is called
the determinant of A, and the sums themselves arecalled cofactor expansions of A.
That is,
Theorem 2.1.2
If A is annxn triangular matrix (upper triangular, lower triangular, or diagonal), then
det(A) is the product of the entries on the main diagonal of the matrix; that is, .det(A) =
a11a22ann.
Proof Since the determinant of A can be found by a cofactor expansion along any row
or column, we can use the row or
column of zeros. Thus, if we let C1,C2,,Cn denote the cofactors of A along that row or
column, that
The following useful theorem relates the determinant of a matrix and the determinant of
its transpose.
Theorem 2.2.2
Let A be a square matrix. Then det(A) = det(AT)
Because transposing a matrix changes its columns to rows and its rows to columns,
almost every theorem about the rows of a determinant has a companion version about
columns, and vice versa.
Proof Since transposing a matrix changes its columns to rows and its rows to columns,
the cofactor expansion of A along any row is the same as the cofactor expansion of AT
along the corresponding column. Thus, both have the same determinant.
Elementary Matrices
It will be useful to consider the special case of Theorem 2.2.3 in which A=In is the nxn
identity matrix and E (rather than B) denotes the elementary matrix that results when the
row operation is performed on In. In this special case Theorem 2.2.3 implies the
following result.
Theorem 2.2.4
Let E be an nxn elementary matrix.
(a) If E results from multiplying a row of In by a nonzero number k, then det(E) =k.
(b) If E results from interchanging two rows of In, then det(E) =-1.
(c) If E results from adding a multiple of one row of In to another, then det(E) =1.
We pointed out in the margin note that accompanies Theorem 2.2.4 that the determinant
of an elementary matrix is nonzero. Thus, it follows from Formula 4 that det(A) and
det(R) are either both zero or both nonzero, which sets the stage for the main part of the
proof. If we assume first that A is invertible, then it follows from Theorem 1.6.4 that
R=I and hence that det(R)=(10). This, in turn, implies that det(A)0, which is what we
wanted to show.
It follows from Theorems 2.3.3 and Theorem 2.2.5 that a square matrix with two
proportional rows or two proportional columns is not invertible.
Conversely, assume that det(A)0. It follows from this that det(R)0, which tells us that
R cannot have a row of zeros. Thus, it follows from Theorem 1.4.3 that R=I and hence
that A is invertible by Theorem 1.6.4.
Theorem 2.3.4
If A and B are square matrices of the same size, then
det(AB)=det (A) det (B)
Proof We divide the proof into two cases that depend on whether or not A is invertible.
If the matrix A is not
invertible, then by Theorem 1.6.5 neither is the product AB. Thus, from Theorem
Theorem 2.3.3, we have det(AB)=0
and det(A)=, so it follows that det(AB)=det(A) det(B).
Theorem 2.3.5
If A is invertible, then
1
det(1 ) =
det()
Proof Since , it follows that A-1A=I. Therefore, we must have det(A-1)det(A)=I.
Since det(A)0, the proof can be completed by dividing through by det(A).
Adjoint of a Matrix
In a cofactor expansion we compute det(A)by multiplying the entries in a row or column
by their cofactors and adding the resulting products. It turns out that if one multiplies the
entries in any row by the corresponding cofactors from a different row, the sum of these
products is always zero. (This result also holds for columns.) Although we omit the
general proof, the next example illustrates the idea of the proof in a special case.
Definition 1
If A is any nxn matrix and Cij is the cofactor of aij, then the matrix
is called the matrix of cofactors from A. The transpose of this matrix is called the
adjoint of A and is denoted by adj(A).
6.2 Suggestion
Thanks to friends who helped complete this Critical Book, so we can finish it
just in time. In this writing we really need input from Lecturers and friends all for the
perfection of this Critical Book.
Bibliography