Question #40005

If A and B are two matrices of same order and rank (A) = rank (B) = n, then rank(A+B)=n , for n>=1 (T/F)

Expert's answer

Answer on question #40005 – Math – Matrix

If A and B are two matrices of same order and rank (A) = rank (B) = n, then rank(A+B)=n, for n>=1 (T/F)

Solution

Suppose we get two matrices n×nn \times n with rank n


A=(a11a1nan1ann)andB=(b11b1nbn1bnn)A = \left( \begin{array}{ccc} a_{11} & \cdots & a_{1n} \\ \vdots & \ddots & \vdots \\ a_{n1} & \cdots & a_{nn} \end{array} \right) \quad \text{and} \quad B = \left( \begin{array}{ccc} b_{11} & \cdots & b_{1n} \\ \vdots & \ddots & \vdots \\ b_{n1} & \cdots & b_{nn} \end{array} \right)


This means that rows in these matrices are independent. But if exist such λ\lambda that


aik=λbjk,bik=λajk,for some i and j belong to [1;n] and all k=1;na_{ik} = \lambda b_{jk}, \qquad b_{ik} = \lambda a_{jk}, \qquad \text{for some } i \text{ and } j \text{ belong to } [1; n] \text{ and all } k = \overline{1; n}


Then for the sum of this matrices we get


aik+bik=λ(ajk+bjk),k[1;n].a_{ik} + b_{ik} = \lambda (a_{jk} + b_{jk}), \qquad \forall k \in [1; n].


That it means that A+B has at least dependent rows and its rank less than n.

For example, let


A=(1234),B=(3412)A = \left( \begin{array}{cc} 1 & 2 \\ 3 & 4 \end{array} \right), \qquad B = \left( \begin{array}{cc} 3 & 4 \\ 1 & 2 \end{array} \right)


Both matrices have rank 2, but tier sum


A+B=(1+32+43+14+2)=(4646)A + B = \left( \begin{array}{cc} 1 + 3 & 2 + 4 \\ 3 + 1 & 4 + 2 \end{array} \right) = \left( \begin{array}{cc} 4 & 6 \\ 4 & 6 \end{array} \right)


Has rank 1.

**Answer**: False.


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS