Lecture notes linear algebra

Lecture 1, 06-02

Working on your own during tutorial classes.

Singular method of evaluation. Same exact style questions as in tutorials.
week 1: system of linear equations, how to solve them.
Linear equation: x1, xn is an equation that can be written in the form of a1x1 =
anxn=b
we need an equal somewhere. a1 up to aN are the coefficients, where n is a natural
number and b is a real number. Linear comes from the individual expression that
they are only to the power of either 1 or 0, ^2 is not linear.
for some reason x1 and x2 basically seem to replace shit
Making a system, looking for solution that satisfies both systems at the same time. If
we find a solution, is it really the only one? can we check it?
If we have infinite solutions, we have the set of all solution; [s1, s2, …., sN]
Multiplying things in a system don’t matter as the same solution sets will still arise.
Solution that satisfies both solutions at the same time is at the intersection of the
lines. With three variables, you go into a three-dimensional space. Sets that
represent the same lines have a set of infinite solutions.
If same slope but different equality, parallel, no solutions.
A system of linear equations either
- has 1 solution
- has infitinetly many solution
- has no solutions

given the system

-2x1 + x2 = 0
2x1 - 8x2 = 8
-5x2=10
Matrix can be represented by both straight bracket and fat brackets.
coeffeicent matrix: represents coefficients of the variables.
in a complete matrix, the column of the result variables also get added to the end.
This is an augmented matrix.
rows are horizontal, columns are vertical. Matrix expressions is rows*columns,
so S1(3x4)
Rows first apparently.
x1-2x2+x3=0
every operation done to solve a system can also be fixed in the matrix, the system
that the last matrix represents the equivalante.
If everything below a certain line in a matrix is 0,
this is the echelon form
the more advanced version of this has an entries of 1, and around the ones also 0’s
only. That is the purest state of a matrix, called the reduced echelon form.
Each matrix is row-equivalent to only one reduced echelon form.
if you have
THeorem exist and uniqueness a system is consistent if it has at lesast a solution.
if in na row all but the last number are 0, we have a contradiction and their exists no
solution. The system then is inconsistent.
UNiquenesss → If there exists a solution, how do we tell it is unique? if we have 3 variables
we have infinite many solutions. IF we have no free variables, we have 1 unique solution. any
free variables means infinitely many solutions. if not, only 1