Lecture_11 - Lecture Note 11 Dr Jeff Chak-Fu WONG Department of Mathematics Chinese University of Hong Kong jwong@math.cuhk.edu.hk MAT 2310 Linear

Info iconThis preview shows pages 1–9. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Lecture Note 11 Dr. Jeff Chak-Fu WONG Department of Mathematics Chinese University of Hong Kong jwong@math.cuhk.edu.hk MAT 2310 Linear Algebra and Its Applications Fall, 2007 Produced by Jeff Chak-Fu WONG 1 R EAL V ECTOR S PACES 1. Vector Spaces 2. Subspaces 3. Linear Independence 4. Basis and Dimension 5. Homogeneous Systems 6. The Rank of a Matrix and Applications 7. Coordinates and Change of Basis REAL VECTOR SPACES 2 H OMOGENEOUS S YSTEMS HOMOGENEOUS SYSTEMS 3 Our aim is to solve several problems involving homogeneous systems that will be fundamental in “Eigenvalues, Eigenvectors, and Diagonalization”. Here we able to focus our attention on these problems without distracted by the additional material in “Eigenvalues, Eigenvectors, and Diagonalization” HOMOGENEOUS SYSTEMS 4 Consider the homogeneous system A x = , where A is an m × n matrix. As we have already observed in Example 9 of Lecture note 9, the set of all solutions to this homogeneous system is a subspace of R n . An extremely important problem, which will occur repeatedly in “Eigenvalues, Eigenvectors, and Diagonalization”, is that of finding a basis for this solution space. To find such a basis , we use the method of Gauss-Jordan reduction presented in Lecture note 3. Thus we transform the augmented matrix [ A | ] of the system to a matrix [ B | ] in reduced row echelon form, where B has r nonzero rows, 1 ≤ r ≤ m . Without loss of generality we may assume that the leading 1 s in the r nonzero rows of B occur in the first r columns. HOMOGENEOUS SYSTEMS 5 If r = n , then [ B | ] =                  1 ··· 1 ··· . . . . . . . . . . . . . . . . . . ··· 1 mn = rr r × 1= n × 1( r = n ) ··· . . . . . . . . . . . . ··· m × 1                  and the only solution to A x = is the trivial one. The solution space has no basis (sometimes referred to as an empty basis ) and its dimension is zero . HOMOGENEOUS SYSTEMS 6 If r < n , then [ B | ] =                      1 ··· b 1 r +1 ··· b 1 n 1 ··· b 2 r +1 ··· b 2 n 1 ··· . . . . . . . . . . . . . . . . . . . . . . . . ··· 1 b rr +1 ··· b rn r × 1 ··· ··· . . . . . . . . . . . . . . . . . . . . . ··· ··· mn m × 1                      HOMOGENEOUS SYSTEMS 7 Solving for the unknown corresponding to the leading 1 s, we have x 1 =- b 1 r +1 x r +1- b 1 r +2 x r +2-···- b 1 n x n x 2 =- b 2 r +1 x r +1- b 2 r +2 x r +2-···- b 2 n x n . . . x r =- b rr +1 x r +1- b rr +2 x r +2-···- b rn x n , where x r +1 ,x r +2 ,...,x n can be assigned arbitrary real values s j , j = 1 , 2 ,..., p and p = n- r ( dimension of solution space ). Thus x =                     x 1 x 2 ....
View Full Document

This note was uploaded on 05/18/2010 for the course MATHEMATIC MAT2310 taught by Professor Dr.jeffchak-fuwong during the Spring '06 term at CUHK.

Page1 / 78

Lecture_11 - Lecture Note 11 Dr Jeff Chak-Fu WONG Department of Mathematics Chinese University of Hong Kong jwong@math.cuhk.edu.hk MAT 2310 Linear

This preview shows document pages 1 - 9. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online