Exam 1 Flashcards

Matrices and Vectors

1
Q

Linear Equation

A

an equation that can be written as:

ax1+bx2+…..nxn

where a,b..n are real or complex numbers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Linear System

A

One of more linear equations involving the same variables.

Must have
1. No solution (Consistent)
2. 1 solution (Consistent)
3. Infinite Solutions (Inconsistent)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

matrix (elementary row operations)

A
  1. Interchange
  2. Scaling
  3. Replacement
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Row Equivalence

A

Two matrices are row equivalent if there is a series of elementary row operations that transforms one matrix into another

This means that the matrices associated linear system has the same solution set

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Echelon Form

A
  1. Non Zero Rows are above rows of all 0s
  2. Traingle Shape – Leading rows go down left to right
  3. Below leading entry are zeroes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

RRef : Row Reduced Echelon Form

A

What:
1. Leading Entry is 1
2. Leading entry is only non zero entry

Note: RReF is UNIQUE

Use:
1. Determining qualities of variables, determining solution sets

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Pivot Position

A

What: Corresponds to the position of a leading 1. A pivot column contains a pivot solution.

Use:
Basic Variables (have a solution essentially) correspond to pivot columns

Free variables do not correspond to pivot columns and can be any value

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

A linear system is consistent if…

A

it’s corresponding matrix has no row of the form 000 b where b does not equal 0

Consistent system has a solution (1 or infinite)

Why relevant: The existence of a free variable does NOT mean infinite solutions + best way to determine no solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Vector

A
  1. A matrix with one column
  2. Two vectors are equal if and only if thier entries are the same
  3. zero vector has zeroes in all positions
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Vector Operations

A
  1. Scalar Multiplication
  2. Vector Addition
  3. Parellelogram Rule
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Linear Combo

A

Combination of a set of vectors with a set of scalars as weights

relevant: for matrices..

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

span

A

what: the set of all linear combinations of v1, v2,v3
why: where can we go using these vectors?

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

matrix equations

A

A x> = b> only has a solution if b is a linear combination of the columns of A (think of how multiplication works)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Ax = 0

A

-homogenous if it can be written in that form
- always at least one solution (trivial solution) x = 0
- non trivial solution (one free variable)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

The consistent equation with Ax = b, let p be a solution

A

the solution set is w = p + vh where vh is any solution of the homogenous equation

repercussions: if there is only a trivial solution, then Ax = b is the unique solution

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Linear Independence

A

A set of vectors is linearly indepedent if none of the vectors in the set are linear combinations of the others

  1. Linearly independent vectors only have the trivial solution
  2. Does not contain the zero vectors
  3. More vectors than entries in vectors (more columns than rows)
17
Q

Given an mxn matrix, for each b in Rm Ax = b has a solution

A
  1. b must be a linear combo of A
  2. columns of A span Rm
  3. pivot position in each row
18
Q

Codomain

A

all possible outputs

19
Q

range

A

all outputs

20
Q

Onto

A

Range and Codomain are the same
rn –> rm
Every b in rm is the image of at least one x in rn

21
Q

one to one

A

every b in Rm is the image of at MOST on x in Rn

22
Q

Linear Transformation requirement

A
  1. vector addition
  2. scalar multiplication
23
Q

Linear Transformation Properties

A
  1. 1-1 if and only if T(x) = 0 has only the trivial solution (this means that A is linearly independent)
  2. T maps Rn onto Rm if and only if the columns of A span Rm
24
Q

Invertibility

A

AC = I = CA

  1. A and its inverse are invertible
  2. Must be a square matrix, no free variables
  3. (AB)-1 = B-1*A-1
  4. Must be one to one and onto
25
Q

Vector Space

A

A non empty set V of objects which are subject to 10 axioms (on cheat sheet)
1. closed under addition
2. addition is commutative
3. addition is associative
4. closed under multiplication
5. has zero vector
6. an additive inverse exists
7. scalars distrivute
8. vecors distribute
9. associativity w scalars
10, scalar identity

26
Q

Subspace

A
  1. zero vector in H
  2. closed under addition
  3. closed under multiplication
27
Q

Null Space

A

the solution set of A where x = 0

This is a subspace

28
Q

Column Space of A

A

The span of the column of A

The pivot columns of a matrix A are the basis of Col (A)

29
Q

basis

A

a set of linearly independent vectors that span H