Catalogue · Proof · Source audit · Issue #142
Status: Complete proposed proof of the named conjecture for every positive integer m and every integer n>1. The proof is unrefereed. Three internal reviews found no remaining mathematical gap. No earlier complete threshold proof was found in the public sources inspected; the source audit states the access and priority limits.
Lean status: none. No Lean formalization is included. The scripts audit formulas; the general proof does not depend on a finite computation.
Result
Let J denote an all-ones block and let Ω(V) be the doubly stochastic matrices supported by
The support is cohesive exactly when n<m+sqrt(m). It is never barycentric for n>1. At and above the threshold, including equality, its unique permanent minimizer is
The previously missing contribution is the general threshold direction. The known cohesive and non-barycentric directions are credited and independently rederived. This conjecture appears in the literature discussed under Minc Problem 14 and Problem 15. It does not characterize arbitrary cohesive or barycentric supports, so it is not a full solution of either Minc entry.
Proof and review
The proof first repairs a gap in the available 2011 equalization argument. A minor polynomial is a product of nonnegative first-order differential operators applied to a monomial. Its real nonpositive roots yield an inequality which forces equal cross-block parameters at a minimizer, including boundary cases. The reduced permanent satisfies a coefficient-derived differential equation. A first-zero argument proves strict increase at and above the threshold; a second-order expansion handles equality. A separate completion to a doubly stochastic matrix proves full-face uniqueness through the equality case of van der Waerden.
- Complete proof, including the reduction repair and all endpoint cases.
- Inequalities review.
- Sign-matrix review.
- Source audit and dependency history.
Reproduce the identity audits
Requires Python 3 and SymPy 1.14.0. Run with assertions enabled:
python3 results/pula-song-wanless/verify.pyThe script checks generic symbolic derivative and crossing identities, 72 coefficient ODE/variance cases, 48 permanent-counting identities against an independent subset dynamic program, and 42 exact barycenter inequalities. These checks detect algebra or parameter-convention errors; they are not a finite substitute for the all-parameter proof.