True/ False Flashcards
For a matrix A the (i, j)-entry of A in the entry in column i and row j. (1a)
F
Consider the matrix
(0 0 2)
C= (0 7 0)
(3 0 0)
Then C is diagonal with diagonal entries 2, 7 and 3. (1b)
F
Consider the matrix
(4 0 0)
D= (0 7 0)
(0 0 9)
Then D is diagonal with diagonal entries 4, 7 and 9. (1c)
T
For all matrices A and B of the same size, A + B = B + A. (1d)
T
For all square matrices A and B of the same size, AB = BA (1e)
F
The transpose of an m × n matrix is an n × m matrix. (1f)
T
The matrices C and D are both symmetric.
(0 0 2)
C= (0 7 0)
(3 0 0)
(4 0 0)
D= (0 7 0)
(0 0 9) (1g)
F
If the matrix A is symmetric then the matrix −A is symmetric.(1h)
T
If A is an m × n matrix, then the range of the transformation
x → Ax is R^m (2a)
F
The range of the transformation x → Ax is the set of all linear combinations of the columns of A (2b)
T
If A, B and C are n × n matrices and AB = AC then B = C. (2c)
F
If A and B are n × n matrices and AB = I then B = A^−1. (2d)
T
If A is an invertible matrix then the inverse of A can be written as 1/A. (2e)
F
If A is invertible then the system Ax = b has a unique solution. (2f)
T
Let
A = (a b)
(c d).
Then A is invertible if and only if ad-bc > 0. (2g)
F
If A and B are invertible then AB is invertible and (AB)^−1 =A^−1B^−1. (2h)
F
If A and B are invertible matrices of the same size, then AB is invertible and
(AB)^−1 = B^−1A^−1.
If A is invertible then A^T
is invertible, and the inverse of A^T is the
transpose of A^−1
T
Let A be an invertible matrix. Then the matrix obtained by adding
twice the first row to the second may not be invertible. (2j)
F
Let A be a non-invertible n × n matrix. Then the linear system
Ax = 0 has infinitely many solutions. (2k)
T
A square matrix A is invertible if and only if its reduced row echelon form is the identity. (2l)
T
Performing an elementary row operation is equivalent to left multiplication by an elementary matrix. (3a)
T
Every invertible matrix A can be expressed uniquely as a product
of elementary matrices. (3b)
F
Let A be a non-invertible n × n matrix. Then the matrix obtained
by swapping rows one and two of A is also non-invertible. (3c)
T
For matrices A, B and C, if A is row equivalent to B and B is row equivalent to C then A is row equivalent to C. (3d)
T
two matrices are row equivalent if one can be changed to the other by a sequence of elementary row operations
Every elementary matrix is invertible. (3e)
T
By Lemma 2.5.2: Each elementary matrix is invertible, and its inverse is an elementary matrix of the same type.
The product of two n × n elementary matrices must also be an elementary matrix. (3f)
F
If E1 and E2 are both n × n elementary matrices then E1E2 = E2E1. (3g)
T
A square matrix A is invertible if and only if its reduced row
echelon form is the identity. (3h)
T
Let
A = (1 1)
(0 1).
Then T_A is the function that assigns to each vector x=(x1,x2) ∈ R2
the vector y = (x1 + x2, x2) ∈ R2 (3i)
T
If T : Rn → Rm is linear then T(2u) = T(u) + T(u). (3j)
T
For all linear transformations T : Rn → Rn and S : Rn → Rn, we have S ◦ T = T ◦ S. (3k)
F
Let A and B be two n × n matrices over R. If AB = BA then TA ◦ TB = TB ◦ TA. (3l)
T
Let T : Rn → Rn be an invertible linear transformation. Then T^−1: Rn → Rn is linear. (3m)
T
A function T : Rn → Rm is a linear transformation if and only if it is a matrix transformation. (3n)
T
