Submitted:
27 September 2026
Posted:
29 September 2026
You are already at the latest version
Abstract
Let \( A=(a_{ij}) \) be an \( n\times n \) positive semidefinite Hermitian matrix and let \( A(i| j) \) be the submatrix obtained from \( A \) by deleting row \( i \) and column \( j \) of \( A \), where \( 1\leq i, j\le n \). We prove that, for all \( i \) and \( j \), \( \begin{split} &a_{ii}\ per A(i| i)-a_{ij}\ perA(i|j)-a_{ji}\ per A(j| i) +a_{jj}\ per A(j| j)\leq 2\ per A. \end{split} \) This inequality was first posed by Pate [10] and later stated as Conjecture 11 in Wanless’s survey article [11] on permanents.
Keywords:
permanent
; positive semidefinite matrix
; symmetric tensor
; creation operator
MSC: Primary 15A15; Secondary 15B48
1. Introduction
Let be an complex matrix. The permanent of A is defined by replacing the alternating signs in the determinant expansion with positive signs. Explicitly, , where denotes the symmetric group on .
Permanent theory is an active area of research in matrix theory and combinatorics. Despite extensive study, many intriguing questions and long-standing conjectures remain open; see, e.g., [2,3,7,8,9,12].
We denote by the set of all complex matrices. For with , let be the submatrix obtained by deleting row i and column j of A, where . Our main result is the following statement.
Theorem 1.
Let be an positive semidefinite matrix. Then,
2. A Lemma
We begin with the following lemma.
Lemma.
Let and be self-adjoint operators on a finite-dimensional complex Hilbert space. Suppose that and satisfy, for some ,
(Here, denotes commutator.) Let . Then, for any ,
(Here, ⪰ denotes the Loewner partial order.)
Proof.
For an arbitrarily fixed unit vector , we write
The Cauchy–Schwarz inequality immediately yields two inequalities:
and
By (2), we obtain
Set . Then, as .
To show (3), we evaluate the quadratic form of the left-hand side of (3) minus at and express it as a quadratic function in :
Thus, to show (3), or equivalently, , it suffices to show that
We now show that (8) also holds for the case where .
Note that is , which is equivalent to
Define a linear function
Using (6), we have
Observe that and that has the root
One checks by computation that . Thus, . (One may also show directly that .)
3. Symmetric Tensors and Creation Operators.
In this section, we establish a norm inequality for tensors with creation operators that will be used to prove our main result (Theorem 1). The inequality is also of interest in its own right.
We begin with some basic concepts in tensor theory. Let be a finite-dimensional complex Hilbert space and let d be a nonnegative integer. The dth tensor power , see, e.g., ([6] p. 141), is equipped with the inner product
and the symmetrization operator
is the orthogonal projection onto ; see ([6] p. 153). We write for the displayed symmetrized tensor and use the inner product inherited from . We set and ; the empty symmetric product is 1. For and , define
For , define as the adjoint of , and set . Thus, raises the degree by one, whereas lowers it by one. We compose these operators on the algebraic direct sum
whose elements are finite sums of homogeneous symmetric tensors. Different degrees are orthogonal. Adjoints are taken between the corresponding homogeneous spaces.
To compute these operators, choose an orthonormal basis of . For a multi-index with nonnegative integer entries, write and . When , the symmetrization of has distinct, mutually orthogonal elementary tensors, each with coefficient . Consequently,
Different multi-indices give orthogonal tensors, and their span is . An orthonormal basis is therefore given by
Here . If is the multi-index with a single 1 in position ℓ, the definition of gives
Taking adjoints on successive degrees gives
For an arbitrary symmetric product of degree , they give
where the hat denotes omission. Both sides are multilinear in and conjugate-linear in w. It is therefore enough to check the formula when these vectors are basis vectors, in which case it follows from the preceding formulas.
Theorem 2.
Let be a finite-dimensional complex Hilbert space, let m be a nonnegative integer, let , and let . Then,
The norm on the left is taken in and the norm on the right in .
Proof.
Step 1. Reduction to an orthonormal pair. If , , or , both sides of (12) vanish. Since is linear, replacing by multiplies both vectors in (12) by . We may therefore assume . Multiplying y by a scalar of modulus one leaves both norms unchanged, so we may also assume
If , then , and the left side of (12) is zero. Suppose henceforth that , and set
The identities , , and
show that are orthonormal. Solving for gives
Write
Extend to an orthonormal basis of . The preceding basis formulas give
Operators acting on different coordinates commute. For example, and both send to when , and both vanish when . The other mixed commutators are checked in the same way. Thus, with ,
on .
Step 2. Decomposition into eigenspaces of N. For each degree d, the operator N is diagonal in the basis above:
For and , let
This is the k-eigenspace of N on . In particular,
is an orthogonal sum. We put when , , or . The basis formulas show that
with annihilation equal to zero on degree 0. Since belong to , (13) implies
and, for ,
For distinct k, these target spaces are orthogonal on each side. Writing therefore gives
It therefore suffices to prove (12) for . We fix a nonzero space and work with a vector f satisfying
Step 3. The two expressions in (12). By linearity and (13),
The mixed terms cancel because , and so
Expanding the tensor expression gives
The two tensors on the right are orthogonal because . Moreover, (14) and (15) give
It follows that
Since , we may put . Equation (16) reads . Thus, (12) for this f is equivalent to
Step 4. Calculation of and . Set
The operator Q lowers the degree by two, and raises it by two. Both and preserve each homogeneous space and its N-eigenspaces. In particular, the maps
are adjoints of one another. Hence,
The basis formulas, including the cases , give
The corresponding identities with in place of also hold. Thus,
To calculate , write and . The mixed commutation relations give
Therefore
Expanding and substituting the preceding formula yields
Since , this is
Also, , so
Consequently,
On , the equality and (19)–(20) give
Factoring the polynomial in L gives
on .
Step 5. The operators . On the finite-dimensional space , define
The operators preserve . So do and : they transfer one factor from the v-direction to the u-direction, or conversely, without changing either the total degree or . Their restrictions satisfy . Since are also self-adjoint on , so are .
The formulas for and above give
It follows that
Furthermore,
Adding yields
Since , we have proved
Thus, satisfy the hypotheses of the lemma in Section 2.
Step 6. Application of the lemma. Put
Since , we have , and
On , the relations and give
Consequently,
Also . Substituting both identities into (21) gives
By our lemma, the operator in parentheses is positive semidefinite. Therefore
which proves (18). Returning to (16) and (17), we obtain
This proves (12) on each . Summing over the orthogonal components from Step 2 proves it for arbitrary . The argument includes , for which . □
4. Proof of Theorem 1
For , set
We are now ready to prove our main result.
Proof of Theorem 1.
If , the left-hand side of (1) is zero, and , as also follows from (27) below. We may therefore assume . A simultaneous permutation of rows and columns reduces the proof to the case with and . Choose vectors in a finite-dimensional complex Hilbert space such that . The relation between symmetric tensors and permanents [5], with the normalization used here, is
For , put and . It follows that
Thus, is times the Gram matrix of .
5. Further Discussions
A closely related statement, stronger than inequality (1), is Bapat and Sunder’s Conjecture 3 in [1] (1986). In his study of Bapat and Sunder’s conjecture by means of permanent functions and compound matrices, Pate [10] (2008) showed that
for every positive semidefinite Hermitian matrix A and every -vector x, where
Here and range over the k-element subsets of , listed in lexicographic order. The matrix has rows indexed by and columns indexed by , and . Pate also indicated that Bapat and Sunder’s conjecture would imply inequality (1).
Drury [4] (2018) gave a negative answer to Bapat and Sunder’s conjecture by providing a counterexample. However, Pate’s question, namely whether inequality (1) holds, was left open in [10]. It is answered here by Theorem 1.
Question.
Pate showed that
if x is a -vector. Is it true that
for and every k with ? Here are the first two standard basis vectors of .
The answer is negative. We provide a family of counterexamples for .
For , let
The columns come from the three orthogonal pairs
Each vector in the first two pairs occurs twice, and each vector in the third pair occurs once. Thus, is positive semidefinite of rank two; indeed, .
The first two 5-subsets in lexicographic order are
Put and
A direct calculation gives
Therefore, for ,
The sign follows from the identity
All terms in the last line are nonnegative when , and the first is 21. Hence, every gives a counterexample. For instance, gives
References
- Bapat, R. B.; Sunder, V. S. An extremal property of the permanent and the determinant. Linear Algebra Appl. 1986, 76, 153–163. [Google Scholar] [CrossRef]
- Brualdi, R. A.; Ryser, H. J. The Permanent, in Combinatorial Matrix Theory; Cambridge University Press, 1991; p. 198-–249. [Google Scholar]
- Cheon, G.-S.; Wanless, I.-M. An update on Minc’s survey of open problems involving permanents. Linear Algebra Appl. 2005, 403, 314–342. [Google Scholar] [CrossRef]
- Drury, S. W. A counterexample to a question of Bapat and Sunder. Math. Inequal. Appl. 2018, 21(no. 2), 517–520. [Google Scholar] [CrossRef]
- Marcus, M.; Newman, M. The permanent function as an inner product . Bull. Amer. Math. Soc. 1961, 67(no. 2), 223–224. [Google Scholar] [CrossRef]
- Merris, R. Multilinear Algebra, Gordon & Breach; Amsterdam, 1997. [Google Scholar]
- Minc, H. Theory of permanents 1982-1985. In Linear Multilinear Algebra; 1987; Volume 21, pp. 109–148. [Google Scholar]
- Minc, H. Theory of permanents 1978-1981. Linear Multilinear Algebra 1983, 12, 227–263. [Google Scholar] [CrossRef]
- Minc, H. Permanents; Addison-Wesley: New York, 1978. [Google Scholar]
- Pate, T. H. On permanental compounds . Linear Algebra Appl. 2008, 429(no. 5–6), 1093–1101. [Google Scholar] [CrossRef]
- Wanless, I. M. Lieb’s Permanental Dominance Conjecture. In The Physics and Mathematics of Elliott Lieb; Frank, R. L., Laptev, A., Lewin, M., Seiringer, R., Eds.; EMS Press: Berlin, 2022; Vol. 2, p. 501-–516. [Google Scholar]
- Zhang, F. An update on a few permanent conjectures . Spec. Matrices 2016, 4(no. 1), 305–-316. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.