Research date: 2026-11-20 (America/Chicago).
This independently checks the proposed strengthened subpermanent lower bound and the constants needed to compare it with the negative transform. The proof in this note covers and . The permanent case , the smaller orders, and the historical scope of Malek's conjecture must be supplied separately when stating the full result. No matrix search or finite-order extension is used.
The two source inputs inspected were Yair Lavi's Kopotun paper, especially Sections 3, 5, and 6, and his Marcus–Minc paper, especially Sections 3–5. The former supplies the stable-polynomial slice framework, root-motion estimate, and centered subpermanent bound. The latter supplies the rational upper bound on the full permanent comparison constant. The stronger capacity estimate below is the campaign's proposed improvement; it is not attributed to those papers.
Notation
Let be doubly stochastic of order , let , and set
The transform is . It is doubly stochastic because every entry of lies in .
1. The improved capacity cost
Assume first that is positive, put , and use the degree- stable polynomial
For positive , double stochasticity implies . The elementary symmetric polynomial is Schur-concave, so . The normalized Newton inequalities make nonincreasing in ; hence
The direction of this inequality matters. It yields
Fix a slice coordinate . For the other coordinates , let . At the optimizing slice coordinate , set . Choose two of the other coordinates with ratio , and scale all coordinates so that these two are . If the remaining coordinates have sums and reciprocal sum , then and . Therefore (1) gives
This also covers . The argument uses two distinct other coordinates, available because .
2. The pointwise lower bound
Use the slice probabilities , their values when all other coordinates equal one, and
The inspected root-motion estimate gives
If , then suffices. Otherwise suppose, for contradiction, that
Write and . Then
For , the factorial bound gives
Equation (2) consequently implies
For the second estimate use in . Also , so (3) gives . Substitution into (3) now forces
For fixed , the product under the radical before the factor decreases with : it equals
Replacing by 5 in (5) is therefore an upper bound. But
for every . An exact certificate is
The quadratic has positive leading coefficient and discriminant ; the last term is nonnegative on . Since , this contradicts (5). Thus the proposed pointwise estimate is valid:
The stable coefficient argument in the inspected Kopotun paper converts (6) into
Indeed, take the infimum over the positive slice coordinates, then choose with . For an arbitrary doubly stochastic matrix, apply the positive-matrix argument to and let . Every quantity in (7) is continuous. This handles all support boundaries.
3. The upper constant increases with
For falling factorials , expansion by the entries selected from gives
The centered estimate applies to : it has zero margins and operator norm at most one. It gives
Use (8), including absolute values for odd , and put . This gives
After division by , the -th coefficient in is a nonnegative constant independent of times . Increasing increases every existing term and introduces only nonnegative terms. Therefore
This is the same coefficient monotonicity mechanism as the source's positive-transform upper bound, applied at a different positive value of .
The exact diagonal-plus-uniform evaluation is
It follows by expanding ; no sign condition on a centered coefficient is substituted for this calculation.
4. Exact separation of the constants
The necessary small scalar calculations are:
| Constant used | Exact value | Gap below | |
|---|---|---|---|
| 5 | |||
| 6 | |||
| 7 |
For , the Marcus–Minc paper proves
All denominators are positive. Comparison with reduces to
Writing gives the exact positive expression
Thus for every and . Combining (7) and (9) proves the proposed strict comparison when , and equality at . The upper comparison must retain for the small constants: and themselves exceed . This does not affect the argument, since (10) permits the sharper at those two orders and the permanent case has a separate theorem.
Verification scope
The accompanying script verifies the scalar evaluations, two independent expansions for them, the cubic decomposition and its discriminant, and the shifted positive polynomial. It does not test a finite collection of matrices or substitute computation for the quantified inequalities. This review found no gap in the stated argument.
Comparison with the complete draft
The complete draft at proof.md was then read independently. Its displayed scalar values, normalizations, the factor , the cubic certificate, and the final strictness argument agree with this check.
Two details in the expanded draft deserve an explicit check. First, the ordered root bounds imply by the increasing slice equation. Setting , the likelihood ratio is
It lies between and , hence between and . This directly gives the needed ratio bound . Sorting the two component root lists does not invalidate their coordinatewise bounds.
Second, the remaining small proper degree is . The zero-margin identities
and imply . At , the transform difference is
The draft's constant and equality conclusion are correct. Degree two is strict away from for , and degrees zero and one are constant. The full degree and its exceptional order-three equality cases are imported from the cited Marcus–Minc theorem rather than claimed as new work.
This completes the mathematical audit of the written argument. The historical attribution and the search for prior all-degree resolutions remain the root agent's separate source audit.