MATH0520 - LE1-4, EV1, EV2

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/35

encourage image

There's no tags or description

Looks like no tags are added yet.

36 Terms

1
New cards

matrix

an 𝑚 ×𝑛 array of real numbers with 𝑚 rows and 𝑛 columns

2
New cards

column vectors

knowt flashcard image
3
New cards

set notation for matrices

</span> mathematical notation used to represent a matrix's structure, typically involving brackets and commas to separate elements within rows and columns </span>

<p>&lt;/span&gt; mathematical notation used to represent a matrix's structure, typically involving brackets and commas to separate elements within rows and columns &lt;/span&gt; </p>
4
New cards

Euclidean vector

an ordered list of real numbers

<p>an ordered list of real numbers</p>
5
New cards

component

each number in the list/euclidean vector

6
New cards

linear equation

equation of the variables 𝑥𝑖 of the form

<p>equation of the variables <span>𝑥𝑖</span> of the form</p>
7
New cards

solution

linear equation is a Euclidean vector that satisfies

𝑎1⁢𝑠1+𝑎2⁢𝑠2+⋯+𝑎𝑛⁢𝑠𝑛=𝑏 (that is, a Euclidean vector whose components can be plugged into the equation).

<p>linear equation is a Euclidean vector that satisfies</p><p>𝑎1⁢𝑠1+𝑎2⁢𝑠2+⋯+𝑎𝑛⁢𝑠𝑛=𝑏 <span>(that is, a Euclidean vector whose components can be plugged into the equation).</span></p>
8
New cards

system of linear equations or a linear system

is a collection of one or more linear equations

<p><span>is a collection of one or more linear equations</span></p>
9
New cards

solution set

is a solution to all equations in the system

<p><span>is a solution to all equations in the system</span></p>
10
New cards

consistent

