Formalizing the Face Lattice of Polyhedra
- 24 June 2020
- book chapter
- Published by Springer Nature
- Vol. 12167, 185-203
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 sublattices.Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Refinements for Free!2013
- Canonical Structures for the Working Coq User2013
- Pragmatic Quotient Types in Coq2013
- A Machine-Checked Proof of the Odd Order Theorem2013
- A counterexample to the Hirsch ConjectureAnnals of Mathematics, 2012
- The HOL Light Theory of Euclidean SpaceJournal of Automated Reasoning, 2012
- Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proofTheoretical Computer Science, 2008
- The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systemsScience of Computer Programming, 2008
- Fast Reflexive Arithmetic Tactics the Linear Case and Beyond2007
- Mathematical problems for the next centuryThe Mathematical Intelligencer, 1998