B = B is a 3 4 matrix; b 32 = 3 and b 2 4 = 3. Scalar Multiplication

Similar documents
Vector Spaces and Vector Subspaces. Remarks. Euclidean Space

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

Chapter 1 Simple Linear Regression (part 6: matrix version)

CHAPTER I: Vector Spaces

Matrices and vectors

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Quiz. Use either the RATIO or ROOT TEST to determine whether the series is convergent or not.

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.

(3) If you replace row i of A by its sum with a multiple of another row, then the determinant is unchanged! Expand across the i th row:

Chapter Vectors

, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)

PAPER : IIT-JAM 2010

Matrix Algebra 2.2 THE INVERSE OF A MATRIX Pearson Education, Inc.

SIGNALS AND SYSTEMS I Computer Assignment 1

Determinants of order 2 and 3 were defined in Chapter 2 by the formulae (5.1)

(I.C) Matrix algebra

Math 299 Supplement: Real Analysis Nov 2013

A brief introduction to linear algebra

APPENDIX F Complex Numbers

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

MATH10212 Linear Algebra B Proof Problems

We are mainly going to be concerned with power series in x, such as. (x)} converges - that is, lims N n

M 340L CS Homew ork Set 6 Solutions

M 340L CS Homew ork Set 6 Solutions

f(x) dx as we do. 2x dx x also diverges. Solution: We compute 2x dx lim

CHAPTER 5. Theory and Solution Using Matrix Techniques

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.

8. Applications To Linear Differential Equations

Homework 2 January 19, 2006 Math 522. Direction: This homework is due on January 26, In order to receive full credit, answer

6 Integers Modulo n. integer k can be written as k = qn + r, with q,r, 0 r b. So any integer.

a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a

Mathematics 3 Outcome 1. Vectors (9/10 pers) Lesson, Outline, Approach etc. This is page number 13. produced for TeeJay Publishers by Tom Strang

Chapter Unary Matrix Operations

REVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

Addition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c

Chapter 0. Review of set theory. 0.1 Sets

Review Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =

Why learn matrix algebra? Vectors & Matrices with statistical applications. Brief history of linear algebra

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

PROBLEM SET I (Suggested Solutions)

Integrable Functions. { f n } is called a determining sequence for f. If f is integrable with respect to, then f d does exist as a finite real number

Appendix F: Complex Numbers

a for a 1 1 matrix. a b a b 2 2 matrix: We define det ad bc 3 3 matrix: We define a a a a a a a a a a a a a a a a a a

Ma 530 Infinite Series I

1. By using truth tables prove that, for all statements P and Q, the statement

Physics 324, Fall Dirac Notation. These notes were produced by David Kaplan for Phys. 324 in Autumn 2001.

Principle Of Superposition

Mon Feb matrix inverses. Announcements: Warm-up Exercise:

( ) ( ) ( ) notation: [ ]

1 1 2 = show that: over variables x and y. [2 marks] Write down necessary conditions involving first and second-order partial derivatives for ( x0, y

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Basic Sets. Functions. MTH299 - Examples. Example 1. Let S = {1, {2, 3}, 4}. Indicate whether each statement is true or false. (a) S = 4. (e) 2 S.

5. Matrix exponentials and Von Neumann s theorem The matrix exponential. For an n n matrix X we define

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Additional Notes on Power Series

x x x Using a second Taylor polynomial with remainder, find the best constant C so that for x 0,

Infinite Series and Improper Integrals

CEE 522 Autumn Uncertainty Concepts for Geotechnical Engineering

Chimica Inorganica 3

Series: Infinite Sums

University of Manitoba, Mathletics 2009

Stochastic Matrices in a Finite Field

Chapter 6 Infinite Series

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

9.3 Power Series: Taylor & Maclaurin Series

Lesson 10: Limits and Continuity

1 lim. f(x) sin(nx)dx = 0. n sin(nx)dx

Axioms of Measure Theory

A) is empty. B) is a finite set. C) can be a countably infinite set. D) can be an uncountable set.

C191 - Lecture 2 - Quantum states and observables

INTRODUCTION TO MATRIX ALGEBRA. a 11 a a 1n a 21 a a 2n...

CALCULATION OF FIBONACCI VECTORS

Recurrence Relations

TEACHER CERTIFICATION STUDY GUIDE

Introduction to Optimization Techniques

Complex Numbers. Brief Notes. z = a + bi

Some examples of vector spaces

Math Solutions to homework 6

Created by T. Madas SERIES. Created by T. Madas

f(x)g(x) dx is an inner product on D.

Web Appendix O - Derivations of the Properties of the z Transform

ENGI Series Page 6-01

LinearAlgebra DMTH502

LINEAR ALGEBRA. Paul Dawkins

A gentle introduction to Measure Theory

Enumerative & Asymptotic Combinatorics

Regn. No. North Delhi : 33-35, Mall Road, G.T.B. Nagar (Opp. Metro Gate No. 3), Delhi-09, Ph: ,

CALCULATING FIBONACCI VECTORS

1 Approximating Integrals using Taylor Polynomials

