On a Nash curve selection lemma through finitely many points
Abstract
A celebrated theorem in Real Algebraic and Analytic Geometry (originally due to Bruhat-Cartan and Wallace and stated later in its current form by Milnor) is the (Nash) curve selection lemma. It states that each point in the closure of a semialgebraic set S⊂ Rn can be reached by a Nash arc of Rn such that at least one of its branches is contained in S. The purpose of this work is to generalize the previous result to finitely many points. More precisely, let S⊂n be a semialgebraic set, let x1,…,xr∈ S be r points (that we call `control points') and 0=:t1<…<tr:=1 be r values (that we call `control times'). A natural `logistic' question concerns the existence of a smooth and semialgebraic (Nash) path α:[0,1] S that passes through the control points at the control times, that is, α(tk)=xk for k=1,…,r. The necessary and sufficient condition to guarantee the existence of α when the number of control points is large enough and they are in general position is that is connected by analytic paths. The existence of generic real algebraic sets that do not contain rational curves confirms that the analogous result involving polynomial paths (instead of Nash paths) is only possible under additional restrictions. A sufficient condition is that ⊂n has in addition dimension n. A related problem concerns the approximation by a Nash path of an existing continuous semialgebraic path β:[0,1] S with control points x1,…,xr∈ and control times 0=:t1<…<tr:=1. A sufficient condition is that the (finite) set of values η(β) at which β is not smooth is contained in the set of regular points of S and η(β) does not meet the set of control times.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.