Strong Self-Permanent Inequalities for Complex Four-Row Bipartite Supports
Loading original first page…
Abstract
For every finite column count, we prove the strong self-permanent inequality for complex positive semidefinite matrices whose off-diagonal support lies in a bipartite graph with one part of size four. The conclusion bounds the permanent of the entrywise squared modulus by the permanent of the original matrix times the product of its diagonal entries. The proof removes column-dependent moment restrictions: a matching-polytope bound controls row overlaps, paired endpoint deletion gives a column-independent scalar estimate, and a large-entry transfer completes the argument. Arbitrary complex phases, missing edges and singular matrices are included. A separate extension establishes the same inequality on five-by-five bipartite supports by combining the analytic reductions with an exact tensor Bernstein certificate. We also prove a dimension-free energy criterion for the ordinary self-Chollet inequality, covering all positive semidefinite bipartite supports with one part of size at most twelve, together with further five-row regimes. The earlier three-row core and the large-entry transfer are proved within the manuscript. The finite certificate is reconstructed by a portable exact-arithmetic supplement.
Read the full paper in the original PDF.