Determinants - Uniqueness and Properties
|
|
- Nathaniel Neil Norton
- 5 years ago
- Views:
Transcription
1 Determinants - Uniqueness and Properties In order to show that there s only one determinant function on M(n, R), I m going to derive another formula for the determinant It involves permutations of the rows, so I ll give a brief introduction to permutations first Definition A permutation of the set {1, 2,,n} is an invertible function σ : {1, 2,,n} {1, 2,,n} The set of all permutations of {1, 2,,n} is denoted S n and is called the symmetric group on n letters A transposition is a permutation in which two elements are swapped, and everything else doesn t move Recall that a function has an inverse if and only if it is bijective: Different inputs produce different outputs (injective), and everything in the target set is an output of the function (surjective) So a permutation of {1, 2,,n} is just a way of scrambling the numbers from 1 to n Example There are 6 permutations of {1, 2, 3}: The last two in the first row and the first one in the second row are transpositions In each case, two elements are swapped, and the other element doesn t move For example, the one in the bottom right corner of the diagram is the function σ(1) = 3, σ(2) = 1, σ(3) = 2 Now many permutations are there of {1, 2,,n}? There are n places that 1 can be mapped to Once you know where 1 goes, there are n 1 places remaining where 2 can be mapped to (1 and 2 can t go to the same place because permutations are injective) Continuing in this way, you find that the total numbers of possibilities is n(n 1)(n 2) 2 1 = n! Therefore, there are n! permutations of {1, 2,,n} Permutations are multiplied by composing them as functions, ie by doing one permutation followed by another The following result says that every permutation can be built out of transpositions Theorem (a) Every permutation can written as a product of transpositions (b) No permutation can be written as a product of both an even and an odd number of transpositions 1
2 You ll probably see these results proved in a course in abstract algebra You can see that the first part reasonable: It says that any way of scrambling the elements in {1, 2,,n} could be accomplished by swapping two elements at a time, one swap after another The second part of the theorem is important, because it justifies the following definition Definition A permutation is even if it can be written as a product of an even number of transpositions A permutation is odd if it can be written as a product of an odd number of transpositions If σ is a permutation, the sign of σ is sgn(σ) = { +1 if σ is even 1 if σ is odd Theorem If D : M(n, R) R is linear in each row and is 0 on matrices with equal rows, then D(A) = σ S n sgn(σ)a 1σ(1) A nσ(n) D(I) Proof Write Observe that r 1 A = r n r i = j A ij e j, where e j is the j-th standard basis vector (equivalently, the j-th row of the identity matrix) By linearity, j A 1je j e j r D(A) = D 2 = r A 1j D 2 j r n r n Now do the same with row 2: D(A) = j e j e A 1j A 2k D k k r n Do this for all n rows, using j 1,,j n as the summation indices: e j1 D(A) = e j2 A 1j1 A 2j2 A njn D j 1,,j n e jn Since D is 0 on matrices with equal rows, I only need to consider terms where all the rows are different ie terms where j 1,,j n are distinct This means that {j 1,,j n } is a permutation of {1,,n}, and I m summing over σ S n : e σ(1) D(A) = e σ(2) A 1σ(1) A 2σ(2) A nσ(n) D σ S n e σ(n) 2
3 Now e σ(1) e σ(2) e σ(n) is just the identity matrix with its rows permuted by σ Every permutation is a product of transpositions By an earlier lemma, since D is linear on the rows and is 0 for matrices with equal rows, a transposition (ie a row swap) multiplies the value of D by 1 Hence, e σ(1) e σ(2) D = sgn(σ)d(i) e σ(n) Therefore, D(A) = σ S n A 1σ(1) A 2σ(2) A nσ(n) sgn(σ)d(i) Since the determinant function defined by expansion by cofactors is alternating and linear in each row, it satisfies the conditions of the theorem Since det I = 1, the formula in the theorem becomes det A = σ S n sgn(σ)a 1σ(1) A nσ(n) I ll call this the permutation formula for the determinant Example Compute the following real determinant using the permutation formula det I have to choose 3 entries from the matrix at a time, in such a way that each choice involves exactly one element from each row and each column For each such choice, I take the product of the three elements and multiply by the sign of the permutation of the elements, which I ll describe below Finally, I add up the results In order to do this systematically, focus on the first column I can choose 1, 4, or 7 from column 1 If I choose 1 from column 1, I can either choose 5 from column 2 and 9 from column 3, or 8 from column 2 and 6 from column 3 (Remember that I can t have two elements from the same row or column) If I choose 4 from column 1, I can either choose 2 from column 2 and 9 from column 3, or 8 from column 2 and 3 from column
4 Finally, if I choose 7 from column 1, I can either choose 2 from column 2 and 6 from column 3, or 5 from column 2 and 3 from column This gives me 6 products: (1)(5)(9) (1)(6)(8) (4)(2)(9) (4)(8)(3) (7)(2)(6) (7)(5)(3) Next, I have to attach a sign to each product To do this, I count the number of row swaps I need to move the 1 s in the identity matrix into the same positions as the numbers in the product I ll illustrate with two examples 3 4 : r 1 r r 1 r It took 2 row swaps to move the 1 s into the same positions as 4, 8, and 3 Since 2 is even, the sign of (4)(8)(3) is : r r It took 1 row swap to move the 1 s into the same positions as 7, 5, and 3 Since 1 is odd, the sign of (7)(5)(3) is 1 Continuing in this fashion, I get det = (1)(5)(9) (1)(6)(8) (4)(2)(9) + (4)(8)(3) + (7)(2)(6) (7)(5)(3) = Notice how ugly the computation was! While the permutation formula can be used for computations, it s easier to use row or column operations or expansion by cofactors Corollary There is a unique determinant function : M(n, R) R Proof A determinant function D is linear in each row, is 0 on matrices with equal rows, and satisfies D(I) = 1 The theorem then shows that D(A) is completely determined by A In other words, the determinant function I defined by cofactor expansion is the only determinant function on n n matrices Remark Another way to express the proof of the Corollary is: If D : M(n, R) R is alternating and linear in each row, then D(A) = A D(I), where denotes the determinant function on M(n, R) Corollary If A M(n, R), then A = A T Proof A T = n sgn(σ) A T iσ(i) = n sgn(σ) A σ(i)i = σ S n i=1 σ S n i=1 4
5 n sgn(σ) A jσ 1 (j) = ( sgn σ 1 ) n A jσ 1 (j) = σ S n j=1 σ S n j=1 ( sgn σ 1 ) n A jσ 1 (j) = n sgn (τ) A jτ(j) = A σ 1 S n j=1 τ S n j=1 I got the next-to-the-last equality by letting τ = σ 1 Remark Since the rows of A are the columns of A T and vice versa, the Corollary implies that you can also use column operations to compute determinants The allowable operations are swapping two columns, multiplying a column by a number, and adding a multiple of a column to another column They have the same effects on the determinant as the corresponding row operations As I noted earlier, this result also means that you can compute determinants using cofactors of rows as well as columns The uniqueness of determinant functions is useful in deriving properties of determinants Theorem Let A, B M(n, R) Then AB = A B Proof Fix B, and define D(A) = AB Let r i denote the i-th row of A Then r 1 B r D(A) = 2 B r n B Now is alternating, so interchanging two rows in the determinant above multiplies D(A) by 1 Hence, D is alternating Next, I ll show that D is linear: k xb D kx + y = + yb = k D This proves that D is linear in each row By the remark following the uniqueness theorem, (kx + y)b x AB = D(A) = A D(I) = A B = + D y In words, this important result says that the determinant of a product is the product of the determinants Note that the same thing does not work for sums Example It s not true that det(a + B) = det A + det B For example, in M(2, R), [ ] [ ] det = 1 and det =
6 But det ([ ] [ ]) [ ] = det = Theorem Let F be a field, and let A M(n, F) A is invertible if and only if A 0 Proof If A is invertible, then A A 1 = AA 1 = I = 1 This equation implies that A 0 (since A = 0 would yield 0 = 1 ) Conversely, suppose that A 0 Suppose that A row reduces to the row reduced echelon matrix R, and consider the effect of elementary row operations on A Swapping two rows multiplies the determinant by 1 Adding a multiple of a row to another row leaves the determinant unchanged And multiplying a row by a nonzero number multiplies the determinant by that nonzero number Clearly, no row operation will make the determinant 0 if it was nonzero to begin with Since A 0, it follows that R 0 Since R is a row reduced echelon matrix with nonzero determinant, it can t have any all-zero rows An n n row reduced echelon matrix with no all-zero rows must be the identity, so R = I Since A row reduces to the identity, A is invertible Corollary Let F be a field, and let A M(n, F) If A is invertible, then A 1 = 1 A Proof I showed in proving the theorem that A A 1 = 1, so A 1 = 1 A Here s an easy application of this result Corollary Let F be a field, and let A, P M(n, F) If P is invertible, then PAP 1 = A Proof PAP 1 = P A P 1 = P P 1 A = A (The matrices PAP 1 and A are said to be similar This will come up later when I talk about changing coordinates in vector spaces) Definition Let R be a commutative ring with identity, and let A M(n, R) The classical adjoint adja is the matrix whose i-j-th entry is (adj A) ij = ( 1) i+j A(j i) In other words, adj A is the transpose of the matrix of cofactors Example Compute the adjoint of A = First, I ll compute the cofactors The first line shows the cofactors of the first row, the second line the cofactors of the second row, and the third line the cofactors of the third row = 3, = 1, = 1, = 3, = 1, = 1, 6
7 + 0 3 = 3, = 1, = 1 The adjoint is the transpose of the matrix of cofactors: adj A = I ll need the following little lemma later on Lemma Let R be a commutative ring with identity, and let A M(n, R) Then (adja) T = adj A T Proof Consider the (i, j) th elements of the matrices on the two sides of the equation [(adja) T ] ij = (adja) ji = ( 1) j+i A(i j), [adj A T ] ij = ( 1) i+j A T (j i) The signs ( 1) j+i and ( 1) i+j are the same; what about the other terms? A(i j) is the determinant of the matrix formed by deleting the i th row and the j th column from A A T (j i) is the determinant of the matrix formed by deleting the j th row and i th column from A T But the i th row of A is the i th column of A T, and the j th column of A is the j th row of A T So the two matrices that remain after these deletions are transposes of one another, and hence they have the same determinant Thus, A(i j) = A T (j i) Hence, [(adja) T ] ij = [adj A T ] ij Theorem Let R be a commutative ring with identity, and let A M(n, R) Then Proof Expand A by cofactors of row i: A I = A adj A A = j ( 1) i+j A ij A(i j) Take k i, and construct a new matrix by replacing row k of A with row i Since the new matrix has two equal rows, its determinant is 0 On the other hand, expanding by cofactors of row k, 0 = j ( 1) k+j A kj A(k j) = j ( 1) k+j A ij A(k j) In words, this means that if you expand by cofactors of a row using the cofactors from another row, you get 0 You only get A if you use the right cofactors ie the cofactors for the given row In terms of the Kronecker delta function, ( 1) k+j A ij A(k j) = δ ik A for all i, k j Interpret this equation as a matrix equation, where the two sides represent the i-k-th entries of their respective matrices What are the respective matrices? The right side is obviously the i-k-th entry of A I For the left side, (A adja) ik = A ij (adja) jk = A ij ( 1) j+k A(k j) j j 7
8 Therefore, A I = A adja I can use the theorem to obtain an important corollary I already know that a matrix over a field is invertible if and only if its determinant is nonzero The next result explains what happens over a commutative ring with identity, and also provides a formula for the inverse of a matrix Corollary Let R be a commutative ring with identity, and let A M(n, R) A is invertible if and only if A is invertible in R, in which case A 1 = 1 adj A A Proof First, suppose A is invertible Then AA 1 = I, so A A 1 = AA 1 = I = 1 Therefore, A is invertible in R Conversely, suppose A is invertible in R I have Take the last equation and replace A with A T : A I = A adja, so I = A A 1 adja (1) I = A T A T 1 adj A T Use the facts that A T = A and (from the earlier lemma) that (adj A) T = adja T : Use the transpose rule (MN) T = N T M T : I = A T A 1 (adja) T I = A 1 (adja A) T Finally, transpose both sides, using the transpose rules I T = I and (M T ) T = M: I = A 1 adja A (2) Equations (1) and (2) show that A 1 adj A multiplies A to I on both the left and right Therefore, A is invertible, and A 1 = A 1 adj A The last result can be used to find the inverse of a matrix It s not very good for big matrices from a computational point of view: The usual row reduction algorithm uses fewer steps However, it s not too bad for small matrices say 3 3 or smaller Example Compute the inverse of the following real matrix using cofactors: A = First, I ll compute the cofactors The first line shows the cofactors of the first row, the second line the cofactors of the second row, and the third line the cofactors of the third row = 2, 3 0 = 3, = 5, 8
9 2 2 = 0, = 3, 3 2 = 3, = 4, = 6, = 4 The adjoint is the transpose of the matrix of cofactors: adja = Since deta = 6, I have A 1 = Another consequence of the formula A I = A adj A is Cramer s rule, which gives a formula for the solution of a system of linear equations As with the adjoint formula for the inverse of a matrix, Cramer s rule is not computationally efficient: It s better to use row reduction to solve systems Corollary (Cramer s rule) If A is an invertible n n matrix, the unique solution to Ax = y is given by x i = B i A, where B i is the matrix obtained from A by replacing its i-th column by y Proof A x i = j Ax = y, (adj A)Ax = (adja)y, (adja) ij y j = ( 1) i+j y j A(j i) j What is the last sum? It is a cofactor expansion of A along column i, where instead of the elements of A s column i I m using the components of y This is exactly B i Example Use Cramer s Rule to solve the following system over R: In matrix form, this is 2x + y + z = 1 x + y z = 5 3x y + 2z = x y = z 2 I replace the successive columns of the coefficient matrix with 1, 5, 2, in each case computing the determinant of the resulting matrix and dividing by the determinant of the coefficient matrix: x = 2 = 10 7 = , y = 3 2 = 6 7 = 6 5 7, z = = 19 7 =
10 This looks pretty simple, doesn t it? But notice that you need to compute four 3 3 determinants to do this It becomes more expensive to solve systems this way as the matrices get larger c 2008 by Bruce Ikenaga 10
Determinants Chapter 3 of Lay
Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j
More informationLECTURE 4: DETERMINANT (CHAPTER 2 IN THE BOOK)
LECTURE 4: DETERMINANT (CHAPTER 2 IN THE BOOK) Everything with is not required by the course syllabus. Idea Idea: for each n n matrix A we will assign a real number called det(a). Properties: det(a) 0
More information1 Determinants. 1.1 Determinant
1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationDeterminants: Uniqueness and more
Math 5327 Spring 2018 Determinants: Uniqueness and more Uniqueness The main theorem we are after: Theorem 1 The determinant of and n n matrix A is the unique n-linear, alternating function from F n n to
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationHere are some additional properties of the determinant function.
List of properties Here are some additional properties of the determinant function. Prop Throughout let A, B M nn. 1 If A = (a ij ) is upper triangular then det(a) = a 11 a 22... a nn. 2 If a row or column
More informationLinear Algebra: Lecture notes from Kolman and Hill 9th edition.
Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices
More informationChapter 2. Square matrices
Chapter 2. Square matrices Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/18 Invertible matrices Definition 2.1 Invertible matrices An n n matrix A is said to be invertible, if there is a
More information= 1 and 2 1. T =, and so det A b d
Chapter 8 Determinants The founder of the theory of determinants is usually taken to be Gottfried Wilhelm Leibniz (1646 1716, who also shares the credit for inventing calculus with Sir Isaac Newton (1643
More informationDeterminants. Samy Tindel. Purdue University. Differential equations and linear algebra - MA 262
Determinants Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T. Determinants Differential equations
More informationProperties of the Determinant Function
Properties of the Determinant Function MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Overview Today s discussion will illuminate some of the properties of the determinant:
More informationDETERMINANTS 1. def. (ijk) = (ik)(ij).
DETERMINANTS 1 Cyclic permutations. A permutation is a one-to-one mapping of a set onto itself. A cyclic permutation, or a cycle, or a k-cycle, where k 2 is an integer, is a permutation σ where for some
More informationChapter 2:Determinants. Section 2.1: Determinants by cofactor expansion
Chapter 2:Determinants Section 2.1: Determinants by cofactor expansion [ ] a b Recall: The 2 2 matrix is invertible if ad bc 0. The c d ([ ]) a b function f = ad bc is called the determinant and it associates
More information1 Matrices and Systems of Linear Equations. a 1n a 2n
March 31, 2013 16-1 16. Systems of Linear Equations 1 Matrices and Systems of Linear Equations An m n matrix is an array A = (a ij ) of the form a 11 a 21 a m1 a 1n a 2n... a mn where each a ij is a real
More informationLinear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More information1111: Linear Algebra I
1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Michaelmas Term 2015 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Michaelmas Term 2015 1 / 10 Row expansion of the determinant Our next goal is
More informationIntroduction to Determinants
Introduction to Determinants For any square matrix of order 2, we have found a necessary and sufficient condition for invertibility. Indeed, consider the matrix The matrix A is invertible if and only if.
More informationLecture Notes in Linear Algebra
Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................
More informationDeterminants. Beifang Chen
Determinants Beifang Chen 1 Motivation Determinant is a function that each square real matrix A is assigned a real number, denoted det A, satisfying certain properties If A is a 3 3 matrix, writing A [u,
More information14. Properties of the Determinant
14. Properties of the Determinant Last time we showed that the erminant of a matrix is non-zero if and only if that matrix is invertible. We also showed that the erminant is a multiplicative function,
More informationLinear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 206, v 202) Contents 2 Matrices and Systems of Linear Equations 2 Systems of Linear Equations 2 Elimination, Matrix Formulation
More informationChapter 3. Determinants and Eigenvalues
Chapter 3. Determinants and Eigenvalues 3.1. Determinants With each square matrix we can associate a real number called the determinant of the matrix. Determinants have important applications to the theory
More informationMATH 106 LINEAR ALGEBRA LECTURE NOTES
MATH 6 LINEAR ALGEBRA LECTURE NOTES FALL - These Lecture Notes are not in a final form being still subject of improvement Contents Systems of linear equations and matrices 5 Introduction to systems of
More informationDETERMINANTS. , x 2 = a 11b 2 a 21 b 1
DETERMINANTS 1 Solving linear equations The simplest type of equations are linear The equation (1) ax = b is a linear equation, in the sense that the function f(x) = ax is linear 1 and it is equated to
More information5.3 Determinants and Cramer s Rule
304 53 Determinants and Cramer s Rule Unique Solution of a 2 2 System The 2 2 system (1) ax + by = e, cx + dy = f, has a unique solution provided = ad bc is nonzero, in which case the solution is given
More informationA Review of Matrix Analysis
Matrix Notation Part Matrix Operations Matrices are simply rectangular arrays of quantities Each quantity in the array is called an element of the matrix and an element can be either a numerical value
More informationEquality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.
Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read
More informationECON 186 Class Notes: Linear Algebra
ECON 86 Class Notes: Linear Algebra Jijian Fan Jijian Fan ECON 86 / 27 Singularity and Rank As discussed previously, squareness is a necessary condition for a matrix to be nonsingular (have an inverse).
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
More informationMatrix Arithmetic. j=1
An m n matrix is an array A = Matrix Arithmetic a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn of real numbers a ij An m n matrix has m rows and n columns a ij is the entry in the i-th row and j-th column
More informationGraduate Mathematical Economics Lecture 1
Graduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 23, 2012 Outline 1 2 Course Outline ematical techniques used in graduate level economics courses Mathematics for Economists
More informationUndergraduate Mathematical Economics Lecture 1
Undergraduate Mathematical Economics Lecture 1 Yu Ren WISE, Xiamen University September 15, 2014 Outline 1 Courses Description and Requirement 2 Course Outline ematical techniques used in economics courses
More informationMATRICES AND MATRIX OPERATIONS
SIZE OF THE MATRIX is defined by number of rows and columns in the matrix. For the matrix that have m rows and n columns we say the size of the matrix is m x n. If matrix have the same number of rows (n)
More information1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )
Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical
More informationVectors and matrices: matrices (Version 2) This is a very brief summary of my lecture notes.
Vectors and matrices: matrices (Version 2) This is a very brief summary of my lecture notes Matrices and linear equations A matrix is an m-by-n array of numbers A = a 11 a 12 a 13 a 1n a 21 a 22 a 23 a
More information. =. a i1 x 1 + a i2 x 2 + a in x n = b i. a 11 a 12 a 1n a 21 a 22 a 1n. i1 a i2 a in
Vectors and Matrices Continued Remember that our goal is to write a system of algebraic equations as a matrix equation. Suppose we have the n linear algebraic equations a x + a 2 x 2 + a n x n = b a 2
More informationEvaluating Determinants by Row Reduction
Evaluating Determinants by Row Reduction MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Objectives Reduce a matrix to row echelon form and evaluate its determinant.
More informationFundamentals of Engineering Analysis (650163)
Philadelphia University Faculty of Engineering Communications and Electronics Engineering Fundamentals of Engineering Analysis (6563) Part Dr. Omar R Daoud Matrices: Introduction DEFINITION A matrix is
More informationII. Determinant Functions
Supplemental Materials for EE203001 Students II Determinant Functions Chung-Chin Lu Department of Electrical Engineering National Tsing Hua University May 22, 2003 1 Three Axioms for a Determinant Function
More informationGAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511)
GAUSSIAN ELIMINATION AND LU DECOMPOSITION (SUPPLEMENT FOR MA511) D. ARAPURA Gaussian elimination is the go to method for all basic linear classes including this one. We go summarize the main ideas. 1.
More informationLinear Algebra Primer
Introduction Linear Algebra Primer Daniel S. Stutts, Ph.D. Original Edition: 2/99 Current Edition: 4//4 This primer was written to provide a brief overview of the main concepts and methods in elementary
More informationMAC Module 3 Determinants. Learning Objectives. Upon completing this module, you should be able to:
MAC 2 Module Determinants Learning Objectives Upon completing this module, you should be able to:. Determine the minor, cofactor, and adjoint of a matrix. 2. Evaluate the determinant of a matrix by cofactor
More informationElementary maths for GMT
Elementary maths for GMT Linear Algebra Part 2: Matrices, Elimination and Determinant m n matrices The system of m linear equations in n variables x 1, x 2,, x n a 11 x 1 + a 12 x 2 + + a 1n x n = b 1
More informationMethods for Solving Linear Systems Part 2
Methods for Solving Linear Systems Part 2 We have studied the properties of matrices and found out that there are more ways that we can solve Linear Systems. In Section 7.3, we learned that we can use
More information1 Matrices and Systems of Linear Equations
Linear Algebra (part ) : Matrices and Systems of Linear Equations (by Evan Dummit, 207, v 260) Contents Matrices and Systems of Linear Equations Systems of Linear Equations Elimination, Matrix Formulation
More informationDeterminants. Recall that the 2 2 matrix a b c d. is invertible if
Determinants Recall that the 2 2 matrix a b c d is invertible if and only if the quantity ad bc is nonzero. Since this quantity helps to determine the invertibility of the matrix, we call it the determinant.
More informationMATH 2030: EIGENVALUES AND EIGENVECTORS
MATH 2030: EIGENVALUES AND EIGENVECTORS Determinants Although we are introducing determinants in the context of matrices, the theory of determinants predates matrices by at least two hundred years Their
More informationMATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication
More informationTopic 15 Notes Jeremy Orloff
Topic 5 Notes Jeremy Orloff 5 Transpose, Inverse, Determinant 5. Goals. Know the definition and be able to compute the inverse of any square matrix using row operations. 2. Know the properties of inverses.
More informationDeterminants by Cofactor Expansion (III)
Determinants by Cofactor Expansion (III) Comment: (Reminder) If A is an n n matrix, then the determinant of A can be computed as a cofactor expansion along the jth column det(a) = a1j C1j + a2j C2j +...
More informationChapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in
Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column
More informationNOTES ON LINEAR ALGEBRA. 1. Determinants
NOTES ON LINEAR ALGEBRA 1 Determinants In this section, we study determinants of matrices We study their properties, methods of computation and some applications We are familiar with the following formulas
More informationLemma 8: Suppose the N by N matrix A has the following block upper triangular form:
17 4 Determinants and the Inverse of a Square Matrix In this section, we are going to use our knowledge of determinants and their properties to derive an explicit formula for the inverse of a square matrix
More informationa 11 a 12 a 11 a 12 a 13 a 21 a 22 a 23 . a 31 a 32 a 33 a 12 a 21 a 23 a 31 a = = = = 12
24 8 Matrices Determinant of 2 2 matrix Given a 2 2 matrix [ ] a a A = 2 a 2 a 22 the real number a a 22 a 2 a 2 is determinant and denoted by det(a) = a a 2 a 2 a 22 Example 8 Find determinant of 2 2
More informationM. Matrices and Linear Algebra
M. Matrices and Linear Algebra. Matrix algebra. In section D we calculated the determinants of square arrays of numbers. Such arrays are important in mathematics and its applications; they are called matrices.
More informationc c c c c c c c c c a 3x3 matrix C= has a determinant determined by
Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.
More informationMATRICES The numbers or letters in any given matrix are called its entries or elements
MATRICES A matrix is defined as a rectangular array of numbers. Examples are: 1 2 4 a b 1 4 5 A : B : C 0 1 3 c b 1 6 2 2 5 8 The numbers or letters in any given matrix are called its entries or elements
More informationChapter 4. Matrices and Matrix Rings
Chapter 4 Matrices and Matrix Rings We first consider matrices in full generality, i.e., over an arbitrary ring R. However, after the first few pages, it will be assumed that R is commutative. The topics,
More informationMath 103, Summer 2006 Determinants July 25, 2006 DETERMINANTS. 1. Some Motivation
DETERMINANTS 1. Some Motivation Today we re going to be talking about erminants. We ll see the definition in a minute, but before we get into ails I just want to give you an idea of why we care about erminants.
More informationMatrices. Chapter Definitions and Notations
Chapter 3 Matrices 3. Definitions and Notations Matrices are yet another mathematical object. Learning about matrices means learning what they are, how they are represented, the types of operations which
More information3 Matrix Algebra. 3.1 Operations on matrices
3 Matrix Algebra A matrix is a rectangular array of numbers; it is of size m n if it has m rows and n columns. A 1 n matrix is a row vector; an m 1 matrix is a column vector. For example: 1 5 3 5 3 5 8
More informationApprentice Program: Linear Algebra
Apprentice Program: Linear Algebra Instructor: Miklós Abért Notes taken by Matt Holden and Kate Ponto June 26,2006 1 Matrices An n k matrix A over a ring R is a collection of nk elements of R, arranged
More information4. Determinants.
4. Determinants 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 2 2 determinant 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 3 3 determinant 4.1.
More information1300 Linear Algebra and Vector Geometry
1300 Linear Algebra and Vector Geometry R. Craigen Office: MH 523 Email: craigenr@umanitoba.ca May-June 2017 Matrix Inversion Algorithm One payoff from this theorem: It gives us a way to invert matrices.
More informationIntroduction to Matrices
214 Analysis and Design of Feedback Control Systems Introduction to Matrices Derek Rowell October 2002 Modern system dynamics is based upon a matrix representation of the dynamic equations governing the
More informationif we factor non-zero factors out of rows, we factor the same factors out of the determinants.
Theorem: Let A n n. Then A 1 exists if and only if det A 0. proof: We already know that A 1 exists if and only if the reduced row echelon form of A is the identity matrix. Now, consider reducing A to its
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J Olver 3 Review of Matrix Algebra Vectors and matrices are essential for modern analysis of systems of equations algebrai, differential, functional, etc In this
More informationReview of linear algebra
Review of linear algebra 1 Vectors and matrices We will just touch very briefly on certain aspects of linear algebra, most of which should be familiar. Recall that we deal with vectors, i.e. elements of
More informationSection 2.2: The Inverse of a Matrix
Section 22: The Inverse of a Matrix Recall that a linear equation ax b, where a and b are scalars and a 0, has the unique solution x a 1 b, where a 1 is the reciprocal of a From this result, it is natural
More informationMath 320, spring 2011 before the first midterm
Math 320, spring 2011 before the first midterm Typical Exam Problems 1 Consider the linear system of equations 2x 1 + 3x 2 2x 3 + x 4 = y 1 x 1 + 3x 2 2x 3 + 2x 4 = y 2 x 1 + 2x 3 x 4 = y 3 where x 1,,
More informationENGR-1100 Introduction to Engineering Analysis. Lecture 21
ENGR-1100 Introduction to Engineering Analysis Lecture 21 Lecture outline Procedure (algorithm) for finding the inverse of invertible matrix. Investigate the system of linear equation and invertibility
More informationMaterials engineering Collage \\ Ceramic & construction materials department Numerical Analysis \\Third stage by \\ Dalya Hekmat
Materials engineering Collage \\ Ceramic & construction materials department Numerical Analysis \\Third stage by \\ Dalya Hekmat Linear Algebra Lecture 2 1.3.7 Matrix Matrix multiplication using Falk s
More informationA matrix A is invertible i det(a) 6= 0.
Chapter 4 Determinants 4.1 Definition Using Expansion by Minors Every square matrix A has a number associated to it and called its determinant, denotedbydet(a). One of the most important properties of
More informationMath 416, Spring 2010 The algebra of determinants March 16, 2010 THE ALGEBRA OF DETERMINANTS. 1. Determinants
THE ALGEBRA OF DETERMINANTS 1. Determinants We have already defined the determinant of a 2 2 matrix: det = ad bc. We ve also seen that it s handy for determining when a matrix is invertible, and when it
More informationEC5555 Economics Masters Refresher Course in Mathematics September 2014
EC5555 Economics Masters Refresher Course in Mathematics September 4 Lecture Matri Inversion and Linear Equations Ramakanta Patra Learning objectives. Matri inversion Matri inversion and linear equations
More informationPhys 201. Matrices and Determinants
Phys 201 Matrices and Determinants 1 1.1 Matrices 1.2 Operations of matrices 1.3 Types of matrices 1.4 Properties of matrices 1.5 Determinants 1.6 Inverse of a 3 3 matrix 2 1.1 Matrices A 2 3 7 =! " 1
More informationInverses and Elementary Matrices
Inverses and Elementary Matrices 1-12-2013 Matrix inversion gives a method for solving some systems of equations Suppose a 11 x 1 +a 12 x 2 + +a 1n x n = b 1 a 21 x 1 +a 22 x 2 + +a 2n x n = b 2 a n1 x
More informationTOPIC III LINEAR ALGEBRA
[1] Linear Equations TOPIC III LINEAR ALGEBRA (1) Case of Two Endogenous Variables 1) Linear vs. Nonlinear Equations Linear equation: ax + by = c, where a, b and c are constants. 2 Nonlinear equation:
More informationInvertible Matrices over Idempotent Semirings
Chamchuri Journal of Mathematics Volume 1(2009) Number 2, 55 61 http://www.math.sc.chula.ac.th/cjm Invertible Matrices over Idempotent Semirings W. Mora, A. Wasanawichit and Y. Kemprasit Received 28 Sep
More informationLecture 10: Determinants and Cramer s Rule
Lecture 0: Determinants and Cramer s Rule The determinant and its applications. Definition The determinant of a square matrix A, denoted by det(a) or A, is a real number, which is defined as follows. -by-
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationA FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic
A FIRST COURSE IN LINEAR ALGEBRA An Open Text by Ken Kuttler Matrix Arithmetic Lecture Notes by Karen Seyffarth Adapted by LYRYX SERVICE COURSE SOLUTION Attribution-NonCommercial-ShareAlike (CC BY-NC-SA)
More informationKevin James. MTHSC 3110 Section 2.1 Matrix Operations
MTHSC 3110 Section 2.1 Matrix Operations Notation Let A be an m n matrix, that is, m rows and n columns. We ll refer to the entries of A by their row and column indices. The entry in the i th row and j
More informationLinear Algebra Primer
Linear Algebra Primer D.S. Stutts November 8, 995 Introduction This primer was written to provide a brief overview of the main concepts and methods in elementary linear algebra. It was not intended to
More information1 Matrices and Systems of Linear Equations
March 3, 203 6-6. Systems of Linear Equations Matrices and Systems of Linear Equations An m n matrix is an array A = a ij of the form a a n a 2 a 2n... a m a mn where each a ij is a real or complex number.
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationFinal Review Sheet. B = (1, 1 + 3x, 1 + x 2 ) then 2 + 3x + 6x 2
Final Review Sheet The final will cover Sections Chapters 1,2,3 and 4, as well as sections 5.1-5.4, 6.1-6.2 and 7.1-7.3 from chapters 5,6 and 7. This is essentially all material covered this term. Watch
More informationDeterminants: Introduction and existence
Math 5327 Spring 2018 Determinants: Introduction and existence In this set of notes I try to give the general theory of determinants in a fairly abstract setting. I will start with the statement of the
More informationMatrix representation of a linear map
Matrix representation of a linear map As before, let e i = (0,..., 0, 1, 0,..., 0) T, with 1 in the i th place and 0 elsewhere, be standard basis vectors. Given linear map f : R n R m we get n column vectors
More informationChapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations
Chapter 1: Systems of linear equations and matrices Section 1.1: Introduction to systems of linear equations Definition: A linear equation in n variables can be expressed in the form a 1 x 1 + a 2 x 2
More informationThings we can already do with matrices. Unit II - Matrix arithmetic. Defining the matrix product. Things that fail in matrix arithmetic
Unit II - Matrix arithmetic matrix multiplication matrix inverses elementary matrices finding the inverse of a matrix determinants Unit II - Matrix arithmetic 1 Things we can already do with matrices equality
More informationMATH2210 Notebook 2 Spring 2018
MATH2210 Notebook 2 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 2 MATH2210 Notebook 2 3 2.1 Matrices and Their Operations................................
More informationDeterminants in detail
Determinants in detail Kyle Miller September 27, 2016 The book s introduction to the determinant det A of an n n square matrix A is to say there is a quantity which determines exactly when A is invertible,
More information1 procedure for determining the inverse matrix
table of contents 1 procedure for determining the inverse matrix The inverse matrix of a matrix A can be determined only if the determinant of the matrix A is different from zero. The following procedures
More informationNotes on Row Reduction
Notes on Row Reduction Francis J. Narcowich Department of Mathematics Texas A&M University September The Row-Reduction Algorithm The row-reduced form of a matrix contains a great deal of information, both
More informationMatrix Algebra. Matrix Algebra. Chapter 8 - S&B
Chapter 8 - S&B Algebraic operations Matrix: The size of a matrix is indicated by the number of its rows and the number of its columns. A matrix with k rows and n columns is called a k n matrix. The number
More informationMatrix inversion and linear equations
Learning objectives. Matri inversion and linear equations Know Cramer s rule Understand how linear equations can be represented in matri form Know how to solve linear equations using matrices and Cramer
More informationMath 3108: Linear Algebra
Math 3108: Linear Algebra Instructor: Jason Murphy Department of Mathematics and Statistics Missouri University of Science and Technology 1 / 323 Contents. Chapter 1. Slides 3 70 Chapter 2. Slides 71 118
More information