Rank of Matrix and Digonalization (original) (raw)

The rank of the given matrix is:

[Tex]\begin{bmatrix} 1 & 1 \\ 0 & 0 \end{bmatrix}[/Tex]

The rank of the matrix given below is:

[Tex]\begin{bmatrix}1 & 4 & 8 & 7 \\0 & 0 & 3 & 0 \\4 & 2 & 3 & 1 \\3 & 12 & 24 & 21 \\\end{bmatrix}[/Tex]

Let A and B be two n×n matrices over real numbers. Let rank(M) and det(M) denote the rank and determinant of a matrix M, respectively. Consider the following statements.

I. rank(AB) = rank(A) × rank (B)
II. det(AB) = det(A) × det(B)
III. rank(A+B) ≤ rank(A) + rank(B)
IV. det(A+B) ≤ det(A) + det(B)

Which of the above statements are TRUE?

Consider a matrix **P(2x2) whose only eigenvectors are the multiples of [Tex]\begin{bmatrix}1 \\ 4 \end{bmatrix}[/Tex]
Consider the following statements.
(I) **P does not have an inverse
(II) **P has a repeated eigenvalue
(III) **P cannot be diagonalized
Which one of the following options is correct?

• Only I and III are necessarily true
• Only II is necessarily true
• Only I and II are necessarily true
• Only II and III are necessarily true

In a compact one-dimensional array representation for a lower triangular matrix (all elements above the diagonal are zero) of size n x n, non-zero elements of each row are stored one after another, starting from the first row, the index of (i, j)th element in this new representation is

There are 5 questions to complete.

Take a part in the ongoing discussion