Unit 3 Linear Algebra

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

1/105

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 1:29 PM on 7/22/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

106 Terms

1
New cards

What is an eigenvector of A?

A nonzero vector v satisfying Av = λv for some scalar λ.

2
New cards

What is an eigenvalue of A?

A scalar λ for which Av = λv has a nonzero solution.

3
New cards

Can the zero vector be an eigenvector?

No. Eigenvectors must be nonzero.

4
New cards

Can zero be an eigenvalue?

Yes. Zero is an eigenvalue if Av = 0 has a nonzero solution.

5
New cards

How do you verify that v is an eigenvector?

Compute Av and check whether it equals one scalar multiple λv.

6
New cards

What equation finds eigenvalues?

det(A - λI) = 0.

7
New cards

What is the characteristic polynomial?

p(λ) = det(A - λI).

8
New cards

What are the eigenvalues of a triangular matrix?

The entries on its main diagonal.

9
New cards

Why does det(A - λI) = 0 identify eigenvalues?

It makes A - λI singular, so (A - λI)x = 0 has a nonzero solution.

10
New cards

How do you find the eigenspace for λ?

Solve (A - λI)x = 0.

11
New cards

What is the eigenspace formula?

Eλ = Nul(A - λI).

12
New cards

What is the difference between an eigenvector and an eigenspace?

An eigenvector is one nonzero vector; an eigenspace is the entire subspace of solutions, including zero.

13
New cards

Does an eigenspace contain zero?

Yes, because every subspace contains zero.

14
New cards

How do you find a basis for an eigenspace?

Row-reduce A - λI and use the special solution vectors.

15
New cards

What is algebraic multiplicity?

The number of times an eigenvalue is repeated as a root of the characteristic polynomial.

16
New cards

What is geometric multiplicity?

The dimension of the eigenspace.

17
New cards

What inequality relates the two multiplicities?

1 ≤ geometric multiplicity ≤ algebraic multiplicity.

18
New cards

What does it mean for A to be diagonalizable?

A = PDP^(-1), where P is invertible and D is diagonal.

19
New cards

What are the columns of P?

Linearly independent eigenvectors of A.

20
New cards

What are the diagonal entries of D?

The eigenvalues matching the eigenvectors in the corresponding columns of P.

21
New cards

When is an n by n matrix diagonalizable?

When it has n linearly independent eigenvectors.

22
New cards

If A has n distinct eigenvalues, is it diagonalizable?

Yes.

23
New cards

Can a matrix with repeated eigenvalues be diagonalizable?

Yes, if it still has enough linearly independent eigenvectors.

24
New cards

Is every diagonalizable matrix invertible?

No. It may have zero as an eigenvalue.

25
New cards

When is a diagonalizable matrix invertible?

When none of its eigenvalues are zero.

26
New cards

How do you compute A^k using diagonalization?

A^k = PD^kP^(-1).

27
New cards

How do you compute D^k?

Raise each diagonal entry to the kth power.

28
New cards

If Av = λv, what is A^kv?

A^kv = λ^kv.

29
New cards

What does an eigenvector represent geometrically?

A direction that is not rotated away from its line by the transformation.

30
New cards

What does a positive eigenvalue do?

Scales the eigenvector without reversing its direction.

31
New cards

What does a negative eigenvalue do?

Scales and reverses the eigenvector direction.

32
New cards

What does λ = 1 mean?

The eigenvector is unchanged.

33
New cards

What does λ = -1 mean?

The eigenvector is reversed with the same length.

34
New cards

What does λ = 0 mean?

The eigenvector is mapped to zero.

35
New cards

What does |λ| > 1 mean?

The transformation stretches along that eigenvector direction.

36
New cards

What does 0 < |λ| < 1 mean?

The transformation shrinks along that eigenvector direction.

37
New cards

What does it mean for two matrices to be similar?

A = PBP^(-1) for some invertible P.

38
New cards

What do similar matrices share?

The same eigenvalues, characteristic polynomial, determinant, and trace.

39
New cards

What MATLAB command finds eigenvalues and eigenvectors?

[V,D] = eig(A)

40
New cards

What does V contain in [V,D] = eig(A)?

Eigenvectors as columns.

41
New cards

What does D contain in [V,D] = eig(A)?

Eigenvalues on the diagonal.

42
New cards

What MATLAB command finds only eigenvalues?

eig(A)

43
New cards

How can MATLAB find the eigenspace for λ?

null(A - lambda*eye(size(A)))

44
New cards

What MATLAB command computes matrix powers?

A^k

45
New cards

What is a stochastic matrix?

A nonnegative matrix whose columns sum to 1 under the column-vector convention.

46
New cards

What is the Markov-chain update formula?

x_(k+1) = Px_k.

47
New cards

How do you compute x1?

x1 = Px0.

48
New cards

How do you compute x2?

x2 = Px1 = P^2x0.

49
New cards

What is the general Markov-chain formula?

