Introduction to Determinants

Similar documents
Chapter 3. Determinants and Eigenvalues

MAC Module 2 Systems of Linear Equations and Matrices II. Learning Objectives. Upon completing this module, you should be able to :

Chapter 2:Determinants. Section 2.1: Determinants by cofactor expansion

System of Equations: An Introduction

1 Determinants. 1.1 Determinant

1111: Linear Algebra I

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

MATRICES AND MATRIX OPERATIONS

Math 240 Calculus III

MATH 240 Spring, Chapter 1: Linear Equations and Matrices

Linear Systems and Matrices

ECON 186 Class Notes: Linear Algebra

3 Matrix Algebra. 3.1 Operations on matrices

Properties of the Determinant Function

MATRIX DETERMINANTS. 1 Reminder Definition and components of a matrix

Multiplying matrices by diagonal matrices is faster than usual matrix multiplication.

Graduate Mathematical Economics Lecture 1

MAT 1332: CALCULUS FOR LIFE SCIENCES. Contents. 1. Review: Linear Algebra II Vectors and matrices Definition. 1.2.

Lecture Notes in Linear Algebra

Chapter 2 Notes, Linear Algebra 5e Lay

Lecture 10: Determinants and Cramer s Rule

c c c c c c c c c c a 3x3 matrix C= has a determinant determined by

Methods for Solving Linear Systems Part 2

Matrices and RRE Form

Undergraduate Mathematical Economics Lecture 1

MATRICES The numbers or letters in any given matrix are called its entries or elements

Lesson 3. Inverse of Matrices by Determinants and Gauss-Jordan Method

MAC Module 3 Determinants. Learning Objectives. Upon completing this module, you should be able to:

Lesson U2.1 Study Guide

Determinants. Samy Tindel. Purdue University. Differential equations and linear algebra - MA 262

The matrix will only be consistent if the last entry of row three is 0, meaning 2b 3 + b 2 b 1 = 0.

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in

Determinants Chapter 3 of Lay

JUST THE MATHS UNIT NUMBER 9.3. MATRICES 3 (Matrix inversion & simultaneous equations) A.J.Hobson

Math 4A Notes. Written by Victoria Kala Last updated June 11, 2017

Determinants by Cofactor Expansion (III)

Matrix Algebra: Introduction

The Solution of Linear Systems AX = B

Review for Exam Find all a for which the following linear system has no solutions, one solution, and infinitely many solutions.

Numerical Linear Algebra Homework Assignment - Week 2

Determinant: 3.3 Properties of Determinants

MAC1105-College Algebra. Chapter 5-Systems of Equations & Matrices

Determinant: 3.2 Evaluation of Determinant with Elementary

MATRICES. knowledge on matrices Knowledge on matrix operations. Matrix as a tool of solving linear equations with two or three unknowns.

Introduction to Matrices and Linear Systems Ch. 3

Fundamentals of Engineering Analysis (650163)

Chapter 2. Square matrices

8 Square matrices continued: Determinants

Linear 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.

7.4. The Inverse of a Matrix. Introduction. Prerequisites. Learning Outcomes

Matrix Algebra. Matrix Algebra. Chapter 8 - S&B

Determinants - Uniqueness and Properties

Linear Algebra (part 1) : Matrices and Systems of Linear Equations (by Evan Dummit, 2016, v. 2.02)

MTH501- Linear Algebra MCQS MIDTERM EXAMINATION ~ LIBRIANSMINE ~

TOPIC III LINEAR ALGEBRA

Chapter 4. Determinants

Elementary Linear Algebra

7.6 The Inverse of a Square Matrix

MAT Linear Algebra Collection of sample exams

Row Space and Column Space of a Matrix

Math 3C Lecture 20. John Douglas Moore

Lecture 6 & 7. Shuanglin Shao. September 16th and 18th, 2013

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

Formula for the inverse matrix. Cramer s rule. Review: 3 3 determinants can be computed expanding by any row or column

22A-2 SUMMER 2014 LECTURE 5

a11 a A = : a 21 a 22

Math 60. Rumbos Spring Solutions to Assignment #17

Notes on Row Reduction

Matrix operations Linear Algebra with Computer Science Application

10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections )

Evaluating Determinants by Row Reduction

M. Matrices and Linear Algebra

1 Matrices and Systems of Linear Equations

Linear Algebra: Lecture notes from Kolman and Hill 9th edition.

4 Elementary matrices, continued

Phys 201. Matrices and Determinants

MATH 2331 Linear Algebra. Section 2.1 Matrix Operations. Definition: A : m n, B : n p. Example: Compute AB, if possible.

7.3. Determinants. Introduction. Prerequisites. Learning Outcomes

Lecture 7. Econ August 18

Gaussian Elimination and Back Substitution

Midterm 1 Review. Written by Victoria Kala SH 6432u Office Hours: R 12:30 1:30 pm Last updated 10/10/2015

CHAPTER 8: Matrices and Determinants

Linear Algebra Section 2.6 : LU Decomposition Section 2.7 : Permutations and transposes Wednesday, February 13th Math 301 Week #4

Systems of Linear Equations and Matrices

MTHSC 3110 Section 1.1

a 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

MTH 102A - Linear Algebra II Semester

Section 5.3 Systems of Linear Equations: Determinants

Section 1.1: Systems of Linear Equations

1 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 )

Section Gaussian Elimination

Math 313 Chapter 1 Review

1300 Linear Algebra and Vector Geometry

JUST THE MATHS SLIDES NUMBER 9.3. MATRICES 3 (Matrix inversion & simultaneous equations) A.J.Hobson

Lecture 12: Solving Systems of Linear Equations by Gaussian Elimination

Find the solution set of 2x 3y = 5. Answer: We solve for x = (5 + 3y)/2. Hence the solution space consists of all vectors of the form

UNIT 3 MATRICES - II

Linear Algebra Primer

k is a product of elementary matrices.

Linear Algebra and Matrix Inversion

Transcription:

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. We called this number the determinant of A. It is clear from this, that we would like to have a similar result for bigger matrices (meaning higher orders). So is there a similar notion of determinant for any square matrix, which determines whether a square matrix is invertible or not? In order to generalize such notion to higher orders, we will need to study the determinant and see what kind of properties it satisfies. First let us use the following notation for the determinant Properties of the Determinant 1. Any matrix A and its transpose have the same determinant, meaning 2. This is interesting since it implies that whenever we use rows, a similar behavior will result if we use columns. In particular we will see how row elementary operations are helpful in finding the determinant. Therefore, we have similar conclusions for elementary column operations. The determinant of a triangular matrix is the product of the entries on the diagonal, that is 1

3. If we interchange two rows, the determinant of the new matrix is the opposite of the old one, that is 4. If we multiply one row with a constant, the determinant of the new matrix is the determinant of the old one multiplied by the constant, that is 5. In particular, if all the entries in one row are zero, then the determinant is zero. If we add one row to another one multiplied by a constant, the determinant of the new matrix is the same as the old one, that is 6. Note that whenever you want to replace a row by something (through elementary operations), do not multiply the row itself by a constant. Otherwise, you will easily make errors (due to Property 4). We have In particular, if A is invertible (which happens if and only if ), then If A and B are similar, then. Let us look at an example, to see how these properties work. Example. Evaluate 2

Let us transform this matrix into a triangular one through elementary operations. We will keep the first row and add to the second one the first multiplied by. We get Using the Property 2, we get Therefore, we have which one may check easily. Determinants of Matrices of Higher Order As we said before, the idea is to assume that previous properties satisfied by the determinant of matrices of order 2, are still valid in general. In other words, we assume: 1. Any matrix A and its transpose have the same determinant, meaning 2. The determinant of a triangular matrix is the product of the entries on the diagonal. 3

