Research date: 20 November 2026 (America/Chicago).
Status: complete proposed proof. Two independent internal reviews found no mathematical gap; the bounded source audit found no prior full endpoint theorem. The proof is unrefereed. This is the named all-degree extension attributed to Malek in Cheon and Wanless's discussion of Minc Conjecture 3. It is a subsidiary in the Minc source chain, not a second resolution of the already proved permanent case. No Lean verification is part of this work.
Statement
Let be the nonnegative doubly stochastic matrices of order , let , and let be the sum of the permanents of all -by- submatrices, with . Define
Theorem. For every integer , every , and every ,
For , equality always holds. For , the equality cases are:
- : every doubly stochastic matrix;
- : only ;
- : and , where is a permutation matrix;
- : only .
The case , including its equality cases, is Lavi's previously proved Marcus–Minc theorem [2]. The new argument covers every proper degree simultaneously. It does not assert monotonicity along the entire segment from to its transform; that stronger statement is false.
Inputs and normalization
Put
and write . The proof establishes, for and ,
It then compares this with a strictly smaller linear upper coefficient for .
We use two published analytic inputs, with their roles kept separate:
- Gurvits's coefficient–capacity inequality: if is homogeneous of degree in variables, real stable, and has nonnegative coefficients, then , where [4].
- Lavi's centered-subpermanent estimate [2, Lemma 3.1; 3, Lemma 5.1]: if has zero row and column sums and , and , then for .
The stable polynomial, optimized-slice notation, root movement, and scalar coefficient step below are those of [3, Sections 2–3]. They are reproduced to make the improvement in their capacity estimate explicit.
1. A stronger capacity cost for proper degrees
Initially suppose every entry of is positive. Let , , and define
The elementary symmetric polynomial is real stable. Composition with the positive linear forms in , and multiplication by the uniform linear factors, preserve stability. Thus is real stable, homogeneous of degree , and has positive coefficients. Direct differentiation gives
Its central coefficient is
For a positive vector , write . Since is doubly stochastic, is majorized by . Elementary symmetric polynomials are Schur-concave on the positive orthant, hence . One can see this Schur-concavity directly: averaging a pair of coordinates with fixed sum increases their product, and the coefficient of that product in is nonnegative.
Newton's inequalities imply that is nonincreasing in . Therefore
Combining these facts yields the capacity-cost estimate
This replaces the weaker estimate that keeps only the uniform factors. It uses essentially.
Fix a coordinate , hold the other coordinates positive, and set . The polynomial has degree , positive coefficients and negative real roots. The function has a unique minimizer . Write
The minimizing equation is . At , equation (4) gives ; write the corresponding probability vector as . Then
To apply (6), choose two of the fixed coordinates with ratio . Their sums in and have product . If are the corresponding sums of the other coordinates and their reciprocals, then . Cauchy–Schwarz on the cross terms gives
Consequently, for every positive ,
In particular, .
2. The root-movement estimate
We recall the root comparison in [3, Lemma 3.1 and equations (3.10)–(3.14)]. Set
and let , . Then coordinatewise.
The ordered negative roots of are nonincreasing in every coordinate of , and scale linearly when is scaled. For completeness, varying one coordinate of gives a pencil . Real stability places and in proper position; their zeros interlace and the ordered zeros of this pencil move to the left as increases. The monotonicity extends across multiple roots by continuity. The additional uniform factors have root , with the same bounds. After merging the ordered root lists,
The second assertion follows from the strictly increasing equation . Therefore the likelihood ratios lie in an interval whose largest-to-smallest ratio is at most .
Here is the probability calculation that converts this to a Euclidean bound. If two positive probability vectors have likelihood ratios between and , with , then and
Writing , this gives
Also, since the deviations of the coordinates of from sum to zero,
3. A uniform slice bound
We prove that, for ,
If , this follows from . Otherwise suppose, for a contradiction, that the reverse weak inequality holds. Set
Then , , and
For , the exponential series gives
Indeed, for bounds the series by the displayed geometric series.
Equation (9) implies . Applying (14) and (15), and using and , we obtain
Dividing (11) by now gives
This is impossible. For fixed , the expression
decreases with . At , the difference between and the expression under the square root in (17) is
To verify this strictly and without numerical approximation, convexity of on , with its tangent at , gives
The quadratic has positive leading coefficient and discriminant . It is strictly positive for every real . Since , equation (18) makes the right side of (17) strictly less than one. This proves (13).
4. From slices to the subpermanent lower bound
The scalar step of Gurvits's proof has a useful refinement, reproduced in [3, Lemma 2.2]. For the optimized slice in (7),
It also follows directly. In terms of the probability vector ,
The first inequality is weighted AM–GM. For the second, expand . The linear terms cancel; the quadratic term contributes ; convexity makes every higher contribution relative to the uniform probability vector nonnegative.
Let . Equations (13) and (19) give
The polynomial is stable, homogeneous of degree in variables, and has nonnegative coefficients. Applying the coefficient–capacity inequality and using , equations (5) and (8) imply
Some column has squared norm at least . This proves (2) for positive . Replacing an arbitrary by and taking proves (2) on the whole polytope, including its boundary.
5. The transformed upper bound
For a matrix with zero margins, selecting the entries supplied by in a subpermanent gives
Here . A doubly stochastic matrix is a convex combination of permutation matrices and hence has Euclidean operator norm at most one. Its restriction to is , so .
Apply the centered estimate from [2,3] term by term in (20), with . Since , the result is
The positivity of also follows from the tensor identity , with the sum of the normalized square-free symmetric basis tensors.
For fixed , is nondecreasing in . In the centered expansion, division by leaves the -th coefficient proportional to , with every other factor nonnegative. Terms first appearing at a larger are nonnegative as well.
For exact evaluation, selecting identity entries gives
The following rational comparisons handle the initial orders:
| Range | Upper coefficient used | Exact gap from |
|---|---|---|
These are checks of three scalar constants in an all-order proof, not finite matrix tests.
For , use and [2, Section 5]'s bound
The first bound can be checked directly from (22) at . For ,
Its logarithm is at most
At , put . The estimate gives the first inequality in (23).
The second inequality is equivalent to . On writing , this polynomial is , positive for every .
Thus for all . Combining (2) and (21) gives
This proves the inequality and strictness away from for all those parameters.
6. Initial orders and equality
The degrees are constant on . The full degree is [2, Theorem 1.1], with the equality cases listed above.
For proper degree two, the centered expansion is exact and
This is strictly positive for unless .
The only remaining pair is . For every zero-margin matrix,
The identity follows by inclusion–exclusion on the repeated row and column indices in the ordered triple sum. Since ,
Using
at , and , gives
It is strict away from . Together with the prior full-degree theorem, this completes every parameter and every equality case.
Scope, dependency, and review status
This proves one named historical subsidiary conjecture if the argument withstands review. The full-permanent endpoint, the centered estimate, the stable polynomial, and the root-movement estimate are prior work. The proposed new step is the reciprocal-mean capacity cost (6), its slice consequence (13), and their use to close the negative transform for every proper degree.
It does not solve Lih–Wang's half-segment inequality, the false Holens–Djokovic conjecture, Gyires's inequality, or the full boundary-monotonicity classification. It supplies no new claim for the already resolved numbered Conjecture 3.
The narrow order-five rational margin is explicit. The proof of its lower coefficient is an all-order analytic inequality, and the scalar checks accompany the proof for reproducibility. They do not replace the proof, and internal review is not external refereeing. See the separate source audit for priority and eligibility limits.
References
- G.-S. Cheon and I. M. Wanless, An update on Minc's survey of open problems involving permanents, Linear Algebra and its Applications 403 (2005), 314–342, DOI 10.1016/j.laa.2005.02.030. The Conjecture 3 discussion, equation (9), attributes the all-degree endpoint to Malek. Author PDF.
- Y. Lavi, The Marcus–Minc Transform Inequality, 24 September 2026, arXiv:2609.29262v1. Theorem 1.1, Lemma 3.1, and Section 5 are used. Numbered Minc page.
- Y. Lavi, The Kopotun Subpermanent Transform Inequality, manuscript dated 11 October 2026, Hexagon 2611.00201v1. Sections 2–3 supply the polynomial and optimized-root method. Its proved transform is , distinct from (1).
- L. Gurvits, Van der Waerden/Schrijver–Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all, Electronic Journal of Combinatorics 15 (2008), R66, DOI 10.37236/790.
- M. Malek, A note on a permanental conjecture of M. Marcus and H. Minc, Linear and Multilinear Algebra 25 (1989), 71–73, DOI 10.1080/03081088908817929. The exact conjecture is transcribed from [1]; full-text access limits for this original paper are stated in the source audit.