Review date: 20 November 2026 (America/Chicago). This receipt checks the mathematical argument communicated by the root researcher, including the new capacity-cost estimate, its constants, the transformed upper bound, the small cases, and extension to matrices with zero entries. A separate source audit is required for the historical status and any priority claim.
Statement and normalization
Let n>=2, let A be a nonnegative doubly stochastic matrix, and write
The claimed comparison is
where sigma_k is the sum of all permanents of square submatrices of order k. The degree-one case is an identity. The full permanent case k=n is the previously proved Marcus–Minc theorem. The new argument covers every proper degree 2<=k<n, rather than a bounded collection of orders.
For these proper degrees set
The key new lower bound, checked below, is
Published inputs inspected
The following full primary texts were read for this review.
- Y. Lavi, The Kopotun Subpermanent Transform Inequality, hexagon:2611.00201v1, dated 11 October 2026. Sections 3.1–3.3 give the polynomial normalization, optimized slices, and root-movement estimate used here. Lemma 2.2 and equation (3.8) give the coefficient consequence. The proposed argument replaces the capacity-cost estimate of Section 4.1 and its subsequent constants; it does not claim the already published Kopotun comparison as new.
- Y. Lavi, The Marcus–Minc Transform Inequality, arXiv:2609.29262v1, 24 September 2026. Lemma 3.1 supplies the centered subpermanent estimate, including its contraction hypothesis and positivity of
sigma_r(I-J). Section 5 gives the rational bound for the full-degree upper constant. Theorem 1.1 supplies the full permanent case and its equality exceptions.
Both inputs were checked at the indicated arguments, not inferred solely from their abstracts.
Polynomial and slice hypotheses
First assume every entry of A is positive. Define
This is stable, homogeneous of degree n, and has positive coefficients in every degree-n monomial. It satisfies P(1)=1, grad P(1)=1, and has capacity one. Its central coefficient is
For a fixed column j, fix all other positive coordinates x_h. Let t_* minimize P(x_1,...,t,...,x_n)/t. Positivity and stability give n strictly negative roots and a unique positive minimizer. The associated probability vectors p=p(x) and p^0=p(1), the variances d=||p-1/n||_2^2, d_0=||p^0-1/n||_2^2, and the cost
satisfy
If R=log(max_(h≠j) x_h/min_(h≠j) x_h), the inspected root-movement argument gives
The root pairing in that source is legitimate even with repeated roots: the e_k roots are ordered within that factor, while the n-k uniform-factor roots are paired separately. The optimized scale t_* cancels from the range of the logarithmic likelihood ratios. Thus (2) does not assume that the slice optimizer stays at one.
Finally, writing M_j=inf_(x>0)(F+d/2), the scalar capacity step and the remaining Gurvits induction give
This takes a lower bound before the infimum; it does not confuse evaluation at x=1 with a lower estimate for M_j.
The stronger capacity cost
For positive z, put E_r(z)=e_r(z)/binom(n,r). Since Az is majorized by z and e_k is Schur-concave,
Newton's inequalities imply that E_(r+1)(z)/E_r(z)<=E_1(z). Multiplying these ratios gives
Here k<n is essential; at k=n-1 the last comparison is an equality. Using E_(n-1)(z)/prod z=E_1(1/z), we obtain
To bound the last product with two coordinates in ratio e^R, scale those two to e^(R/2) and e^(-R/2). Put C=2 cosh(R/2) and let S,T be the sums of the other coordinates and their reciprocals. Then S+T>=2(n-2) and ST>=(n-2)^2. Consequently
This remains true when one of the other coordinates is the optimized t_*. Equations (4) and the definition of F prove
Constant audit for the lower bound
If d_0=0, the required pointwise bound follows from F,d>=0. Otherwise suppose, for contradiction,
Write s=sqrt(d/d_0) and w=5/4-ns^2/2. Then
for n>=5. The estimate exp(F/2)-1<=8F/15 holds on this whole interval. One rational verification uses exp(x)-1<=x+x^2/[2(1-x/3)] for 0<=x<=1/8; the latter bound is at most (49/46)x<(16/15)x.
Equation (5) therefore gives
and, using d_0w<=5/4,
Also (2) and d_0<=1-1/n give np_max<=1+(n-1)s. Substituting in (2), dividing by sqrt(d_0), and using (6) yields
For fixed 0<=s<1, the expression before the factor 28/45 under the square root decreases with n. At n=5, its separation from (1-s)^2 is
The positivity has the exact certificate
For s>=0, the last term is nonnegative. The quadratic has positive leading coefficient and discriminant -43876/729<0. This makes the right side of (7) strictly less than one, a contradiction.
Thus M_j>=5d_0/(4n). Because the sum over columns of d_0 is Delta, some column has d_0>=Delta/n. Equation (3) proves (1).
Upper bound and its constants
The centered estimate applies to X=A-J because X has zero margins and ||X||_(2→2)<=1. Put Q=I-J and rho=1/(n-1). The exact centered expansion has coefficients
Taking the odd terms in absolute value gives
All summands are nonnegative. The identity
shows that, after division by alpha_(n,k), the dependence on k is through (k-2)_(r-2). Hence b_(n,k) is nondecreasing in k. There is no assumption on the signs of the centered coefficients of X.
Independent exact evaluation gives
For n>=8, the published full-degree estimate implies
After multiplying positive denominators, the last strict inequality is equivalent to
At n=8+u this is 6u^3+89u^2+357u+192, which is positive for every u>=0. Thus (8) has a strictly smaller coefficient than (1) for every proper degree with n>=5.
Small cases, boundary, and equality
For k=2, the exact identity sigma_2(X)=||X||_F^2/2 gives
This is strict for n>=3 unless A=J. The only remaining proper degree below order five is (n,k)=(4,3). The centered expansion and sigma_3(X)=(2/3)sum x_ij^3 give
The last inequality uses only x_ij>=-1/4, which implies x_ij^3>=-x_ij^2/4. It is again strict away from J.
For arbitrary nonnegative A, apply (1) first to A_epsilon=(1-epsilon)A+epsilon J. The lower estimate passes to the limit using only continuity of sigma_k and the Frobenius norm. The centered upper estimate already holds on the boundary. Strictness then follows from the positive difference between the constants in (1) and (8), not from taking a limit of strict inequalities.
Accordingly every proper-degree comparison 2<=k<n is strict unless A=J. The cases k=n retain the established Marcus–Minc equality classification: all doubly stochastic matrices in order two; J_3 and the six complements of permutation matrices in order three; only J_n when n>=4. Degree one is always an equality.
Review conclusion
No mathematical gap was found in the argument described above. Its new lower bound and strict upper-constant separation cover all proper degrees and all support boundaries. The original Malek source, the exact historical scope of that conjecture, and whether a prior full proof exists must be audited separately before claiming a newly resolved named conjecture.
Final draft read
The complete draft at /workspace/scratch/0c03194a47dc/proof.md was read after this derivation was checked. Its equations (1)–(26), normalization, initial cases, support-boundary argument, and equality list agree with the reviewed proof. In particular, its identity-entry expansion (22) has the correct factor (k)_j/(n)_j, and its simpler geometric-series proof of exp(F/2)-1<=8F/15 is valid on 0<=F<=1/4.
The draft's additional bound u<=t_*<=v is also valid: substituting t=u and t=v into the increasing minimizing equation brackets one. For clarity, the following identity makes its subsequent likelihood-ratio claim explicit. If c_i=lambda_i(x)/lambda_i(1), then
Thus the ratio of the largest to smallest likelihood ratio is at most v/u. This supplies the intermediate step in the prose following equation (10); no stronger root comparison is needed.