Lectures

Sunday, January 19, 2020 1:54 PM

MA2071 Page 1
Intro
Sunday, January 12, 2020 3:28 PM

Prof. Naralah

hmnasralah@wpi.edu

Midterm: Feb 7 @ 5pm

Final: Mar 6 @ 5pm

Always go to class, no Lecture notes

No hand in HW, WebWork is back

Grades: Typical ratings for A, B and C . Get 90%+

MA2071 Page 2
L1: Systems of linear equations in Lin Alg
Wednesday, January 15, 2020 12:20 PM

Linear equation: an equation thar follows This

Keep things at the same power

elimination Rewritten With y as a variable

if 2 lines (in2 variables) are not parallel, then they only have exactly One solution.

if they are parallel, They either have no solution or overlap giving infinitely many solutions.

Remark:

A system of Linear equations will have either

1. one solution
2. no solutions
3. Infinitely many Solutions

Def: as long as 2 or 3 holds, it is consistent. Otherwise if 1 holds, it is inconsistent

MA2071 Page 3
Matrix notation
- used all term
- idea: record Sys. of eqs. without redundancies

only the coefficients

MA2071 Page 4
L2: Row reduction and Echelon form
Thursday, January 16, 2020 11:57 AM

Goal: Develop an algorithm (row reduction) to

solve a system of linear equations in matrix
form

only the coefficients

1. first nonzero entry of each row is 1. these are called " Pivot" / lead
1s"
2. every entry below a pivot must be 0

1. Row echelon form

2. every entry above Pivot =0

Methods to solve:
1. Gaussian elimination
2. transform system in matrix form to row echelon form
3. use back substitution to get Solution

What are the "legal operations" to reduce a matrix?

Elementary row operations

1. Can swap 2 rows
2. Scale (multiply or divide a row by any real number)
3. add a multiple of One row to another row

MA2071 Page 5
use either gaussian or gauss Jordan elimination to solve the system

what if after row reducing we get this?

MA2071 Page 6
L3 + L4 : Vector equations
Friday, January 17, 2020 12:00 PM

vector: a Matrix with one column (ordered list)

example:

scaling

only works if vectors live in same space

MA2071 Page 7
Recall: making new vectors out of old ones

MA2071 Page 8
MA2071 Page 9
MA2071 Page 10
L4B & L5: 1.4: the Matrix equation
Tuesday, January 21, 2020 12:39 PM

MA2071 Page 11
MA2071 Page 12
 For every

For every , it can be built from colums of A

The columns of

Matrix A has a pivot in every row after row reduction

MA2071 Page 13
MA2071 Page 14
L6 Solution sense of linear systems
Friday, January 24, 2020 11:57 AM

MA2071 Page 15
MA2071 Page 16
L6 B + L7A : applications of linear systems
Friday, January 24, 2020 12:35 PM

Balancing chemical equations

- Chem equation: describes Chem reactions in which Substances undergo a chemical
transformation into another Substance

In a chem reaction, atoms are neither created or destroyed

MA2071 Page 17
MA2071 Page 18
MA2071 Page 19
MA2071 Page 20
MA2071 Page 21
MA2071 Page 22
MA2071 Page 23
MA2071 Page 24
L7B + 8A : Linear independence
Monday, January 27, 2020 12:34 PM

MA2071 Page 25
MA2071 Page 26
MA2071 Page 27
L8B + 9A : Linear Transformations
Tuesday, January 28, 2020 12:35 PM

MA2071 Page 28
MA2071 Page 29
MA2071 Page 30
MA2071 Page 31
9B, 10A : the matrix of linear transformation
Thursday, January 30, 2020 12:49 PM

The only Linear transformations are matrix ones. If T is linear, there is a matrix A that T(x) =A(x)

CHECK THE BOOK TO EXPLAIN IT PERFECTLY

MA2071 Page 32
MA2071 Page 33
10B/11A Matrix operations/arithmetic
Monday, February 3, 2020 12:01 PM

Obj: discuss 4 basic functions and scaling of a matrix

MA2071 Page 34
MA2071 Page 35
11B/12A: Inverse of a Matrix
Tuesday, February 4, 2020 12:00 PM

MA2071 Page 36
MA2071 Page 37
MA2071 Page 38
L13:intro to determinants
Thursday, February 6, 2020 12:18 PM

determines if a matrix is invertible

