Solving Systems of Linear Equations Flashcards
What is the central core of linear algebra?
To solve systems of linear
equations (the unknowns are only multiplied by numbers).
Define a linear system.
A linear system is a collection of m equations in n variables.
What is the goal of linear algebra?
To solve the linear system simultaneously.
What is the general solution of a linear system?
The set of all solutions.
What is an inconsistent linear system?
A linear system that has no solution.
What is a consistent linear system?
A linear system that has at least one solution.
What is a homogeneous linear system?
A linear system in which all the constants on the
right-hand-side are zeros.
What is an inhomogeneous linear system?
A linear system in which at least one of the constants on the
right-hand-side is non-zero.
What kind of linear systems are always consistent?
Homogeneous linear systems.
What is a degenerate linear system?
A linear system where all the coefficients are zeros.
0x1+0x2+···0xn = b, b∈R.
If b≠0, this equation has no solution and if b=0, every
x = (x1,x2,···,xn)∈R^n
is a solution
What are the three elementary row operations?
- Add a multiple of one equation to another
- Exchange equations
- Multiply an equation by a non-zero scalar.
(All three can be reversed)
What is an augmented matrix?
A matrix composed of a coefficient matrix A and a column of constants b.
[A|b]
If there are m equations and n unknowns in a system, what is the size of the coefficient matrix A?
mxn (m rows and n columns)
When is a matrix said to be in Row Echelon Form
(REF)?
- All the zero rows are at the bottom.
- The first non-zero entry in each row is a 1, which is called a leading 1 or a pivot.
- Each leading 1 is to the right of the one in the row above.
When is a matrix said to be in Reduced Row Echelon Form
(RREF)?
If, in addition to being in REF, each leading 1 is the only non-zero entry in its column.
What are 4 remarks about REF’s and RREF’s?
1 From REF of the augmented matrix of a linear system we will be able to tell if the system is inconsistent or has a unique solution, or has infinitely many solutions.
- From the RREF we can read off the solution.
- Variables corresponding to columns which do not have a leading 1 are called non-leading variables and these are the parameters in the general solution.
- Non-leading variables are responsible for a linear system to have infinitely many solutions.
When are two matrices A and B are row equivalent?
Two matrices A and B are row equivalent (A∼B or B∼A) if B can be obtained from A by a finite sequence of elementary row operations.
How may RREF’s does any matrix have?
A unique one.
What are the 3 rules for reading off the type of general solution from REF?
- If the augmented matrix (in REF) contains a row like
[0, 0, · · · , 0|b] where b≠0, then it is inconsistent and there is no solution, - If every column of REF has a leading 1, then there is a unique solution,
- If there is a column in a REF that does not have a leading 1 (which corresponds to a non-leading variable), then there are infinitely many solutions.
What is the procedure for writing down the general solution from a consistent RREF?
- If there is a unique solution (i.e. every column has a leading 1), then the solution is the column of constants.
- Otherwise, identify the leading and non-leading variables in the RREF. Then,
- 1 Write down the equation for each row and solve for the leading variables in terms of non-leading variables.
- 2 Set each non-leading variable to a different parameter and substitute them into the equations for the leading variables.
- 3 Write down the general solution, including all variables.
What are the 5 steps of the Gaussian Elimination Algorithm for reducing systems to REF?
- If M is the zero matrix, stop!
- Find the left-most non-zero column, and interchange the top-row with another (if necessary) to bring a non-zero entry to the first row of this column.
- Scale the first row, as necessary, to get a leading 1.
- Add suitable multiple of the top row to the other rows to create zeros below the leading 1.
- This completes the operations with the first row. Keep first
row and go back to step 1.
When the algorithm stops, the resulting matrix will be in REF.
What are the 3 additional steps of the Gaussian Elimination Algorithm for reducing systems to RREF?
- If the right-most leading 1 is in row 1, stop!
- Start from the right-most leading 1 and add suitable multiples of that row to create zeros above that leading 1.
- Cover up the row we used and go step (6).
When the algorithm stops, the resulting matrix would be in RREF.
What is a matrix?
A a rectangular array of numbers or entries.
