Formalizing the Face Lattice of Polyhedra - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Logical Methods in Computer Science Year : 2022

Formalizing the Face Lattice of Polyhedra

Abstract

Faces play a central role in the combinatorial and computational aspects of polyhedra. In this paper, we present the first formalization of faces of polyhedra in the proof assistant Coq. This builds on the formalization of a library providing the basic constructions and operations over polyhedra, including projections, convex hulls and images under linear maps. Moreover, we design a special mechanism which automatically introduces an appropriate representation of a polyhedron or a face, depending on the context of the proof. We demonstrate the usability of this approach by establishing some of the most important combinatorial properties of faces, namely that they constitute a family of graded atomistic and coatomistic lattices closed under interval sublattices. We also prove a theorem due to Balinski on the $d$-connectedness of the adjacency graph of polytopes of dimension $d$.

Dates and versions

hal-03915661 , version 1 (29-12-2022)

Identifiers

Cite

Xavier Allamigeon, Ricardo Katz, Pierre-Yves Strub. Formalizing the Face Lattice of Polyhedra. Logical Methods in Computer Science, 2022, 18 (2), ⟨10.46298/lmcs-18(2:10)2022⟩. ⟨hal-03915661⟩
38 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More