MA2071 Page 39
MA2071 Page 40
personal notes for the determinant
Monday, February 3, 2020 5:12 PM

MA2071 Page 41
L14: Determinants continued
Monday, February 10, 2020 11:58 AM

MA2071 Page 42
MA2071 Page 43
L15: vector space and subspace
Tuesday, February 11, 2020 11:55 AM

MA2071 Page 44
MA2071 Page 45
MA2071 Page 46
2.8 Subspace of R^n
Thursday, February 13, 2020 11:58 AM

MA2071 Page 47
MA2071 Page 48
MA2071 Page 49
5.1 Eigenvectors and eigenvalues
Friday, February 14, 2020 12:01 PM

MA2071 Page 50
MA2071 Page 51
MA2071 Page 52
L16
Monday, February 17, 2020 11:58 AM

MA2071 Page 53
MA2071 Page 54
L18
Tuesday, February 18, 2020 12:02 PM

MA2071 Page 55
MA2071 Page 56
L19
Thursday, February 20, 2020 12:00 PM

MA2071 Page 57
MA2071 Page 58
MA2071 Page 59
L20
Friday, February 21, 2020 12:01 PM

MA2071 Page 60
MA2071 Page 61
L21
Monday, February 24, 2020 12:02 PM

MA2071 Page 62
MA2071 Page 63
MA2071 Page 64
MA2071 Page 65
MA2071 Page 66
MA2071 Page 67
L22
Tuesday, February 25, 2020 12:26 PM

MA2071 Page 68
MA2071 Page 69
L23
Monday, March 2, 2020 12:04 PM

MA2071 Page 70
MA2071 Page 71
MA2071 Page 72
L24
Tuesday, March 3, 2020 12:01 PM

MA2071 Page 73
MA2071 Page 74
FINAL NOTES TO STUDY
Wednesday, March 4, 2020 6:26 PM

2.8: Subspaces of

- A subspace of is any set H in has these three properties

A. The zero vector, is in H

B. For each u and v vector in H, the sum u+v is in H

C. For each u in H and each scalar c, cu is in H

- Column space of A
○ The set of Col a of all linear combinations of the columns of A

○ Ex:

▪ To solve this, augment to see if the system is consistent

□ In this context, Consistent means that there is a possible solution,
otherwise meaning that if all of the variables equate to 0 when anything
in the augmented row is not 0, then the specific line is not consistent.
□ If b follows the rules and is consistent, then it is a part of Col A

- Null Space of Matrix A

○ The Null space of a matrix is the set of Nul A of all solutions of the homogeneous
equation Ax = 0
▪ The null space of an mxn matrix A is a subspace of . The set of all solutions
of a system Ax=0 of m homogeneous linear equations in n unknowns is a
subspace of Rn
- Basis for Subspace A: A linearly independent set in H that spans H
- Basis from the Null space of A

MA2071 Page 75
 - Null Space: Vectors x that satisfy

Create

Null space:

Nullity: Columns - rank = Nullity

Nullity of 2

- Key notes:
○ Find the free variables, row reduce and solve everything.

2.9: Dimension and Rank

- Dimensions of a matrix: they are sorted row by column obviously

- Rank of a matrix: Determined by the dimension of a column space of a matrix
Example: if a 5x7 matrix has only 3 pivots, then the rank of A is 3

MA2071 Page 76
 ○ Example: if a 5x7 matrix has only 3 pivots, then the rank of A is 3

- Invertible Matrix Theorem Part 2

M. Columns of A for a basis of Rn
N. Col A = Rn
O. Dim Col A = n
P. Rank A = n
Q. Nul A = {0}
R. Dim Nul A = 0

3.1: Determinants

Matrix must be a square matrix to take the determinant

Cofactor expansion system

The numbers will change signs based on the expansion when they become the factors of a
matrix similar to the image below

Chose the row and column based on the amount of zeros

MA2071 Page 77
3.2: Properties of Determinants

Row Operations
A. If a row of A is added to another row to produce a matrix B,
B. If two rows are switched in a matrix:
C. If one row is multiplied by , then

Triangle Theorem

If

Same for if

The diagonal works based on the triangle pattern.

4.1: Vector Space and Subspace

Vector Space: a non empty set V of vectors which are defined two operations, addition and
multiplication by scalars
Rules:
1. The Sum of u and v denoted by is in V
2. The Scalar multiple of u by c is known as is in V

