Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2409.14869

Help | Advanced Search

Mathematics > Algebraic Geometry

arXiv:2409.14869 (math)
[Submitted on 23 Sep 2024 (v1) , last revised 5 Mar 2025 (this version, v2)]

Title: Quantitative approximate definable choices

Title: 定量近似可定义选择

Authors:Antonio Lerario, Luca Rizzi, Daniele Tiberio
Abstract: In semialgebraic geometry, projections play a prominent role. A definable choice is a semialgebraic selection of one point in every fiber of a projection. Definable choices exist by semialgebraic triviality, but their complexity depends exponentially on the number of variables. By allowing the selection to be approximate (in the Hausdorff sense), we improve on this result. In particular, we construct an approximate selection whose degree is linear in the complexity of the projection and does not depend on the number of variables. This work is motivated by infinite-dimensional applications, in particular to the Sard conjecture in sub-Riemannian geometry. To prove these results, we develop a general quantitative theory for Hausdorff approximations in semialgebraic geometry, which has independent interest.
Abstract: 在半代数几何中,投影起着重要作用。 一个可定义的选择是投影每个纤维中一点的半代数选择。 根据半代数平凡性,可定义的选择存在,但其复杂度随变量数量呈指数增长。 通过允许选择是近似的(在豪斯多夫意义下),我们改进了这一结果。 特别是,我们构造了一个近似选择,其次数与投影的复杂度成线性关系,并且不依赖于变量的数量。 这项工作受到无限维应用的启发,特别是对子黎曼几何中的Sard猜想。 为了证明这些结果,我们开发了一种关于半代数几何中豪斯多夫逼近的一般定量理论,这具有独立的兴趣。
Comments: accepted version, to appear on Mathematische Annalen
Subjects: Algebraic Geometry (math.AG) ; Differential Geometry (math.DG); Metric Geometry (math.MG)
MSC classes: 14P10, 53C17
Cite as: arXiv:2409.14869 [math.AG]
  (or arXiv:2409.14869v2 [math.AG] for this version)
  https://doi.org/10.48550/arXiv.2409.14869
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1007/s00208-025-03128-3
DOI(s) linking to related resources

Submission history

From: Luca Rizzi [view email]
[v1] Mon, 23 Sep 2024 10:07:24 UTC (44 KB)
[v2] Wed, 5 Mar 2025 09:28:12 UTC (45 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
math
< prev   |   next >
new | recent | 2024-09
Change to browse by:
math.AG
math.DG
math.MG

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号