A Safe Computational Framework for Integer Programming Applied to Chvatal's Conjecture

We describe a general and safe computational framework that provides integer programming results with the degree of certainty that is required for machine-assisted proofs of mathematical theorems. At its core, the framework relies on a rational branch-and-bound certificate produced by an exact integer programming solver, SCIP, in order to circumvent floating-point round-off errors present in most state-of-the-art solvers for mixed-integer programs. The resulting certificates are self-contained and checker software exists that can verify their correctness independently of the integer programming solver used to produce the certificate. This acts as a safeguard against programming errors that may be present in complex solver software. The viability of this approach is tested by applying it to finite cases of Chvatal's conjecture, a long-standing open question in extremal combinatorics. We take particular care to verify also the correctness of the input for this specific problem, using the Coq formal proof assistant. As a result, we are able to provide the first machine-assisted proof that Chvatal's conjecture holds for all downsets whose union of sets contains seven elements or less.

Automated summary

This paper presents a general and safe computational framework for machine-assisted proofs of mathematical theorems using integer programming. The framework relies on a rational branch-and-bound certificate to avoid floating-point round-off errors and provides checker software to independently verify the correctness of the certificate.