Efficient Computation of a Semi-Algebraic Basis of the First Homology Group of a Semi-Algebraic Set

Pub Date : 2024-02-22 DOI:10.1007/s00454-024-00626-0
Saugata Basu, Sarah Percival
{"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

$$\begin{aligned} Z^{(n-1)} \supset \cdots \supset Z^{(1)} \supset Z^{(0)} \end{aligned}$$

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)}\)).

Abstract Image

分享
查看原文
半代数集合第一同调群的半代数基的高效计算
让 \(\textrm{R}\) 是一个实闭域,而 \(\textrm{C}\) 是 \(\textrm{R}\) 的代数闭包。我们给出了一种算法,用于计算任何给定的由闭式定义的半代数集合 \(S \subset \textrm{R}^k\) 的第一同调群的半代数基,其系数在一个域 \({\mathbb {F}}\) 中。该算法的复杂度以单倍指数为界。更准确地说,如果给定的无量纲公式涉及 s 个多项式,而这些多项式的度数以 d 为界,那么算法的复杂度以 \((s d)^{k^{O(1)}}\) 为界。这种算法推广了已知的计算半代数集合零次同调群的半代数基的算法,这种算法具有单指数复杂度,等价于计算一个点集,这个点集与给定半代数集合的每个半代数连接分量在一个唯一的点上相遇。目前还不知道如何以指数级的复杂度计算高次同调群的这种基础。作为我们算法的中间步骤,我们为给定的半代数集合 S 构造一个半代数子集 \(\Gamma \),使得 \(textrm{H}_q(S,\Gamma ) = 0\) for \(q=0,1\).我们将这一构造与复代数几何中的一个基本定理联系起来,该定理指出,对于任何维数为 n 的仿射综 X,都存在 Zariski 闭子集 $$\begin{aligned} Z^{(n-1) }。Z^{(n-1)} \supset \cdots \supset Z^{(1)} \supset Z^{(0)} \end{aligned}$$with \(\dim _\textrm{C}Z^{(i)} \le i\), and \(\textrm{H}_q(X,Z^{(i)}) = 0\) for \(0 \le q \le i\).我们猜想这一结果在半代数范畴中的定量版本,即用封闭的半代数集合代替 X 和 \(Z^{(i)}\) 。我们证明了复杂度以单倍指数为界的\(Z^{(0)}\)和\(Z^{(1)}\)的存在,从而在这一猜想上取得了初步进展(在此之前,这种算法只知道用于构造\(Z^{(0)}\))。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信