These operations apply with the same addition and multiplication rules as with standard
addition and multiplication

Subspaces
- A vector subspace is a subset H of V with the three properties
1. The zero vector of Vis in H
2. H is closed under addition, meaning that the sum of is in H
3. H is closed under multiplication by scalars, meaning that vector is in H
- How do you test this?
○ Check these two statements
▪ are in if u and v are in
▪ is in if v is in

MA2071 Page 78
5.1: Eigenvectors and eigenvalues

- An nxn matrix that is a non zero vector x such that

How do you get there?

Subtract an eigen identity matrix from the main matrix, and then row reduce to find the
value,

Use quadratic formula:

To find the eigenvectors:

1. Repeat the process outside of the determinant
2. Substitute lambda for the true eigen values
3. Row reduce until you have your columns

Example:

Lets say and

Repeating the same process will give the vector

5.2: Characteristic Equation

MA2071 Page 79
Eigen Value Rules
1. 0 is not an eigenvalue of A
2. The determinant of A is not zero

Lets say and are eigen values and they form the basis

If Then the values will be set as such:

For this case, you find vectors that satisfy the conditions until you have enough for an eigen
basis

5.3: Diagonalization

- If D =

-
If told to find

- matrix A
- Diagonal nxn matrix B
- Example:
○
- A square matrix A is diagonalizable if A is similar to a diagonal matrix

6.1: Dot Product, Length and Orthogonality

Dot Product: if and

Theorems
A.
B.
C.
D. and if and only

Vector Length:

Distance between two vectors:

Orthogonal Vectors:

6.2: Orthogonal Sets

MA2071 Page 80
6.2: Orthogonal Sets
- Think of it similarly to a basis, these are vector sets that are orthogonal. In this set, all
vectors are orthogonal to each other.

Orthogonal Basis: How do we get it?

This is given by the equation where j is any number from 1 to p

The full equation

To make a vector unto an orthogonal projection, use the following formula

-

Orthonormal Sets:
- For this to be true, and

How does this exist? With a unit vector

Convert the orthogonal basis into ortho normal for this to work at all.

Check for Orthonormal columns: where is the matrix of

If this is truly orthogonal, Then the matrix should be 0 in every entry except for the diagonal
which should appear as , or

For U as a m x n matrix with orthogonal columns, these cases are true:

1.
2.
3. only if

6.3: Orthogonal Projections

Orthogonal Decomposition:

So, for the full formula, to show the orthogonal projection of y onto W:

6.4: Gram Schmidt Process

How does it work?

MA2071 Page 81
To find a new vector based off of an old one, use the following:

- For vectors
○
○
○

Orthonormal Basis:

6.5: Least Squares Problems

- Recall the formula

The calculation for the least squares formula:

- When solving for an inconsistent solution, use the following:

○

For a least squares formula to work, it must follow these properties

1. The equation Ax=b has a unique solution for every b in Rn
2. The columns of A are linearly Independent
3. The matrix is invertible.

Alternative Calculations
-

6.6: Applications of LSS

For , which is denoted similar to y = mx+b

- The system can be set up based on the formulas from the last 2 lectures

MA2071 Page 82
MA2071 Page 83
Homework
Sunday, January 19, 2020 1:55 PM

MA2071 Page 84
HW 1 Scratchpad
Sunday, January 19, 2020 1:55 PM

MA2071 Page 85
pad 3
Monday, January 20, 2020 2:14 PM

MA2071 Page 86
MA2071 Page 87
pad 4
Tuesday, January 21, 2020 1:52 AM

MA2071 Page 88
MA2071 Page 89
MA2071 Page 90
Pad 5
Tuesday, January 21, 2020 5:57 PM

MA2071 Page 91
Pad 6: Linear determinant example
Tuesday, January 28, 2020 2:59 PM

MA2071 Page 92
Pad 7
Monday, February 3, 2020 5:36 PM

MA2071 Page 93
Pad 8
Sunday, February 16, 2020 10:45 PM

MA2071 Page 94
MA2071 Page 95
MA2071 Page 96
Pad 9
Monday, February 17, 2020 12:42 AM

MA2071 Page 97
P10
Tuesday, February 18, 2020 5:16 PM

MA2071 Page 98
MA2071 Page 99
MA2071 Page 100
MA2071 Page 101
P11
Sunday, March 1, 2020 2:54 PM

MA2071 Page 102

