Consider the following assertions: I. Rank (ST) = Rank S = Rank T II. Rank (ST) = Rank S, if T is non-singular III. Rank (ST) = Rank T, if T is non-singular Where S, T : V → V are linear transformations of a finite dimensional vector space V. Which of these is/are correct?

Consider the following assertions: I. Rank (ST) = Rank S = Rank T II. Rank (ST) = Rank S, if T is non-singular III. Rank (ST) = Rank T, if T is non-singular Where S, T : V → V are linear transformations of a finite dimensional vector space V. Which of these is/are correct? Correct Answer Only II

Explanation:

From the properties of a rank of a matrix,

Let A be an m × n matrix, if P and Q are invertible m × m and n × n matrices respectively. Then

Rank (AQ) = Rank (A) = Rank (PA)

Now check the given statements,

I. Rank (ST) = Rank S = Rank T; there is no information of inverse of matrices so it is not necessarily true

II. Rank (ST) = Rank S, if T is non-singular; given that T is non-singular (i.e. invertible) hence it is true

III. Rank (ST) = Rank T, if T is non-singular; it is true when S is invertible but there is no information about the inverse of the matrix.

Hence only second statement is true.

Related Questions

Although power-law transformations are considered more versatile than log transformations for compressing of gray-levels in an image, then, how is log transformations advantageous over power-law transformations?
Consider a system described by ẋ = Ax + Bu y = Cx + Du The system is completely output controllable if and only if Where: x = State vector (n-vector) u = Control vector (r-vector) y = Output vector (m-vector) A = n × n matrix B = n × r matrix C = m × n matrix D = m × r matrix