Mechanization of Incidence Projective Geometry in Higher Dimensions, a Combinatorial Approach
Pascal Schreck (ICube, UMR 7357 CNRS Universit\'e de Strasbourg,, France), Nicolas Magaud (ICube, UMR 7357 CNRS Universit\'e de Strasbourg,, France), David Braun (ICube, UMR 7357 CNRS Universit\'e de Strasbourg,, France)

TL;DR
This paper extends automated theorem proving in incidence geometry from 2D to higher dimensions (3D, 4D, 5D) using a combinatorial approach based on matroid theory, showcasing initial results in these complex spaces.
Contribution
It introduces a novel combinatorial prover for higher-dimensional incidence geometry, filling a gap in automated theorem proving beyond 2D.
Findings
Proved incidence theorems in 3D, 4D, and 5D.
Demonstrated the applicability of matroid theory in higher-dimensional geometry.
Extended automation tools to complex geometric spaces.
Abstract
Several tools have been developed to enhance automation of theorem proving in the 2D plane. However, in 3D, only a few approaches have been studied, and to our knowledge, nothing has been done in higher dimensions. In this paper, we present a few examples of incidence geometry theorems in dimensions 3, 4, and 5. We then prove them with the help of a combinatorial prover based on matroid theory applied to geometry.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Logic, programming, and type systems · Computational Geometry and Mesh Generation
