Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 91 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 29 tok/s Pro
GPT-4o 98 tok/s
GPT OSS 120B 472 tok/s Pro
Kimi K2 196 tok/s Pro
2000 character limit reached

The Yomdin-Gromov algebraic lemma revisited (2009.02082v1)

Published 4 Sep 2020 in math.AG, math.CA, math.DS, and math.LO

Abstract: In 1987, Yomdin proved a lemma on smooth parametrizations of semialgebraic sets as part of his solution of Shub's entropy conjecture for $C\infty$ maps. The statement was further refined by Gromov, producing what is now known as the Yomdin-Gromov algebraic lemma. Several complete proofs based on Gromov's sketch have appeared in the literature, but these have been considerably more complicated than Gromov's original presentation due to some technical issues. In this note we give a proof that closely follows Gromov's original presentation. We prove a somewhat stronger statement, where the parameterizing maps are guaranteed to be \emph{cellular}. It turns out that this additional restriction, along with some elementary lemmas on differentiable functions in o-minimal structures, allows the induction to be carried out without technical difficulties.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube