{"title":"Efficient Computation of a Semi-Algebraic Basis of the First Homology Group of a Semi-Algebraic Set","authors":"Saugata Basu, Sarah Percival","doi":"10.1007/s00454-024-00626-0","DOIUrl":null,"url":null,"abstract":"<p>Let <span>\\(\\textrm{R}\\)</span> be a real closed field and <span>\\(\\textrm{C}\\)</span> the algebraic closure of <span>\\(\\textrm{R}\\)</span>. We give an algorithm for computing a semi-algebraic basis for the first homology group, <span>\\(\\textrm{H}_1(S,{\\mathbb {F}})\\)</span>, with coefficients in a field <span>\\({\\mathbb {F}}\\)</span>, of any given semi-algebraic set <span>\\(S \\subset \\textrm{R}^k\\)</span> defined by a closed formula. The complexity of the algorithm is bounded singly exponentially. More precisely, if the given quantifier-free formula involves <i>s</i> polynomials whose degrees are bounded by <i>d</i>, the complexity of the algorithm is bounded by <span>\\((s d)^{k^{O(1)}}\\)</span>. This algorithm generalizes well known algorithms having singly exponential complexity for computing a semi-algebraic basis of the zeroth homology group of semi-algebraic sets, which is equivalent to the problem of computing a set of points meeting every semi-algebraically connected component of the given semi-algebraic set at a unique point. It is not known how to compute such a basis for the higher homology groups with singly exponential complexity. As an intermediate step in our algorithm we construct a semi-algebraic subset <span>\\(\\Gamma \\)</span> of the given semi-algebraic set <i>S</i>, such that <span>\\(\\textrm{H}_q(S,\\Gamma ) = 0\\)</span> for <span>\\(q=0,1\\)</span>. We relate this construction to a basic theorem in complex algebraic geometry stating that for any affine variety <i>X</i> of dimension <i>n</i>, there exists Zariski closed subsets </p><span>$$\\begin{aligned} Z^{(n-1)} \\supset \\cdots \\supset Z^{(1)} \\supset Z^{(0)} \\end{aligned}$$</span><p>with <span>\\(\\dim _\\textrm{C}Z^{(i)} \\le i\\)</span>, and <span>\\(\\textrm{H}_q(X,Z^{(i)}) = 0\\)</span> for <span>\\(0 \\le q \\le i\\)</span>. We conjecture a quantitative version of this result in the semi-algebraic category, with <i>X</i> and <span>\\(Z^{(i)}\\)</span> replaced by closed semi-algebraic sets. We make initial progress on this conjecture by proving the existence of <span>\\(Z^{(0)}\\)</span> and <span>\\(Z^{(1)}\\)</span> with complexity bounded singly exponentially (previously, such an algorithm was known only for constructing <span>\\(Z^{(0)}\\)</span>).</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00454-024-00626-0","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Let \(\textrm{R}\) be a real closed field and \(\textrm{C}\) the algebraic closure of \(\textrm{R}\). We give an algorithm for computing a semi-algebraic basis for the first homology group, \(\textrm{H}_1(S,{\mathbb {F}})\), with coefficients in a field \({\mathbb {F}}\), of any given semi-algebraic set \(S \subset \textrm{R}^k\) defined by a closed formula. The complexity of the algorithm is bounded singly exponentially. More precisely, if the given quantifier-free formula involves s polynomials whose degrees are bounded by d, the complexity of the algorithm is bounded by \((s d)^{k^{O(1)}}\). This algorithm generalizes well known algorithms having singly exponential complexity for computing a semi-algebraic basis of the zeroth homology group of semi-algebraic sets, which is equivalent to the problem of computing a set of points meeting every semi-algebraically connected component of the given semi-algebraic set at a unique point. It is not known how to compute such a basis for the higher homology groups with singly exponential complexity. As an intermediate step in our algorithm we construct a semi-algebraic subset \(\Gamma \) of the given semi-algebraic set S, such that \(\textrm{H}_q(S,\Gamma ) = 0\) for \(q=0,1\). We relate this construction to a basic theorem in complex algebraic geometry stating that for any affine variety X of dimension n, there exists Zariski closed subsets
with \(\dim _\textrm{C}Z^{(i)} \le i\), and \(\textrm{H}_q(X,Z^{(i)}) = 0\) for \(0 \le q \le i\). We conjecture a quantitative version of this result in the semi-algebraic category, with X and \(Z^{(i)}\) replaced by closed semi-algebraic sets. We make initial progress on this conjecture by proving the existence of \(Z^{(0)}\) and \(Z^{(1)}\) with complexity bounded singly exponentially (previously, such an algorithm was known only for constructing \(Z^{(0)}\)).