1. n! = n. tion. For example, (n+1)! working with factorials. = (n+1) n (n 1) 2 1

A Hadamard-type lower bound for symmetric diagonally dominant positive matrices

Most text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t

Matrix Algebra from a Statistician s Perspective BIOS 524/ Scalar multiple: ka

Ma 4121: Introduction to Lebesgue Integration Solutions to Homework Assignment 5

Assignment 2 Solutions SOLUTION. ϕ 1 Â = 3 ϕ 1 4i ϕ 2. The other case can be dealt with in a similar way. { ϕ 2 Â} χ = { 4i ϕ 1 3 ϕ 2 } χ.

Solutions to Math 347 Practice Problems for the final

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

September 2012 C1 Note. C1 Notes (Edexcel) Copyright - For AS, A2 notes and IGCSE / GCSE worksheets 1

SECTION 2 Electrostatics

Transcription:

MATH 37 Matrices Dr. Neal, WKU A m matrix A = (a i j ) is a array of m umbers arraged ito m rows ad colums, where a i j is the etry i the ith row, jth colum. The values m are called the dimesios (or size) of the matrix. If the dimesios are, the A is called a square matrix. For aother m matrix B = (b i j ), we say A = B iff a i j = b i j for all i, j. A = 4 A is a 3 matrix; a = ad a 3 = 6 4 B = 3 3 5 B is a 3 4 matrix; b 3 = 3 ad b 4 = 3 4 3 G = 5 6 8 5 G is a square matrix with dimesios 3 3 Scalar Multiplicatio Let A = (a i j ) be a m matrix ad let c be a real umber. (Heceforth, a idividual real umber will be called a scalar.) We defie scalar multiplicatio to be the product of the scalar c with the matrix A give by c A = (c a i j ). That is, we simply multiply every etry i A by the value c. For A as give above, the 3A = 3 4 6 3 =. 9 8 Matrix Additio Let A = (a i j ) ad B = (b i j ) both be m matrices. The we defie the sum A + B by A + B = (c i j ), where c i j = a i j + b i j or A + B = (a i j + b i j ). That is, if A ad B have the same dimesios, the we ca add A ad B ad we do so by addig their etries term by term: Example. 4 + 3 5 6 = 5 4 4 6 The operatios of scalar multiplicatio ad matrix additio make the set of all m matrices a vector space over the set of real umbers. I this cotext, a m matrix is called a vector ad the real umbers are the scalars. A special case is the set of matrices, which are more ofte called the set of vectors i -dimesioal space, or R : (x x... x )

Properties of Scalar Multiplicatio. Closure: If A is m, the c A is also m for every scalar c.. Scalar Multiplicative Idetity: A = A for all m matrices A. 3. Associative: c(d A) = (c d )A for all scalars c ad d ad all m matrices A. 4. Scalar Distributio: c(a + B) = c A + c B for all scalars c ad all m matrices A, B. 5. Matrix Distributio: (c + d) A = c A + d A for all scalars c, d ad all m matrices A. Properties of Matrix Additio. Closure: If A ad B are m, the A + B is also m.. Commutative: A + B = B + A for all m matrices A ad B. 3. Associative: A + (B + C) = (A + B) + C for all m matrices A, B, ad C. 4. Additive Idetity: A + = A for all m matrices A, where is the m Zero matrix that has a for each etry. 5. Additive Iverse: A is the scalar product ( )A ad A + ( A) = for all m matrices A. We defie matrix subtractio by A B = A + ( B) = (a i j b i j ), which is doe by subtractig etries term by term. Note: A = B if ad oly if A B =. Matrix Multiplicatio Let A = (a i j ) be a m matrix, ad let B = (b i j ) be a p matrix. Because the umber of colums i A equals the umber of rows i B, we ca defie the matrix product AB (i that order) to be a m p matrix give by AB = C = (c i j ), where c i j = a i k b k j. Example. 3 4 A = 4 4 B = 3 D = 5 3 5 6 3 3 4 4 A B B D D A 3 3 4 3 4 4 4 3 # of cols i A equals # rows i B, so AB is defied ad is 4 # of cols i B equals # of rows i D, so BD is defied ad is 3 # of cols i D equals # of rows i A, so DA is defied ad is 4 3 Note: With these matrices, BA, DB, ad AD are ot defied.

Now how do we compute a matrix product? Cosider A ad B as above, ad let C = AB be its 4 product. C = AB = c c c 3 c 4 c c c 3 c 4 Dr. Neal, WKU To fid c i j, use the ier product of the ith row of A with the jth colum of B. A = 4 4 B = 3 3 5 4 c = () + ( )() + 4( ) = 8 4 4 3 c = (4) + ( )() + 4(3) = 4 5 c 3 = () + ( )() + 4(5) = 3 4 3 c 4 = () + ( )( 3) + 4() = 3 6 c = () + 3() + 6( ) = 6 3 6 4 3 c = (4) + 3() + 6(3) =8 3 6 5 c 3 = () + 3() + 6(5) = 33 3 6 3 c 4 = () + 3( 3) + 6() = 3 8 3 C = AB = 6 8 33 3 Note: To avoid this tedious maual labor, you should lear how to eter matrices ito your calculator usig the MATRIX EDIT scree. You ca the recall matrices to the HOME scree from the MATRIX NAMES meu. With A, B, ad D defied as i Example, use your calculator to verify that BD = 8 4 7 3 6 8 4 3 ad DA = 3. 7 4

