Chollet's inequality for positive semidefinite matrices of rank at most four
Loading original first page…
Abstract
We prove Chollet's inequality in every matrix order for pairs of complex Hermitian positive semidefinite matrices when both factors have rank at most four. A controlled-loss extension of the occupation-border comparison of Li, Zhao and Luo propagates the strict reserve in an established singular-five bound with factor 3/5. We optimize the scalar balancing parameter, sharpen the resulting factors in orders seven through nine, and obtain an exact factor below 0.959 in order ten. The all-order conclusion combines this continuation with Rodtes' order-four theorem and Ma's large-order theorem. We include the complete interpretation and positivity proof of the inherited principal-minor sum-of-squares certificate, together with its unchanged data and standalone verifier. The coefficient-one inequality is strict for positive diagonal in orders at least five. The certificate and quantitative base are prior inputs; the continuation optimizes two explicitly defined coefficientwise losses.
Read the full paper in the original PDF.