3. 4. 5. 6. If we interchange two rows, the determinant of the new matrix is the opposite of the old one. If we multiply one row with a constant, the determinant of the new matrix is the determinant of the old one multiplied by the constant. If we add one row to another one multiplied by a constant, the determinant of the new matrix is the same as the old one. We have In particular, if A is invertible (which happens if and only if ), then So let us see how this works in case of a matrix of order 4. Example. Evaluate We have If we subtract every row multiplied by the appropriate number from the first row, we get 4

We do not touch the first row and work with the other rows. We interchange the second with the third to get If we subtract every row multiplied by the appropriate number from the second row, we get Using previous properties, we have If we multiply the third row by 13 and add it to the fourth, we get which is equal to 3. Putting all the numbers together, we get 5

These calculations seem to be rather lengthy. We will see later on that a general formula for the determinant does exist. Example. Evaluate In this example, we will not give the details of the elementary operations. We have Example. Evaluate We have 6

General Formula for the Determinant Let A be a square matrix of order n. Write A = (a ij ), where a ij is the entry on the row number i and the column number j, for and. For any i and j, set A ij (called the cofactors) to be the determinant of the square matrix of order (n-1) obtained from A by removing the row number i and the column number j multiplied by (-1) i+j. We have for any fixed i, and for any fixed j. In other words, we have two type of formulas: along a row (number i) or along a column (number j). Any row or any column will do. The trick is to use a row or a column which has a lot of zeros. In particular, we have along the rows or or As an exercise write the formulas along the columns. Example. Evaluate 7

We will use the general formula along the third row. We have Which technique to evaluate a determinant is easier? The answer depends on the person who is evaluating the determinant. Some like the elementary row operations and some like the general formula. All that matters is to get the correct answer. Note that all of the above properties are still valid in the general case. Also you should remember that the concept of a determinant only exists for square matrices. Determinant and Inverse of Matrices Finding the inverse of a matrix is very important in many areas of science. For example, decrypting a coded message uses the inverse of a matrix. Determinant may be used to answer this problem. Indeed, let A be a square matrix. We know that A is invertible if and only if. Also if A has order n, then the cofactor A i,j is defined as the determinant of the square matrix of order (n-1) obtained from A by removing the row number i and the column number j multiplied by (-1) i+j. Recall for any fixed i, and 8

for any fixed j. Define the adjoint of A, denoted adj(a), to be the transpose of the matrix whose ij th entry is A ij. Example. Let We have Let us evaluate. We have Note that. Therefore, we have Is this formula only true for this matrix, or does a similar formula exist for any square matrix? In fact, we do have a similar formula. Theorem. For any square matrix A of order n, we have In particular, if, then 9

For a square matrix of order 2, we have which gives This is a formula which we used on a previous page. Application of Determinant to Systems: Cramer's Rule We have seen that determinant may be useful in finding the inverse of a nonsingular matrix. We can use these findings in solving linear systems for which the matrix coefficient is nonsingular (or invertible). Consider the linear system (in matrix form) A X = B where A is the matrix coefficient, B the nonhomogeneous term, and X the unknown columnmatrix. We have: Theorem. The linear system AX = B has a unique solution if and only if A is invertible. In this case, the solution is given by the so-called Cramer's formulas: 10

where x i are the unknowns of the system or the entries of X, and the matrix A i is obtained from A by replacing the i th column by the column B. In other words, we have where the b i are the entries of B. In particular, if the linear system AX = B is homogeneous, meaning, then if A is invertible, the only solution is the trivial one, that is. So if we are looking for a nonzero solution to the system, the matrix coefficient A must be singular or noninvertible. We also know that this will happen if and only if. This is an important result. Example. Solve the linear system Answer. First note that which implies that the matrix coefficient is invertible. So we may use the Cramer's formulas. We have We leave the details to the reader to find 11

Note that it is easy to see that z=0. Indeed, the determinant which gives z has two identical rows (the first and the last). We do encourage you to check that the values found for x, y, and z are indeed the solution to the given system. Remark. Remember that Cramer's formulas are only valid for linear systems with an invertible matrix coefficient. 12