Log In Sign Up

Formalizing the Face Lattice of Polyhedra

by   Xavier Allamigeon, et al.

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.


page 1

page 2

page 3

page 4


An Improved Trickle-Down Theorem for Partite Complexes

Given a d+1-partite d-dimensional simplicial complex, we prove a general...

On Polyhedral Realization with Isosceles Triangles

Answering a question posed by Joseph Malkevitch, we prove that there exi...

On Planarity of Graphs in Homotopy Type Theory

In this paper, we present a constructive and proof-relevant development ...

Can you find a face in a HEVC bitstream?

Finding faces in images is one of the most important tasks in computer v...


Hypertrees are high-dimensional counterparts of graph theoretic trees. T...

Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

We derandomize the famous Isolation Lemma by Mulmuley, Vazirani, and Vaz...

Removing Popular Faces in Curve Arrangements

A face in a curve arrangement is called popular if it is bounded by the ...