MA2071 Page 103
MA2071 Page 104
P12
Tuesday, March 3, 2020 6:23 PM

MA2071 Page 105

MA2071 Page 106
MA2071 Page 107
MA2071 Page 108
P13
Tuesday, March 3, 2020 7:52 PM

MA2071 Page 109

MA2071 Page 110
Conferences
Wednesday, January 22, 2020 9:56 AM

MA2071 Page 111

C1
Wednesday, January 22, 2020 9:58 AM

MA2071 Page 112

MA2071 Page 113
C2
Wednesday, January 29, 2020 10:00 AM

MA2071 Page 114

MA2071 Page 115
C3
Wednesday, February 5, 2020 10:02 AM

MA2071 Page 116

MA2071 Page 117
C4
Wednesday, February 12, 2020 10:03 AM

MA2071 Page 118

MA2071 Page 119
C5
Wednesday, February 19, 2020 10:02 AM

MA2071 Page 120

MA2071 Page 121
C6
Wednesday, February 26, 2020 10:02 AM

MA2071 Page 122

MA2071 Page 123
C7
Wednesday, March 4, 2020 10:05 AM

MA2071 Page 124

MA2071 Page 125
Midterm Review
Thursday, February 6, 2020 4:04 PM

System of Equations to a matrix:

Augmented Matrix

Row Operations
- Add and Subtract
- Scale
- Switch Rows

Gaussian/Row Echelon Form

- One Pivot in every row, one in every column
- Downward in a diagonal manner
- No pivot should have a non-zero number below it

Gauss Jordan/Reduced Row Echelon Form

- Pivots are all that are left, reduced to 1
- Pivots should be in a diagonal order, one pivot in every row, and one in every column

Planes

Matrix Equation

MA2071 Page 126

Homogenous System

has only one trivial solution.

Chemical Formulas

Set them equal to each variable and then solve

Flow

Linear Combination:

T(x) = A(x)

Linear Transformation

- For every u and v in

- For every u and v in ,

MA2071 Page 127

Onto and 1 to 1

Onto: Every row has a pivot

1 to 1: Every column has a pivot

Identity Matrix

- A matrix that is completely row reduced and square (nxn, one pivot in each row)

Matrix Arithmetic
- Addition/Subtraction of a matrix: Matrices A and B must have the same dimensions (mxn)
- Multiplication: Columns of A must be equal to the rows of B
( )

Inverse Matrix
-
Augment an identity matrix to the original matrix and row reduce to find the new matrix
-

An inverse matrix is only possible if the matrix is square and

- An inverse matrix

Determinant of a 5x5 or higher matrix: Reduce to Row Echelon and Multiply diagonally

- Row swap will change the values

- Row operations will not change the outcome

Transposed Matrix:

MA2071 Page 128

 : Swap the rows with the columns.

Inversion Rules:

for a square matrix :

A is invertible
B. A is row equivalent to the NXN identity matrix
C. A has n Pivots
D. AX=0 has only the trivial solution
E. the Columns of A form a linearly independent set
F. Linear transformation x Ax is one to one
g. has at least one solution for each b in
h. Columns of A span
i. maps an onto
j. There is a matrix , C such that CA =I
k there is a matrix nxn, D such that AD = I
h is invertible

THESE RULES ARE EITHER ALL TRUE OR ALL FALSE, NOTHING IN BETWEEN

MA2071 Page 129

In class review
Friday, February 7, 2020 12:09 PM

MA2071 Page 130

MA2071 Page 131
MA2071 Page 132
MA2071 Page 133
Project 1
Thursday, February 6, 2020 9:42 PM

>> A = [1,1;0,3]

A=

1 1
0 3

>> a = [8;21]

a=

8
21

>> A*a

ans =

29
63

>> a1=rem(A*a,26)

a1 =

3
11

>> b=[19;18]

b=

19
18

>> b=[18;18]

b=

18
18

>> A*b

ans =

MA2071 Page 134

 36
54

>> rem(A*b,26)

ans =

10
2

>> c= [25;21]

c=

25
21

>> A*c

ans =

46
63

>> rem(A*c,26)

ans =

20
11

>> d = [16;16]

d=

16
16

>> A*d

ans =

32
48

>> d1=rem(A*d,26)

d1 =

6
22

MA2071 Page 135

P2
Monday, February 24, 2020 10:29 PM

MA2071 Page 136