A quantitative Chollet inequality for rank-four matrices of order seven
For every complex Hermitian positive semidefinite matrix A of order seven and rank at most four, we prove per(A ∘ bar(A))≤ (192)/(245)(per A)^2. The inequality is strict when all diagonal entries are positive. The main input is the bound per(A ∘ bar(A))≤(3/5)(per A)^2 for every singular positive semidefinite matrix of order five. An exact rational principal-minor sum-of-squares certificate proves this singular-boundary inequality. A rank-preserving border comparison then gives the same constant in order six and the stated constant in order seven. The certificate and a standalone exact-integer verifier accompany the paper. Cauchy–Schwarz gives the corresponding two-factor inequalities when both factors have rank at most four. Edition 3 of this preprint in the Luminary Research Archive: https://research.luminaryoddities.org/a-quantitative-chollet-inequality-for-rank-four-matrices-of-order-seven/v/3
Authors
- Scott Schubr (ORCID: https://orcid.org/0009-0009-7357-4439)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-19
- DOI
- https://doi.org/10.5281/zenodo.24382159
- Primary Topic
- Mathematical Inequalities and Applications
- Type
- preprint