On Projective Delineability
Lucas Michel, Jasper Nalbach, Pierre Mathonet, Naïm Zénaïdi, Christopher W. Brown, Erika Ábrahám, James H. Davenport, Matthew England
TL;DR
The paper introduces projective delineability as a projective-geometry–based surrogate for classical delineability in cylindrical algebraic decomposition. By leveraging the real projective line $\\mathbb{RP}^1$, homogenization, and linear-transform pullbacks $H^d$, $\\iota_A^{*d}$, and $A^{*d}$, it formalizes projective roots and proves local and global results that mirror McCallum’s delineability theory, enabling omission of leading coefficients in single-cell CAD constructions. The local result uses a geometric trick to avoid roots at infinity, after which standard delineability applies and transfers back to the projective setting; the global result shows that on simply connected bases the projective delineability data form a trivial cover, yielding global root functions. Together, these findings provide a framework for computational savings in CAD, with potential practical impact for SMT-based real arithmetic decision procedures, and extend cleanly to multivariate polynomials. The work thus offers a principled path to reduce projection data while preserving correct regionwise sign-invariance in CAD computations.
Abstract
We consider cylindrical algebraic decomposition (CAD) and the key concept of delineability which underpins CAD theory. We introduce the novel concept of projective delineability which is easier to guarantee computationally. We prove results about this which can allow reduced CAD computations.
