The Hibi--Li (2016) conjecture is fully resolved
Abstract
Hibi and Li conjectured that the order polytope πͺ(P) of a finite poset P has at most as many faces of each dimension as its chain polytope π(P), and that equality in some dimension k with 1β€ kβ€|P|β1 forces the two polytopes to be unimodularly equivalent. Fourier proved the inequality in a 2026 preprint. Let X be the five-element poset in which an element lies above two incomparable elements and below two other incomparable elements. Building on Fourier's proof, we show that if an n-element poset contains X as an induced subposet, then, for every k with 2β€ kβ€ nβ1, its chain polytope has at least binomnβ3kβ2 more k-dimensional faces than its order polytope, and that for every nβ₯5 some n-element poset containing X attains all these bounds at once. Since Hibi and Li showed that πͺ(P) and π(P) are unimodularly equivalent exactly when P does not contain X, this proves the equality statement for these k. For k=1 the equality statement is false: πͺ(X) and π(X) have equally many edges (Hibi, Li, Sahara and Shikama) but are not unimodularly equivalent. With Fourier's inequality, these results settle the conjecture. Every result is formally verified in Lean 4, with only published results and two results of Fourier's preprint as axioms.
Related
- The Hibi-Li Face-Number Conjecture
- The Fully Inhomogeneous p-Adic Littlewood Conjecture
- Sign Propagation of Principal Minors in Fully Semimonotone Matrices and Stone's Conjecture
- ARAZY'S CONJECTURE CONCERNING SCHUR MULTIPLIERS: REVISITED AND RESOLVED
- Concavity-Free Lβ Estimates and Stability for Fully Nonlinear Complex Equations
BibTeX
@misc{goel2026hibili,
title = {{The Hibi--Li (2016) conjecture is fully resolved}},
author = {Dave Goel},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.40703},
eprint = {2610.40703},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.40703},
}
RIS
TY - UNPB
TI - The Hibi--Li (2016) conjecture is fully resolved
AU - Dave Goel
PY - 2026
DA - 2026/10/28
PB - arXiv
DO - 10.48550/arxiv.2610.40703
UR - https://arxiv.org/abs/2610.40703
AB - Hibi and Li conjectured that the order polytope πͺ(P) of a finite poset P has at most as many faces of each dimension as its chain polytope π(P), and that equality in some dimension k with 1β€ kβ€|P|β1 forces the two polytopes to be unimodularly equivalent. Fourier proved the inequality in a 2026 preprint. Let X be the five-element poset in which an element lies above two incomparable elements and below two other incomparable elements. Building on Fourier's proof, we show that if an n-element poset contains X as an induced subposet, then, for every k with 2β€ kβ€ nβ1, its chain polytope has at least binomnβ3kβ2 more k-dimensional faces than its order polytope, and that for every nβ₯5 some n-element poset containing X attains all these bounds at once. Since Hibi and Li showed that πͺ(P) and π(P) are unimodularly equivalent exactly when P does not contain X, this proves the equality statement for these k. For k=1 the equality statement is false: πͺ(X) and π(X) have equally many edges (Hibi, Li, Sahara and Shikama) but are not unimodularly equivalent. With Fourier's inequality, these results settle the conjecture. Every result is formally verified in Lean 4, with only published results and two results of Fourier's preprint as axioms.
ER -