Over a commutative unital ring, does $\det A = 0$ imply that $A\mathbf{x} = 0$ has a non-zero solution?

Let $A$ be square of size $n \times n$, and $\det A=0$. Then $A\,\textrm{adj}(A)=0$ where $\textrm{adj}(A)$ is the adjugate of $A$. As long as $\textrm{adj}(A)\neq 0$ then taking some column of $\textrm{adj}(A)$ gives you $x$ with $Ax=0$.

But what if adj$(A)=0$? In this case all minors of $A$ vanish. Find a largest square submatrix of $A$ with nonzero determinant. We can assume that it's size $r$ by $r$ and fills the top left corner of $A$. Let $B$ be the top-left $r+1$ by $r+1$ submatrix of $A$. Then $\det B=0$ but adj$(B)\ne0$. Let $y$ be the $(r+1)$-th column of adj$(B)$ and $z$ be the column vector of height $n$ got by appending zeroes below $y$. Then $z\ne0$ (due to the non-vanishing of the top left $r$ by $r$ determinant) and I claim that $Az=0$.

The top $r+1$ entries of $Az$ are certainly zero. This is the identity $B\,$adj$(B)=0$. If we look at another entry, say the $s$-th then it is zero, essentially by replacing the bottom row of $B$ by the first $r+1$-th entries of the $s$-th row of $A$, and noting that the new matrix has zero determinant, as it is obtained from a submatrix of $A$ of size $r+1$ by $r+1$ by elementary row operations. As all submatrices of $A$ of this size have vanishing determinant, this completes the proof that $Az=0$.

In a commutative ring (with 1), it turns out that, yes, $Ax=0$ has a non-trivial solution if and only if $\det(A)$ is either zero or a zero divisor. This follows from a theorem of McCoy.

Here is a link to a related question of my own:

MSE -- Do these matrix rings have non-zero elements that are neither units nor zero divisors?

MO -- https://mathoverflow.net/questions/77816/do-these-matrix-rings-have-non-zero-elements-that-are-neither-units-nor-zero-divi

A link to a paper with an account of McCoy's rank theorem: http://math.berkeley.edu/~lam/amspfaff.pdf