Lean status: none
For every nonnegative doubly stochastic matrix of order and every subpermanent degree ,
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.
- Complete proof and equality cases
- Source and priority audit
- Independent inequality review
- Independent constants and text review
- Exact scalar identity checker
- Coordination issue
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.