The Hibi–Li (2016) conjecture is fully resolved

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 (n−3 choose k−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.