Curve selection and Łojasiewicz inequalities
Suppose a calculation gives a small residual. Does that force a small error? If a function approaches a limiting value, how small can its gradient be? And when a set approaches a boundary point through a narrow curved region, can one follow that approach by an analytic path? These questions ask for different measurements of the same geometry. We will use function values as parameters for the gradient problem, error thresholds for the residual problem, and distance for the boundary problem.
Original exposition, examples and solutions: CC0 1.0 Universal. The classical results and the human mathematical methods used are credited in the final section.
Here definable means globally subanalytic. A map is definable if its graph is. A definable arc is a continuous definable map from a positive interval ; it can be constant or unbounded and need not have an endpoint in its target. All norms and manifold gradients below use the ambient Euclidean metric.
A polynomial shows why the two exponents differ
On the square , set
The zero set of is the origin, so measures the error in solving . Direct computation gives
The exponent four is necessary: on the vertical axis, an estimate would say . No works as .
For the gradient, the relevant comparison is different:
The first inequality uses for and . The last uses and . Again the vertical axis determines the smallest possible exponent, now : an exponent would require .
| Approach | Error | Residual | Gradient norm |
|---|---|---|---|
| , | |||
| , |
Thus raising an error to an integer power and raising a function value to an exponent below one are distinct operations. Our proofs must explain both, without assuming that a general function is polynomial or that its domain is closed.
What a one-variable parameter can tell us
We use three proved inputs from Analytic finiteness for preparation: finite analytic cells, Boolean operations, projection and closure, and convergent one-variable Puiseux expansions. Their roles are limited and explicit.
Every definable subset of the line is a finite union of points and intervals. Consequently a property holding at positive parameters arbitrarily close to zero holds on a whole interval after shrinking, provided its parameter set is definable. Every scalar definable function on such an interval has an expansion
convergent for small positive . It is analytic away from zero on that interval. Boundedness excludes negative powers; convergence to zero excludes a nonzero constant term. A nonzero function therefore has a first term , with rational . Differentiating (3) is legitimate after writing it as a convergent Laurent series in .
Here is the consequence that will control gradients.
Bounded-curve speed lemma. If is bounded and definable, then it has a limit . After shrinking it is analytic, and either it is constant or there are rational and such that
In particular it has finite length near zero.
Proof. Apply (3) to each coordinate. Its constant coefficient is the corresponding coordinate of . Among all nonconstant coordinates, let be the smallest first positive exponent after subtracting that constant. Termwise differentiation gives the stated bound, after enlarging to cover the finitely many coordinates. Finally .
We also need to select points subject to definable conditions. The precise fact is that every definable relation with nonempty fibres has a definable section. A full proof using compact subsets of locally closed fibres appears in the final proof section, Choosing a point without assuming that an open fibre has a minimum. Whenever we select a curve below, this fact gives a definable map; (3), coordinate by coordinate, supplies its eventual continuity and differentiability. No continuity of a section on its entire parameter space is assumed.
Why must a gradient exponent be less than one?
The useful parameter here is the function value itself. A curve that visits value at time must satisfy the chain rule with derivative one. A very small gradient would force that curve to move too fast for (4).
Level-set lemma. Let be a bounded definable submanifold, and let be definable and . There exist , and rational such that
Neither nor its level sets need be closed. The function need not extend continuously to every boundary point of .
Proof. Put . If zero is not an accumulation point of , choose below all its positive values; (5) is then vacuous, and , work. Otherwise contains . Define the least possible slope at level by
Every fibre is nonempty, so is finite and nonnegative. Infima of definable real families are definable: being a lower bound and having a point below every larger number are quantified conditions, handled by Boolean operations and projection. The gradient is definable as well. Its differential and tangent space can be expressed by limits of difference quotients in definable charts; the induced gradient is their unique Euclidean Riesz representative. None of these statements uses a minimum in (6).
First, for all sufficiently small positive . Otherwise its definable zero set contains an interval next to zero. On that interval select with
The map is bounded because is bounded, and it is nonconstant because its function values vary. The speed lemma gives (4). On the open set where , the function is , with gradient norm . Also . Therefore
which is impossible as .
We may now shrink so that . Its first Puiseux term is , where and . Choose, without requiring attainment of the infimum, a definable satisfying
Again is bounded and nonconstant. Combining its speed bound with the chain rule gives
Thus , and in particular . If , take ; if , take . For small , the lower Puiseux bound gives . Since every point on level has gradient norm at least , this proves (5).
Put . The maps used in this argument are then:
The derivative of the bottom map is one. The derivative of the top map is integrably bounded. The vertical derivative must supply the remaining size.
Gradient inequality at a boundary value. Let be a definable submanifold, let be definable and , and let . Suppose has a continuous extension at , of value . Then some neighborhood of , some , and some rational satisfy
Proof. Take for any positive finite , and apply the level-set lemma to on this bounded open submanifold. Its tangent spaces and induced gradient agree with those of . Continuity at supplies a smaller neighborhood where . Apply (5) where ; where the left side of (10) is zero. Set . Only continuity at the specified point was used.
For on , with integer , the selected level curve is . Its speed is , while the slope at level is . Equality holds in the chain-rule product. This explains directly the exponent .
How much residual is needed to sustain a fixed error?
Now let be any definable set and any definable functions. They need not be continuous. Assume is bounded. Think of as an error and as a residual. The following quantity asks for the smallest residual compatible with an error of at least :
The adjoined value one covers empty fibres. Thus is always defined, takes values in , is definable and is nondecreasing.
Arc-detected inequality. Suppose that for every definable arc ,
Then there are an integer and such that
Proof. We first show that for every fixed . If , then for every small there is with and . Definable selection gives such an . Its coordinates have Puiseux expansions, possibly with negative powers, so after shrinking it is a continuous definable arc. Along it and , contrary to (12). This argument permits an arc escaping to infinity; boundedness of the selected points was not assumed. Constant arcs are included in (12), so in particular forces .
Choose a positive bound for . Because is positive and bounded, its first Puiseux term at zero is with and rational . The exponent zero is allowed. Choose , so that
and choose an integer . On this interval, . On , monotonicity gives . Consequently
If , substitute into (11)–(14): . If , (13) is automatic. This proves the global statement with , including the part where the error is bounded away from zero and the empty-set case.
There is a particularly simple case which should not be hidden inside an asymptotic expansion. Suppose whenever , for some . For a positive bound of , take
For the left side is zero; for , one has . This includes the zero fibres. In a proof using the supremum of over small positive -fibres, this is exactly the branch where that supremum is identically zero. It has its own constants and requires no leading nonzero term.
Compact zero-set criterion. If is compact, are continuous and definable on , and , then (13) holds.
Proof. The function is bounded. For fixed , the set is compact. If it is nonempty, has a positive minimum on it: a zero of there would contradict the zero-set inclusion. If it is empty, (11) gives . Thus for every , and the argument (14) proves (13) directly. No limiting point of an arc has to be chosen for this compact argument.
Compactness cannot simply be omitted from that criterion. On , take and . Neither function vanishes, so the zero-set inclusion holds, but (13) would require for all . The escaping arc is the missing test in (12).
Can an analytic path stay inside a narrowing region?
Consider
Its closure contains the origin, but no straight ray through the origin stays in near that point. Indeed would have to be a constant strictly between and . In contrast,
lies in for both signs of every sufficiently small nonzero , and is analytic through zero. Curvature and a change of parameter are doing useful work.
Analytic curve selection. For a definable and , there is an analytic map with and for . One may also require membership for both signs of nonzero . If , the map can be chosen nonconstant and avoiding away from zero.
Proof. If is not an accumulation point of , then and the constant map suffices. Otherwise the definable set of positive distances accumulates at zero and therefore contains . Select a definable on each of these distance levels:
The coordinates of are bounded, tend to zero and have convergent Puiseux expansions. Choose a common denominator . In each coordinate, substitute into its expansion. The resulting exponents are even nonnegative integers, with positive exponents for every nonzero term. Their power series converge on a two-sided interval and define an analytic with value at zero. For either sign of , the series equals the actual , since . Hence (18) gives and .
The factor two is not a cosmetic addition: , while . For a local subanalytic set in an analytic manifold, first use a bounded coordinate neighborhood on which that set is globally subanalytic; the chart inverse carries this construction back to the manifold. Equivalently, if a one-sided analytic germ has already been obtained, , with sufficiently small, gives membership on both sides. This retains the full two-sided use of curve selection without asserting global definability of the manifold.
What extra information does distance from the endpoint give?
The gradient inequality (10) was proved using function-value levels. A separate estimate records geometric distance. Under the same hypotheses on , there are and a neighborhood of such that
Here is a proof which makes the uniform constant explicit as an existence assertion over the whole neighborhood, rather than merely proving one inequality on each individually chosen arc.
Translate to zero and subtract . If (19) failed for every neighborhood and constant, then for each small we could select with
This is a definable relation, so choose definably and shrink until it is analytic. Set . It tends to zero and has a positive leading Puiseux term; its derivative is positive for small . Thus it has a definable inverse on a positive interval. Reparameterize as , so that .
Every coordinate of is bounded by . In its Puiseux series every nonzero first exponent is consequently at least one. Differentiating shows . The function is nonzero and tends to zero by continuity at the origin. Write its first term as , with and rational . Then
For small , the chain rule now gives
where the last inequality is (20). Dividing by the nonzero contradicts . This proves (19), including points at which the gradient vanishes. In particular any such nearby point has . This radial argument is not an input to the proof of (10).
Choosing a point without assuming that an open fibre has a minimum
For completeness we prove the selection fact used above in all fibre dimensions at once.
Definable choice. If is definable and is its projection to , there is a definable with for every .
Proof. The empty-base case uses the empty map; for there is nothing to choose. Suppose . First make all fibres bounded by the semialgebraic homeomorphism
This is only a change of coordinates in the fibre; it is not a definition of global subanalyticity. Apply the finite cell theorem to the image under , and list its cells as . Each cell is locally closed. Indeed a continuous graph is closed relative to its base times , and a band is open relative to that product; induction from intervals and points proves the claim. A slice at a fixed base point is therefore locally closed as well.
For each , choose the least index for which the fibre is nonempty. This partitions into finitely many definable pieces. Fix such a piece for the construction. The set is bounded and locally closed. Put
The closure is taken in the fibre , not in the total parameter space. Its graph is definable by the quantified condition “every positive-radius ball in this fibre meets .” The set is nonempty and compact. Because is open in its own closure, is compact too. Define on
For fixed , this is continuous. It is positive at every point of and zero on when that set is present. Consequently its maximum on is positive, and the set of maximizing points is a nonempty compact subset of . Distance, the maximum, and are definable by quantified conditions on the bounded fibres. Their definability requires no prior selection theorem and no continuity in .
Choose the lexicographically least point of . Such a point exists: minimize its first coordinate on the compact set, then its second coordinate on the resulting compact subset, and so on through the finite list of coordinates. It is unique. The condition that a point lies in and no point of is lexicographically smaller defines its graph. Thus it is a definable function of . Finally apply and combine the finitely many base pieces.
The construction has the following chain of sets in each fibre:
Compactness is used only after the missing boundary has been excluded by maximizing its distance. Thus an open or unbounded original fibre presents no problem.
Exercises with complete solutions
Which exponent is forced by a narrow direction?
Let be an integer and put on . Determine the smallest integer for which can hold, and the smallest positive for which can hold near zero.
Solution. The vertical axis forces and . These bounds are attained. Since for , . For , subadditivity of the -power gives . Both terms are bounded by fixed multiples of . Thus the stated lower bounds are the exact exponents.
Why must the arc test include escape to infinity?
On , take and . Check the implication (12) for bounded definable arcs, then decide whether it implies (13).
Solution. On a bounded arc, its values lie in for some , so ; the antecedent of (12) cannot occur. Nevertheless (13) would require on all of , which fails. The definable arc , for , detects the failure. Restricting the theorem to bounded arcs would change its content.
Why is boundedness of the error necessary?
On , take and . Prove (12), and show that no global conclusion (13) is possible.
Solution. If , then , so (12) holds for every arc. But , whereas is unbounded for every . Hence no fixed works. The compact tail in (14) is an error bound , not an unspoken bound on the domain.
A slope infimum which is never a minimum
Let and . Compute (6) for . Explain how (8) still has a valid selection.
Solution. On level , put ; then and . Its derivative in is , so , approached as but never attained in . The definable curve lies in the required level for . Its slope tends to one, as does , so its slope is less than after shrinking. Approximate minimization is sufficient. Here , and any fixed rational gives a weaker valid local lower bound after adjusting constants.
Build a two-sided curve in a thin band
For , give an analytic curve through zero which lies in for both signs of a nonzero parameter. Show that no straight ray has the same property even on the positive side.
Solution. Take . For , its first coordinate is in , and its second is strictly between and . A ray with positive -component has constant ratio , whereas membership requires . That constant would have to be zero in the limit, which violates the strict lower inequality. A ray with nonpositive -component cannot enter the band.
The gradient exponent and the selected speed
On , let , extended continuously by zero at the endpoint. Compute the slope as a function of the value , the selected curve’s speed, and the least possible gradient exponent. Check the radial estimate as well.
Solution. The level curve is , with derivative . Its gradient norm is . Their product is one, so (9) is sharp with and . The estimate becomes , and holds near zero precisely when . Finally , so the distance-sensitive estimate holds with equality for .
Mathematical sources and proof-method credits
Guillaume Valette, On subanalytic geometry, arXiv:2507.23622v1, 31 July 2025, §2.2, pp. 47–50, is the human treatment used for the classical results: definable choice (Proposition 2.2.1), analytic curve selection (Lemma 2.2.3), the arc and compact inequalities (Theorem 2.2.5 and Corollary 2.2.6), the radial estimate (Lemma 2.2.8), and the gradient inequality (Corollary 2.2.9). The paper is cited here, not copied.
The reduction from a definable family to a selected one-variable witness, the use of convergent Puiseux orders, and the chain-rule comparison for the radial estimate are mathematical methods used from that treatment. Here the gradient theorem is proved instead by approximate minimum slopes on value levels and the speed of bounded selected curves; it does not use the arc inequality or a distance-defined auxiliary manifold. The residual theorem uses the minimum residual compatible with an error threshold, and compactness is applied directly to those threshold sets. The selection proof uses compact maximizing sets inside locally closed fibres. The polynomial tests, diagrams of maps and six solved exercises develop these arguments; no claim that the classical theorems or general methods are new is intended.
The current programme providers linked above supply finite analytic cells, the set operations and convergent Puiseux expansions. Their own human-source notices remain in force. The arguments here require no finite triangulation theorem for a noncompact analytic manifold.