Well considering two $n \times n$ matrices does the following hold true: $$\det(A+B) = \det(A) + \det(B)$$ Can there be said anything about $\det(A+B)$?
If $A/B$ are symmetric (or maybe even of the form $\lambda I$) - can then things be said?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this communityWell considering two $n \times n$ matrices does the following hold true: $$\det(A+B) = \det(A) + \det(B)$$ Can there be said anything about $\det(A+B)$?
If $A/B$ are symmetric (or maybe even of the form $\lambda I$) - can then things be said?
This does not hold true in general. For even $n$, let $A=-B$ and $\det(A) > 0$, so $\det(A+B)=0 < \det(A)+\det(B)$. Now, consider $A=B$. We have $\det(A+B)=\det(2A)=2^n \det(A) > 2 \det(A)=\det(A)+\det(B)$ for $n>1$ and $\det(A)>0$. Thus, either inequality can hold.
In general, you can't expect a formula for $\det(A+B)$. But sometimes, when you're lucky, you can use the Matrix Determinant Lemma, which says the following:
$$\det(A+uv^T)=(1+v^TA^{-1}u)\det(A),$$
where $A$ is an invertible matrix and $v^TA^{-1}u$ is interpreted as a scalar. Therefore, if $A$ is invertible, and you can write $B$ as $uv^T$ for two vectors $u,v$, then now you have a formula. One could also note that $\det(uv^T)$ is always 0.
If you're looking for a matrix operation which is well-behaved with respect to matrix addition, look for the trace.
No, there is no such law. Playing with simple matrices gives counterexamples, e.g.
$$\det\left(\begin{bmatrix} 1 & 0\\0&0\end{bmatrix}+\begin{bmatrix} 0 & 0\\0&1\end{bmatrix}\right)=\det\begin{bmatrix} 1 & 0\\0&1\end{bmatrix}=1,$$ but $$\det\begin{bmatrix} 1 & 0\\0&0\end{bmatrix}+ \det\begin{bmatrix} 0 & 0\\0&1\end{bmatrix}=0+0=0.$$
Take $A=I_n=B$. Then $\det(A+B)=\det(2I_n)=2^n\det(I_n)=2^n$ and $\det(A)+\det(B)=1+1 = 2$ so for $n>1$, your equality does not hold at least for these matrix. And for $n=1$, since the determinant is the only element of the matrix, we do have your equality. So $\boxed{\left[\forall A,B \in M_n\left(\Bbb R\right), \det(A+B)=\det(A)+\det(B)\right]\iff n = 1}$
Although the determinant function is not linear in general, I have a way to construct matrices $A$ and $B$ such that $\det(A + B) = \det(A) + \det(B)$, where neither $A$ nor $B$ contains a zero entry and all three determinants are nonzero:
Suppose $A = [a_{ij}]$ and $B = [b_{ij}]$ are 2 x 2 real matrices. Then $\det(A + B) = (a_{11} + b_{11})(a_{22} + b_{22}) - (a_{12} + b_{12})(a_{21} + b_{21})$ and $\det(A) + \det(B) = (a_{11} a_{22} - a_{12} a_{21}) + (b_{11} b_{22} - b_{12} b_{21})$.
These two determinant expressions are equal if and only if
$a_{11} b_{22} + b_{11} a_{22} - a_{12} b_{21} - b_{12} a_{21} = $ $\det \left[ \begin{array}{cc} a_{11} & a_{12}\\ b_{21} & b_{22} \end{array} \right]$ + $\det \left[ \begin{array}{cc} b_{11} & b_{12}\\ a_{21} & a_{22} \end{array} \right]$ = 0.
Therefore, if we choose any nonsingular 2 x 2 matrix $ A = [a_{ij}]$ with nonzero entries and then create $B = [b_{ij}]$ such that $b_{11} = - a_{21}, b_{12} = - a_{22}, b_{21} = a_{11},$ and $b_{22} = a_{12}$, we have solved our problem. For example, if we take $$A = \begin{bmatrix} 1 & 2 \\ 3 & 4 \end{bmatrix} \quad \text{and}\quad B = \begin{bmatrix} -3 & -4 \\ 1 & 2\end{bmatrix} ,$$
then $\det(A) = -2, \det(B) = -2, $ and $\det(A + B) = -4$, as required.