Malek's conjecture

What Lean checks

Complete written all-degree negative-transform proof with all equality cases, two independent internal reviews and exact scalar identity checks. The permanent endpoint is prior work; the named subsidiary is documented in the Minc site's linked survey. No proof-assistant work is claimed.

Lean status: none

For every nonnegative doubly stochastic matrix AA of order n≥2n\ge2 and every subpermanent degree 0≤k≤n0\le k\le n,

σk(A)≥σk(nJn−An−1).\sigma_k(A)\ge \sigma_k\!\left(\frac{nJ_n-A}{n-1}\right).

The complete proposed proof covers all parameters and classifies equality. Its new step is a reciprocal-mean capacity estimate for the stable polynomial representing a proper subpermanent degree. The full-permanent endpoint is previously proved work.

This is the historical conjecture attributed to Malek in Cheon–Wanless's 2005 survey, equation (9), linked from Minc's list. The live numbered C3 page cites Malek but does not separately state this all-degree extension. It is a named subsidiary in that source chain, not another resolution of numbered Conjecture 3. The source audit makes this eligibility limit explicit.

Both internal reviews found no mathematical gap. The exact checker uses only Python's standard library and tests scalar proof identities, not a finite set of matrices. The proof is unrefereed, historical priority remains provisional, and no Lean verification is claimed.