100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached 4.2 TrustPilot
logo-home
Summary

Summary Linear Algebra and Its Applications, Global Edition, ISBN: 9781292092232 Linear Algebra

Rating
-
Sold
-
Pages
11
Uploaded on
22-09-2021
Written in
2021/2022

summary of all linear algebra theorems and definitions

Institution
Module









Whoops! We can’t load your doc right now. Try again or contact support.

Connected book

Written for

Institution
Study
Module

Document information

Summarized whole book?
No
Which chapters are summarized?
1.1 - 2.3
Uploaded on
September 22, 2021
Number of pages
11
Written in
2021/2022
Type
Summary

Subjects

Content preview

Linear algebra: definitions and theorems
1.1 SYSTEMS OF LINEAR EQUATIONS

A linear equation in the variables x 1 x n is an equation that can be written in the form a1x1 + a2x2 +
… + anxn = b where b and the coefficients a1, ... , an are real or complex numbers.

A system of linear equations (or a linear system) is a collection of one or more linear equations
involving the same variables.

A system of linear equations has 1. no solution, or 2. exactly one solution, or 3. infinitely many
solutions. A system of linear equations is said to be consistent if it has either one solution or infinitely
many solutions; a system is inconsistent if it has no solution.

ELEMENTARY ROW OPERATIONS 1. (Replacement) Replace one row by the sum of itself and a
multiple of another row. 2. (Interchange) Interchange two rows. 3. (Scaling) Multiply all entries in a
row by a nonzero constant.

Two matrices are called row equivalent if there is a sequence of elementary row operations that
transforms one matrix into the other. If the augmented matrices of two linear systems are row
equivalent, then the two systems have the same solution set.

1.2 ROW REDUCTION AND ECHELON FORMS

A leading entry of a row refers to the leftmost nonzero entry (in a nonzero row).




Uniqueness of the Reduced Echelon Form: Each matrix is row equivalent to one and only one
reduced echelon matrix.

A pivot position in a matrix A is a location in A that corresponds to a leading 1 in the reduced echelon
form of A. A pivot column is a column of A that contains a pivot position.




1

, Basic variables: variables with only one value; free variables: you can choose any value for the x.




1.3 VECTOR EQUATIONS




A matrix with only one column is called a column vector, or simply a vector. Two vectors in R2 are
equal if and only if their corresponding entries are equal.

The vector whose entries are all zero is called the zero vector and is denoted by 0.




y = c 1v 1 C+ … + c p v p is called a linear combination of v 1 , … , vp with weights c1 , … , cp .




2
£2.68
Get access to the full document:

100% satisfaction guarantee
Immediately available after payment
Both online and in PDF
No strings attached

Get to know the seller
Seller avatar
bogaertsfamke
3.0
(1)

Get to know the seller

Seller avatar
bogaertsfamke Universiteit Antwerpen
Follow You need to be logged in order to follow users or courses
Sold
4
Member since
4 year
Number of followers
3
Documents
11
Last sold
10 months ago

3.0

1 reviews

5
0
4
0
3
1
2
0
1
0

Recently viewed by you

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their exams and reviewed by others who've used these revision notes.

Didn't get what you expected? Choose another document

No problem! You can straightaway pick a different document that better suits what you're after.

Pay as you like, start learning straight away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and smashed it. It really can be that simple.”

Alisha Student

Frequently asked questions