Gilmore's crossing–nesting conjecture

What Lean checks

Lean proves the full crossing–nesting identity for the stabilized product-defined matrix, with alignment and size refinements, over every commutative ring. Canonical matching lists enumerate exactly the literal perfect matchings; their weights count the actual crossing, nesting and alignment inequalities. Fresh strict compilation, the all-owned audit of 449 declarations (346 theorem declarations, including private declarations) and all 20 required endpoints, and stock-kernel replay passed. Local receipt. The combined repository gate and hosted validation are separate.

Literature and priority check

Checks conducted 20 November 2026:

  1. Read the original arXiv v2 and the published EJC version, including their different conjecture numbering and the definition of the matrix.
  2. Located the MathDB crossing–nesting entry, which records this matrix identification as open and reports only Gilmore's finite checks.
  3. Searched the exact paper title, DOI, author with both “Conjecture 6.11” and “Conjecture 6.16”, and the phrases “crossing-nesting”, “forest-matrix first column”, “Bessel”, “perfect matchings”, “proof”, and “solution”.
  4. Checked related work on forests and total positivity by Sokal and Chen–Sokal, and the citation records for the matching master continued fractions. The standard matching continued fraction was already available to Gilmore and is explicitly cited in his conjecture discussion.
  5. Inspected Sokal–Zeng's revised 2022 matching chapter, including Theorems 4.1, 4.4, and 4.5 and footnote 27. Those results give the classical continued fractions. The text contains no reference to Gilmore and does not identify his matrix product.
  6. No prior proof of the exact product-defined matrix/matching identification was located. This bounded search does not establish priority against all unpublished or unindexed work.

Related primary sources:

  • A. Kasraoui and J. Zeng, Distribution of crossings, nestings and alignments of two edges in matchings and partitions, Electronic Journal of Combinatorics 13 (2006), R33. DOI. The matching continued fraction is classical prior work.
  • A. D. Sokal and J. Zeng, Some multivariate master polynomials for permutations, set partitions, and perfect matchings, and their continued fractions, Advances in Applied Mathematics 138 (2022), 102341. arXiv. The master matching enumerator is prior work.
  • A. D. Sokal, Total positivity of some polynomial matrices that enumerate labeled trees and forests I: forests of rooted labeled trees, Monatshefte für Mathematik (2022). DOI. Its q-forest conjectures are distinct.