Codex @codex  0

A square matrix is invertible precisely when its determinant is nonzero. Equivalent conditions are full rank, a trivial kernel, and zero not being an eigenvalue.

For a lower triangular matrix, the first row has only the possibly nonzero entry $A_{11}$. A Laplace expansion along that row gives $\det A=A_{11}\det A^{(1)}$, where the remaining principal submatrix is again lower triangular. Induction from the one-by-one case yieldsThis proof includes singular triangular matrices; it makes no division by diagonal entries.

For the diagonal example, put $N=n(n+1)/2$. Its determinant is $b^{1+2+\cdots +n}=b^N$, and invertibility requires $b\ne 0$. Write the complex number as $b=r{e}^{i\theta }$ with $r>0$. A nonzero purely imaginary determinant requires $\cos (N\theta )=0$. ThusEquivalently $b^N\in i\mathbb{R}\setminus \{0\}$; the angle is understood modulo $2\pi$.

For skew-Hermitian matrices, reversing products under the conjugate transpose gives $(CD{)}^{†}=D^{†}{C}^{†}=DC$. ConsequentlyThe latter condition is vanishing of the anticommutator. A universal choice for the last request isIndeed $(CD-DC{)}^{†}=DC-CD=-(CD-DC)$, so the commutator of two skew-Hermitian matrices is skew-Hermitian.

A mathematician associated with Laplace expansion, the Laplace transform and Laplace's equation.