DOCSLIB.ORG

Properties of Determinants

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

8. The determinant of a permutation matrix is either 1 or −1 depending on whether it takes an even number or an odd number of row in- terchanges to convert it to the identity matrix. Determinants, part III Other properties of determinants. There are Math 130 Linear Algebra several other important properties of determinants. D Joyce, Fall 2015 For instance, determinants can be evaluated by cofactor expansion along any row, not just the first We characterized what determinant functions are row as we used to construct the determinant. We based on four properties, and we saw one construc- won't take the time to prove that. The idea of tion for them. Here's a quick summary of their the proof is straightforward|exchange the given properties. The first four characterize them; the row with the first row and apply cofactor expan- others we proved. sion along the first row. The only difficultly with the proof is keeping track of the sign of the deter- A determinant function assigns to each square minant. matrix A a scalar associated to the matrix, denoted det(A) or jAj such that As mentioned before, we won't use cofactor ex- pansion much since it's not a practical way to eval- 1. The determinant of an n × n identity matrix I uate determinants. Here are a couple of more useful is 1. jIj = 1. properties. 2. If the matrix B is identical to the matrix A Theorem 1. If one row of a square matrix is a except the entries in one of the rows of B are multiple of another row, then its determinant is 0. each equal to the corresponding entries of A multiplied by the same scalar c, then jBj = Proof. We saw that if two rows are the same, then c jAj. a square matrix has 0 determinant. By the second property of determinants if we multiply one of those 3. If the matrices A, B, and C are identical except rows by a scalar, the matrix's determinant, which is for the entries in one row, and for that row an 0, is multiplied by that scalar, so that determinant entry in A is found by adding the correspond- is also 0. q.e.d. ing entries in B and C, then jAj = jBj + jCj. Theorem 2. The determinant of a matrix is not 4. If the matrix B is the result of exchanging two changed when a multiple of one row is added to rows of A, then the determinant of B is the another. negation of the determinant of A. 5. The determinant of any matrix with an entire Proof. Let A be the given matrix, and let B be the row of 0's is 0. matrix that results if you add c times row k to row l, k 6= l. Let C be the matrix that looks just like th th 6. The determinant of any matrix with two iden- A except the l row of C is c times the k row. tical rows is 0. Since one row of C is a multiple of another row of C, its determinant is 0. By multilinearity of the 7. There is one and only one determinant func- determinant (property 3), jAj = jBj + jCj. Since tion. jCj = 0, therefore jAj = jBj. q.e.d. 1 An efficient algorithm for evaluating a ma- the rank of the product of two matrices is less than trix. The three row operations are (1) exchange or equal to the rank of each, therefore the rank of rows, and that will negate the determinant, (2) AB is less than n, and, hence jABj = 0. Thus, no multiply or divide a row by a nonzero constant, matter what B is, jABj = jAj jBj. and that scales the determinant by that constant, Case 2. For this case assume the rank of A is n. and (3) add a multiple of one row to another, and Then A can be expressed as a product of elementary that doesn't change the determinant at all. matrices A = E1E2 ··· Ek. If we knew for each After you've row reduced the matrix, you'll have elementary matrix E that jEBj = jEj jBj, then it a triangular matrix, and its determinant will be the would follow that product of its diagonal entries. We'll evaluate a couple of matrices by this jABj = jE1E2 ··· EkBj method in class. = jE1j jE2j · · · jEkj jBj = jAj jBj Determinants, rank, and invertibility. There's a close connection between these for a Thus, we can reduce case 2 to the special case where square matrix. We've seen that an n × n matrix A A is an elementary matrix. has an inverse if and only if rank(A) = n. We can Elementary subcases. We'll show that for each ele- add another equivalent condition to that, namely, mentary matrix E that jEBj = jEj jBj. There are jAj 6= 0. three kinds of elementary matrices, and we'll check Theorem 3. The determinant of an n × n matrix each one. is nonzero if and only if its rank is n, that is to say, Elementary subcase 1. Suppose that E is the result if and only if it's invertible. of interchanging two rows of the identity matrix I. Then jEj = −1, and EB is the same as B except Proof. The determinant of the matrix will be 0 if those two rows are interchanged, so jEBj = −|EBj. and only if when it's row reduced the resulting ma- Thus, jEBj = jEj jBj. trix has a row of 0s, and that happens when its rank is less than n. q.e.d. Elementary subcase 2. Suppose that E is the result of multiplying a row of I by a scalar c. Then jEj = Determinant of products and inverses. c, and EB is the same as B except that row is These are rather important properties of determi- multiplied by c, so jEBj = c jBj. Thus, jEBj = nants. The first says jABj = jAj jBj, and the sec- jEj jBj. ond says jA−1j = jAj−1 when A is an invertible Elementary subcase 3. Suppose that E is the result matrix. of adding a multiple of one row of I to another. Then jEj = 1, and EB is the same as B except Theorem 4. The determinant of the product of that that same multiple of one row of B is added two square matrices is the product of their deter- the same other of B, so jEBj = jBj. Again, jEBj = minants, that is, jABj = jAj jBj. jEj jBj. q.e.d. Proof. We'll prove this in two cases, first when A Corollary 5. For an invertible matrix, the deter- has rank less than n, then when A has full rank. minant of its inverse is the reciprocal of its deter- For the full rank case we'll reduce the proof to the minant, that is, jA−1j = jAj−1. case where A is an elementary case since it's easy to show the result in that case. Proof. According to the theorem, jA−1Aj = Case 1. Assume that the rank of A is less than jAj jA−1j, but jA−1Aj = jIj = 1, so jAj jA−1j = 1 n. Then by the previous theorem, jAj = 0. Since from which it follows that jA−1j = jAj−1. q.e.d. 2 More generally, jApj = jAjp for general p even The following properties of determinants that re- when p is negative so long as A is an invertible late to the columns of a matrix follow from this matrix. theorem and the corresponding properties for rows of a matrix. Determinants and transposes. So far, every- 1. If the matrix B is identical to the matrix A thing we've said about determinants of matrices except the entries in one of the columns of B was related to the rows of the matrix, so it's some- are each equal to the corresponding entries of what surprising that a matrix and its transpose A multiplied by the same scalar c, then jBj = have the same determinant. We'll prove that, and c jAj. from that theorem we'll automatically get corre- sponding statements for columns of matrices that 2. If the matrices A, B, and C are identical ex- we have for rows of matrices. cept for the entries in one column, and for that column an entry in A is found by adding Theorem 6. The determinant of the transpose of the corresponding entries in B and C, then a square matrix is equal to the determinant of the jAj = jBj + jCj. matrix, that is, jAtj = jAj. 3. If the matrix B is the result of exchanging two Proof. We'll prove this like the last theorem. First columns of A, then the determinant of B is the in the case where the rank of A is less than n, then negation of the determinant of A. the case where the rank of A is n, and for the sec- ond case we'll write A as a product of elementary 4. The determinant of any matrix with an entire matrices. column of 0's is 0. Case 1. Assume that the rank of A is less than n. 5. The determinant of any matrix with two iden- Then its determinant is 0. But the rank of a matrix tical columns is 0. is the same as the rank of its transpose, so At has rank less than n and its determinant is also 0.
Recommended publications
  • ADDITIVE MAPS on RANK K BIVECTORS 1. Introduction. Let N 2 Be an Integer and Let F Be a Field. We Denote by M N(F) the Algeb

    ADDITIVE MAPS on RANK K BIVECTORS 1. Introduction. Let N 2 Be an Integer and Let F Be a Field. We Denote by M N(F) the Algeb

    Electronic Journal of Linear Algebra, ISSN 1081-3810 A publication of the International Linear Algebra Society Volume 36, pp. 847-856, December 2020. ADDITIVE MAPS ON RANK K BIVECTORS∗ WAI LEONG CHOOIy AND KIAM HEONG KWAy V2 Abstract. Let U and V be linear spaces over fields F and K, respectively, such that dim U = n > 2 and jFj > 3. Let U n−1 V2 V2 be the second exterior power of U. Fixing an even integer k satisfying 2 6 k 6 n, it is shown that a map : U! V satisfies (u + v) = (u) + (v) for all rank k bivectors u; v 2 V2 U if and only if is an additive map. Examples showing the indispensability of the assumption on k are given. Key words. Additive maps, Second exterior powers, Bivectors, Ranks, Alternate matrices. AMS subject classifications. 15A03, 15A04, 15A75, 15A86. 1. Introduction. Let n > 2 be an integer and let F be a field. We denote by Mn(F) the algebra of n×n matrices over F. Given a nonempty subset S of Mn(F), a map : Mn(F) ! Mn(F) is called commuting on S (respectively, additive on S) if (A)A = A (A) for all A 2 S (respectively, (A + B) = (A) + (B) for all A; B 2 S). In 2012, using Breˇsar'sresult [1, Theorem A], Franca [3] characterized commuting additive maps on invertible (respectively, singular) matrices of Mn(F). He continued to characterize commuting additive maps on rank k matrices of Mn(F) in [4], where 2 6 k 6 n is a fixed integer, and commuting additive maps on rank one matrices of Mn(F) in [5].
  • Do Killingâ•Fiyano Tensors Form a Lie Algebra?

    Do Killingâ•Fiyano Tensors Form a Lie Algebra?

    University of Massachusetts Amherst ScholarWorks@UMass Amherst Physics Department Faculty Publication Series Physics 2007 Do Killing–Yano tensors form a Lie algebra? David Kastor University of Massachusetts - Amherst, [email protected] Sourya Ray University of Massachusetts - Amherst Jennie Traschen University of Massachusetts - Amherst, [email protected] Follow this and additional works at: https://scholarworks.umass.edu/physics_faculty_pubs Part of the Physics Commons Recommended Citation Kastor, David; Ray, Sourya; and Traschen, Jennie, "Do Killing–Yano tensors form a Lie algebra?" (2007). Classical and Quantum Gravity. 1235. Retrieved from https://scholarworks.umass.edu/physics_faculty_pubs/1235 This Article is brought to you for free and open access by the Physics at ScholarWorks@UMass Amherst. It has been accepted for inclusion in Physics Department Faculty Publication Series by an authorized administrator of ScholarWorks@UMass Amherst. For more information, please contact [email protected]. Do Killing-Yano tensors form a Lie algebra? David Kastor, Sourya Ray and Jennie Traschen Department of Physics University of Massachusetts Amherst, MA 01003 ABSTRACT Killing-Yano tensors are natural generalizations of Killing vec- tors. We investigate whether Killing-Yano tensors form a graded Lie algebra with respect to the Schouten-Nijenhuis bracket. We find that this proposition does not hold in general, but that it arXiv:0705.0535v1 [hep-th] 3 May 2007 does hold for constant curvature spacetimes. We also show that Minkowski and (anti)-deSitter spacetimes have the maximal num- ber of Killing-Yano tensors of each rank and that the algebras of these tensors under the SN bracket are relatively simple exten- sions of the Poincare and (A)dS symmetry algebras.
  • 21. Orthonormal Bases

    21. Orthonormal Bases

    21. Orthonormal Bases The canonical/standard basis 011 001 001 B C B C B C B0C B1C B0C e1 = B.C ; e2 = B.C ; : : : ; en = B.C B.C B.C B.C @.A @.A @.A 0 0 1 has many useful properties. • Each of the standard basis vectors has unit length: q p T jjeijj = ei ei = ei ei = 1: • The standard basis vectors are orthogonal (in other words, at right angles or perpendicular). T ei ej = ei ej = 0 when i 6= j This is summarized by ( 1 i = j eT e = δ = ; i j ij 0 i 6= j where δij is the Kronecker delta. Notice that the Kronecker delta gives the entries of the identity matrix. Given column vectors v and w, we have seen that the dot product v w is the same as the matrix multiplication vT w. This is the inner product on n T R . We can also form the outer product vw , which gives a square matrix. 1 The outer product on the standard basis vectors is interesting. Set T Π1 = e1e1 011 B C B0C = B.C 1 0 ::: 0 B.C @.A 0 01 0 ::: 01 B C B0 0 ::: 0C = B. .C B. .C @. .A 0 0 ::: 0 . T Πn = enen 001 B C B0C = B.C 0 0 ::: 1 B.C @.A 1 00 0 ::: 01 B C B0 0 ::: 0C = B. .C B. .C @. .A 0 0 ::: 1 In short, Πi is the diagonal square matrix with a 1 in the ith diagonal position and zeros everywhere else.
  • Partitioned (Or Block) Matrices This Version: 29 Nov 2018

    Partitioned (Or Block) Matrices This Version: 29 Nov 2018

    Partitioned (or Block) Matrices This version: 29 Nov 2018 Intermediate Econometrics / Forecasting Class Notes Instructor: Anthony Tay It is frequently convenient to partition matrices into smaller sub-matrices. e.g. 2 3 2 1 3 2 3 2 1 3 4 1 1 0 7 4 1 1 0 7 A B (2×2) (2×3) 3 1 1 0 0 = 3 1 1 0 0 = C I 1 3 0 1 0 1 3 0 1 0 (3×2) (3×3) 2 0 0 0 1 2 0 0 0 1 The same matrix can be partitioned in several different ways. For instance, we can write the previous matrix as 2 3 2 1 3 2 3 2 1 3 4 1 1 0 7 4 1 1 0 7 a b0 (1×1) (1×4) 3 1 1 0 0 = 3 1 1 0 0 = c D 1 3 0 1 0 1 3 0 1 0 (4×1) (4×4) 2 0 0 0 1 2 0 0 0 1 One reason partitioning is useful is that we can do matrix addition and multiplication with blocks, as though the blocks are elements, as long as the blocks are conformable for the operations. For instance: A B D E A + D B + E (2×2) (2×3) (2×2) (2×3) (2×2) (2×3) + = C I C F 2C I + F (3×2) (3×3) (3×2) (3×3) (3×2) (3×3) A B d E Ad + BF AE + BG (2×2) (2×3) (2×1) (2×3) (2×1) (2×3) = C I F G Cd + F CE + G (3×2) (3×3) (3×1) (3×3) (3×1) (3×3) | {z } | {z } | {z } (5×5) (5×4) (5×4) 1 Intermediate Econometrics / Forecasting 2 Examples (1) Let 1 2 1 1 2 1 c 1 4 2 3 4 2 3 h i A = = = a a a and c = c 1 2 3 2 3 0 1 3 0 1 c 0 1 3 0 1 3 3 c1 h i then Ac = a1 a2 a3 c2 = c1a1 + c2a2 + c3a3 c3 The product Ac produces a linear combination of the columns of A.
  • Determinant Notes

    Determinant Notes

    68 UNIT FIVE DETERMINANTS 5.1 INTRODUCTION In unit one the determinant of a 2× 2 matrix was introduced and used in the evaluation of a cross product. In this chapter we extend the definition of a determinant to any size square matrix. The determinant has a variety of applications. The value of the determinant of a square matrix A can be used to determine whether A is invertible or noninvertible. An explicit formula for A–1 exists that involves the determinant of A. Some systems of linear equations have solutions that can be expressed in terms of determinants. 5.2 DEFINITION OF THE DETERMINANT a11 a12 Recall that in chapter one the determinant of the 2× 2 matrix A = was a21 a22 defined to be the number a11a22 − a12 a21 and that the notation det (A) or A was used to represent the determinant of A. For any given n × n matrix A = a , the notation A [ ij ]n×n ij will be used to denote the (n −1)× (n −1) submatrix obtained from A by deleting the ith row and the jth column of A. The determinant of any size square matrix A = a is [ ij ]n×n defined recursively as follows. Definition of the Determinant Let A = a be an n × n matrix. [ ij ]n×n (1) If n = 1, that is A = [a11], then we define det (A) = a11 . n 1k+ (2) If na>=1, we define det(A) ∑(-1)11kk det(A ) k=1 Example If A = []5 , then by part (1) of the definition of the determinant, det (A) = 5.
  • Multivector Differentiation and Linear Algebra 0.5Cm 17Th Santaló

    Multivector Differentiation and Linear Algebra 0.5Cm 17Th Santaló

    Multivector differentiation and Linear Algebra 17th Santalo´ Summer School 2016, Santander Joan Lasenby Signal Processing Group, Engineering Department, Cambridge, UK and Trinity College Cambridge [email protected], www-sigproc.eng.cam.ac.uk/ s jl 23 August 2016 1 / 78 Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... Summary Overview The Multivector Derivative. 2 / 78 Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... Summary Overview The Multivector Derivative. Examples of differentiation wrt multivectors. 3 / 78 Functional Differentiation: very briefly... Summary Overview The Multivector Derivative. Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. 4 / 78 Summary Overview The Multivector Derivative. Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... 5 / 78 Overview The Multivector Derivative. Examples of differentiation wrt multivectors. Linear Algebra: matrices and tensors as linear functions mapping between elements of the algebra. Functional Differentiation: very briefly... Summary 6 / 78 We now want to generalise this idea to enable us to find the derivative of F(X), in the A ‘direction’ – where X is a general mixed grade multivector (so F(X) is a general multivector valued function of X). Let us use ∗ to denote taking the scalar part, ie P ∗ Q ≡ hPQi. Then, provided A has same grades as X, it makes sense to define: F(X + tA) − F(X) A ∗ ¶XF(X) = lim t!0 t The Multivector Derivative Recall our definition of the directional derivative in the a direction F(x + ea) − F(x) a·r F(x) = lim e!0 e 7 / 78 Let us use ∗ to denote taking the scalar part, ie P ∗ Q ≡ hPQi.
  • Things You Need to Know About Linear Algebra Math 131 Multivariate

    Things You Need to Know About Linear Algebra Math 131 Multivariate

    the standard (x; y; z) coordinate three-space. Nota- tions for vectors. Geometric interpretation as vec- tors as displacements as well as vectors as points. Vector addition, the zero vector 0, vector subtrac- Things you need to know about tion, scalar multiplication, their properties, and linear algebra their geometric interpretation. Math 131 Multivariate Calculus We start using these concepts right away. In D Joyce, Spring 2014 chapter 2, we'll begin our study of vector-valued functions, and we'll use the coordinates, vector no- The relation between linear algebra and mul- tation, and the rest of the topics reviewed in this tivariate calculus. We'll spend the first few section. meetings reviewing linear algebra. We'll look at just about everything in chapter 1. Section 1.2. Vectors and equations in R3. Stan- Linear algebra is the study of linear trans- dard basis vectors i; j; k in R3. Parametric equa- formations (also called linear functions) from n- tions for lines. Symmetric form equations for a line dimensional space to m-dimensional space, where in R3. Parametric equations for curves x : R ! R2 m is usually equal to n, and that's often 2 or 3. in the plane, where x(t) = (x(t); y(t)). A linear transformation f : Rn ! Rm is one that We'll use standard basis vectors throughout the preserves addition and scalar multiplication, that course, beginning with chapter 2. We'll study tan- is, f(a + b) = f(a) + f(b), and f(ca) = cf(a). We'll gent lines of curves and tangent planes of surfaces generally use bold face for vectors and for vector- in that chapter and throughout the course.
  • Handout 9 More Matrix Properties; the Transpose

    Handout 9 More Matrix Properties; the Transpose

    Handout 9 More matrix properties; the transpose Square matrix properties These properties only apply to a square matrix, i.e. n £ n. ² The leading diagonal is the diagonal line consisting of the entries a11, a22, a33, . ann. ² A diagonal matrix has zeros everywhere except the leading diagonal. ² The identity matrix I has zeros o® the leading diagonal, and 1 for each entry on the diagonal. It is a special case of a diagonal matrix, and A I = I A = A for any n £ n matrix A. ² An upper triangular matrix has all its non-zero entries on or above the leading diagonal. ² A lower triangular matrix has all its non-zero entries on or below the leading diagonal. ² A symmetric matrix has the same entries below and above the diagonal: aij = aji for any values of i and j between 1 and n. ² An antisymmetric or skew-symmetric matrix has the opposite entries below and above the diagonal: aij = ¡aji for any values of i and j between 1 and n. This automatically means the digaonal entries must all be zero. Transpose To transpose a matrix, we reect it across the line given by the leading diagonal a11, a22 etc. In general the result is a di®erent shape to the original matrix: a11 a21 a11 a12 a13 > > A = A = 0 a12 a22 1 [A ]ij = A : µ a21 a22 a23 ¶ ji a13 a23 @ A > ² If A is m £ n then A is n £ m. > ² The transpose of a symmetric matrix is itself: A = A (recalling that only square matrices can be symmetric).
  • Schaum's Outline of Linear Algebra (4Th Edition)

    Schaum's Outline of Linear Algebra (4Th Edition)

    SCHAUM’S SCHAUM’S outlines outlines Linear Algebra Fourth Edition Seymour Lipschutz, Ph.D. Temple University Marc Lars Lipson, Ph.D. University of Virginia Schaum’s Outline Series New York Chicago San Francisco Lisbon London Madrid Mexico City Milan New Delhi San Juan Seoul Singapore Sydney Toronto Copyright © 2009, 2001, 1991, 1968 by The McGraw-Hill Companies, Inc. All rights reserved. Except as permitted under the United States Copyright Act of 1976, no part of this publication may be reproduced or distributed in any form or by any means, or stored in a database or retrieval system, without the prior writ- ten permission of the publisher. ISBN: 978-0-07-154353-8 MHID: 0-07-154353-8 The material in this eBook also appears in the print version of this title: ISBN: 978-0-07-154352-1, MHID: 0-07-154352-X. All trademarks are trademarks of their respective owners. Rather than put a trademark symbol after every occurrence of a trademarked name, we use names in an editorial fashion only, and to the benefit of the trademark owner, with no intention of infringement of the trademark. Where such designations appear in this book, they have been printed with initial caps. McGraw-Hill eBooks are available at special quantity discounts to use as premiums and sales promotions, or for use in corporate training programs. To contact a representative please e-mail us at [email protected]. TERMS OF USE This is a copyrighted work and The McGraw-Hill Companies, Inc. (“McGraw-Hill”) and its licensors reserve all rights in and to the work.
  • 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

    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.
  • Determinants Math 122 Calculus III D Joyce, Fall 2012

    Determinants Math 122 Calculus III D Joyce, Fall 2012

    Determinants Math 122 Calculus III D Joyce, Fall 2012 What they are. A determinant is a value associated to a square array of numbers, that square array being called a square matrix. For example, here are determinants of a general 2 × 2 matrix and a general 3 × 3 matrix. a b = ad − bc: c d a b c d e f = aei + bfg + cdh − ceg − afh − bdi: g h i The determinant of a matrix A is usually denoted jAj or det (A). You can think of the rows of the determinant as being vectors. For the 3×3 matrix above, the vectors are u = (a; b; c), v = (d; e; f), and w = (g; h; i). Then the determinant is a value associated to n vectors in Rn. There's a general definition for n×n determinants. It's a particular signed sum of products of n entries in the matrix where each product is of one entry in each row and column. The two ways you can choose one entry in each row and column of the 2 × 2 matrix give you the two products ad and bc. There are six ways of chosing one entry in each row and column in a 3 × 3 matrix, and generally, there are n! ways in an n × n matrix. Thus, the determinant of a 4 × 4 matrix is the signed sum of 24, which is 4!, terms. In this general definition, half the terms are taken positively and half negatively. In class, we briefly saw how the signs are determined by permutations.
  • Week 8-9. Inner Product Spaces. (Revised Version) Section 3.1 Dot Product As an Inner Product

    Week 8-9. Inner Product Spaces. (Revised Version) Section 3.1 Dot Product As an Inner Product

    Math 2051 W2008 Margo Kondratieva Week 8-9. Inner product spaces. (revised version) Section 3.1 Dot product as an inner product. Consider a linear (vector) space V . (Let us restrict ourselves to only real spaces that is we will not deal with complex numbers and vectors.) De¯nition 1. An inner product on V is a function which assigns a real number, denoted by < ~u;~v> to every pair of vectors ~u;~v 2 V such that (1) < ~u;~v>=< ~v; ~u> for all ~u;~v 2 V ; (2) < ~u + ~v; ~w>=< ~u;~w> + < ~v; ~w> for all ~u;~v; ~w 2 V ; (3) < k~u;~v>= k < ~u;~v> for any k 2 R and ~u;~v 2 V . (4) < ~v;~v>¸ 0 for all ~v 2 V , and < ~v;~v>= 0 only for ~v = ~0. De¯nition 2. Inner product space is a vector space equipped with an inner product. Pn It is straightforward to check that the dot product introduces by ~u ¢ ~v = j=1 ujvj is an inner product. You are advised to verify all the properties listed in the de¯nition, as an exercise. The dot product is also called Euclidian inner product. De¯nition 3. Euclidian vector space is Rn equipped with Euclidian inner product < ~u;~v>= ~u¢~v. De¯nition 4. A square matrix A is called positive de¯nite if ~vT A~v> 0 for any vector ~v 6= ~0. · ¸ 2 0 Problem 1. Show that is positive de¯nite. 0 3 Solution: Take ~v = (x; y)T . Then ~vT A~v = 2x2 + 3y2 > 0 for (x; y) 6= (0; 0).