math 211 math 211
play

Math 211 Math 211 Lecture #13 October 10, 2000 2 Square Matrices - PowerPoint PPT Presentation

1 Math 211 Math 211 Lecture #13 October 10, 2000 2 Square Matrices Square Matrices There are special kinds: Singular and nonsingular. Invertible and noninvertible. What do the terms mean? What are the relations bewtween


  1. 1 Math 211 Math 211 Lecture #13 October 10, 2000

  2. 2 Square Matrices Square Matrices • There are special kinds: ⋄ Singular and nonsingular. ⋄ Invertible and noninvertible. • What do the terms mean? • What are the relations bewtween them? return

  3. 3 Singular and Nonsingular Matrices Singular and Nonsingular Matrices The n × n matrix A is nonsingular if the equation A x = b has a solution for any right hand side b . Proposition: The n × n matrix A is nonsingular if and only if the simplified matrix (after elimination) has only nonzero entries along the diagonal. • In reduced row echelon form we get I .

  4. 4 Proposition: If the n × n matrix A is nonsingular then the equation A x = b has a unique solution for any right hand side b . Proposition: The n × n matrix A is singular if and only if the homogenous equation A x = 0 has a non-zero solution. Outline

  5. 5 Invertible Matrices Invertible Matrices An n × n matrix A is invertible if there is an n × n matrix B such that AB = BA = I . The matrix B is called an inverse of A . • If B 1 and B 2 are both inverses of A , then B 1 = B 1 ( AB 2 ) = ( B 1 A ) B 2 = B 2 • The inverse of A is denoted by A − 1 . • Invertible ⇒ nonsingular.

  6. 6 Invertible Matrices Invertible Matrices Computing the inverse A − 1 . • Form the matrix [ A, I ] . • Do elimination until the matrix has the form [ I, B ] . • Then A − 1 = B . • A matrix is invertible if and only if it is nonsingular. Outline

  7. 7 Solution Set of a Homogeneous Solution Set of a Homogeneous System System Our goal is to understand such sets better. In particular we want to know: • What are the properties of these solution sets? • Is there a convenient way to describe them? return

  8. 8 Nullspace of a Matrix Nullspace of a Matrix The nullspace of a matrix A is the set { x | A x = 0 } . • The nullspace of A is the same as the solution set for the homogeneous system A x = 0 . • The nullspace of A is denoted by null( A ) ,

  9. 9 Properties of the Nullspace of A Properties of the Nullspace of A Let A be a matrix. Proposition: 1. If x and y are in null( A ) , then x + y is in null( A ) . 2. If a is a scalar and x is in null( A ) , then a x is in null( A ) . return

  10. 10 Subspaces of R n Subspaces of R n Definition: A nonempty subset V of R n that has the properties 1. if x and y are vectors in V , x + y is in V , 2. if a is a scalar, and x is in V , then a x is in V , is called a subspace of R n . • The nullspace of a matrix is a subspace. Nullspace return

  11. 11 Examples of Subspaces Examples of Subspaces • The nullspace of a matrix is a subspace. • A line through the origin is a subspace. V = { t v | t ∈ R } . • A plane through the origin is a subspace. V = { a v + b w | a, b ∈ R } . • { 0 } and R n are subspaces of R n . Subspace return

  12. 12 Linear Combinations Linear Combinations Any linear combination of Proposition: vectors in a subspace V is also in V . • Subspaces of R n have the same kind of linear structure as R n itself. • In particular the nullspaces of matrices have the same kind of linear structure as R n . Subspace Outline

  13. 13 Example Example 4 3 − 1   A = − 3 − 2 1   1 2 1 The nullspace of A is null( A ) = { a v | a ∈ R } , where v = (1 , − 1 , 1) T . return

  14. 14 Example Example 4 3 − 1 6   B = − 3 − 2 1 − 4   1 2 1 4 • null( B ) = { a v + b w | a, b ∈ R } , where v = (1 , − 1 , 1 , 0) T and w = (0 , − 2 , 0 , 1) T . • null( B ) consists of all linear combinations of v and w . return

  15. 15 The Span of a Set of Vectors The Span of a Set of Vectors In every example the subspace has been the set of all linear combinations of a few vectors. The span of a set of vectors is the Definition: set of all linear combinations of those vectors. The span of the vectors v 1 , v 2 , . . . , and v k is denoted by span( v 1 , v 2 , . . . , v k ) . null( A ) null( B ) Examples

  16. 16 The Span of a Set of Vectors The Span of a Set of Vectors If v 1 , v 2 , . . . , and v k are all Proposition: vectors in R n , then V = span( v 1 , v 2 , . . . , v k ) is a subspace of R n . Examples Outline

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend