Status: complete proposed proof, with separate internal mathematical reviews and a completed bounded prior-resolution audit. The argument remains unrefereed. No finite computation is used in the proof.
Statement and attribution
William Johnson's Pfaffian Positivity for Convex Kernels and Optimal Matching Bounds, arXiv:2610.24371v1, Conjecture 7.1, asks the following. Let be positive and even, let , and let be nonincreasing and log-convex. Define the real skew-symmetric matrix by
For every perfect matching of , the conjecture asserts
The proof below uses Johnson's already proved Proposition 4.2, the endpoint inequality for additive interval matrices. The new argument passes from products of interval factors to that additive class after arbitrary cyclic relabeling and positive diagonal scaling. This supplies an inequality for every adjacent pair, which can be iterated along any noncrossing matching. No claim is made that the endpoint inequality, the source's rainbow bound, or its resolution of the Albouy–Moeckel nonvanishing conjecture is new here.
1. The imported endpoint inequality
For a linearly ordered set , let denote its intervals of size at least two. An additive interval matrix is the skew-symmetric matrix whose positive-order entries have the form
Johnson's Proposition 4.2 states, for every even ,
Here and throughout, the empty Pfaffian is one. The proposition applies to every additive interval matrix with nonnegative coefficients, not only to matrices arising from a distance kernel. Its statement also explicitly covers every even principal submatrix. The source proves the stronger coefficientwise polynomial inequality; only the real-valued inequality (1) is needed here.
2. A class defined by products of circular interval factors
Place in its cyclic order. A circular interval is a consecutive block in this cyclic order; the full set is allowed. Choose finitely many circular intervals , numbers , and positive vertex factors . Define
and complete by skew-symmetry. Empty or singleton interval supports contribute no off-diagonal factor and may be discarded.
Theorem. Every matrix (2) of even order satisfies
for every perfect matching .
We first prove four elementary facts about this class.
2.1 Positive diagonal scaling preserves the comparison
If with all , then
Every perfect-matching product is multiplied by the same factor . Also, in an endpoint comparison, is multiplied by this same factor. These identities follow directly from the perfect-matching expansion, since every vertex occurs exactly once.
2.2 Products of ordinary interval factors are additive interval matrices
For an ordinary linear interval ,
Expand a finite product of these expressions. Each term is a nonnegative coefficient times
The intersection of linear intervals is a linear interval, possibly empty or a singleton. The empty selection contributes the constant one, represented by the full interval . Thus the product matrix has nonnegative additive interval coefficients. This is a finite algebraic expansion, requiring no convergence argument.
2.3 A wrapped interval can be replaced by its complement
Fix any cut of the cyclic order and regard the resulting order as linear. A proper circular interval that wraps across the cut has an ordinary-interval complement. For such an interval , put . The identity
gives
Replace every wrapped proper interval in this way and absorb all into the positive vertex factors. Ordinary intervals and the full interval are left unchanged. The resulting matrix, after removing the positive diagonal factors, is a product of ordinary interval factors with parameters at least one. By Section 2.2 it is an additive interval matrix. Consequently, (1) can be applied after any cyclic relabeling of (2), with the diagonal factors then restored using Section 2.1.
2.4 Cyclic relabeling preserves the positive-order Pfaffian
For any symmetric collection of edge weights, form the skew matrix by putting those weights above the diagonal. Its Pfaffian is the sum over perfect matchings of the matching product times , where is the number of pairs of chords whose endpoints alternate in the cyclic order. Alternation is invariant under rotating the cyclic order. Hence the Pfaffian, when the same edge weights are again placed above the diagonal, is unchanged by cyclic relabeling.
Equivalently, for a one-step rotation in even order, the permutation changes the Pfaffian's sign, and reversing the moved vertex's row and column restores the positive-order entries and changes the sign back. The same observation applies to every even induced subconfiguration.
3. Every adjacent pair satisfies the endpoint comparison
Let be cyclically adjacent vertices of a matrix (2). Cut the circle between them so that they become the first and last vertices of the resulting linear order. By Sections 2.2–2.3, a positive diagonal scaling turns this reordered matrix into an additive interval matrix. Apply (1), undo the diagonal scaling, and use cyclic invariance from Section 2.4. We obtain
where is the positive edge weight. The principal submatrix is written in the original induced increasing order; cyclic invariance permits this restoration of order.
Restriction to any subset preserves class (2). Indeed, the intersection of a circular interval with the subset is a circular interval in the subset's induced cyclic order, or is empty. The vertex factors remain positive and the parameters remain at least one. Thus (5) can be applied again after deleting a matched adjacent pair.
4. Noncrossing matchings and uncrossing
For the original distance kernels, Johnson already gives the uncrossing argument and strictly decreasing total-length termination immediately after Conjecture 7.1. The factorwise comparison below extends that existing reduction to the circular interval-product class. The new proof step is the adjacent-pair inequality (5), which settles the noncrossing case in every order.
Every noncrossing perfect matching has a cyclically adjacent matched pair. To see this, use any linear cut and choose a matched pair with minimum index difference. If a vertex lies strictly between its endpoints, noncrossing forces that vertex to be matched to another vertex between the same endpoints. That inner pair has a smaller index difference, a contradiction. Thus the chosen pair is adjacent.
Apply (5) to such a pair. The remaining matching is noncrossing in the induced order and the remaining matrix is still in class (2). Induction on the number of vertices, with the empty matching as the initial case, proves (3) for every noncrossing perfect matching.
Now consider four cyclically ordered vertices . For any circular interval , its intersection with these four vertices is circularly consecutive. Therefore
To check (6), intersections of size zero, one, three, or four give equal sums. If the intersection has size two, those two vertices are cyclically adjacent among the four, so the right side is zero and the left side is nonnegative. This exhausts the possibilities.
As every , multiplying (6)'s factorwise inequalities and canceling the common vertex factors gives
Hence a crossing pair of matching edges can be replaced by without decreasing the matching product. The sum of the edge lengths in the fixed index order strictly decreases:
Repeated replacements therefore terminate at a noncrossing perfect matching. Its product is at least the original matching product, and the already proved noncrossing case bounds it above by . This proves the theorem for every matching.
5. Log-convex distance kernels belong to this class
Return to the conjecture's kernel and ordered nodes. Let and, for , put
Because is positive and nonincreasing, these are finite nonnegative real numbers and . Set the out-of-range boundary values . For each linear interval of size at least two, define
All these coefficients are nonnegative. For or , this follows from monotonicity. For the coefficient is zero. In the interior, write
Then
since the increments of a convex function over a fixed positive length are nondecreasing in their starting point. No differentiability assumption is needed.
Double telescoping in (8) gives, for every ,
Consequently,
This is (2), with and . The theorem therefore proves Johnson's conjecture in its full stated generality.
Sources and proof boundary
- William Johnson, Pfaffian Positivity for Convex Kernels and Optimal Matching Bounds, arXiv:2610.24371v1, 17 October 2026. Primary abstract; primary PDF. Proposition 4.2 is on printed pages 8–9; Conjecture 7.1 is on printed page 14.
- The imported inequality is exactly Proposition 4.2 for arbitrary nonnegative additive interval coefficients. The kernel uncrossing reduction is also already stated after Conjecture 7.1. The new steps are the circular-complement gauge, its use to move the endpoint inequality to any adjacent pair, and the resulting all-matching theorem for (2).
- The previously run finite screens are exploratory checks, not premises of this proof. The stronger multivariate coefficientwise domination suggested by those screens is not asserted here.
- Priority status is recorded separately. A correct derivation is not, by itself, evidence that no earlier derivation exists.