A. No | ||
B. In special cases | ||
C. Yes | ||
D. There is not enough information provided to determine this. |
A. | ||
B. | ||
C. | ||
D. |
A. matrices that commute. | ||
B. square matrices. | ||
C. Hermitian matrices. | ||
D. invertible matrices. |
A. | ||
B. | ||
C. | ||
D. |
A. For any either or . | ||
B. If and either or , then . | ||
C. If , , then . | ||
D. All of these. |
A. Boundedness | ||
B. Finiteness | ||
C. Archimedean | ||
D. All of these |
A. | ||
B. | ||
C. | ||
D. All of these |
A. one can be obtained from the other by a finite number of elementary row operations. | ||
B. one is the negative of the other. | ||
C. the product of the two matrices is zero. | ||
D. none of these. |
A. | ||
B. | ||
C. | ||
D. |
A. for every non-zero there is a such that . | ||
B. . | ||
C. is a real vector space. | ||
D. for all . |
A. | ||
B. Every finite field | ||
C. The field of rational functions with real coefficients | ||
D. None of these |
A. | ||
B. | ||
C. | ||
D. |
A. | ||
B. | ||
C. | ||
D. |
A. Eight | ||
B. At least one | ||
C. Exactly two | ||
D. Infinitely many |
A. at least one; exactly five | ||
B. zero; exactly five | ||
C. exactly five; exactly five | ||
D. zero; exactly five |
A. 24 | ||
B. 10 | ||
C. 12 | ||
D. 42 |
A. , | ||
B. , | ||
C. , | ||
D. , |
A. Negative | ||
B. Real | ||
C. Complex | ||
D. All of these |
A. -1, degenerate | ||
B. 1, -1 | ||
C. 1 degenerate | ||
D. 0, -1 |
A. , is normal. | ||
B. , is not normal. | ||
C. , is normal. | ||
D. , is not normal. |
A. zero. | ||
B. non-negative. | ||
C. purely real. | ||
D. purely imaginary. |
A. | ||
B. | ||
C. | ||
D. None of these |
A. | ||
B. | ||
C. | ||
D. |
A. smallest number such that some submatrix of has a non zero determinant. | ||
B. largest number such that some submatrix of has a non zero determinant. | ||
C. largest number such that some submatrix of has a nonzero determinant. | ||
D. none of these. |
A. | ||
B. | ||
C. Every nonzero vector is an eigenvector of | ||
D. All of these. |
A. Every square matrix is unitarily similar to an upper triangular matrix. | ||
B. Every matrix is unitarily similar to a square matrix. | ||
C. Every matrix is unitarily similar to a triangular matrix. | ||
D. Every upper triangular matrix is similar to a square matrix. |
A. Composition of permutations is associative. | ||
B. Composition of permutations is commutative. | ||
C. There is an identity element for composition. | ||
D. There is an inverse element for composition. |
A. sum of the eigenvalues of ; negative of the sum of the eigenvalues of | ||
B. product of the eigenvalues of ; sum of the eigenvalues of | ||
C. sum of the eigenvalues of ; product of the eigenvalues of | ||
D. ; |
A. Whether or not critical points of a function exist | ||
B. Where the derivative is zero for certain types of functions | ||
C. Whether a critical point of a function is a local minimum or a maximum | ||
D. All of these |
A. for all | ||
B. for all | ||
C. for all | ||
D. for all |
A. is not injective. | ||
B. is not injective. | ||
C. is invertible. | ||
D. is surjective. |
A. is an eigenvalue for . | ||
B. is an eigenvalue for . | ||
C. is an eigenvalue for . | ||
D. all of these. |
A. and is the conjugate of | ||
B. and is the conjugate of | ||
C. and is the negative conjugate of | ||
D. None of these. |
A. and | ||
B. and | ||
C. and | ||
D. and |
A. | ||
B. | ||
C. | ||
D. |
A. is a symmetric matrix. | ||
B. is a orthogonal matrix. | ||
C. is a normal matrix. | ||
D. is a unitary matrix. |
A. It is a local maximum. | ||
B. It is a local minimum. | ||
C. It is a saddle point. | ||
D. It is zero. |
A. the minimal polynomial for has a root in . | ||
B. the minimal polynomial for has no roots in . | ||
C. is an isomorphism. | ||
D. the only -invariant subspaces of are trivial. |
A. | ||
B. | ||
C. | ||
D. |
A. Trivial subspaces | ||
B. Lines through the origin | ||
C. Both A and B | ||
D. None of these |
A. | ||
B. | ||
C. | ||
D. |
A. Symmetric matrices | ||
B. Diagonal matrices | ||
C. Nonsingular matrices | ||
D. Upper triangular matrices |
A. collection | ||
B. span | ||
C. kernel | ||
D. transformation |
A. | ||
B. | ||
C. | ||
D. |
A. and | ||
B. and | ||
C. and | ||
D. |
A. | ||
B. | ||
C. | ||
D. |
A. | ||
B. | ||
C. | ||
D. |
A. | ||
B. | ||
C. | ||
D. All of these |
A. | ||
B. | ||
C. | ||
D. None of these |
A. singular | ||
B. invertible | ||
C. continuous | ||
D. one-to-one |
A. zero map. | ||
B. identity map. | ||
C. vector space. | ||
D. surjective linear map. |
A. | ||
B. | ||
C. | ||
D. |
A. | ||
B. | ||
C. | ||
D. |
A. | ||
B. | ||
C. | ||
D. |
A. | ||
B. | ||
C. | ||
D. None of these |
A. any positive numbers. | ||
B. singular values of . | ||
C. complex values. | ||
D. obtained from the dot product of and . |
A. for all and | ||
B. for all and | ||
C. for all and | ||
D. for all and |
A. Every eigenvalue of a Markov matrix satisfies . | ||
B. Every eigenvalue of a Markov matrix satisfies . | ||
C. Every eigenvalue of a Markov matrix satisfies . | ||
D. All of these. |
A. has negative entries and . | ||
B. has non-negative entries and . | ||
C. has non-negative entries and . | ||
D. |
A. it is not closed under addition. | ||
B. it is infinite. | ||
C. it is not closed under multiplication. | ||
D. it does not contain a zero vector. |
A. does not have full rank. | ||
B. | ||
C. is invertible. | ||
D. |
A. normal | ||
B. unitary | ||
C. symmetric | ||
D. square |
A. , | ||
B. , | ||
C. , | ||
D. None of these |
A. Normal operators are diagonal with respect to an orthonormal basis. | ||
B. Normal operators are diagonal with respect to a singular set of vectors. | ||
C. Nilpotent operators are diagonal with respect to an orthonormal basis. | ||
D. Semi-symmetric operators are diagonal with respect to any basis. |
A. for all . | ||
B. for all . | ||
C. for all . | ||
D. None of these |
A. Real | ||
B. Complex | ||
C. Degenerate | ||
D. All of these |
A. is normal if and only if there exists an orthonormal basis for consisting of eigenvectors for . | ||
B. is self-adjoint if and only if the eigenvectors of are degenerate. | ||
C. is normal if and only if is diagonalizable. | ||
D. None of these. |
A. Orthogonal | ||
B. Isometries | ||
C. Normal | ||
D. All of these |
A. Symmetric matrices | ||
B. Hermitian matrices | ||
C. Orthogonal matrices | ||
D. All of these |
A. Find a unitary matrix and a diagonal matrix such that . | ||
B. Find a unitary matrix and a diagonal matrix such that . | ||
C. Find a unitary matrix and a unitary matrix such that . | ||
D. Find a diagonal matrix and a unitary matrix such that . |
A. | ||
B. | ||
C. | ||
D. All of these |
A. self-adjoint. | ||
B. nilpotent. | ||
C. orthogonal. | ||
D. diagonal. |
A. | ||
B. | ||
C. | ||
D. All of these |
A. | ||
B. for every | ||
C. for every | ||
D. All of these |
A. Similar | ||
B. Equal | ||
C. Orthogonal | ||
D. None of these |
A. for all , and if and only if | ||
B. for all | ||
C. for all $$v,w \in V$ | ||
D. All of these |
A. | ||
B. | ||
C. | ||
D. |
A. ; | ||
B. ; | ||
C. ; | ||
D. ; |
A. Let where is an inner product space. Then there exists a unique such that for all , . | ||
B. Let where is an inner product space. Then there exists a unique such that for all , . | ||
C. Let where is an inner product space. Then there exist infinitely many such that for all , . | ||
D. None of these. |
A. a complete inner product space. | ||
B. an inner product space. | ||
C. a normed space. | ||
D. none of these. |
A. The angle between two vectors | ||
B. The length of a vector | ||
C. The direction of a vector | ||
D. All of these |
A. | ||
B. | ||
C. | ||
D. |
A. . | ||
B. . | ||
C. . | ||
D. . |
A. | ||
B. is invertible. | ||
C. | ||
D. |
A. is not orthogonal to either or . | ||
B. and are orthogonal. | ||
C. and are orthogonal. | ||
D. and are orthogonal. |
A. | ||
B. | ||
C. | ||
D. |
A. | ||
B. | ||
C. | ||
D. |
A. . | ||
B. . | ||
C. . | ||
D. . |
A. . | ||
B. . | ||
C. . | ||
D. . |