DOCSLIB.ORG

Lecture 5: July 3, 2013

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Lecture 5: July 3, 2013 Lecture 5: July 3, 2013 Properties of Matrix Operations The first three theorems of Section 1.6 give properties of matrix addition, scalar multiplication, and matrix multiplication. I did not present these theorems in class, but asked you to read them on your own. I list them here, grouping the properties in a slightly different manner. Properties of Matrix Addition: Let A; B, and C be (m × n) matrices. (a) Addition is associative: (A + B) + C = A + (B + C). (b) Addition is commutative: A + B = B + A. (c) Additive Identity: there exists a unique (m × n) matrix O called the zero matrix such that A + O = O + A = A. (d) Additive inverses exist: there exists an (m × n) matrix (−A) such that A + (−A) = O. (This is easily seen to be the matrix −1 · A.) Properties of Matrix Multiplication: Let A be an (m × n) matrix, let B be an (n × p) matrix, and let C be a (p × q) matrix. (a) Multiplication is associative: (AB)C = A(BC). (b) Multiplicative Identity: There exist a unique (m × m) matrix Im and a unique (n × n) matrix In such that ImA = AIn = A Properties of Scalar Multiplication: Let A be an (m × n) matrix, let B be an (n × p) matrix and let r and s be scalars. (a) Scalar multiplication is associative: (rs)A = r(sA) and r(AB) = (rA)B. (b) Scalar multiplication commutes with matrix multiplication: (rA)B = A(rB). Distributive Properties: Let A and B be (m × n) matrices, let C and D be (n × p) matrices, and let r and s be scalars. (a) Matrix multiplication distributes over matrix addition : (A + B)C = AB + BC and A(C + D) = AC + AD. (b) Matrix multiplication distributes over scalar addition: (r + s)A = rA + sA. (c) Scalar multiplication distributes over matrix addition: r(A + B) = rA + rB. Special Matrices Let us introduce some important matrices, the (m × n) zero matrix and the (n × n) identity matrix (these are the same matrices as in the theorems above). The (m × n) zero matrix, denoted by O in our textbook, is the (m × n) matrix consisting entirely of zeros: 2 0 0 ··· 0 3 6 0 0 ··· 0 7 O = 6 7 6 . 7 4 . 5 0 0 ··· 0 1 It is easy to see that this indeed behaves as the additive identity for (m × n) matrices. The (n × n) identity matrix, denoted In, is the (n × n) matrix with ones along the main diagonal and zeros everywhere else: 2 1 0 0 ··· 0 0 3 6 0 1 0 ··· 0 0 7 6 7 6 0 0 1 ··· 0 0 7 I = 6 7 n 6 . 7 6 . 7 6 7 4 0 0 0 ··· 1 0 5 0 0 0 ··· 0 1 So, for example, 2 1 0 0 3 1 0 I = and I = 0 1 0 2 0 1 3 4 5 0 0 1 When n is clear from the context, we will omit the subscript and write I instead of In. The identity matrix behaves as the multiplicative identity for (n × n) matrices and, more generally, if A is an (m × n) matrix, we have ImA = AIn = A What's Missing? If you look carefully at Theorems 1.7, 1.8, and 1.9, you will notice that certain nice properties of real number multiplication do not seem to carry over. In particular, • Matrix multiplication is NOT commutative: in general, AB 6= BA, even if both products are defined and have the same dimensions. For example, in the previous lecture we saw that 5 2 0 −1 6 −3 0 −1 5 2 −1 −1 = but = 1 1 3 1 3 0 3 1 1 1 16 7 • There was no mention of matrix division. We will discuss matrix inverses in Section 1.9. However, it is worth making a few comments here. We know that every nonzero real number k has a multiplicative inverse, namely 1=k and this inverse has the property that k · 1=k = 1. The situation with matrices is much more complicated: First, we restrict ourselves to square matrices. In this case, we can define inverses analagously to the real number case, namely if A and B are two (n × n) matrices then A and B are inverses if AB = In. However, it is not true that every nonzero square matrix has an inverse. To see what might go wrong, consider the following multiplication: 0 1 0 1 0 0 = 0 0 0 0 0 0 Thus, it is possible to find a nonzero matrix whose square is the zero matrix. This phenomenon has no analogue over the real numbers. We'll discuss matrix inverses in much more detail in a few days, but the lesson from these two examples is that matrix multiplication can be somewhat surprising and should be careful not to assume matrix multiplication behaves just like real number multiplication. The Transpose of a Matrix T Definition: Let A = (aij) be an (m × n) matrix. The transpose of A is the (n × m) matrix A obtained by interchanging the rows and columns of A: T (A )ij = aji 2 Examples: Let A and B be the matrices 1 2 3 1 2 A = and B = 4 5 6 0 3 Then 2 1 4 3 1 0 AT = 2 5 and BT = 4 5 2 3 3 6 Theorem 1.10: Let A and B be two (m × n) matrices and let C be an (n × p) matrix. Then 1.( A + B)T = AT + BT 2.( AC)T = CT AT (order is reversed) 3.( AT )T = A Note: Although the reversed order in 2. may seem counter-intuitive at first, it becomes more plausible if we consider the dimensions of these matrices. A is an (m × n) matrix so AT is an (n × m) matrix; C is an (n × p) matrix so CT is a (p × n) matrix. The product AC is an (m × p) matrix so (AC)T will be a (p × m) matrix. The product CT AT is also a (p × m) matrix, while the product AT CT is not even defined if m 6= p. Now that the result at least seems plausible, let's go ahead and prove it. Proof of 2: By the remark above, we see that (AC)T and CT AT have the same dimensions. Recall the formula for matrix multiplication: n X (AC)ij = (A)ik(C)kj k=1 Thus, using the definition of transpose, we have n T X ((AC) )ij = (AC)ji = (A)jk(C)ki k=1 Also, using the definitions of matrix multiplication and transpose, n n T T X T T X (C A )ij = (C )ik(A )kj = (C)ki(A)jk k=1 k=1 But (C)ki and (A)jk are scalars and scalar multiplication is commutative so we see that n n T X X T T ((AC) )ij = (A)jk(C)ki = (C)ki(A)jk = (C A )ij k=1 k=1 It follows that (AC)T = CT AT . Definition: An (m × n) matrix is symmetric if AT = A. Note that A is an (m × n) matrix and AT is an (n × m) matrix. Thus, if AT = A, it must be the case that m = n so A is a so-called square matrix. Since only square matrices can be symmetric, we may as well refine our definition: Refined Definition: A symmetric matrix is an (n × n) matrix satisfying AT = A. 3 Examples: The matrices 2 1 2 3 3 1 2 and 2 4 5 2 3 4 5 3 5 6 are symmetric. However, the matrices 2 1 2 3 3 2 2 3 4 3 4 1 2 3 5 and 4 1 2 3 5 1 2 3 0 1 2 are not symmetric. In the definition of symmetric matrix, the only symmetry we are interested in is symmetry about the main diagaonal. The matrix may exhibit other forms of symmetry, but these do not count towards the definition of symmetric matrix. The matrices from above are displayed again below with the main diagonal in red in each case: 2 123 3 2 123 3 2 234 3 12 ; 245 ; 123 ; 123 23 4 5 4 5 4 5 3 56 1 23 0 12 Exercise: For what avalues of a, b, and c is the following matrix symmetric? 2 1 2 5 4 3 6 a 7 1 b 7 6 7 4 5 1 c 3 5 4 0 3 8 (As usual, the answers can be found at the end of these lecture notes.) Scalar Product and Vector Norms In Math 126, you defined the dot product of two vectors in 2- and 3-dimensions as well as the magnitude of 2- and 3-dimensional vectors. Here, we will generalize these ideas to n-dimensional vectors and see how to nicely express them using matrix notation. Recall that if x = hx1; x2; x3i and y = hy1; y2; y3i, the dot product of x and y was given by x • y = x1y1 + x2y2 + x3y3 and the magnitude of x was given by q 2 2 2 kxk = x1 + x2 + x3 (where this formula was derived from the Pythagorean Theorem). Let us generalize these concepts to Rn, using the notation of this class. Let x and y be the n-dimensional vectors 2 3 2 3 x1 y1 6 x2 7 6 y2 7 x = 6 7 and y = 6 7 6 . 7 6 . 7 4 . 5 4 . 5 xn yn Definition: The scalar product (or dot product) of x and y is the scalar T x y = x1y1 + x2y2 + ··· + xnyn The Euclidean norm (or magnitude) of x is the scalar p q T 2 2 2 kxk = x x = x1 + x2 + ··· + xn 4 (Note: technically, xT y and xT x are (1 × 1) matrices.
Load more

