MATH 304 Linear Algebra Lecture 6: Transpose of a matrix. Determinants.

Similar documents
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

Unit 18 Determinants

Notes on Determinant

Math 115A HW4 Solutions University of California, Los Angeles. 5 2i 6 + 4i. (5 2i)7i (6 + 4i)( 3 + i) = 35i + 14 ( 22 6i) = i.

Using row reduction to calculate the inverse and the determinant of a square matrix

Lecture 2 Matrix Operations

1 Introduction to Matrices

MATH 304 Linear Algebra Lecture 18: Rank and nullity of a matrix.

13 MATH FACTS a = The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.

Direct Methods for Solving Linear Systems. Matrix Factorization

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS

MAT188H1S Lec0101 Burbulla

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

The Characteristic Polynomial

Similarity and Diagonalization. Similar Matrices

The Determinant: a Means to Calculate Volume

Elementary Matrices and The LU Factorization

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Solution to Homework 2

Linear Algebra Notes for Marsden and Tromba Vector Calculus

Introduction to Matrix Algebra

Solving Linear Systems, Continued and The Inverse of a Matrix

8 Square matrices continued: Determinants

LINEAR ALGEBRA. September 23, 2010

Chapter 7. Matrices. Definition. An m n matrix is an array of numbers set out in m rows and n columns. Examples. (

Solving Systems of Linear Equations

1 Sets and Set Notation.

Math 312 Homework 1 Solutions

Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.

Abstract: We describe the beautiful LU factorization of a square matrix (or how to write Gaussian elimination in terms of matrix multiplication).

Row Echelon Form and Reduced Row Echelon Form

Systems of Linear Equations

CONTROLLABILITY. Chapter Reachable Set and Controllability. Suppose we have a linear system described by the state equation

GENERATING SETS KEITH CONRAD

MATH 423 Linear Algebra II Lecture 38: Generalized eigenvectors. Jordan canonical form (continued).

SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison

Lecture 4: Partitioned Matrices and Determinants

Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.

Data Mining: Algorithms and Applications Matrix Math Review

Typical Linear Equation Set and Corresponding Matrices

Here are some examples of combining elements and the operations used:

Orthogonal Diagonalization of Symmetric Matrices

Linear Algebra: Determinants, Inverses, Rank

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Similar matrices and Jordan form

Factorization Theorems

Matrix Differentiation

Section Inner Products and Norms

Lecture Notes 2: Matrices as Systems of Linear Equations

Recall that two vectors in are perpendicular or orthogonal provided that their dot

26. Determinants I. 1. Prehistory

Section 5.3. Section 5.3. u m ] l jj. = l jj u j + + l mj u m. v j = [ u 1 u j. l mj

Lecture notes on linear algebra

Introduction to Matrices for Engineers

Linear Algebra Review. Vectors

DATA ANALYSIS II. Matrix Algorithms

Linear Algebra Notes

Chapter 2 Determinants, and Linear Independence

160 CHAPTER 4. VECTOR SPACES

( ) which must be a vector

Matrices and Linear Algebra

Continued Fractions and the Euclidean Algorithm

1 VECTOR SPACES AND SUBSPACES

The Singular Value Decomposition in Symmetric (Löwdin) Orthogonalization and Data Compression

Lecture 1: Systems of Linear Equations

Chapter 6. Orthogonality

6. Cholesky factorization

DETERMINANTS TERRY A. LORING

Eigenvalues, Eigenvectors, Matrix Factoring, and Principal Components

Inner products on R n, and more

Lecture 5 Principal Minors and the Hessian

AMATH 352 Lecture 3 MATLAB Tutorial Starting MATLAB Entering Variables

NOTES ON LINEAR TRANSFORMATIONS

Solution of Linear Systems

1.2 Solving a System of Linear Equations

Matrices 2. Solving Square Systems of Linear Equations; Inverse Matrices

T ( a i x i ) = a i T (x i ).

by the matrix A results in a vector which is a reflection of the given

Lectures notes on orthogonal matrices (with exercises) Linear Algebra II - Spring 2004 by D. Klain

A note on companion matrices

MA106 Linear Algebra lecture notes

Chapter 19. General Matrices. An n m matrix is an array. a 11 a 12 a 1m a 21 a 22 a 2m A = a n1 a n2 a nm. The matrix A has n row vectors

Orthogonal Bases and the QR Algorithm

Lecture 3: Finding integer solutions to systems of linear equations

Solving Systems of Linear Equations

18.06 Problem Set 4 Solution Due Wednesday, 11 March 2009 at 4 pm in Total: 175 points.

Notes on Orthogonal and Symmetric Matrices MENU, Winter 2013

Inner Product Spaces and Orthogonality

α = u v. In other words, Orthogonal Projection

RESULTANT AND DISCRIMINANT OF POLYNOMIALS

9.2 Summation Notation

9 MATRICES AND TRANSFORMATIONS

MATH APPLIED MATRIX THEORY

LU Factoring of Non-Invertible Matrices

Operation Count; Numerical Linear Algebra

University of Lille I PC first year list of exercises n 7. Review

Notes on Linear Algebra. Peter J. Cameron

Linear Codes. Chapter Basics

Transcription:

MATH 304 Linear Algebra Lecture 6: Transpose of a matrix. Determinants.

Transpose of a matrix Definition. Given a matrix A, the transpose of A, denoted A T, is the matrix whose rows are columns of A (and whose columns are rows of A). That is, if A = (a ij ) then A T = (b ij ), where b ij = a ji. Examples. 7 8 9 T ( ) T 1 2 3 = 4 5 6 = (7, 8, 9), 1 4 2 5, 3 6 ( ) T 4 7 = 7 0 ( ) 4 7. 7 0

Properties of transposes: (A T ) T = A (A + B) T = A T + B T (ra) T = ra T (AB) T = B T A T (A 1 A 2... A k ) T = A T k... AT 2 AT 1 (A 1 ) T = (A T ) 1

Definition. A square matrix A is said to be symmetric if A T = A. For example, any diagonal matrix is symmetric. Proposition For any square matrix A the matrices B = AA T and C = A + A T are symmetric. Proof: B T = (AA T ) T = (A T ) T A T = AA T = B, C T = (A + A T ) T = A T + (A T ) T = A T + A = C.

Determinants Determinant is a scalar assigned to each square matrix. Notation. The determinant of a matrix A = (a ij ) 1 i,j n is denoted det A or a 11 a 12... a 1n a 21 a 22... a 2n....... a n1 a n2... a nn Principal property: det A = 0 if and only if the matrix A is singular.

Definition in low dimensions Definition. det (a) = a, a b c d = ad bc, a 11 a 12 a 13 a 21 a 22 a 23 a 31 a 32 a 33 = a 11a 22 a 33 + a 12 a 23 a 31 + a 13 a 21 a 32 a 13 a 22 a 31 a 12 a 21 a 33 a 11 a 23 a 32. + : : * *, * * * *, * *, * * * *, * *. * * * *.

Examples: 2 2 matrices 1 0 0 1 = 1, 3 0 0 4 = 12, 2 5 0 3 = 6, 7 0 5 2 = 14, 0 1 1 0 = 1, 0 0 4 1 = 0, 1 3 1 3 = 0, 2 1 8 4 = 0.

Examples: 3 3 matrices 3 2 0 1 0 1 = 3 0 0 + ( 2) 1 ( 2) + 0 1 3 2 3 0 0 0 ( 2) ( 2) 1 0 3 1 3 = 4 9 = 5, 1 4 6 0 2 5 0 0 3 = 1 2 3 + 4 5 0 + 6 0 0 6 2 0 4 0 3 1 5 0 = 1 2 3 = 6.

General definition The general definition of the determinant is quite complicated as there is no simple explicit formula. There are several approaches to defining determinants. Approach 1 (original): an explicit (but very complicated) formula. Approach 2 (axiomatic): we formulate properties that the determinant should have. Approach 3 (inductive): the determinant of an n n matrix is defined in terms of determinants of certain (n 1) (n 1) matrices.

M n (R): the set of n n matrices with real entries. Theorem There exists a unique function det : M n (R) R (called the determinant) with the following properties: if a row of a matrix is multiplied by a scalar r, the determinant is also multiplied by r; if we add a row of a matrix multiplied by a scalar to another row, the determinant remains the same; if we interchange two rows of a matrix, the determinant changes its sign; det I = 1. Corollary det A = 0 if and only if the matrix A is singular.

Row echelon form of a square matrix A: det A 0 det A = 0

3 2 0 Example. A = 1 0 1, det A =? 2 3 0 In the previous lecture we have transformed the matrix A into the identity matrix using elementary row operations. interchange the 1st row with the 2nd row, add 3 times the 1st row to the 2nd row, add 2 times the 1st row to the 3rd row, multiply the 2nd row by 0.5, add 3 times the 2nd row to the 3rd row, multiply the 3rd row by 0.4, add 1.5 times the 3rd row to the 2nd row, add 1 times the 3rd row to the 1st row.

3 2 0 Example. A = 1 0 1, det A =? 2 3 0 In the previous lecture we have transformed the matrix A into the identity matrix using elementary row operations. These included two row multiplications, by 0.5 and by 0.4, and one row exchange. It follows that det I = ( 0.5) ( 0.4) det A = ( 0.2) det A. Hence det A = 5 det I = 5.

Other properties of determinants If a matrix A has two identical rows then det A = 0. a 1 a 2 a 3 b 1 b 2 b 3 a 1 a 2 a 3 = 0 If a matrix A has two rows proportional then det A = 0. a 1 a 2 a 3 b 1 b 2 b 3 ra 1 ra 2 ra 3 = r a 1 a 2 a 3 b 1 b 2 b 3 a 1 a 2 a 3 = 0

Distributive law for rows Suppose that matrices X, Y, Z are identical except for the ith row and the ith row of Z is the sum of the ith rows of X and Y. Then det Z = det X + det Y. a 1 +a 1 a 2+a 2 a 3+a 3 b 1 b 2 b 3 c 1 c 2 c 3 = a 1 a 2 a 3 b 1 b 2 b 3 c 1 c 2 c 3 + a 1 a 2 a 3 b 1 b 2 b 3 c 1 c 2 c 3

Adding a scalar multiple of one row to another row does not change the determinant of a matrix. a 1 + rb 1 a 2 + rb 2 a 3 + rb 3 b 1 b 2 b 3 c 1 c 2 c 3 = a 1 a 2 a 3 = b 1 b 2 b 3 c 1 c 2 c 3 + rb 1 rb 2 rb 3 b 1 b 2 b 3 c 1 c 2 c 3 = a 1 a 2 a 3 b 1 b 2 b 3 c 1 c 2 c 3

Definition. A square matrix A = (a ij ) is called upper triangular if all entries below the main diagonal are zeros: a ij = 0 whenever i > j. The determinant of an upper triangular matrix is equal to the product of its diagonal entries. a 11 a 12 a 13 0 a 22 a 23 0 0 a 33 = a 11a 22 a 33 If A = diag(d 1, d 2,...,d n ) then det A = d 1 d 2... d n. In particular, det I = 1.

Determinant of the transpose If A is a square matrix then det A T = det A. a 1 b 1 c 1 a 2 b 2 c 2 a 3 b 3 c 3 = a 1 a 2 a 3 b 1 b 2 b 3 c 1 c 2 c 3

Columns vs. rows If one column of a matrix is multiplied by a scalar, the determinant is multiplied by the same scalar. Interchanging two columns of a matrix changes the sign of its determinant. If a matrix A has two columns proportional then det A = 0. Adding a scalar multiple of one column to another does not change the determinant of a matrix.

Submatrices Definition. Given a matrix A, a k k submatrix of A is a matrix obtained by specifying k columns and k rows of A and deleting the other columns and rows. 1 2 3 4 2 4 10 20 30 40 3 5 7 9 5 9 ( ) 2 4 5 9

Given an n n matrix A, let M ij denote the (n 1) (n 1) submatrix obtained by deleting the ith row and the jth column of A. 3 2 0 Example. A = 1 0 1. 2 3 0 ( ) ( ) ( ) 0 1 1 1 1 0 M 11 =, M 3 0 12 =, M 2 0 13 =, 2 3 ( ) ( ) ( ) 2 0 3 0 3 2 M 21 =, M 22 =, M 23 =, M 31 = 3 0 ( 2 0 0 1 2 0 ) ( ) 3 0, M 32 =, M 1 1 33 = 2 3 ( ) 3 2. 1 0

Row and column expansions Given an n n matrix A = (a ij ), let M ij denote the (n 1) (n 1) submatrix obtained by deleting the ith row and the jth column of A. Theorem For any 1 k, m n we have that n det A = ( 1) k+j a kj det M kj, j=1 (expansion by kth row) n det A = ( 1) i+m a im det M im. i=1 (expansion by mth column)

Signs for row/column expansions + + + + + + + +.......

1 2 3 Example. A = 4 5 6. 7 8 9 Expansion by the 1st row: 1 2 3 5 6 4 6 4 5 8 9 7 9 7 8 det A = 1 5 6 8 9 2 4 6 7 9 + 3 4 5 7 8 = (5 9 6 8) 2(4 9 6 7) + 3(4 8 5 7) = 0.

1 2 3 Example. A = 4 5 6. 7 8 9 Expansion by the 2nd column: 2 1 3 1 3 4 6 5 4 6 7 9 7 9 8 det A = 2 4 6 7 9 + 5 1 3 7 9 8 1 3 4 6 = 2(4 9 6 7) + 5(1 9 3 7) 8(1 6 3 4) = 0.

1 2 3 Example. A = 4 5 6. 7 8 9 Subtract the 1st row from the 2nd row and from the 3rd row: 1 2 3 4 5 6 7 8 9 = 1 2 3 3 3 3 7 8 9 = 1 2 3 3 3 3 6 6 6 = 0 since the last matrix has two proportional rows.