Let $A_1, A_2\in M_n(\mathbb{R})$ two symmetric matrices s.t. $det(A_1^2+A_2^2)=0$.
Show that $det(A_1\cdot B_1 +A_2\cdot B_2)=0$ for every $B_1, B_2\in M_n(\mathbb{R})$.
My idea:
I consider the matrix C :\begin{bmatrix} A_1 & A_2 \\ B_1^t & B_2^t \end{bmatrix}
$det(C\cdot C^t)\geq 0\Rightarrow det(\begin{bmatrix} A_1^2 +A_2^2 & D \\ D^t & E\\ \end{bmatrix})\geq 0 $ where $D=A_1B_1+A_2B_2$.
I tried to expand the determinant with Laplace Rule. I am not sure if $ det(\begin{bmatrix} A_1^2 +A_2^2 & D \\ D^t & E\\ \end{bmatrix}) = -det(D\cdot D^t)$.
In this way I would get $det(D)=0$.
If $\det (A_1^2+A_2^2) = 0$, then $x^TA_1^2+x^TA_2^2=0$ for some $x\neq 0$ and so $\|x^TA_1\|^2 + \|x^TA_2\|^2 = 0$.
Since $x^TA_1=x^TA_2 = 0$, we see that $x^T (A_1 B_1+A_2 B_2) =0$ and so $\det (A_1 B_1+A_2 B_2) =0$