Recommended publications
  • Eigenvalues and Eigenvectors
    Jim Lambers MAT 605 Fall Semester 2015-16 Lecture 14 and 15 Notes These notes correspond to Sections 4.4 and 4.5 in the text. Eigenvalues and Eigenvectors In order to compute the matrix exponential eAt for a given matrix A, it is helpful to know the eigenvalues and eigenvectors of A. Definitions and Properties Let A be an n × n matrix. A nonzero vector x is called an eigenvector of A if there exists a scalar λ such that Ax = λx: The scalar λ is called an eigenvalue of A, and we say that x is an eigenvector of A corresponding to λ. We see that an eigenvector of A is a vector for which matrix-vector multiplication with A is equivalent to scalar multiplication by λ. Because x is nonzero, it follows that if x is an eigenvector of A, then the matrix A − λI is singular, where λ is the corresponding eigenvalue. Therefore, λ satisfies the equation det(A − λI) = 0: The expression det(A−λI) is a polynomial of degree n in λ, and therefore is called the characteristic polynomial of A (eigenvalues are sometimes called characteristic values). It follows from the fact that the eigenvalues of A are the roots of the characteristic polynomial that A has n eigenvalues, which can repeat, and can also be complex, even if A is real. However, if A is real, any complex eigenvalues must occur in complex-conjugate pairs. The set of eigenvalues of A is called the spectrum of A, and denoted by λ(A). This terminology explains why the magnitude of the largest eigenvalues is called the spectral radius of A.
    [Show full text]
  • Algebra of Linear Transformations and Matrices Math 130 Linear Algebra
    Then the two compositions are 0 −1 1 0 0 1 BA = = 1 0 0 −1 1 0 Algebra of linear transformations and 1 0 0 −1 0 −1 AB = = matrices 0 −1 1 0 −1 0 Math 130 Linear Algebra D Joyce, Fall 2013 The products aren't the same. You can perform these on physical objects. Take We've looked at the operations of addition and a book. First rotate it 90◦ then flip it over. Start scalar multiplication on linear transformations and again but flip first then rotate 90◦. The book ends used them to define addition and scalar multipli- up in different orientations. cation on matrices. For a given basis β on V and another basis γ on W , we have an isomorphism Matrix multiplication is associative. Al- γ ' φβ : Hom(V; W ) ! Mm×n of vector spaces which though it's not commutative, it is associative. assigns to a linear transformation T : V ! W its That's because it corresponds to composition of γ standard matrix [T ]β. functions, and that's associative. Given any three We also have matrix multiplication which corre- functions f, g, and h, we'll show (f ◦ g) ◦ h = sponds to composition of linear transformations. If f ◦ (g ◦ h) by showing the two sides have the same A is the standard matrix for a transformation S, values for all x. and B is the standard matrix for a transformation T , then we defined multiplication of matrices so ((f ◦ g) ◦ h)(x) = (f ◦ g)(h(x)) = f(g(h(x))) that the product AB is be the standard matrix for S ◦ T .
    [Show full text]
  • Math 217: Multilinearity of Determinants Professor Karen Smith (C)2015 UM Math Dept Licensed Under a Creative Commons By-NC-SA 4.0 International License
    Math 217: Multilinearity of Determinants Professor Karen Smith (c)2015 UM Math Dept licensed under a Creative Commons By-NC-SA 4.0 International License. A. Let V −!T V be a linear transformation where V has dimension n. 1. What is meant by the determinant of T ? Why is this well-defined? Solution note: The determinant of T is the determinant of the B-matrix of T , for any basis B of V . Since all B-matrices of T are similar, and similar matrices have the same determinant, this is well-defined—it doesn't depend on which basis we pick. 2. Define the rank of T . Solution note: The rank of T is the dimension of the image. 3. Explain why T is an isomorphism if and only if det T is not zero. Solution note: T is an isomorphism if and only if [T ]B is invertible (for any choice of basis B), which happens if and only if det T 6= 0. 3 4. Now let V = R and let T be rotation around the axis L (a line through the origin) by an 21 0 0 3 3 angle θ. Find a basis for R in which the matrix of ρ is 40 cosθ −sinθ5 : Use this to 0 sinθ cosθ compute the determinant of T . Is T othogonal? Solution note: Let v be any vector spanning L and let u1; u2 be an orthonormal basis ? for V = L . Rotation fixes ~v, which means the B-matrix in the basis (v; u1; u2) has 213 first column 405.
    [Show full text]
  • Basic Multivector Calculus, Proceedings of FAN 2008, Hiroshima, Japan, 23+24 October 2008
    E. Hitzer, Basic Multivector Calculus, Proceedings of FAN 2008, Hiroshima, Japan, 23+24 October 2008. Basic Multivector Calculus Eckhard Hitzer, Department of Applied Physics, Faculty of Engineering, University of Fukui Abstract: We begin with introducing the generalization of real, complex, and quaternion numbers to hypercomplex numbers, also known as Clifford numbers, or multivectors of geometric algebra. Multivectors encode everything from vectors, rotations, scaling transformations, improper transformations (reflections, inversions), geometric objects (like lines and spheres), spinors, and tensors, and the like. Multivector calculus allows to define functions mapping multivectors to multivectors, differentiation, integration, function norms, multivector Fourier transformations and wavelet transformations, filtering, windowing, etc. We give a basic introduction into this general mathematical language, which has fascinating applications in physics, engineering, and computer science. more didactic approach for newcomers to geometric algebra. 1. Introduction G(I) is the full geometric algebra over all vectors in the “Now faith is being sure of what we hope for and certain of what we do not see. This is what the ancients were n-dimensional unit pseudoscalar I e1 e2 ... en . commended for. By faith we understand that the universe was formed at God’s command, so that what is seen was not made 1 A G (I) is the n-dimensional vector sub-space of out of what was visible.” [7] n The German 19th century mathematician H. Grassmann had grade-1 elements in G(I) spanned by e1,e2 ,...,en . For the clear vision, that his “extension theory (now developed to geometric calculus) … forms the keystone of the entire 1 vectors a,b,c An G (I) and scalars , ,, ; structure of mathematics.”[6] The algebraic “grammar” of this universal form of calculus is geometric algebra (or Clifford G(I) has the fundamental properties of algebra).
    [Show full text]
  • MATH 304 Linear Algebra Lecture 24: Scalar Product. Vectors: Geometric Approach
    MATH 304 Linear Algebra Lecture 24: Scalar product. Vectors: geometric approach B A B′ A′ A vector is represented by a directed segment. • Directed segment is drawn as an arrow. • Different arrows represent the same vector if • they are of the same length and direction. Vectors: geometric approach v B A v B′ A′ −→AB denotes the vector represented by the arrow with tip at B and tail at A. −→AA is called the zero vector and denoted 0. Vectors: geometric approach v B − A v B′ A′ If v = −→AB then −→BA is called the negative vector of v and denoted v. − Vector addition Given vectors a and b, their sum a + b is defined by the rule −→AB + −→BC = −→AC. That is, choose points A, B, C so that −→AB = a and −→BC = b. Then a + b = −→AC. B b a C a b + B′ b A a C ′ a + b A′ The difference of the two vectors is defined as a b = a + ( b). − − b a b − a Properties of vector addition: a + b = b + a (commutative law) (a + b) + c = a + (b + c) (associative law) a + 0 = 0 + a = a a + ( a) = ( a) + a = 0 − − Let −→AB = a. Then a + 0 = −→AB + −→BB = −→AB = a, a + ( a) = −→AB + −→BA = −→AA = 0. − Let −→AB = a, −→BC = b, and −→CD = c. Then (a + b) + c = (−→AB + −→BC) + −→CD = −→AC + −→CD = −→AD, a + (b + c) = −→AB + (−→BC + −→CD) = −→AB + −→BD = −→AD. Parallelogram rule Let −→AB = a, −→BC = b, −−→AB′ = b, and −−→B′C ′ = a. Then a + b = −→AC, b + a = −−→AC ′.
    [Show full text]
  • Inner Product Spaces
    CHAPTER 6 Woman teaching geometry, from a fourteenth-century edition of Euclid’s geometry book. Inner Product Spaces In making the definition of a vector space, we generalized the linear structure (addition and scalar multiplication) of R2 and R3. We ignored other important features, such as the notions of length and angle. These ideas are embedded in the concept we now investigate, inner products. Our standing assumptions are as follows: 6.1 Notation F, V F denotes R or C. V denotes a vector space over F. LEARNING OBJECTIVES FOR THIS CHAPTER Cauchy–Schwarz Inequality Gram–Schmidt Procedure linear functionals on inner product spaces calculating minimum distance to a subspace Linear Algebra Done Right, third edition, by Sheldon Axler 164 CHAPTER 6 Inner Product Spaces 6.A Inner Products and Norms Inner Products To motivate the concept of inner prod- 2 3 x1 , x 2 uct, think of vectors in R and R as x arrows with initial point at the origin. x R2 R3 H L The length of a vector in or is called the norm of x, denoted x . 2 k k Thus for x .x1; x2/ R , we have The length of this vector x is p D2 2 2 x x1 x2 . p 2 2 x1 x2 . k k D C 3 C Similarly, if x .x1; x2; x3/ R , p 2D 2 2 2 then x x1 x2 x3 . k k D C C Even though we cannot draw pictures in higher dimensions, the gener- n n alization to R is obvious: we define the norm of x .x1; : : : ; xn/ R D 2 by p 2 2 x x1 xn : k k D C C The norm is not linear on Rn.
    [Show full text]
  • Inner Product Spaces Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (March 2, 2007)
    MAT067 University of California, Davis Winter 2007 Inner Product Spaces Isaiah Lankham, Bruno Nachtergaele, Anne Schilling (March 2, 2007) The abstract definition of vector spaces only takes into account algebraic properties for the addition and scalar multiplication of vectors. For vectors in Rn, for example, we also have geometric intuition which involves the length of vectors or angles between vectors. In this section we discuss inner product spaces, which are vector spaces with an inner product defined on them, which allow us to introduce the notion of length (or norm) of vectors and concepts such as orthogonality. 1 Inner product In this section V is a finite-dimensional, nonzero vector space over F. Definition 1. An inner product on V is a map ·, · : V × V → F (u, v) →u, v with the following properties: 1. Linearity in first slot: u + v, w = u, w + v, w for all u, v, w ∈ V and au, v = au, v; 2. Positivity: v, v≥0 for all v ∈ V ; 3. Positive definiteness: v, v =0ifandonlyifv =0; 4. Conjugate symmetry: u, v = v, u for all u, v ∈ V . Remark 1. Recall that every real number x ∈ R equals its complex conjugate. Hence for real vector spaces the condition about conjugate symmetry becomes symmetry. Definition 2. An inner product space is a vector space over F together with an inner product ·, ·. Copyright c 2007 by the authors. These lecture notes may be reproduced in their entirety for non- commercial purposes. 2NORMS 2 Example 1. V = Fn n u =(u1,...,un),v =(v1,...,vn) ∈ F Then n u, v = uivi.
    [Show full text]
  • Matrix Multiplication. Diagonal Matrices. Inverse Matrix. Matrices
    MATH 304 Linear Algebra Lecture 4: Matrix multiplication. Diagonal matrices. Inverse matrix. Matrices Definition. An m-by-n matrix is a rectangular array of numbers that has m rows and n columns: a11 a12 ... a1n a21 a22 ... a2n . .. . am1 am2 ... amn Notation: A = (aij )1≤i≤n, 1≤j≤m or simply A = (aij ) if the dimensions are known. Matrix algebra: linear operations Addition: two matrices of the same dimensions can be added by adding their corresponding entries. Scalar multiplication: to multiply a matrix A by a scalar r, one multiplies each entry of A by r. Zero matrix O: all entries are zeros. Negative: −A is defined as (−1)A. Subtraction: A − B is defined as A + (−B). As far as the linear operations are concerned, the m×n matrices can be regarded as mn-dimensional vectors. Properties of linear operations (A + B) + C = A + (B + C) A + B = B + A A + O = O + A = A A + (−A) = (−A) + A = O r(sA) = (rs)A r(A + B) = rA + rB (r + s)A = rA + sA 1A = A 0A = O Dot product Definition. The dot product of n-dimensional vectors x = (x1, x2,..., xn) and y = (y1, y2,..., yn) is a scalar n x · y = x1y1 + x2y2 + ··· + xnyn = xk yk . Xk=1 The dot product is also called the scalar product. Matrix multiplication The product of matrices A and B is defined if the number of columns in A matches the number of rows in B. Definition. Let A = (aik ) be an m×n matrix and B = (bkj ) be an n×p matrix.
    [Show full text]
  • Clifford Algebra with Mathematica
    Clifford Algebra with Mathematica J.L. ARAGON´ G. ARAGON-CAMARASA Universidad Nacional Aut´onoma de M´exico University of Glasgow Centro de F´ısica Aplicada School of Computing Science y Tecnolog´ıa Avanzada Sir Alwyn William Building, Apartado Postal 1-1010, 76000 Quer´etaro Glasgow, G12 8QQ Scotland MEXICO UNITED KINGDOM [email protected] [email protected] G. ARAGON-GONZ´ ALEZ´ M.A. RODRIGUEZ-ANDRADE´ Universidad Aut´onoma Metropolitana Instituto Polit´ecnico Nacional Unidad Azcapotzalco Departamento de Matem´aticas, ESFM San Pablo 180, Colonia Reynosa-Tamaulipas, UP Adolfo L´opez Mateos, 02200 D.F. M´exico Edificio 9. 07300 D.F. M´exico MEXICO MEXICO [email protected] [email protected] Abstract: The Clifford algebra of a n-dimensional Euclidean vector space provides a general language comprising vectors, complex numbers, quaternions, Grassman algebra, Pauli and Dirac matrices. In this work, we present an introduction to the main ideas of Clifford algebra, with the main goal to develop a package for Clifford algebra calculations for the computer algebra program Mathematica.∗ The Clifford algebra package is thus a powerful tool since it allows the manipulation of all Clifford mathematical objects. The package also provides a visualization tool for elements of Clifford Algebra in the 3-dimensional space. clifford.m is available from https://github.com/jlaragonvera/Geometric-Algebra Key–Words: Clifford Algebras, Geometric Algebra, Mathematica Software. 1 Introduction Mathematica, resulting in a package for doing Clif- ford algebra computations. There exists some other The importance of Clifford algebra was recognized packages and specialized programs for doing Clif- for the first time in quantum field theory.
    [Show full text]
  • Linear Algebra Chapter 5: Norms, Inner Products and Orthogonality
    MATH 532: Linear Algebra Chapter 5: Norms, Inner Products and Orthogonality Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Spring 2015 [email protected] MATH 532 1 Outline 1 Vector Norms 2 Matrix Norms 3 Inner Product Spaces 4 Orthogonal Vectors 5 Gram–Schmidt Orthogonalization & QR Factorization 6 Unitary and Orthogonal Matrices 7 Orthogonal Reduction 8 Complementary Subspaces 9 Orthogonal Decomposition 10 Singular Value Decomposition 11 Orthogonal Projections [email protected] MATH 532 2 Vector Norms Vector[0] Norms 1 Vector Norms 2 Matrix Norms Definition 3 Inner Product Spaces Let x; y 2 Rn (Cn). Then 4 Orthogonal Vectors n T X 5 Gram–Schmidt Orthogonalization & QRx Factorizationy = xi yi 2 R i=1 6 Unitary and Orthogonal Matrices n X ∗ = ¯ 2 7 Orthogonal Reduction x y xi yi C i=1 8 Complementary Subspaces is called the standard inner product for Rn (Cn). 9 Orthogonal Decomposition 10 Singular Value Decomposition 11 Orthogonal Projections [email protected] MATH 532 4 Vector Norms Definition Let V be a vector space. A function k · k : V! R≥0 is called a norm provided for any x; y 2 V and α 2 R 1 kxk ≥ 0 and kxk = 0 if and only if x = 0, 2 kαxk = jαj kxk, 3 kx + yk ≤ kxk + kyk. Remark The inequality in (3) is known as the triangle inequality. [email protected] MATH 532 5 Vector Norms Remark Any inner product h·; ·i induces a norm via (more later) p kxk = hx; xi: We will show that the standard inner product induces the Euclidean norm (cf.
    [Show full text]
  • Eigenvalues and Eigenvectors
    Section 5.1 Eigenvalues and Eigenvectors At this point in the class, we understand that the operation of matrix multiplication is very different from scalar multiplication. Matrix multiplication is an operation that finds the product of a pair of matrices, whereas scalar multiplication finds the product of a scalar with a matrix. More to the point, scalar multiplication of a scalar k with a matrix X is an easy operation to perform; indeed there's a simple algorithm: multiply each entry of X by the scalar k. Matrix multiplication on the other hand cannot be expressed using a simple algorithm. Indeed, the operation is extremely complex: to multiply a pair of n×n matrices, it takes about n2 operations, a hugely inefficient process. Thus it is surprising that, for any square matrix A, certain matrix multiplications \collapse" (in a sense) into scalar multiplication. As an example, consider the matrices ( ) ( ) ( ) 3 2 −4 10 A = ; w = ; x = : 3 4 −1 15 The product Aw is not particularly interesting: ( ) −14 Aw = ; −16 indeed, there appears to be very little connection between A, w, and Aw. On the other hand, an we see an interesting phenomenon when we calculate Ax: ( ) ( ) 60 10 Ax = = 6 = 6x: 90 15 Forgetting the calculation in the middle, we have Ax = 6x; in a sense, the matrix multiplication Ax collapsed into scalar multiplication 6x. We will see below that the phenomenon described here is more common than one might think. Identifying products like Ax = 6x will allow us to extract a great deal of useful information about A; accordingly, the rest of the section will be devoted to this phenomenon, which we give a name in the next definition.
    [Show full text]
  • Lecture 12: Abstract Vector Spaces and Concrete Examples
    LECTURE 12 Abstract Vector Spaces and Concrete Examples Our discussion of linear algebra so far has been devoted to discussing the relations between systems of linear equations, matrices, and vectors.As such, topics like the notions of subspaces, bases, linear independence, etc.tend to come off as a bunch of formal nonsense.To see the real utility of these ideas, it’s actually helpful to first abstract things further; this will allow us to bring more interesting examples can be drawn into the picture. Definition 12.1. A vector space over R is a set V for which the following operations are defined • scalar multiplication: for every r ∈ R and v ∈ V we have a map (r, v) → rv ∈ V. • vector addition: for every pair of vectors u, v ∈ V we have a map (u, v) → u + v ∈ V and satisfy the following properties 1.( u + v)+w = u +(v + w) (associativity of vector addition) 2. u + v = v + u (commutativity of vector addition) 3. There exists an element 0 ∈ V such that v + 0 = v for all v ∈ V . (additive identity.) 4. For each v ∈ V there exists an element −v ∈ V such that v +(−v)=0. (additive inverses) 5. r (u + v)=ru + rv (scalar multiplication is distributive with respect to vector addition). 6.( r + s) v = rv + sv. (scalar multiplication is distributive with respect to addition of scalars) 7. r(sv)=(rs)v (scalar multiplication preserves associativity of multiplication in R.) 8.(1) v = v (preservation of scale). Definition 12.2. A subspace W of a vector space V is a subset of V that is closed under scalar multipli- cation and vector addition.
    [Show full text]