Idetity Matrix The idetity matrix, deoted I, is the matrix with all s dow the mai diagoal ad s everywhere else: I = (e i j ), where e i i = ad e i j = for i j. I = I 3 = I 4 = Theorem.. Let A = (a i j ) be a m matrix. The I m A = A ad A I = A. Proof. Because I m has m colums which equals the umber of rows i A, the product I m A is defied. Moreover, I m A is m (the umber of rows i I m by the umber of colums i A). So I m A has the same dimesios as A. m Now let I m A = C = (c i j ), where c i j = e i k a k j. If k i, the e i k =, ad e i i = ; hece, c i j simplifies to c i j = e i i a i j = a i j. Because their etries are equal for all i, j, we have C = A. Now cosider A I, which is defied because A has colums which equals the umber of rows i I. Moreover, A I is m which is the same size as A. Now let A I = D = (d i j ), where d i j = a i k e k j. If k j, the e k j =, ad e j j = ; hece, d i j simplifies to d i j = a i j e j j = a i j. Because their etries are equal for all i, j, we have D = A. Example 3. Let A = 4, which is 3. The I 3 6 A = A = A I 3. That is, 4 4 4 = = 3 3 3 3 3

Other Properties of Matrix Multiplicatio. Associative: A(BC) = (AB)C, wheever A is m, B is p, ad C is p q.. Distributive: A(B + C) = AB + AC wheever A is m ad B, C are p. 3. Distributive: (A + B)C = AC + BC wheever A, B are m ad C is p. 4. Scalar Associative: c(ab) = (ca)b = A(cB) for all scalars c wheever A is m, B is p. Proof of. Let A = (a i j ), B = (b i j ), ad C = (c i j ). The B + C = (b i j + c i j ) ad A(B + C) = D = (d i j ), where d i j = a i k (b k j + c k j ) = a i k b k j + a i k c k j = a i k b k j + a i k c k j = f i j, k = k = where ( f i j ) = AB + AC. Defiitio. A square matrix A = (a i j ) is called diagoal if a i j = wheever i j. Theorem.. Let A = (a i j ) ad B = (b i j ) both be diagoal square matrices. The AB = BA = (c i j ), where c i i = a i i b i i ad c i j = for i j. That is, AB = BA ad this product is a diagoal matrix with its diagoal etries beig the product of the diagoal etries i A ad B. Proof. Because A ad B are both, the products AB ad BA are both defied ad are. Because A ad B are diagoal, the a i j = ad b i j = wheever i j. Now let AB = C = (c i j ), where c i j = a i k b k j. Wheever k i, the a i k = ; hece, c i j simplifies to c i j = a i i b i j. Now if j i, the b i j = ad so c i j =. If j = i, the c i i = a i i b i i. A aalogous argumet shows the result as well for the product BA. 3 6 Example 4. Let A = 4 ad B =. The AB = 8 = BA. 3 4 Note: Whever A ad B are both, the the products AB ad BA are both defied. However, it is geerally the case that AB BA. (Create your ow example with some matrices!) So matrix multiplicatio is o-commutative.

Traspose Let A = (a i j ) be a m matrix. We defie A traspose deoted by A T to be a m matrix defied by A T = ( a i ʹ j ), where a i ʹ j = a j i. That is, we simply take rows of A ad make them the colums of A T (or take the colums of A ad make them the rows of A T ). A square matrix A is called symmetric if A T = A, which meas that a i j = a j i for all i, j. Example 5. Let A = 4 4 3 G = 5 6 8 5 3 5 6 4 H = 3 8 9 5 4 9 The A T = 3 4 6 4 5 8 G T = 5 3 6 ad H T = H, so H is symmetric. Quick Facts: (i) (A T ) T = A (The traspose of the traspose gives back the origial A.) (ii) (ca) T = c( A T ) ad ( A + B) T = A T + B T. Fact (ii) meas that traspose is a liear operator o the set of matrices (i.e., costats factor out ad traspose is additive.) You have see other liear operators such as the itegral operator o the set of cotiuous fuctios f. With itegratio, we have c f (x ) dx = c f (x )dx ad ( f ( x) + g( x) ) dx = f (x )dx + g( x) dx ; that is, costats factor out ad itegratio is additive. Other liear operators iclude differetiatio o the set of differetiable fuctios ad summatio o the set of ifiite series. Theorem.3. Let A be a m matrix. The AA T ad A T A are both defied ad are square matrices. Proof. Because A is m, the A T is m. So the umber of colums i A equals the umber of rows i A T ; thus, AA T is defied ad is m m, (the umber of rows i A by the umber of colums i A T ). Because A T is m ad A is m, the umber of colums i A T equals the umber of rows i A. So A T A is defied ad is (the umber of rows i A T by the umber of colums i A).