Semidefinite programs (SDPs) — some of the most useful and pervasive optimization problems of the last few decades — often behave pathologically: the optimal values of the primal and dual problems may differ and may not be attained. Such SDPs are theoretically interesting and often impossible to solve. Yet, the pathological SDPs in the literature look strikingly similar, and to explain why, our recent paper (“Bad semidefinite programs: they all look the same”, SIAM J. Opt, 2017) characterized pathological semidefinite systems by certain {\em excluded matrices}, which are easy to spot in all published examples. Here we give short, and elementary proofs of these results using mostly techniques from elementary linear algebra. Our main tool is a standard (canonical) form of semidefinite systems, from which their pathological behavior is easy to verify. The standard form is constructed in a surprisingly simple manner, using mostly elementary row operations inherited from Gaussian elimination. As a byproduct, we prove that any linear map acting on symmetric matrices can be brought into a standard form; this standard form allows us to easily check whether the image of the semidefinite cone under the given linear map is closed.