if its solution set is non-empty (that is, there exists a solution for the system

11
New cards

inconsistent

if its solution set is empty (that is, there is no solution for the system)

12
New cards

consistent with one solution

solution set for linear system that is contains a single vector (one unique solution)

<p>solution set for linear system that is contains a single vector (one unique solution)</p>
13
New cards

consistent with infinite solution

solution set for linear system that contains infinitely many vectors (infinite solution)

<p>solution set for linear system that contains infinitely many vectors (infinite solution)</p>
14
New cards

inconsistent

solution set for linear system that is empty set, denoted by either {} or ∅, no solution

<p>solution set for linear system that is  empty set, denoted by either {} or ∅, no solution</p>
15
New cards

augmented matrix

the 𝑚 ×𝑛 matrix of its coefficients augmented with the 𝑚 constant values as a final column

<p><span>the 𝑚 ×𝑛 matrix of its coefficients augmented with the 𝑚 constant values as a final column</span></p>
16
New cards

coefficient matrix

𝑚 ×𝑛 array consisting of the coefficients of the linear system (and ignore its constant terms)

<p><span>𝑚 ×𝑛 array consisting of </span>the coefficients of the linear system (and ignore its constant terms)</p>
17
New cards

Vector equation

an equation written as a linear combination of column vectors with unknown scalar variables set equal to a target result vector

<p>an equation written as a linear combination of column vectors with unknown scalar variables set equal to a target result vector</p>
18
New cards

equivalent

Two systems of linear equations are that have the same solution set (denote with ∼)

19
New cards

three row operations produce equivalent augmented matrices

  1. Swap two rows, for example, 𝑅1 ↔𝑅2

  2. Multiply a row by a nonzero constant, for example, 2⁢𝑅1 →𝑅1

  3. Add a constant multiple of one row to another row, for example, 𝑅2 −4⁢𝑅1 →𝑅2


<ol><li><p><span>Swap two rows, for example, 𝑅1 </span><span data-name="left_right_arrow" data-type="emoji">↔</span><span>𝑅2</span></p></li><li><p><span>Multiply a row by a nonzero constant, for example, 2⁢𝑅1 →𝑅1</span></p></li><li><p><span>Add a constant multiple of one row to another row, for example, 𝑅2 −4⁢𝑅1 →𝑅2</span></p></li></ol><p></p>
20
New cards

reduced row echelon form (RREF)

  1. The leftmost nonzero term of each row is 1. We call these terms pivots.

  2. Each pivot is to the right of every higher pivot.

  3. Each term that is either above or below a pivot is 0.

  4. All zero rows (rows whose terms are all 0) are at the bottom of the matrix


21
New cards

Gauss-Jordan elimination algorithm

  1. Ignoring any rows that already have marked pivots, identify the leftmost column with a nonzero entry.

  2. Use row operations to obtain a pivot of value 1 in the topmost row that does not already have a marked pivot.

  3. Mark this pivot, then use row operations to change all values above and below the marked pivot to 0.

  4. Repeat these steps until the matrix is in RREF.


22
New cards

inconsistent linear system (RREF)

If the linear system given by RREF⁡(𝐴) includes the contradiction

0=1, that is, the RREF matrix includes the row [0⋯01]

<p><em>If the linear system given by </em><span>RREF⁡(𝐴)</span><em> includes the contradiction</em></p><p>0=1, <em>that is, the </em><span>RREF</span><em> matrix includes the row </em>[0⋯01]</p>
23
New cards

consistent linear system with one solution (RREF)

If the linear system given by RREF⁡(𝐴) sets every variable of the system to a specific value; that is we have:

𝑥1=𝑠1

𝑥2=𝑠2⋮

𝑥𝑛=𝑠𝑛

(with some possible extra 0 = 0 equations), then

<p><em>If the linear system given by </em><span>RREF⁡(𝐴)</span><em> sets every variable of the system to a specific value; that is we have:</em></p><p>𝑥1=𝑠1</p><p>𝑥2=𝑠2⋮</p><p>𝑥𝑛=𝑠𝑛</p><p><em>(with some possible extra </em><span>0 = 0</span><em> equations), then </em></p>
24
New cards

consistent with infinitely-many different solutions (RREF)

not include a 0 =1 contradiction while at least one variable is not required to equal a specific value.

<p>not include a 0 =1 contradiction while at least one variable is not required to equal a specific value.</p>
25
New cards

bound variables

pivot columns in an augmented matrix

26
New cards

free variables

a variable that does not correspond to a pivot column in row-echelon form, meaning it can take any real number value

27
New cards

scalar

The real number that is used to multiply a vector

28
New cards

vector spaces

a collection of objects called vectors that can be added together and scaled by numbers called scalar (e.g. polynomials, matrices)

29
New cards

linear combination

a set of vectors {v1,v2,…,vn} is given by c1v1 +c2⁢v2 +… +𝑐𝑛⁢𝑣𝑛 for any choice of scalar multiples 𝑐1,𝑐2,…,𝑐𝑛.

<p><span>a set of vectors {v1,v2,…,vn} is given by c1v1 +c2⁢v2 +… +𝑐𝑛⁢𝑣𝑛 for any choice of scalar multiples 𝑐1,𝑐2,…,𝑐𝑛.</span></p>
30
New cards

span of a set of vectors

is the collection of all linear combinations of that set

<p><span>is the collection of all linear combinations of that set</span></p>
31
New cards

span in R^m

𝑚 vectors are required to span ℝ^𝑚

32
New cards

{v1,…,vn} spans all of ℝ^m

is consistent for every vector meaning the vector is in R^m (RREF of the vector equation’s coefficient matrix has all pivot rows)

33
New cards

{v1,…,vn} fails to span all of ℝ^𝑚

when the vector equation

𝑥1⁢⃗𝑣1+⋯+𝑥𝑛⁢⃗𝑣𝑛=⃗𝑤

is inconsistent for some vector ⃗𝑤 ∈ ℝ^𝑚 (RREF of the vector equation’s coefficient matrix has at least one non-pivot row (a row of zeroes)

34
New cards

rank-nullity theorem

The dimension of the domain of 𝑇 equals dim⁡(ker⁡𝑇) +dim⁡(Im⁡𝑇).


35
New cards

rank of 𝑇 (or 𝐴)

The dimension of the image

36
New cards

nullity

the dimension of the kernel