finals: sections 1.5 - 9.2 Flashcards

1
Q

when is a system of linear equations considered to be homogeneous?

A

when it can be written in the form Ax = 0

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

the homogeneous equation Ax = 0 has a nontrivial solution if and only if _____________

A

the equation has at least one free variable

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

what is the trivial solution?

A

the equation Ax = 0, where x = 0 is the only solution

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

what is a nontrivial solution?

A

an x does not equal 0 that satisfies Ax = 0

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

what is parametric vector form?

A

when the solution is written as a vector equation, x = su +tv

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

what is linear independence?

A

a set {v1, …, vp} is linearly independent if the vector equation x1v1 + … + xpvp = 0 has only the trivial solution

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

the columns of a matrix A are linearly independent if and only if _______________

A

the equation Ax = 0 has only the trivial solution

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

if a set has more vectors than entries in each vector, then the set is ___________

A

linearly dependent

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

if a set of vectors contains the zero vector, then the set is _________

A

linearly dependent

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

when two vectors are multiples of each other, they are _______________

A

linearly dependent

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

why do we care about linear independence?

A

1) it helps us understand whether a set of vectors provides unique information
2) if the set is linearly dependent, some of the vectors are redundant because they can be written as a combination of other vectors

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

a transformation or mapping, T, is linear if:

A

1) T(u+v) = T(u) + T(v), for all vectors u and v in the domain of T
2) T(cu) = cT(u), for all scalars c and all vectors u in the domain of T

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

what is a transformation (or mapping) T from IR^n to IR^m?

A

a rule that assigns a vector x in IR^n to a vector T(x) in IR^m

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

what is the domain of T?

A

IR^n

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

what is the codomain of T?

A

IR^m

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

what is the image of x?

A

T(x)

17
Q

what is the range of T?

A

the set of all images T(x)

18
Q

what is a shear transformation?

A

the transformation from IR^2 –> IR^2 defined by T(x) = Ax

19
Q

what is a dilation?

A

given scalar r, the transformation from IR^2 –> IR^2 defined by T(x) = rx

20
Q

what is a diagonal matrix?

A

a square, nxn matrix with entries on the diagonal and zeros everywhere else

21
Q

what are the properties of matrices and matrix multiplication?

A

1) A(BC) = (AB)C
2) A(B + C) + AB + AC
3) (B + C)A + BA + CA

22
Q

what is the transpose of a matrix?

A

given an nxm matrix A, the transpose of A, denoted A^T, is the mxn matrix whose columns are formed from the corresponding rows of A

23
Q

what are the properties of transposing?

A

1) (A^T)^T = A
2) (A + B)^T = A^T + B^T
3) (rA^T) = r(A^T), r scalar
4) (AB)^T + B^T * A^T

24
Q

what is the geometric approach good for?

A

lower dimensional problems (3D or less)

25
Q

what is the canonical linear programming problem?

A

1) maximize c^Tx = f(x) subject to:
2) the constraints of Ax <= b
3) and x > 0

26
Q

what is an optimal vector?

A

a vector that satisfies 1, 2, and 3

27
Q

what is a feasible solution?

A

a vector that satisfies 2 and 3

28
Q

what is an objective function?

A

what you are optimizing

29
Q

what are the two things that can go wrong in a linear programming problem?

A

1) infeasible
2) unbounded

30
Q

what is infeasible?

A

the constraint inequalities are inconsistent and the set of all feasible solutions F, is an empty set

31
Q

what is unbounded?

A

there are arbitrarily large values in F, then a maximum DNE

32
Q
A