x_k = P^kx0.

50
New cards

How do you build a transition matrix from words?

Each column represents the current state, and each row represents the next state.

51
New cards

What should each column of a stochastic matrix sum to?

1.

52
New cards

What is a steady-state vector?

A vector q that satisfies Pq = q.

53
New cards

What equation is used to solve for steady state?

(P - I)q = 0.

54
New cards

What additional equation is needed for a probability steady state?

The entries of q must sum to 1.

55
New cards

What additional condition is needed for a population steady state?

The entries must sum to the total population.

56
New cards

Which eigenvalue corresponds to steady state?

λ = 1.

57
New cards

Is a steady-state vector an eigenvector?

Yes, an eigenvector associated with λ = 1.

58
New cards

How can MATLAB approximate a long-term Markov state?

P^100*x0

59
New cards

What is a linear transformation?

A function preserving vector addition and scalar multiplication.

60
New cards

What are the two linearity conditions?

T(u + v) = T(u) + T(v) and T(cu) = cT(u).

61
New cards

Is every transformation T(x) = Ax linear?

Yes.

62
New cards

What is the standard matrix of T from Rn to Rm?

A = [T(e1) T(e2) … T(en)].

63
New cards

What is the most important matrix-transformation rule?

Apply T to each domain basis vector and place the output coordinate vectors as columns.

64
New cards

What should you identify first in a transformation problem?

The domain, codomain, and ordered bases.

65
New cards

What should you do second in a transformation problem?

Apply T to each domain basis vector.

66
New cards

What should you do third in a transformation problem?

Express each output in the codomain basis.

67
New cards

What should you do fourth in a transformation problem?

Place those coordinate vectors into the columns of the matrix.

68
New cards

How many rows does a transformation matrix have?

The dimension of the codomain.

69
New cards

How many columns does a transformation matrix have?

The dimension of the domain.

70
New cards

How do you find the standard matrix for T:R2→R2?

Compute T(e1) and T(e2) and use them as the columns.

71
New cards

How do you find a matrix relative to a nonstandard basis B?

Compute T(b1), T(b2), and so on, then express each result in B-coordinates.

72
New cards

What is the basis matrix P?

The matrix whose columns are the basis vectors in standard coordinates.

73
New cards

When the same basis B is used in domain and codomain, how do you find the standard matrix?

A = P[T]B P^(-1).

74
New cards

How do you show two vectors form a basis for R2?

Show they are linearly independent, often by checking the determinant is nonzero.

75
New cards

How do you handle polynomial transformations?

Apply T to 1, t, t^2, and other basis polynomials, then use output coefficients as columns.

76
New cards

What is the coordinate vector of a + bt + ct^2 relative to {1,t,t^2}?

[a;b;c]

77
New cards

For T:P2→P4, what size is the matrix?

5 by 3.

78
New cards

Why is a P2→P4 matrix 5 by 3?

P2 has dimension 3 and P4 has dimension 5.

79
New cards

What is the dot-product formula?

u·v = u1v1 + u2v2 + … + unvn.

80
New cards

What is the vector-length formula?

||v|| = sqrt(v·v).

81
New cards

What is the distance formula?

dist(u,v) = ||u - v||.

82
New cards

What is the angle formula?

cos(theta) = (u·v)/(||u||||v||).

83
New cards

What MATLAB command computes a dot product?

dot(u,v)

84
New cards

What MATLAB command computes vector length?

norm(v)

85
New cards

What MATLAB command computes distance?

norm(u-v)

86
New cards

What MATLAB command computes an angle in degrees?

acosd(dot(u,v)/(norm(u)*norm(v)))

87
New cards

When are two vectors orthogonal?

When their dot product is zero.

88
New cards

What is an orthogonal set?

A set where every pair of different vectors has dot product zero.

89
New cards

What is an orthonormal set?

An orthogonal set where every vector also has length 1.

90
New cards

How do you normalize a vector?

v/||v||

91
New cards

What equation shows that Q has orthonormal columns?

Q^TQ = I.

92
New cards

If Q is square with orthonormal columns, what is Q^(-1)?

Q^(-1) = Q^T.

93
New cards

Are nonzero orthogonal vectors linearly independent?

Yes.

94
New cards

What is the projection of y onto u?

proj_u(y) = ((y·u)/(u·u))u.

95
New cards

What is the projection formula when u is a unit vector?

proj_u(y) = (y·u)u.

96
New cards

What is projection onto W with an orthogonal basis {u1,…,up}?

proj_W(y) = Σ((y·ui)/(ui·ui))ui.

97
New cards

What is the closest vector in W to y?

proj_W(y).

98
New cards

What is the purpose of Gram-Schmidt?

To turn a linearly independent basis into an orthogonal basis for the same subspace.

99
New cards

What is the first Gram-Schmidt step?

u1 = v1.

100
New cards

What is the second Gram-Schmidt step?

u2 = v2 - proj_u1(v2).