Let $A$ and $D$ be square matrices, and let $B$ and $C$ be matrices of valid shapes to allow the formation of $$ M = \begin{bmatrix} A & B \\ C & D \end{bmatrix}. $$ If $\det{A}\neq0$, we may use the Schur complement to express $\det{M}$ in terms of its constituent blocks as $$ \det{M} = \det{A}\cdot\det(D-CA^{-1}B), $$ and if $\det{D}\neq0$ we have in a similar fashion that $$ \det{M} = \det(A-BD^{-1}C)\cdot\det{D}. $$
My question: Does there exist a similar formula expressing $\det{M}$ in terms of its constituent blocks, that is valid in case $\det{A}=\det{D}=0$?
Without loss of generality, let $A$ be $m$-by-$m$ and $D$ be $n$-by-$n$, with $m\ge n$. Consider $$ f(t)=\det\left( \begin{array}{cc} A+tI_m&B\\ C&D \end{array} \right). $$ Obviously,
Now, since $g(t)\ne 0$ on some $\left(-\delta,\delta\right)\setminus\left\{0\right\}$, it follows that $A+tI_m$ is invertible on this domain. Therefore, $$ f(t)=\det\left(A+tI_m\right)\det\left(D-C\left(A+tI_m\right)^{-1}B\right). $$ Consequently, the continuity of $f(t)$ yields $$ f(0)=\lim_{t\to 0}\left(\det\left(A+tI_m\right)\det\left(D-C\left(A+tI_m\right)^{-1}B\right)\right). $$
Now, let us focus on two distinct cases. First, if $A=O_m$, i.e., $A$ is a zero matrix of order $m$. In this case, the above formula gives \begin{align} f(0)&=\lim_{t\to 0}\left(\det\left(tI_m\right)\det\left(D-C\left(tI_m\right)^{-1}B\right)\right)\\ &=\lim_{t\to 0}\left(t^m\det\left(D-\frac{1}{t}CB\right)\right)\\ &=\lim_{t\to 0}\left(t^m\det\left(\frac{1}{t}\left(tD-CB\right)\right)\right)\\ &=\lim_{t\to 0}\left(t^{m-n}\det\left(tD-CB\right)\right). \end{align} Recall that $m\ge n$. We therefore obtain
Second, consider $A\ne O_m$. This case is more complicated, and there is no elegant form for $f(0)$ with only $A$, $B$, $C$, and $D$ involved. However, since $A\ne O_m$, we may perform some elementary operations of the second type, i.e., row- and column-switching transformations, such that after the operations, we obtain $$ f(0)=\det\left( \begin{array}{cc} A'&B'\\ C'&D' \end{array} \right), $$ where, e.g., $A'$ results from $A$ by switching $A$'s rows and columns, such that $A''$, the $k$-by-$k$ square matrix made up of the first $k$ rows and columns of $A'$, is invertible. The existence of such an $A''$ is guaranteed by the fact that $A\ne O_m$. In this way, $$ f(0)=\det\left( \begin{array}{cc} A''&B''\\ C''&D'' \end{array} \right). $$ Thanks to the invertibility of $A''$, $$ f(0)=\det\left(A''\right)\det\left(D''-C''\left(A''\right)^{-1}B''\right). $$ This result is much less elegant. $A''$ is only part of $A$. $B''$ contains part of both $A$ and $B$, and so does $C''$. $D''$ contains the whole $D$, and part of $A$, $B$, and $C$. Besides, there are switches of rows and columns as well.