- #1
stryker105
- 4
- 1
Below is some statements for inverse, permutation and transposes. Next to them I will write what I believe to be correct. I know that at least one of my responses is incorrect, can anybody help me? I greatly appreciate it.
Assume that all matrices are n\times n, that P and Q are permutation matrices and that R is a permutation matrix that interchanges two (otherwise unspecified) rows
If A is symmetric and A=LU then L = U^T. F
PQ=QP F
R^-1 = R T
R^15 = R F
The inverse of an invertible symmetric matrix is symmetric. T
A (square) matrix being invertible means the same as it being non-singular. T
A nxn matrix is invertible if and only if elimination, possibly including row interchanges, produces n non-zero pivots. T
The inverse of an invertible matrix is invertible. F
(AB)^-1= (A^-1)(B^-1). F
(AB)^-1= (B^-1)(A^-1). T
if A and B are invertible, then so is AB. T
Assume that all matrices are n\times n, that P and Q are permutation matrices and that R is a permutation matrix that interchanges two (otherwise unspecified) rows
If A is symmetric and A=LU then L = U^T. F
PQ=QP F
R^-1 = R T
R^15 = R F
The inverse of an invertible symmetric matrix is symmetric. T
A (square) matrix being invertible means the same as it being non-singular. T
A nxn matrix is invertible if and only if elimination, possibly including row interchanges, produces n non-zero pivots. T
The inverse of an invertible matrix is invertible. F
(AB)^-1= (A^-1)(B^-1). F
(AB)^-1= (B^-1)(A^-1). T
if A and B are invertible, then so is AB. T