1/37
Comprehensive practice flashcards covering vector spaces, subspaces, null/column/row spaces, dimension and rank, coordinate systems, change of basis, eigenvalues and eigenvectors, similarity, diagonalization, linear transformation matrices, complex eigenvalues, inner products, orthogonality, projections, Gram-Schmidt, QR factorization, and least-squares problems.
What three defining conditions must a subset H of a vector space V satisfy to be a subspace?
A subset H is a subspace if: (1) the zero vector of V is in H (0∈H); (2) for all u,v∈H, u+v∈H (closed under addition); and (3) for each v∈H and any scalar c, cv∈H (closed under scalar multiplication).
If v1,v2,…,vp are vectors in a vector space V, what theorem provides the main method for producing subspaces of V?
The theorem states that Span{v1,v2,…,vp} is always a subspace of V.
How are the null space, column space, and row space of an m×n matrix A defined?
NulA={x∈Rn:Ax=0} is a subspace of Rn; ColA=Span{a1,…,an} is a subspace of Rm; and RowA=Span{r1,…,rm}=ColAT is a subspace of Rn.
For a linear transformation T:Rn→Rm with standard matrix A, what are the kernel and range of T?
The kernel of T is equal to NulA, and the range of T is equal to ColA.
What two conditions are required for a set of vectors β={b1,…,bp} to be a basis for a subspace H?
The set β must be linearly independent, and the span of β must equal H (Span{b1,…,bp}=H).
Given a matrix A row equivalent to an echelon form B, how are bases for RowA and ColA determined?
A basis for RowA consists of the nonzero rows of echelon form B, whereas a basis for ColA consists of the pivot columns of the original matrix A.
What is the relationship between rank, nullity, and column count given by the Rank-Nullity Theorem for an m×n matrix A?
rankA+nullityA=n, where rankA is the number of pivot positions of A and nullityA is the number of free variables in Ax=0.
What does the Basis Theorem state regarding a subset S of a p-dimensional vector space V (p≥1)?
If S has exactly p elements, then S is a basis for V if either S is linearly independent or S spans V.
What does the Unique Representation Theorem establish about a basis β={b1,…,bn} for a vector space V?
For each x∈V, there exists a unique set of scalars c1,…,cn such that x=c1b1+⋯+cnbn.
Under what condition are two finite-dimensional vector spaces V and W isomorphic (V≅W)?
Two finite-dimensional vector spaces V and W are isomorphic if and only if dimV=dimW.
How is the change-of-coordinates matrix PC←B constructed from basis B={b1,…,bn} to basis C?
The columns of PC←B are the C-coordinate vectors of the vectors in B: PC←B=[[b1]C[b2]C…[bn]C].
In Rn, what row reduction algorithm computes the change-of-coordinates matrix PC←B from basis B to basis C?
Row reduce the double-augmented matrix [c1…cn∣b1…bn] to [In∣PC←B].
![<p>Row reduce the double-augmented matrix $$[c_1 \; \dots \; c_n \mid b_1 \; \dots \; b_n]$$ to $$[I_n \mid P_{C \leftarrow B}]$$.</p>](https://assets.knowt.com/pdf-flow-prod/59c765fb-6f19-4708-b096-2f1335164fa1-figures/0.png)
How can the change-of-coordinates matrix PC←B be calculated using change-of-coordinates matrices PB and PC to the standard basis?
PC←B=PC−1PB, which follows from x=PB[x]B and [x]C=PC−1x.
What is the definition of an eigenvector and an eigenvalue of an n×n matrix A?
An eigenvector of A is a nonzero vector x∈Rn such that Ax=λx for some scalar λ, and λ is an eigenvalue of A.
How is the eigenspace of an n×n matrix A corresponding to eigenvalue λ defined?
The eigenspace is Nul(A−λI), which is the solution set of (A−λI)x=0, containing the zero vector together with all eigenvectors corresponding to λ.
What is the relationship between the invertibility of a square matrix A and the eigenvalue 0?
0 is an eigenvalue of A if and only if A is not invertible (which occurs if and only if detA=0).
When are two square matrices A and B defined to be similar, and what invariant do they share?
A and B are similar if there exists an invertible matrix P such that P−1AP=B; similar matrices have identical characteristic polynomials, and hence the same eigenvalues with the same algebraic multiplicities.
According to the Diagonalization Theorem, when is an n×n matrix A diagonalizable?
An n×n matrix A is diagonalizable if and only if A has n linearly independent eigenvectors, meaning A=PDP−1 where the columns of P are n linearly independent eigenvectors and the diagonal entries of D are the corresponding eigenvalues.
If A=PDP−1 is a diagonalizable matrix, how is Ak calculated for any positive integer k?
Ak=PDkP−1, where Dk is obtained by raising each diagonal entry of D to the power k.
What is the formula for the matrix M of a linear transformation T:V→W relative to bases B={b1,…,bn} and C?
M=[[T(b1)]C[T(b2)]C…[T(bn)]C], satisfying [T(x)]C=M[x]B.
If A=PDP−1 with D diagonal and B is the basis formed from the columns of P, what is D in terms of linear transformations?
D is the B-matrix ([T]B) for the transformation x↦Ax.
If a real 2×2 matrix A has complex eigenvalue λ=a−bi (b=0) and complex eigenvector v, how is A factored into PCP−1?
A=PCP−1, where P=[RevImv] and C=[[a,−b],[b,a]], which represents a rotation and scaling.
Why do the eigenvalues and eigenvectors of a real matrix always occur in complex conjugate pairs?
Because the characteristic polynomial has real coefficients, so roots satisfy p(λˉ)=0 whenever p(λ)=0, and conjugating Av=λv gives Avˉ=λˉvˉ.
How is the orthogonal complement W⊥ of a subspace W of Rn defined, and what is W∩W⊥?
W⊥={z∈Rn:z⋅w=0 for all w∈W}, and W∩W⊥={0}.

What is the Pythagorean Theorem for vectors u and v in Rn?
u and v are orthogonal if and only if ∣∣u+v∣∣2=∣∣u∣∣2+∣∣v∣∣2.
What are the orthogonal complements of RowA and ColA for an m×n matrix A?
(RowA)⊥=NulA in Rn, and (ColA)⊥=Nul(AT) in Rm.
Given an orthogonal basis β={u1,…,up} for W, how is each coordinate cj of a vector y∈W computed?
cj=uj⋅ujy⋅uj=∣∣uj∣∣2y⋅uj for each j=1,…,p.
What geometric quantities are preserved by a linear transformation defined by an m×n matrix U with orthonormal columns?
Multiplication by U preserves lengths (∣∣Ux∣∣=∣∣x∣∣), dot products ((Ux)⋅(Uy)=x⋅y), and orthogonality ((Ux)⋅(Uy)=0⟺x⋅y=0).
What does the Orthogonal Decomposition Theorem state for a subspace W of Rn and any vector y∈Rn?
Each y∈Rn can be written uniquely as y=y^+z, where y^=projWy∈W and z=y−y^∈W⊥.
If the columns of an n×p matrix U form an orthonormal basis for a subspace W, what matrix represents the orthogonal projection onto W?
The standard matrix is UUT, meaning projWy=UUTy.
What does the Best Approximation Theorem state regarding the orthogonal projection projWy?
projWy is the closest point in W to y, such that ∣∣y−projWy∣∣<∣∣y−v∣∣ for any v∈W with v=projWy.
What is the general formula for each vector vk in the Gram–Schmidt process given a basis \Base = \{x_1, \dots, x_p\}?
v1=x1, and for k≥2, vk=xk−v1⋅v1xk⋅v1v1−⋯−vk−1⋅vk−1xk⋅vk−1vk−1.
In the QR decomposition A=QR for an m×n matrix A with linearly independent columns, what are the properties of Q and R, and how is R computed?
Q is an m×n matrix with orthonormal columns, R is an n×n upper triangular invertible matrix with positive diagonal entries, and R=QTA.
What is the definition of a least-squares solution to an inconsistent system Ax=b?
A least-squares solution is a vector x^∈Rn such that ∣∣b−Ax^∣∣≤∣∣b−Ax∣∣ for all x∈Rn, satisfying Ax^=projColAb.
What matrix equation defines the normal equations for finding a least-squares solution to Ax=b, and what is the formula when ATA is invertible?
The normal equations are ATAx=ATb, and when the columns of A are linearly independent, the unique least-squares solution is x^=(ATA)−1ATb.
How can the QR factorization A=QR be used to find the least-squares solution to Ax=b?
The least-squares solution is given by x^=R−1QTb, which can be computed by solving the upper triangular system Rx^=QTb.
Why can an arbitrary matrix A NOT be row reduced to echelon form to find its eigenvalues?
Row reduction operations do not preserve eigenvalues; the resulting upper triangular echelon matrix is generally not similar to A and has different eigenvalues.
How does the coordinate mapping x↦[x]B preserve algebraic structure between an n-dimensional vector space V and Rn?
The coordinate mapping is a one-to-one and onto linear transformation (an isomorphism) that maps basis vectors \Base = \{b_1, \dots, b_n\} to the standard basis vectors \Base_E = \{e_1, \dots, e_n\}.