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 × n n \times n n × n with rank n
A = ( a 11 ⋯ a 1 n ⋮ ⋱ ⋮ a n 1 ⋯ a n n ) and B = ( b 11 ⋯ b 1 n ⋮ ⋱ ⋮ b n 1 ⋯ b n n ) 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) A = ⎝ ⎛ a 11 ⋮ a n 1 ⋯ ⋱ ⋯ a 1 n ⋮ a nn ⎠ ⎞ and B = ⎝ ⎛ b 11 ⋮ b n 1 ⋯ ⋱ ⋯ b 1 n ⋮ b nn ⎠ ⎞
This means that rows in these matrices are independent. But if exist such λ \lambda λ that
a i k = λ b j k , b i k = λ a j k , for some i and j belong to [ 1 ; n ] and all k = 1 ; n ‾ a_{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} a ik = λ b jk , b ik = λ a jk , for some i and j belong to [ 1 ; n ] and all k = 1 ; n
Then for the sum of this matrices we get
a i k + b i k = λ ( a j k + b j k ) , ∀ k ∈ [ 1 ; n ] . a_{ik} + b_{ik} = \lambda (a_{jk} + b_{jk}), \qquad \forall k \in [1; n]. a ik + b ik = λ ( a jk + b jk ) , ∀ k ∈ [ 1 ; n ] .
That it means that A+B has at least dependent rows and its rank less than n.
For example, let
A = ( 1 2 3 4 ) , B = ( 3 4 1 2 ) 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) A = ( 1 3 2 4 ) , B = ( 3 1 4 2 )
Both matrices have rank 2, but tier sum
A + B = ( 1 + 3 2 + 4 3 + 1 4 + 2 ) = ( 4 6 4 6 ) 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) A + B = ( 1 + 3 3 + 1 2 + 4 4 + 2 ) = ( 4 4 6 6 )
Has rank 1.
**Answer**: False.