Open MathsAll courses

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 (0,ϵ)(0,\epsilon); 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 [−1,1]2[-1,1]^2, set

P(x,y)=x2+y4,e(x,y)=x2+y2. P(x,y)=x^2+y^4,\qquad e(x,y)=\sqrt{x^2+y^2}.

The zero set of PP is the origin, so ee measures the error in solving P=0P=0. Direct computation gives

e4=(x2+y2)2≤2(x4+y4)≤2P.(1) e^4=(x^2+y^2)^2\le2(x^4+y^4)\le2P. \qquad\text{(1)}

The exponent four is necessary: on the vertical axis, an estimate eN≤CPe^N\le CP would say |y|N≤C|y|4|y|^N\le C|y|^4. No N<4N<4 works as y→0y\to0.

For the gradient, the relevant comparison is different:

∇P=(2x,4y3),P3/4≤|x|3/2+|y|3≤|x|+|y|3≤34|∇P|.(2) \nabla P=(2x,4y^3),\qquad P^{3/4}\le |x|^{3/2}+|y|^3 \le |x|+|y|^3\le\tfrac34|\nabla P|. \qquad\text{(2)}

The first inequality uses (u+v)r≤ur+vr(u+v)^r\le u^r+v^r for u,v≥0u,v\ge0 and 0<r<10<r<1. The last uses 2|x|≤|∇P|2|x|\le|\nabla P| and 4|y|3≤|∇P|4|y|^3\le|\nabla P|. Again the vertical axis determines the smallest possible exponent, now 3/43/4: an exponent ρ<3/4\rho<3/4 would require |y|4ρ≤4C|y|3|y|^{4\rho}\le4C|y|^3.

Approach Error ee Residual PP Gradient norm
(t,0)(t,0), t>0t>0 tt t2t^2 2t2t
(0,t)(0,t), t>0t>0 tt t4t^4 4t34t^3

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

u(t)=∑j≥j0ajtj/q,q∈ℤ>0,j0∈ℤ,(3) u(t)=\sum_{j\ge j_0}a_jt^{j/q},\qquad q\in\mathbb Z_{>0},\quad j_0\in\mathbb Z, \qquad\text{(3)}

convergent for small positive tt. 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 ctαct^\alpha, with rational α\alpha. Differentiating (3) is legitimate after writing it as a convergent Laurent series in t1/qt^{1/q}.

Here is the consequence that will control gradients.

Bounded-curve speed lemma. If z:(0,ϵ)→ℝnz:(0,\epsilon)\to\mathbb R^n is bounded and definable, then it has a limit bb. After shrinking it is analytic, and either it is constant or there are rational β>0\beta>0 and K>0K>0 such that

|z′(t)|≤Ktβ−1.(4) |z'(t)|\le Kt^{\beta-1}. \qquad\text{(4)}

In particular it has finite length near zero.

Proof. Apply (3) to each coordinate. Its constant coefficient is the corresponding coordinate of bb. Among all nonconstant coordinates, let β\beta be the smallest first positive exponent after subtracting that constant. Termwise differentiation gives the stated bound, after enlarging KK to cover the finitely many coordinates. Finally ∫0ηKtβ−1dt=Kηβ/β<∞\int_0^\eta Kt^{\beta-1}\,dt=K\eta^\beta/\beta<\infty. ▫\square

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 tt at time tt 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 U⊂ℝnU\subset\mathbb R^n be a bounded definable C1C^1 submanifold, and let F:U→ℝF:U\to\mathbb R be definable and C1C^1. There exist η>0\eta>0, c>0c>0 and rational ρ∈(0,1)\rho\in(0,1) such that

|∇UF(x)|≥c|F(x)|ρif x∈U and 0<|F(x)|<η.(5) |\nabla_U F(x)|\ge c|F(x)|^\rho \quad\text{if }x\in U\text{ and }0<|F(x)|<\eta. \qquad\text{(5)}

Neither UU nor its level sets need be closed. The function need not extend continuously to every boundary point of UU.

Proof. Put R=|F|(U)∩(0,∞)R=|F|(U)\cap(0,\infty). If zero is not an accumulation point of RR, choose η\eta below all its positive values; (5) is then vacuous, and c=1c=1, ρ=1/2\rho=1/2 work. Otherwise RR contains (0,η0)(0,\eta_0). Define the least possible slope at level tt by

h(t)=inf⁡{|∇UF(x)|:x∈U,|F(x)|=t},0<t<η0.(6) h(t)=\inf\{\,|\nabla_UF(x)|:x\in U,\ |F(x)|=t\,\}, \qquad 0<t<\eta_0. \qquad\text{(6)}

Every fibre is nonempty, so h(t)h(t) 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, h(t)>0h(t)>0 for all sufficiently small positive tt. Otherwise its definable zero set contains an interval next to zero. On that interval select z(t)∈Uz(t)\in U with

|F(z(t))|=t,|∇UF(z(t))|<t.(7) |F(z(t))|=t,\qquad |\nabla_UF(z(t))|<t. \qquad\text{(7)}

The map zz is bounded because UU is bounded, and it is nonconstant because its function values vary. The speed lemma gives (4). On the open set where F≠0F\ne0, the function |F||F| is C1C^1, with gradient norm |∇UF||\nabla_UF|. Also z′(t)∈Tz(t)Uz'(t)\in T_{z(t)}U. Therefore

1=|ddt|F(z(t))||≤|∇UF(z(t))||z′(t)|≤Ktβ, 1=\left|\frac{d}{dt}|F(z(t))|\right| \le |\nabla_UF(z(t))|\,|z'(t)| \le Kt^\beta,

which is impossible as t↓0t\downarrow0.

We may now shrink so that h>0h>0. Its first Puiseux term is atαat^\alpha, where a>0a>0 and α∈ℚ\alpha\in\mathbb Q. Choose, without requiring attainment of the infimum, a definable z(t)∈Uz(t)\in U satisfying

|F(z(t))|=t,|∇UF(z(t))|<2h(t).(8) |F(z(t))|=t,\qquad |\nabla_UF(z(t))|<2h(t). \qquad\text{(8)}

Again zz is bounded and nonconstant. Combining its speed bound with the chain rule gives

1≤2h(t)|z′(t)|≤K1tα+β−1.(9) 1\le 2h(t)|z'(t)|\le K_1t^{\alpha+\beta-1}. \qquad\text{(9)}

Thus α+β≤1\alpha+\beta\le1, and in particular α<1\alpha<1. If α>0\alpha>0, take ρ=α\rho=\alpha; if α≤0\alpha\le0, take ρ=1/2\rho=1/2. For small 0<t<10<t<1, the lower Puiseux bound gives h(t)≥(a/2)tα≥(a/2)tρh(t)\ge(a/2)t^\alpha\ge(a/2)t^\rho. Since every point on level tt has gradient norm at least h(t)h(t), this proves (5). ▫\square

Put Uη={x∈U:0<|F(x)|<η}U_\eta=\{x\in U:0<|F(x)|<\eta\}. The maps used in this argument are then:

(0,η)→zUη‖↓|F|(0,η)→id(0,η). \begin{array}{ccc} (0,\eta)&\overset{z}{\longrightarrow}&U_\eta\\ \Vert&&\downarrow |F|\\ (0,\eta)&\overset{\mathrm{id}}{\longrightarrow}&(0,\eta). \end{array}

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 M⊂ℝnM\subset\mathbb R^n be a definable C1C^1 submanifold, let f:M→ℝf:M\to\mathbb R be definable and C1C^1, and let a∈M¯a\in\overline M. Suppose ff has a continuous extension at aa, of value f(a)f(a). Then some neighborhood WW of aa, some C>0C>0, and some rational ρ∈(0,1)\rho\in(0,1) satisfy

|f(x)−f(a)|ρ≤C|∇Mf(x)|(x∈M∩W).(10) |f(x)-f(a)|^\rho\le C|\nabla_Mf(x)| \qquad(x\in M\cap W). \qquad\text{(10)}

Proof. Take U=M∩B(a,r)U=M\cap B(a,r) for any positive finite rr, and apply the level-set lemma to F=f−f(a)F=f-f(a) on this bounded open submanifold. Its tangent spaces and induced gradient agree with those of MM. Continuity at aa supplies a smaller neighborhood W⊂B(a,r)W\subset B(a,r) where |F|<η|F|<\eta. Apply (5) where F≠0F\ne0; where F=0F=0 the left side of (10) is zero. Set C=1/cC=1/c. Only continuity at the specified point was used. ▫\square

For f(x)=xmf(x)=x^m on (0,1)(0,1), with integer m≥2m\ge2, the selected level curve is z(t)=t1/mz(t)=t^{1/m}. Its speed is t1/m−1/mt^{1/m-1}/m, while the slope at level tt is mt1−1/mm t^{1-1/m}. Equality holds in the chain-rule product. This explains directly the exponent 1−1/m<11-1/m<1.

How much residual is needed to sustain a fixed error?

Now let AA be any definable set and f,g:A→ℝf,g:A\to\mathbb R any definable functions. They need not be continuous. Assume ff is bounded. Think of |f||f| as an error and |g||g| as a residual. The following quantity asks for the smallest residual compatible with an error of at least ss:

m(s)=inf⁡({min(1,|g(x)|):x∈A,|f(x)|≥s}∪{1}),s>0.(11) m(s)=\inf\left( \{\min(1,|g(x)|):x\in A,\ |f(x)|\ge s\}\cup\{1\} \right),\qquad s>0. \qquad\text{(11)}

The adjoined value one covers empty fibres. Thus mm is always defined, takes values in [0,1][0,1], is definable and is nondecreasing.

Arc-detected inequality. Suppose that for every definable arc γ:(0,ϵ)→A\gamma:(0,\epsilon)\to A,

g(γ(t))→0⇒f(γ(t))→0.(12) g(\gamma(t))\longrightarrow0 \quad\Longrightarrow\quad f(\gamma(t))\longrightarrow0. \qquad\text{(12)}

Then there are an integer N≥1N\ge1 and C>0C>0 such that

|f(x)|N≤C|g(x)|(x∈A).(13) |f(x)|^N\le C|g(x)|\qquad(x\in A). \qquad\text{(13)}

Proof. We first show that m(s)>0m(s)>0 for every fixed s>0s>0. If m(s)=0m(s)=0, then for every small r>0r>0 there is x∈Ax\in A with |f(x)|≥s|f(x)|\ge s and |g(x)|<r|g(x)|<r. Definable selection gives such an x=x(r)x=x(r). Its coordinates have Puiseux expansions, possibly with negative powers, so after shrinking it is a continuous definable arc. Along it g→0g\to0 and |f|≥s|f|\ge s, 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 g=0g=0 forces f=0f=0.

Choose a positive bound M≥1M\ge1 for |f||f|. Because mm is positive and bounded, its first Puiseux term at zero is asαas^\alpha with a>0a>0 and rational α≥0\alpha\ge0. The exponent zero is allowed. Choose 0<η<10<\eta<1, c0>0c_0>0 so that

m(s)≥c0sα(0<s<η), m(s)\ge c_0s^\alpha\quad(0<s<\eta),

and choose an integer N≥max⁡(1,α)N\ge\max(1,\alpha). On this interval, sN≤sαs^N\le s^\alpha. On [η,M][\eta,M], monotonicity gives m(s)≥m(η)≥m(η)sN/MNm(s)\ge m(\eta)\ge m(\eta)s^N/M^N. Consequently

m(s)≥csN(0<s≤M),c=min⁡{c0,m(η)/MN}>0.(14) m(s)\ge c s^N\quad(0<s\le M),\qquad c=\min\{c_0,m(\eta)/M^N\}>0. \qquad\text{(14)}

If |f(x)|>0|f(x)|>0, substitute s=|f(x)|s=|f(x)| into (11)–(14): c|f(x)|N≤m(|f(x)|)≤|g(x)|c|f(x)|^N\le m(|f(x)|)\le |g(x)|. If f(x)=0f(x)=0, (13) is automatic. This proves the global statement with C=1/cC=1/c, including the part where the error is bounded away from zero and the empty-set case. ▫\square

There is a particularly simple case which should not be hidden inside an asymptotic expansion. Suppose f=0f=0 whenever |g|<δ|g|<\delta, for some δ>0\delta>0. For a positive bound MM of |f||f|, take

N=1,C=max⁡{1,M/δ}.(15) N=1,\qquad C=\max\{1,M/\delta\}. \qquad\text{(15)}

For |g|<δ|g|<\delta the left side is zero; for |g|≥δ|g|\ge\delta, one has |f|≤M≤(M/δ)|g||f|\le M\le(M/\delta)|g|. This includes the zero fibres. In a proof using the supremum of |f||f| over small positive |g||g|-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 AA is compact, f,gf,g are continuous and definable on AA, and g−1(0)⊂f−1(0)g^{-1}(0)\subset f^{-1}(0), then (13) holds.

Proof. The function ff is bounded. For fixed s>0s>0, the set As={x∈A:|f(x)|≥s}A_s=\{x\in A:|f(x)|\ge s\} is compact. If it is nonempty, |g||g| has a positive minimum on it: a zero of gg there would contradict the zero-set inclusion. If it is empty, (11) gives m(s)=1m(s)=1. Thus m(s)>0m(s)>0 for every s>0s>0, and the argument (14) proves (13) directly. No limiting point of an arc has to be chosen for this compact argument. ▫\square

Compactness cannot simply be omitted from that criterion. On [1,∞)[1,\infty), take f=1f=1 and g(x)=1/xg(x)=1/x. Neither function vanishes, so the zero-set inclusion holds, but (13) would require 1≤C/x1\le C/x for all x≥1x\ge1. The escaping arc γ(t)=1/t\gamma(t)=1/t is the missing test in (12).

Can an analytic path stay inside a narrowing region?

Consider

A={(x,y):0<x<1,x2<y<x2+x5}.(16) A=\{(x,y):0<x<1,\ x^2<y<x^2+x^5\}. \qquad\text{(16)}

Its closure contains the origin, but no straight ray through the origin stays in AA near that point. Indeed y/xy/x would have to be a constant strictly between xx and x+x4x+x^4. In contrast,

γ(t)=(t2,t4+12t10)(17) \gamma(t)=(t^2,t^4+\tfrac12t^{10}) \qquad\text{(17)}

lies in AA for both signs of every sufficiently small nonzero tt, and is analytic through zero. Curvature and a change of parameter are doing useful work.

Analytic curve selection. For a definable A⊂ℝnA\subset\mathbb R^n and a∈A¯a\in\overline A, there is an analytic map γ:(−ϵ,ϵ)→ℝn\gamma:(-\epsilon,\epsilon)\to\mathbb R^n with γ(0)=a\gamma(0)=a and γ(t)∈A\gamma(t)\in A for 0<t<ϵ0<t<\epsilon. One may also require membership for both signs of nonzero tt. If a∈A\{a}¯a\in\overline{A\setminus\{a\}}, the map can be chosen nonconstant and avoiding aa away from zero.

Proof. If aa is not an accumulation point of A\{a}A\setminus\{a\}, then a∈Aa\in A and the constant map suffices. Otherwise the definable set of positive distances {|x−a|:x∈A\{a}}\{|x-a|:x\in A\setminus\{a\}\} accumulates at zero and therefore contains (0,δ)(0,\delta). Select a definable z(r)∈Az(r)\in A on each of these distance levels:

|z(r)−a|=r,0<r<δ.(18) |z(r)-a|=r,\qquad 0<r<\delta. \qquad\text{(18)}

The coordinates of z−az-a are bounded, tend to zero and have convergent Puiseux expansions. Choose a common denominator qq. In each coordinate, substitute r=t2qr=t^{2q} 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 γ\gamma with value aa at zero. For either sign of t≠0t\ne0, the series equals the actual z(t2q)z(t^{2q}), since (t2q)j/q=t2j(t^{2q})^{j/q}=t^{2j}. Hence (18) gives γ(t)∈A\gamma(t)\in A and |γ(t)−a|=t2q>0|\gamma(t)-a|=t^{2q}>0. ▫\square

The factor two is not a cosmetic addition: t2=|t|\sqrt{t^2}=|t|, while t4=t2\sqrt{t^4}=t^2. 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, t↦γ(ct2)t\mapsto\gamma(c t^2), with c>0c>0 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 M,f,aM,f,a, there are C0>0C_0>0 and a neighborhood of aa such that

|f(x)−f(a)|≤C0|x−a||∇Mf(x)|.(19) |f(x)-f(a)|\le C_0|x-a|\,|\nabla_Mf(x)|. \qquad\text{(19)}

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 aa to zero and subtract f(a)f(a). If (19) failed for every neighborhood and constant, then for each small s>0s>0 we could select x(s)∈Mx(s)\in M with

0<|x(s)|<s,f(x(s))≠0,|x(s)||∇Mf(x(s))|<s|f(x(s))|.(20) 0<|x(s)|<s,\qquad f(x(s))\ne0,\qquad |x(s)|\,|\nabla_Mf(x(s))|<s|f(x(s))|. \qquad\text{(20)}

This is a definable relation, so choose xx definably and shrink until it is analytic. Set r(s)=|x(s)|r(s)=|x(s)|. It tends to zero and has a positive leading Puiseux term; its derivative is positive for small ss. Thus it has a definable inverse s=s(r)s=s(r) on a positive interval. Reparameterize as z(r)=x(s(r))z(r)=x(s(r)), so that |z(r)|=r|z(r)|=r.

Every coordinate of zz is bounded by rr. In its Puiseux series every nonzero first exponent is consequently at least one. Differentiating shows |z′(r)|≤K|z'(r)|\le K. The function u(r)=f(z(r))u(r)=f(z(r)) is nonzero and tends to zero by continuity at the origin. Write its first term as drλdr^\lambda, with d≠0d\ne0 and rational λ>0\lambda>0. Then

r|u′(r)||u(r)|→λ. \frac{r|u'(r)|}{|u(r)|}\longrightarrow\lambda.

For small rr, the chain rule now gives

λ2|u(r)|≤r|u′(r)|≤Kr|∇Mf(z(r))|<Ks(r)|u(r)|, \tfrac\lambda2|u(r)| \le r|u'(r)| \le Kr|\nabla_Mf(z(r))| <K s(r)|u(r)|,

where the last inequality is (20). Dividing by the nonzero |u(r)||u(r)| contradicts s(r)→0s(r)\to0. This proves (19), including points at which the gradient vanishes. In particular any such nearby point has f(x)=f(a)f(x)=f(a). 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 E⊂ℝm×ℝnE\subset\mathbb R^m\times\mathbb R^n is definable and BB is its projection to ℝm\mathbb R^m, there is a definable s:B→ℝns:B\to\mathbb R^n with (b,s(b))∈E(b,s(b))\in E for every b∈Bb\in B.

Proof. The empty-base case uses the empty map; for n=0n=0 there is nothing to choose. Suppose n≥1n\ge1. First make all fibres bounded by the semialgebraic homeomorphism

T:ℝn→B(0,1),T(y)=y1+|y|2,T−1(v)=v1−|v|2.(21) T:\mathbb R^n\longrightarrow B(0,1),\qquad T(y)=\frac{y}{\sqrt{1+|y|^2}},\qquad T^{-1}(v)=\frac{v}{\sqrt{1-|v|^2}}. \qquad\text{(21)}

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 E′E' under (b,y)↦(b,T(y))(b,y)\mapsto(b,T(y)), and list its cells as C1,…,CkC_1,\ldots,C_k. Each cell is locally closed. Indeed a continuous graph is closed relative to its base times ℝ\mathbb R, 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 b∈Bb\in B, choose the least index ii for which the fibre C=(Ci)bC=(C_i)_b is nonempty. This partitions BB into finitely many definable pieces. Fix such a piece for the construction. The set CC is bounded and locally closed. Put

Kb=C¯,Db=Kb\C. K_b=\overline C,\qquad D_b=K_b\setminus C.

The closure is taken in the fibre ℝn\mathbb R^n, not in the total parameter space. Its graph is definable by the quantified condition “every positive-radius ball in this fibre meets CC.” The set KbK_b is nonempty and compact. Because CC is open in its own closure, DbD_b is compact too. Define on KbK_b

δb(v)={dist⁡(v,Db),Db≠⌀,1,Db=⌀.(22) \delta_b(v)= \begin{cases} \operatorname{dist}(v,D_b),&D_b\ne\varnothing,\\ 1,&D_b=\varnothing. \end{cases} \qquad\text{(22)}

For fixed bb, this is continuous. It is positive at every point of CC and zero on DbD_b when that set is present. Consequently its maximum on KbK_b is positive, and the set QbQ_b of maximizing points is a nonempty compact subset of CC. Distance, the maximum, and QbQ_b are definable by quantified conditions on the bounded fibres. Their definability requires no prior selection theorem and no continuity in bb.

Choose the lexicographically least point of QbQ_b. 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 QbQ_b and no point of QbQ_b is lexicographically smaller defines its graph. Thus it is a definable function of bb. Finally apply T−1T^{-1} and combine the finitely many base pieces.

The construction has the following chain of sets in each fibre:

C⊂Kb,⌀≠Qb=argmaxKbδb⊂C,{vb}=lexmin⁡Qb. C\subset K_b,\qquad \varnothing\ne Q_b=\operatorname*{argmax}_{K_b}\delta_b\subset C, \qquad \{v_b\}=\operatorname{lexmin}Q_b.

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. ▫\square

Exercises with complete solutions

Which exponent is forced by a narrow direction?

Let m≥2m\ge2 be an integer and put Pm(x,y)=x2+y2mP_m(x,y)=x^2+y^{2m} on [−1,1]2[-1,1]^2. Determine the smallest integer NN for which (x2+y2)N/2≤CPm(x^2+y^2)^{N/2}\le CP_m can hold, and the smallest positive ρ\rho for which Pmρ≤C|∇Pm|P_m^\rho\le C|\nabla P_m| can hold near zero.

Solution. The vertical axis forces N≥2mN\ge2m and ρ≥1−1/(2m)\rho\ge1-1/(2m). These bounds are attained. Since (a+b)m≤2m−1(am+bm)(a+b)^m\le2^{m-1}(a^m+b^m) for a,b≥0a,b\ge0, (x2+y2)m≤2m−1(x2m+y2m)≤2m−1Pm(x^2+y^2)^m\le2^{m-1}(x^{2m}+y^{2m})\le2^{m-1}P_m. For ρ=1−1/(2m)\rho=1-1/(2m), subadditivity of the ρ\rho-power gives Pmρ≤|x|2−1/m+|y|2m−1≤|x|+|y|2m−1P_m^\rho\le |x|^{2-1/m}+|y|^{2m-1}\le |x|+|y|^{2m-1}. Both terms are bounded by fixed multiples of |∇Pm|=4x2+4m2y4m−2|\nabla P_m|=\sqrt{4x^2+4m^2y^{4m-2}}. Thus the stated lower bounds are the exact exponents.

Why must the arc test include escape to infinity?

On A=[1,∞)A=[1,\infty), take f=1f=1 and g(x)=1/xg(x)=1/x. Check the implication (12) for bounded definable arcs, then decide whether it implies (13).

Solution. On a bounded arc, its values lie in [1,R][1,R] for some RR, so g≥1/Rg\ge1/R; the antecedent of (12) cannot occur. Nevertheless (13) would require 1≤C/x1\le C/x on all of AA, which fails. The definable arc x(t)=1/tx(t)=1/t, for 0<t<10<t<1, detects the failure. Restricting the theorem to bounded arcs would change its content.

Why is boundedness of the error necessary?

On A=(0,∞)A=(0,\infty), take f(x)=xf(x)=x and g(x)=x/(1+x)g(x)=x/(1+x). Prove (12), and show that no global conclusion (13) is possible.

Solution. If g(x(t))→0g(x(t))\to0, then x(t)=g(x(t))/(1−g(x(t)))→0x(t)=g(x(t))/(1-g(x(t)))\to0, so (12) holds for every arc. But g<1g<1, whereas f(x)N=xNf(x)^N=x^N is unbounded for every N≥1N\ge1. Hence no fixed CC works. The compact tail in (14) is an error bound |f|≤M|f|\le M, not an unspoken bound on the domain.

A slope infimum which is never a minimum

Let U=(0,1)2U=(0,1)^2 and F(x,y)=x(1+y)F(x,y)=x(1+y). Compute (6) for 0<t<10<t<1. Explain how (8) still has a valid selection.

Solution. On level tt, put v=1+y∈(1,2)v=1+y\in(1,2); then x=t/v∈(0,1)x=t/v\in(0,1) and |∇F|2=v2+t2/v2|\nabla F|^2=v^2+t^2/v^2. Its derivative in vv is 2v−2t2/v3>02v-2t^2/v^3>0, so h(t)=1+t2h(t)=\sqrt{1+t^2}, approached as y↓0y\downarrow0 but never attained in UU. The definable curve z(t)=(t/(1+t),t)z(t)=(t/(1+t),t) lies in the required level for 0<t<10<t<1. Its slope tends to one, as does h(t)h(t), so its slope is less than 2h(t)2h(t) after shrinking. Approximate minimization is sufficient. Here α=0\alpha=0, and any fixed rational ρ∈(0,1)\rho\in(0,1) gives a weaker valid local lower bound after adjusting constants.

Build a two-sided curve in a thin band

For A={(x,y):0<x<1,x3<y<x3+x7}A=\{(x,y):0<x<1,\ x^3<y<x^3+x^7\}, give an analytic curve through zero which lies in AA for both signs of a nonzero parameter. Show that no straight ray has the same property even on the positive side.

Solution. Take γ(t)=(t2,t6+12t14)\gamma(t)=(t^2,t^6+\tfrac12t^{14}). For 0<|t|<10<|t|<1, its first coordinate is in (0,1)(0,1), and its second is strictly between x3=t6x^3=t^6 and x3+x7=t6+t14x^3+x^7=t^6+t^{14}. A ray with positive xx-component has constant ratio y/xy/x, whereas membership requires x2<y/x<x2+x6x^2<y/x<x^2+x^6. That constant would have to be zero in the limit, which violates the strict lower inequality. A ray with nonpositive xx-component cannot enter the band.

The gradient exponent and the selected speed

On M=(0,1)M=(0,1), let f(x)=x3/2f(x)=x^{3/2}, extended continuously by zero at the endpoint. Compute the slope as a function of the value t=f(x)t=f(x), the selected curve’s speed, and the least possible gradient exponent. Check the radial estimate as well.

Solution. The level curve is x(t)=t2/3x(t)=t^{2/3}, with derivative (2/3)t−1/3(2/3)t^{-1/3}. Its gradient norm is (3/2)t1/3(3/2)t^{1/3}. Their product is one, so (9) is sharp with α=1/3\alpha=1/3 and β=2/3\beta=2/3. The estimate fρ≤C|f′|f^\rho\le C|f'| becomes x3ρ/2≤(3C/2)x1/2x^{3\rho/2}\le(3C/2)x^{1/2}, and holds near zero precisely when ρ≥1/3\rho\ge1/3. Finally f(x)=23x|f′(x)|f(x)=\tfrac23 x|f'(x)|, so the distance-sensitive estimate holds with equality for C0=2/3C_0=2/3.

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.