Abstract
We present joint work with Rainer Sinn on the algebraic geometry that underlies semidefinite programming. Our focus is on spectrahedral shadows, that is, convex sets representable by linear matrix inequalities. We characterize the polynomials that vanish on the boundary of a spectrahedral shadow when the defining matrices are generic. The colorful pictures shown in this lecture can be enjoyed by everyone.