0% found this document useful (0 votes)
32 views5 pages

Linear Algebra I Lecture Notes

The document contains lecture notes for MATH 233 - Linear Algebra I, authored by Cesar O. Aguilar at SUNY Geneseo. It covers a wide range of topics in linear algebra, including systems of linear equations, matrix operations, vector spaces, linear mappings, determinants, eigenvalues, and applications such as the PageRank algorithm. The notes are structured into multiple sections, each addressing fundamental concepts and techniques in linear algebra.

Uploaded by

gamerspro63
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
32 views5 pages

Linear Algebra I Lecture Notes

The document contains lecture notes for MATH 233 - Linear Algebra I, authored by Cesar O. Aguilar at SUNY Geneseo. It covers a wide range of topics in linear algebra, including systems of linear equations, matrix operations, vector spaces, linear mappings, determinants, eigenvalues, and applications such as the PageRank algorithm. The notes are structured into multiple sections, each addressing fundamental concepts and techniques in linear algebra.

Uploaded by

gamerspro63
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MATH 233 - Linear Algebra I

Lecture Notes
Cesar O. Aguilar

Department of Mathematics
SUNY Geneseo
Lecture 0

Contents

1 Systems of Linear Equations 1


1.1 What is a system of linear equations? . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.3 Solving linear systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.4 Geometric interpretation of the solution set . . . . . . . . . . . . . . . . . . 8

2 Row Reduction and Echelon Forms 11


2.1 Row echelon form (REF) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
2.2 Reduced row echelon form (RREF) . . . . . . . . . . . . . . . . . . . . . . . 13
2.3 Existence and uniqueness of solutions . . . . . . . . . . . . . . . . . . . . . . 17

3 Vector Equations 19
3.1 Vectors in Rn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
3.2 The linear combination problem . . . . . . . . . . . . . . . . . . . . . . . . . 21
3.3 The span of a set of vectors . . . . . . . . . . . . . . . . . . . . . . . . . . . 26

4 The Matrix Equation Ax = b 31


4.1 Matrix-vector multiplication . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
4.2 Matrix-vector multiplication and linear combinations . . . . . . . . . . . . . 33
4.3 The matrix equation problem . . . . . . . . . . . . . . . . . . . . . . . . . . 34

5 Homogeneous and Nonhomogeneous Systems 41


5.1 Homogeneous linear systems . . . . . . . . . . . . . . . . . . . . . . . . . . . 41
5.2 Nonhomogeneous systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
5.3 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47

6 Linear Independence 49
6.1 Linear independence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
6.2 The maximum size of a linearly independent set . . . . . . . . . . . . . . . . 53

7 Introduction to Linear Mappings 57


7.1 Vector mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57
7.2 Linear mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
7.3 Matrix mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
7.4 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62

3
CONTENTS

8 Onto, One-to-One, and Standard Matrix 67


8.1 Onto Mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
8.2 One-to-One Mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 69
8.3 Standard Matrix of a Linear Mapping . . . . . . . . . . . . . . . . . . . . . . 71

9 Matrix Algebra 75
9.1 Sums of Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
9.2 Matrix Multiplication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 76
9.3 Matrix Transpose . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 80

10 Invertible Matrices 83
10.1 Inverse of a Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83
10.2 Computing the Inverse of a Matrix . . . . . . . . . . . . . . . . . . . . . . . 85
10.3 Invertible Linear Mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87

11 Determinants 89
11.1 Determinants of 2 × 2 and 3 × 3 Matrices . . . . . . . . . . . . . . . . . . . . 89
11.2 Determinants of n × n Matrices . . . . . . . . . . . . . . . . . . . . . . . . . 93
11.3 Triangular Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95

12 Properties of the Determinant 97


12.1 ERO and Determinants . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
12.2 Determinants and Invertibility of Matrices . . . . . . . . . . . . . . . . . . . 100
12.3 Properties of the Determinant . . . . . . . . . . . . . . . . . . . . . . . . . . 100

13 Applications of the Determinant 103


13.1 The Cofactor Method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103
13.2 Cramer’s Rule . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 106
13.3 Volumes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107

14 Vector Spaces 109


14.1 Vector Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 109
14.2 Subspaces of Vector Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . 112

15 Linear Maps 117


15.1 Linear Maps on Vector Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . 117
15.2 Null space and Column space . . . . . . . . . . . . . . . . . . . . . . . . . . 121

16 Linear Independence, Bases, and Dimension 125


16.1 Linear Independence . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125
16.2 Bases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 126
16.3 Dimension of a Vector Space . . . . . . . . . . . . . . . . . . . . . . . . . . . 128

17 The Rank Theorem 133


17.1 The Rank of a Matrix . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133

4
Lecture 0

18 Coordinate Systems 137


18.1 Coordinates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 137
18.2 Coordinate Mappings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
18.3 Matrix Representation of a Linear Map . . . . . . . . . . . . . . . . . . . . . 142

19 Change of Basis 147


19.1 Review of Coordinate Mappings on Rn . . . . . . . . . . . . . . . . . . . . . 147
19.2 Change of Basis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149

20 Inner Products and Orthogonality 153


