Globally optimizing small codes in real projective spaces

For $d\in\{5,6\}$, we classify arrangements of $d + 2$ points in $\mathbf{RP}^{d-1}$ for which the minimum distance is as large as possible. To do so, we leverage ideas from matrix and convex analysis to determine the best possible codes that contain equiangular lines, and we introduce a notion of approximate Positivstellensatz certificates that promotes numerical approximations of Stengle's Positivstellensatz certificates to honest certificates.
Comment: code included in ancillary files