20.1 Inner Product on Rn . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
20.2 Orthogonality . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 156
20.3 Coordinates in an Orthonormal Basis . . . . . . . . . . . . . . . . . . . . . . 158

21 Eigenvalues and Eigenvectors 163


21.1 Eigenvectors and Eigenvalues . . . . . . . . . . . . . . . . . . . . . . . . . . 163
21.2 When λ = 0 is an eigenvalue . . . . . . . . . . . . . . . . . . . . . . . . . . . 168

22 The Characteristic Polynomial 169


22.1 The Characteristic Polynomial of a Matrix . . . . . . . . . . . . . . . . . . . 169
22.2 Eigenvalues and Similarity Transformations . . . . . . . . . . . . . . . . . . 176

23 Diagonalization 179
23.1 Eigenvalues of Triangular Matrices . . . . . . . . . . . . . . . . . . . . . . . 179
23.2 Diagonalization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180
23.3 Conditions for Diagonalization . . . . . . . . . . . . . . . . . . . . . . . . . . 182

24 Diagonalization of Symmetric Matrices 187


24.1 Symmetric Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
24.2 Eigenvectors of Symmetric Matrices . . . . . . . . . . . . . . . . . . . . . . . 188
24.3 Symmetric Matrices are Diagonalizable . . . . . . . . . . . . . . . . . . . . . 188

25 The PageRank Algortihm 191


25.1 Search Engine Retrieval Process . . . . . . . . . . . . . . . . . . . . . . . . . 191
25.2 A Description of the PageRank Algorithm . . . . . . . . . . . . . . . . . . . 192
25.3 Computation of the PageRank Vector . . . . . . . . . . . . . . . . . . . . . . 195

26 Discrete Dynamical Systems 197


26.1 Discrete Dynamical Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
26.2 Population Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197
26.3 Stability of Discrete Dynamical Systems . . . . . . . . . . . . . . . . . . . . 199

Common questions

Powered by AI

Linear independence of a set of vectors is established when no vector in the set can be written as a linear combination of the others. This is fundamental because linearly independent sets constitute bases for vector spaces, determining their dimension and forming the foundation for vector space definition. Understanding linear independence is crucial for practical applications such as computations in graphics, data analysis, and solving differential equations .

Vector spaces generalize linear algebraic operations to include more abstract constructs beyond typical Euclidean spaces, such as function spaces and polynomial spaces. This extension allows for the analysis and manipulation of infinitely dimensional spaces, crucial for applications in quantum mechanics, functional analysis, and control theory. The concept enables transformations and computations across different dimensions and structures, greatly expanding the scope of algebraic solutions .

Determinants are scalar values that provide insight into the properties of matrices. They indicate whether a matrix is invertible, with a non-zero determinant confirming invertibility and a zero determinant indicating singularity. These properties are crucial for solving linear systems, and they also affect the volume scaling property in geometric transformations, which are applied in physics and engineering calculations .

A matrix in reduced row echelon form (RREF) simplifies the process of identifying solutions to a linear system by highlighting independent and dependent variables clearly. Each leading entry is 1, and all entries above and below are zero, which makes the solution straightforward: if the system is consistent, the RREF uniquely determines the solution set and explicitly reveals free and pivot variables. If an inconsistent equation is found, the system has no solution .

A matrix is invertible if and only if its determinant is non-zero. This property is significant because an invertible matrix ensures that a unique solution exists for a given system of linear equations. The inverse of a matrix, when it exists, can be used to solve equations using methods such as matrix multiplication, offering insights into transformations and linear mappings .

Eigenvectors and eigenvalues play a crucial role in diagonalizing a matrix. A matrix is diagonalizable if it has a set of n linearly independent eigenvectors, where n is the dimension of the matrix. Diagonalization simplifies matrix powers and facilitates computations such as matrix exponentials, making it useful in applications like differential equations, dynamical systems, and quantum mechanics .

Matrix algebra in computer graphics is fundamental, primarily using operations such as transformations (translation, scaling, rotation) and perspective projections. These operations leverage matrix multiplication, transposition, and other matrix arithmetic to model scenes and transformations efficiently. Matrices allow concise representation and manipulation of geometric data, enabling fast computations that are crucial for real-time rendering and animation in graphics engines .

The Rank Theorem establishes a relationship between the dimensions of the column space and null space of a matrix, which affects the solution characteristics of a linear system. It states that the rank of a matrix plus the nullity equals the number of columns. This theorem is significant because it provides insight into the number of solutions and is a key tool in dimensional analysis, which is important for understanding the linear independence within the system .

The change of basis process transforms vector representations from one coordinate system to another, using a transformation matrix. This is crucial for simplifying problems by choosing a basis that aligns with the symmetry or inherent characteristics of the problem. It also facilitates numerical computations and enables easier solutions of linear transformations in various applications like computer graphics and robotics .

The row echelon form (REF) of a matrix is a simplified version that makes it easier to solve a system of linear equations. The process of row reduction consolidates the system into a triangular matrix, which reveals the leading coefficients and relationships among variables. This form helps identify if a solution is consistent and can indicate the presence of unique, infinite, or no solutions through back substitution .

You might also like