Analytic finiteness for preparation
Human treatment: Guillaume Valette, On subanalytic geometry, arXiv:2507.23622v1, 31 July 2025, §1.3.2, §§1.4–1.5, the preliminaries in §1.6.1, Proposition 1.6.12, Lemma 1.6.13, Proposition 1.6.14, the dimension induction and cell/preparation theorems in §§1.7–1.8, and the one-variable and parameterized Puiseux results. Adapted by GPT-6.1 Sol (OpenAI), Ultra, October 2026. This adapted component is CC BY 4.0; Guillaume Valette remains the author of the underlying exposition. Changes: notation and Markdown/MathML formatting; the algebra prerequisites and degree-zero case are proved; the module and prescribed-jet versions of the formal linear argument are expanded; real Noetherianity is obtained from the course’s existing division proof; the normalizing parameters are allowed either sign, and the uniform derivative bound is proved. Further additions prove independent-variable convergence of the analytic split, localize on the actual compact image, and give a signed balanced-coordinate substitution under the stated cell-induction inputs. Further proof expansions give bounded-monomial unit representations, compact-domain substitution, common translations, dominance, positive and negative power-coordinate pullbacks, and the complete ordinary polynomial reduction. The simultaneous dimension induction is completed below. Further expansions specify the projective product convention, prove elementary witness operations and the bounded local comparison, and supply parameter convergence and the two-sided even-power substitution. These changes imply no endorsement.
The preparation argument for subanalytic functions needs more than the preparation of a single regular germ. A function can vanish identically in on some parameter fibres. We prove that finitely many coefficient germs nevertheless control it:
The are its actual Taylor coefficients in , and the are convergent analytic units. We then normalize this finite family to obtain an analytic family whose order in is uniformly bounded. The later sections prove the unit and coordinate preliminaries and ordinary nondegenerate analytic preparation, with the lower-dimensional induction explicit. The later sections complete the two-coordinate assembly, joint dimension induction, global cell and preparation theorems, complement theorem and convergent Puiseux results.
Real analytic division and finite generation
Write
These are germs at zero; translation gives the same statements at any real point. A germ is a unit precisely when its constant term is nonzero. One direction follows by evaluation. In the other direction the reciprocal of a nonvanishing analytic representative is analytic. Thus is local, with maximal ideal . The displayed generators of this ideal follow by grouping a convergent series with zero constant term according to the first variable appearing in each monomial; the resulting series converge on a smaller polydisc.
The course already contains the full complex preparation and Cauchy division argument, adapted from Jean-Pierre Demailly, in Preparation by the zeros in one fibre and Division, finite generation and elementary algebra. Demailly’s treatment remains under his custom OpenContent grant, as identified in that lesson. We reuse that existing provider by reference.
Here is the additional real argument. Complexify the convergent real series. If a real germ is regular of order in the last variable, complex preparation gives its unique monic Weierstrass polynomial and unit. Conjugating every coefficient gives another preparation of the same germ. Uniqueness makes both factors real. Similarly, the unique division
is fixed by coefficient conjugation when and are real. It therefore supplies division in , with . A nonzero real homogeneous polynomial has a real vector at which it is nonzero: successive consideration as a polynomial in one variable proves that a polynomial vanishing everywhere on has every coefficient zero. Choose such a vector for the first nonzero homogeneous term. A real linear change of coordinates then makes the germ regular in the last variable.
We record the module argument used here and below. Over a Noetherian ring , every submodule of is finitely generated. Induct on . Project a submodule onto its last coordinate. The image is a finitely generated ideal; lift a finite set of its generators. The kernel is a submodule of and has finite generators by induction. Those lifts together with the kernel generators generate the original submodule. Any finite -module is a quotient of , so the inverse image under this quotient proves the same assertion for its submodules.
Noetherianity of real convergent germs. Induct on , starting with the field . If is a nonzero ideal, choose a nonzero element, make it regular by a real coordinate change, and prepare it. Its unit is invertible, so its monic polynomial belongs to . Division by this fixed polynomial sends to an -submodule of . Choose finitely many remainders generating that submodule. Each remainder is in , since it is for an . For any , express its remainder as an -linear combination of these . The division identity then writes in the ideal generated by . The zero ideal needs no generators. Hence every ideal of is finitely generated.
Using a single regular polynomial and division is essential to this proof. Preparation of individual germs in a preassigned direction alone does not justify generation of an arbitrary ideal by polynomials in that direction.
Polynomial rings and stable filtrations
First we supply the algebra used in Valette’s finiteness proof.
Hilbert basis theorem. If is Noetherian, so is .
Proof. Let be a nonzero polynomial ideal. Its leading coefficients, together with zero, form an ideal of : to add two of them, multiply the corresponding polynomials by powers of to align their degrees. Choose polynomials whose leading coefficients generate this ideal, and put . For of degree , subtract an -linear combination of with the same leading coefficient. This lowers the degree. Repetition terminates with a polynomial of degree less than . The polynomials in of degree less than form a submodule of , and hence have finitely many module generators . The generate as an ideal. If , the reduction has zero remainder. The zero ideal is already finite. Induction proves the assertion for finitely many polynomial variables. Any quotient of such a ring is also Noetherian, by taking inverse images of ideals.
Let now be Noetherian, an ideal, and a finite -module. An -filtration is a decreasing sequence of submodules , indexed by , with . It is stable if for all sufficiently large . Introduce the Rees ring and module
Here , and each element has finitely many homogeneous terms. If generate , the map
is surjective. The Hilbert basis theorem makes Noetherian.
Stable-filtration criterion. is a finite -module if and only if is stable.
Proof. A finite set of polynomial generators can be replaced by all its homogeneous components. Those components are still in the Rees module, include a generating set, and are finite in number. Let their degrees be at most . Compare homogeneous terms of degree , where . A generator , , has coefficient in in such an expression. Because
its contribution is in . Hence , and the reverse inclusion is the filtration condition.
Conversely, if for , then for . Each is finite, by the module argument above. Choose its generators in every degree . They generate the entire Rees module. Degree zero is included also when stability starts immediately.
If and is stable, then
is a submodule over the Noetherian ring . It is finite, so the criterion proves that is stable. Taking gives the following form of Artin–Rees:
for some . In particular,
This argument works for every ideal of a Noetherian ring. Valette uses the case of the maximal ideal of a Noetherian local ring.
Krull intersection for modules
Assume now that is Noetherian and local, with maximal ideal . If a finite module satisfies , then . Indeed, if , choose a generating set of least possible size. Express
The coefficient is a unit: otherwise both it and would belong to the unique maximal ideal, forcing . The displayed relation then eliminates , contradicting minimality. This proves the needed form of Nakayama’s lemma.
Krull intersection. For a finite -module ,
Proof. Put . It is a finite submodule of . Artin–Rees applied to says, for sufficiently large ,
Nakayama gives .
Apply this to . Its powers are the images of , so
Every submodule of a finite module is therefore closed for the -adic topology. In particular, for an ideal ,
Locality matters in this conclusion. In , the ideals and satisfy for every positive , although is proper. This is why the local hypothesis cannot be dropped when interpreting the last intersection formula.
Formal linear solutions have convergent replacements
Let , , and let
be an -linear map, represented by a matrix of convergent series. Suppose , and the corresponding formal equation has a solution :
Linear convergence theorem. There is an with . Moreover, for each prescribed integer , can be chosen with the same Taylor coefficients as in every degree less than .
Proof of existence. Truncate each to degree at most , obtaining a polynomial . Then
The reason is coefficientwise: multiplying by a convergent series cannot lower the degree of the omitted formal terms. The difference on the left is convergent, and a convergent series whose terms of degree less than vanish belongs to . To see the latter assertion, assign each monomial to a degree- monomial dividing it, and factor that monomial out. There are finitely many divisors of this degree, and the remaining series converge on a smaller polydisc.
Thus belongs to for every . Submodule closedness gives , proving existence.
Proof with a prescribed jet. For , let be the Taylor polynomial of in degrees less than . A formal series of order at least can be grouped by the finitely many degree- monomials:
Consequently the finite linear equation
has a formal solution. The existence argument already proved gives convergent solutions . Set . This has the required jet and solves . For , use existence alone.
The theorem gives a replacement solution. It does not say that the originally chosen formal series converge. It is a statement about finite linear systems; a nonlinear approximation theorem has not been used.
A finite Taylor family with analytic units
Let be a real analytic germ at . Translating, suppose , and write its convergent expansion
Each is a convergent analytic germ in . Noetherianity says that the ideal generated by all the is generated by a finite subfamily. Enlarging that finite subfamily, choose an initial segment generating the ideal. For , choose convergent germs with
There is no assertion that the infinitely many share a convergence estimate. Instead, work formally. Put
Every exponent of is nonnegative. For any fixed total degree only finitely many can contribute, so this is a well-defined formal series. Coefficient comparison gives
Equivalently, the finite linear equation
has a formal solution. The linear convergence theorem, applied in variables, supplies convergent solutions . Define
Then , and
On a sufficiently small common neighbourhood all are nonzero. After undoing translation, this proves the announced finite Taylor-unit decomposition. If , take . A coefficient that happens to vanish identically may likewise be retained with unit .
This is Valette’s Proposition 1.3.11, using Corollary 1.3.10. The linear-convergence step is what makes the decomposition analytic; purely formal manipulation of the infinite coefficients would not suffice.
Signed normalization and a uniform order bound
Here is the precise normalization used in the next preparation step. Suppose on a neighbourhood of that
For , let
Uniform regularity. There is a neighbourhood of and a constant such that
In particular the order of in , at each such point, is at most .
Proof. At , the derivatives of of orders vanish, and its derivative of order is . Therefore the linear map from to the derivatives of of orders at this point is triangular with nonzero diagonal. The higher , , do not enter these derivatives. Because , these derivatives cannot all vanish. Their maximum is continuous and positive on the compact set , so it has a positive minimum, say . Uniform continuity of the finitely many derivatives on a compact product times a small closed box supplies on which that maximum remains at least .
If is a parameter map, set . On any piece where and for all ,
The normalizing vector lies in , including when some ratios are negative. On the piece where every , the function is identically zero and needs no normalization. Ordering these coefficient functions into suitable analytic cells belongs to the dimension induction in the full preparation proof; it has not been assumed in proving the uniform bound.
For a function analytic near a compact parameter-image closure, first choose finitely many smaller boxes where the Taylor-unit decomposition and this bound hold. Such boxes exist by the local statements and compactness. Their preimages provide a finite cover. The compatible refinement for that cover is supplied by the cell induction below.
How this supplies the geometric argument
The written chain is now
The already written curve-selection and Łojasiewicz treatment additionally needs finite analytic cell decomposition and convergent Puiseux preparation. The later sections complete its reduction, complement and Puiseux providers under the explicitly specified projective product definition.
A convergent split before restricting to a hyperbola
Let be real analytic near , where . Its real series complexifies. Choose such that this complexification is holomorphic on a neighborhood of the closed polydisc of common radius , centered at , and bounded there by . Write
Repeated one-variable Cauchy coefficient estimates give
Define, using an independent variable ,
These series converge as functions of independent variables. In the first one set . Its absolute terms are bounded by
Summing them gives the finite bound
whenever every displayed ratio is less than one. In the second series put ; its analogous bound is
On each strictly smaller closed polydisc these bounds are uniform geometric majorants. Thus the series define holomorphic functions of and , respectively, on the indicated open polydiscs. Their real restrictions are analytic. In particular, both functions are analytic on neighborhoods of compact boxes with
Now impose . An term becomes
and a term becomes . Absolute convergence permits the two subseries to be recombined. Therefore
For , putting gives Valette’s Lemma 1.6.13 splitting identity with fully convergent functions. For , the identity with independent still holds, so no division is needed for the limiting statement. No sign restriction on has been imposed.
For example, for , the construction gives
Hence when . The equality includes the mixed diagonal in the minus series and the off-diagonal in the plus series, as required by the index convention.
Localize on the actual image, rather than a larger product
Suppose is well defined and bounded on a set , and is analytic on an open neighborhood of
Then is compact. Write , so on . There are three local descriptions, covering every .
If , define
on the inverse image of under the analytic map , with . It is analytic on a neighborhood of . Choose a small closed box about that point whose neighborhood lies in this inverse image, and on which . By continuity, there is a neighborhood of such that
Consequently, on the portion of mapping into , the original function is , analytic in its last coordinate on the required compact box.
If , instead define
The same argument gives a compact box where is analytic on a neighborhood and , and a neighborhood whose images lie in its interior. Here the original function is analytic in the coordinate . Notice that on this portion of the original domain because there and is bounded away from zero; the fibre-coordinate change can therefore be inverted.
If , then is an actual point of . The function is analytic near this point, so the convergent splitting just proved applies. Choose a smaller neighborhood such that its points satisfy the splitting bounds and both compact maps
fit in the interiors of the respective boxes of analyticity.
The cover ; extract a finite subcover. Their preimages under cover . This proves the finite analytic localization without any cell theorem. In the full induction, the finite two-coordinate localization below turns these finitely many preimages into compatible cells before applying cell reductions.
The existence of near does not imply analyticity near for every . Those points can lie outside . The proof uses the split only at the third type of point, and uses the two nonsingular-coordinate descriptions at the other points. No analytic extension to a larger parameter product is required.
The signed balanced-coordinate calculation
The following calculation is the remaining analytic mechanism in Valette’s balanced case, conditional on the stated nondegenerate reductions and translation dichotomy from the preceding cell induction.
Work on a piece where and both split contributions
are nonzero and comparable in absolute value, with constants uniform on the piece. Suppose that the ordinary analytic preparation step has supplied, with nonzero base coefficients , nonnegative rational exponents , and uniformly bounded nonvanishing units,
Here the coefficients and translations depend only on the base variables. The preceding translation dichotomy has three possibilities.
If , take . If , take . In either case .
If neither comparison holds and the dichotomy supplies reductions with both translations zero, comparability gives
Therefore take
The denominator exponent is positive because . Again . No positive-sign assumption on was needed.
Set
The ratio is bounded and bounded away from zero. Since and are bounded, comparability bounds , and
is bounded as well. Thus is bounded. Define
On the open set , this is analytic wherever the inner map lands in . That condition holds on a neighborhood of : at each of its points, , and continuity maps it into , since the equality
holds on . The open inverse image of therefore contains the compact closure. Hence the original function is a restricted analytic composition in the last coordinate , with base parameters . Pulling back the resulting preparation through uses the power-coordinate result proved below, including its zero-scale and sign cases and its explicit lower-dimensional induction input.
If , the original function is and belongs directly to the ordinary analytic-composition case. If one split contribution vanishes, the other is the whole function. The balanced calculation is used only after these cases are separated.
This proves the analytic splitting, actual-compact-image localization and signed balanced substitution. The sections below prove the compatible endpoint refinements, ordinary nondegenerate reduction, translation dichotomy, analytic unit representations and coordinate pullbacks using the lower-dimensional induction. The later sections complete the full two-coordinate assembly and joint dimension induction.
Analytic units and the lower-dimensional induction
This section adapts Valette’s definitions in §§1.4–1.5 and the preliminaries in §1.6.1. The additional bounded-monomial construction and compact-image arguments supply the unit representations used in the source’s abbreviated calculations.
An -function is obtained by finitely many sums, products and compositions from restricted real analytic functions and rational powers, on domains where these expressions are defined. A restricted analytic function is analytic on a neighborhood of a compact cube. Its restriction and all the expressions below retain their stated domains. We consider such functions on -cells: inductively, graphs and open bands of analytic -functions over lower-dimensional cells, with infinite band endpoints allowed.
Fix a dimension , write for the first coordinates and for the last, and work in the dimension induction. The lower-dimensional package says that finitely many -functions on supplied lower-dimensional cells can be made analytic, of constant sign and pairwise ordered on a common finite cell refinement. Their domains and any finitely many supplied cells can be respected by that refinement. These are the induction hypotheses in dimensions less than ; the full preparation and arbitrary-set cell theorem in dimension are not being assumed here.
For a cell with base , take an analytic base translation with its graph disjoint from , and put . An analytic -unit in has the form
The base functions are analytic -functions, the whole argument map is bounded, and is analytic and nonzero on a neighborhood of its compact image closure. Shrinking that neighborhood if necessary is permitted. A reduced function is
with analytic -coefficient . The zero coefficient is allowed. A unit is uniformly bounded and bounded away from zero on , by compactness. In the arguments below we prove the requisite analytic representation; uniform bounds alone are not used as a substitute for it.
Cells are connected. For a graph this follows from connectedness of the base. A finite band has a continuous parametrization from using its endpoints. A one-sided band is parametrized from , and a band with both endpoints infinite is . Induction proves connectedness in all cases. Hence a continuous nonzero unit has constant sign on a cell.
Finite endpoint refinements
Given finitely many cells in , together with finitely many analytic -functions on their bases, there is a finite cylindrical refinement respecting the supplied cells and any graphs or bands cut out by these functions.
Proof in the dimension induction. Refine the bases with the lower-dimensional package so that every relevant function is analytic and every pairwise difference has constant sign. Include all finite endpoints defining the original cells. On a fixed base cell, two of these functions are either identical or strictly ordered everywhere. Remove repeated identical endpoints and list the others in order. Their graphs and the intervening bands, including the two outer infinite bands, partition that whole cylinder. They are analytic -cells. Each supplied cell is a union of these cells, because its base and all its endpoints were respected. There are finitely many bases and endpoints.
This also supplies a common refinement of finitely many existing cell decompositions. It does not assume that an arbitrary globally subanalytic set has a cell decomposition.
A graph cell can be handled entirely in the lower dimension. Substituting into a well-defined finite -expression gives an -function of . Make it analytic on a lower-dimensional refinement. On the graph choose , so , take , and use that base function as coefficient. In particular graph cells require no inverse last-coordinate map.
A base function on a band is also reduced after cutting at : on the nonzero bands take ; handle the possible graph as just described. The finite endpoint refinement supplies these pieces even when the original band has both endpoints infinite.
If is already reduced, refine the base so has constant sign. The distance is positive, and the unit is continuous and nonzero. Thus has constant sign on each resulting cell. All these sign refinements use only the lower-dimensional package.
Collecting bounded monomials into two coordinates
Let on a cell with base . Suppose that a finite family
is bounded on the cell, with -coefficients . There may also be finitely many bounded base parameters. After a lower-dimensional refinement, all these arguments can be written as polynomials of bounded base parameters and just two bounded arguments
where is an integer and are nonnegative analytic -functions. Either of may be identically zero.
Proof. Choose so every is an integer. Refine the base so each is analytic and identically zero, strictly positive or strictly negative. For , put ; order these finitely many functions on the base and choose their largest, . If this family is empty or all its coefficients vanish, put . Otherwise . In that case
where . Moreover
so is bounded. With , all these are zero and their representation is immediate.
For , similarly put , choose the largest , and obtain
The ratios lie in , and is bounded. If all negative-exponent coefficients vanish, put . For , the argument is the base function , which is bounded on : every base point has a nonempty fibre. Include these and the original bounded base parameters among the new base parameters. All roots, ratios and choices are -functions and are analytic after the lower-dimensional refinement. This proves the claim.
There is a useful compact-domain consequence. Let be the new bounded argument map, and let be the polynomial map recovering all old arguments. Then
Indeed every point of the left-hand domain is the limit of a sequence of new argument values, and polynomial continuity recovers the limit of the old ones. Thus, if an outer analytic function was given only near the old compact image, its composite with is analytic near the new compact image: take the open inverse image of its domain. No extension to a larger parameter box has been assumed. If the old function was nonzero on that image closure, the composite is nonzero on the new one as well.
Consequently a finite list of bounded monomial arguments can be used in a unit representation without requiring one separate forward or inverse coordinate for each exponent.
Closure and substitution for analytic units
Products, reciprocals and powers. Finitely many units with the same distance have a common two-coordinate argument map. Apply the bounded-monomial construction to their finitely many original forward/inverse arguments and concatenate the bounded base parameters. The recovered old maps are polynomial maps of the new arguments. Compose the outer analytic functions with these maps. Their product is analytic and nonzero near the new compact closure. The same holds for reciprocals.
For a rational power of the absolute value of a unit, first fix its sign on the cell. The signed analytic outer function is positive on the compact image and hence on a smaller neighborhood. Its real rational power is analytic there. Thus is a unit for every . Integer powers retain the corresponding constant sign if desired.
Change of distance. Suppose is another distance, and on a cell it has a reduction
where , , and is a positive unit in . Every unit originally expressed in becomes a unit in .
To prove this rather than infer it from bounds, write each original bounded monomial argument as
Since and its reciprocal are uniformly bounded, the monomial is bounded whenever the original argument is bounded. Collect these finitely many monomials, together with the bounded monomial arguments representing , into two coordinates. Recover by its analytic outer function, take its positive analytic rational powers, and multiply by the recovered monomials. These operations define an analytic map near the new compact closure. On the actual cell the resulting map is exactly the old argument map, so its closure maps into the old compact closure. The old analytic outer function can therefore be composed on a neighborhood of that new compact closure. It remains nonzero there. This is the required unit representation.
In particular if was reduced in , it becomes
reduced in . The unit in parentheses has just been proved to have the required analytic form.
A common translation for finitely many reductions
Suppose are reduced on a cell , with translations , each disjoint from . After a finite endpoint refinement, all are reduced with one common translation.
Proof. First fix signs and order the base functions as necessary. Comparing the distances and only requires cutting at their midpoint: the squared-distance difference is
The finite endpoint refinement therefore makes these distance comparisons constant on each piece. Choose an index with
throughout the piece. This distance is strictly positive because ’s graph is outside the original cell.
For a fixed , put and . If identically, the two distances are equal. Otherwise refine at the endpoints , and fix the sign of .
On , put . The nearest-distance condition says . Squaring gives . Hence
The argument is a bounded forward monomial, and is positive and at least on its compact closure. Thus this is a reduced distance with exponent zero and an explicit unit in .
On , put . Now , and the nearest-distance condition gives . Since , it follows that . Therefore
This is a bounded inverse monomial and a positive analytic unit. The case is included by taking the unit .
We have expressed each old distance as , with or , positive , and an explicit positive unit. The distance-substitution result converts each complete reduction, including its old unit, to the common translation . There are only finitely many indices and endpoints.
Products of reducible functions are now reducible: use a common refinement and translation, multiply the base coefficients, add the rational exponents, and multiply the units. A quotient is handled similarly on its stated domain where the denominator is nonzero. Its nonzero base coefficient can be inverted after the base sign refinement. No zero denominator is silently included.
Dominant and comparable pieces
Let be reduced, and let . There is a finite endpoint refinement on which one of
holds on every piece, with uniform positive comparability constants in the last case.
Proof. Give the functions a common translation. Their zero base coefficients are separated first. Where both are nonzero, write
The compact unit bounds give constants such that
Choose . Cut at the two levels
They are ordered because . Below the first, . Above the second, . Between them the displayed unit bounds give a fixed positive lower bound and a fixed finite upper bound on .
If , these cuts involve only base functions and use the lower-dimensional package. Otherwise each positive level corresponds to
This is a positive analytic -function of the base on the nonzero-coefficient pieces. The endpoints give the needed finite refinement. A negative exponent merely reverses the ordering of the inequalities. The threshold graphs are included as separate cells. If one function is zero, the corresponding dominance assertion is immediate; if both vanish, both inequalities hold.
Zero translation or comparison with the coordinate
After a finite refinement, a given reduction with translation can be arranged so that either , or and have the same sign.
Proof. Graph cells are handled in the lower dimension. On nonzero-coordinate bands, cut at , fix the sign of , and compare with and . These are finite base endpoints. If , there is nothing to change.
If , put . Then
The ratio is a bounded inverse monomial in , and its analytic unit is positive. If , then
This is a base factor times a unit of a bounded forward monomial in . In both cases the distance-substitution theorem changes the full reduction to translation zero.
In the remaining comparable case, if signs are opposite then
Again the inverse argument and analytic unit are explicit, so use translation zero. With the same sign retain the old translation, which satisfies the claimed comparison.
Pullback through a power coordinate
Consider
on a cell where it is well defined. If a function is reducible on the image cells of , its composite with is reducible after a finite refinement.
First handle graph cells as above. Refine the base into constant-sign pieces for , and cut at . If , the image lies in the graph of zero; evaluating the expression on that graph is a lower-dimensional -function. Its pullback is a base function, handled by the graph/band rule. If is in the domain, it is already a graph cell. For , such points are excluded by the stated domain.
It remains to work with and , with both signs fixed. The fibre map is analytic and strictly monotone. With and , its inverse on the branch is
Thus the image of a graph or band is a graph or band, and the preimage of an image cell is again such a cell. Its finite endpoints are analytic -functions after lower-dimensional refinement; zero and infinite endpoints are interpreted by one-sided limits. In particular a supplied finite image refinement pulls back to finitely many cells.
On one such image piece a reduction has an old positive distance . Its pullback is
We give explicit reductions of this distance.
For , put .
If , then . If , put and cut at . On ,
on ,
In each case the ratio lies in , is a bounded monomial in , and that ratio is a positive analytic unit. These are reductions with translation zero.
If , cut at and , using the base endpoints . The two outer regions give respectively
with the ratios in . On the middle region , use
This polynomial is positive on . The numerator vanishes precisely at , which is outside the pulled-back image piece because the old distance was positive there. Put
Split at that numerator’s graph if necessary. On each nonzero piece,
For , . For , . Thus stays strictly positive on its compact argument interval, and
is an explicit reduction with translation . Its last factor is analytic and nonzero near that compact interval; is a bounded forward argument. This proves the required unit representation even near the new translation. For , , and the same formula holds.
For , if the distance is simply . Otherwise,
The positive-power distance on the right has just been reduced. The additional factor is reduced with translation zero. Give the two factors a common translation and multiply their reductions. This reduces for negative as well.
Finally substitute the reduction of into the whole original reduction: the distance-substitution theorem proves that the old unit remains a unit in the new distance. Coefficients and exponents transform accordingly. This proves the pullback assertion. With , a nonnegative original exponent stays nonnegative: the positive-power distance reductions have exponents or . No such claim is needed or made for negative .
Bounded arguments of a general analytic composition
Let be reduced on a cell, and assume is bounded. Let be analytic near . After a common translation and refinement, the composite has the form
where the complete argument map is bounded and is analytic near its actual compact image closure.
Proof. Write . Each monomial is bounded because is bounded and is bounded away from zero. Collect these monomials and every unit’s bounded monomial arguments by the two-coordinate construction. Recover every by its analytic outer function, then every by multiplication. The compact-image consequence ensures that this analytic recovery map is defined near the whole new compact closure and maps it into . Composing with therefore gives the claimed . Zero coefficients are allowed and cause no division.
If , the power-coordinate change gives
The base product is bounded: it equals on the cell, and every base point has a fibre. Thus the general composition is precisely the two-coordinate analytic form in the previously proved splitting/localization argument. The power-coordinate pullback just proved justifies returning to the original distance.
If , only the inverse coordinate remains; use and ordinary analytic preparation in that coordinate, followed by the negative-power pullback. If , the function depends only on the base and uses the lower-dimensional package. These are separate cases, so normalizing a zero forward coefficient to one is never required.
This completes the explicit unit, translation, dominance, power-coordinate and bounded-argument preliminaries in the dimension induction. The next section proves the ordinary nondegenerate polynomial reduction. The subsequent two-coordinate proof and joint dimension induction complete these remaining steps.
Ordinary analytic preparation without a cell-theorem assumption
We now prove Valette’s Proposition 1.6.12, including its polynomial reduction. Throughout this section, only the lower-dimensional package in the preceding unit and refinement arguments is assumed. The induction on the analytic order below is a separate induction in the fixed ambient dimension. It does not assume preparation of arbitrary functions in that dimension.
Ordinary preparation statement. Let be an -cell with base . Suppose
is bounded on , where the are -functions on . Let be analytic on an open neighborhood of . Then has a finite cell refinement on which it is reduced with a nonnegative rational exponent. The coefficient is allowed to vanish identically. We call such a reduction nondegenerate.
All local analytic functions used below are restricted to closed boxes contained in their domains. Composing a function analytic near a compact base image with that base map gives a lower-dimensional -function after a finite localization: take a finite box cover, refine the base at the finitely many coordinate bounds using the lower-dimensional package, and on each resulting piece use its box’s restricted analytic function. Thus coefficient compositions and changes of base coordinates below use only the established lower-dimensional induction.
Finite localization and signed normalization
First make the analytic by the lower-dimensional package. A graph cell is treated in that dimension, as in the graph rule. We can therefore work with bands.
At every point , the finiteness theorem already proved gives, on a sufficiently small box,
Shrink the box so its closed closure lies in the domain of this identity and in the neighborhood on which the signed uniform-regularity argument applies. These smaller open boxes cover . Choose a finite subcover. Membership in the inverse image of such a box is specified by bounds on the base functions and by constant bounds on . Lower-dimensional base refinements followed by finite endpoint refinements respect all these inverse images. Every resulting piece of fits inside one of the selected closed boxes. This construction uses no cell decomposition for arbitrary subanalytic sets.
On one such piece, put . Refine the base so every has constant sign and the functions are ordered. If all vanish, the displayed identity makes the function zero. Otherwise choose an index where their maximum is attained. Then and
With
we have .
The previously proved signed normalization shows that, after the stated shrinking, is regular in of order at most on the entire compact normalized parameter set in question. In particular the same bound holds on , even if tends to zero: the normalized parameters stay in and the coordinate remains exactly one on that closure. Multiplication by the base coefficient preserves a nonnegative last-coordinate exponent. It remains to prove the statement for an analytic function with a uniform finite regularity bound on its actual compact image.
Induction on the regularity bound
Suppose an analytic function is regular in its last coordinate at every point of the relevant compact image, with order at most . We prove the nondegenerate preparation statement by induction on .
For , the function is nonzero on the compact image. It is therefore an analytic unit after a finite box localization. On a nonzero-coordinate band, write the bounded last coordinate as , with . Its analytic outer function, evaluated at the bounded arguments , is a unit with translation zero and exponent zero. The graph is handled in the lower dimension. The same argument applies to any analytic nonvanishing factor arising below.
For , at every compact-image point Weierstrass preparation supplies an analytic nonvanishing factor and a monic polynomial in the last coordinate, of degree . Translate a constant local last-coordinate center into the polynomial’s coefficients. Take closed boxes inside these preparation neighborhoods, extract a finite cover, and refine their inverse images by the same base-bound and endpoint construction as before.
Fix a resulting band. Up to its nonvanishing analytic factor, the function is
where all coefficients are analytic -functions of the base and bounded there. Boundedness follows from continuity on the selected compact parameter box and the nonempty fibres over the base. Degree zero is already the unit case.
For , set
The inverse substitution cancels the coefficient of , leaving
The graph or band is carried to a graph or band with translated endpoints. All are bounded analytic -functions of the base. If , or if all vanish, this polynomial is . Its zero graph uses the lower-dimensional rule; off that graph it is .
Otherwise refine the base so each has constant sign and the roots are ordered. Choose a maximizing index , and put
The function is bounded and analytic on this base piece. Refine at and , including the resulting graphs. On any graph, substitution gives a lower-dimensional function, with exponent zero. The two types of remaining bands are handled as follows.
Outside the scale: an explicit polynomial unit
Where , the polynomial satisfies
Fix the sign . Every argument is bounded. The bounded-monomial collection writes the finite family using two bounded unit arguments. The analytic outer function is at least on the actual compact argument closure. It is therefore nonzero on a neighborhood of that closure and is an analytic -unit. Thus this is a reduction with translation zero and exponent , including the correct constant sign .
Uniform bounds by themselves would not have supplied the unit representation. The preceding collection argument supplies the representation and its analytic domain.
Inside the scale: the analytic order strictly decreases
Where , use the nonzero fibre coordinate . Its image is a cell after the previously proved nonzero-scale power-coordinate construction, with and scale on each sign branch. Put
Then
The full parameter map is bounded. Its compact image closure still satisfies with the fixed sign, so not every is zero there.
At every point of this closure, the order of in is at most . Indeed, if the derivatives of orders all vanished, then
would first give . At zero, for every ,
All these coefficients would vanish, contradicting . This calculation proves the strict decrease throughout the compact closure, including its boundary; mere nonvanishing on the open cell would not suffice.
The induction hypothesis for analytic order, applied to and this bounded map, now gives a nondegenerate reduction in . Pull it back through . The positive-power pullback theorem preserves a nonnegative exponent. Multiply by the base factor . This proves a nondegenerate reduction of on the inner bands as well.
Restore the analytic factor and the coordinate
The Weierstrass factor is nonzero near its actual compact image. In the coordinate , its bounded original arguments are recovered analytically from bounded base parameters and ; on a fixed sign band . It is consequently a unit with translation zero. Give its reduction and the polynomial’s reduction a common translation using the explicit distance-substitution theorem, then multiply.
The common-translation construction replaces a distance by a positive base factor times either the zeroth or first power of the new distance times a positive unit. Hence nonnegative exponents remain nonnegative. This point also covers the nonvanishing factor, whose exponent was zero.
Finally pull back the affine change . A translation in becomes in , and the positive distance is unchanged exactly:
The bounded unit argument map is therefore the same map after substitution. The new center’s graph is disjoint from the pulled-back cell because the old center’s graph was disjoint from the image cell. Coefficients, unit domains and nonnegative exponents all persist.
There were finitely many normalization boxes, finitely many Weierstrass boxes and finitely many scale and sign pieces. In the inner case the integer analytic-order bound strictly decreased; in the outer case the polynomial reduced immediately. The induction terminates. Multiplying back the signed normalizing coefficient completes the ordinary preparation statement.
This proves ordinary nondegenerate preparation with the lower-dimensional induction as its sole cell input. Together with the unit, translation, dominance, power-coordinate and bounded-argument proofs, it discharges those particular inputs in the preceding splitting and balanced calculation. The next sections conclude the full two-coordinate assembly and joint dimension induction, and then prove arbitrary -preparation and globally subanalytic cell decomposition.
Full analytic reduction in a coordinate and its inverse
We complete Valette’s Proposition 1.6.14 using the analytic split, actual-image localization, unit arguments and ordinary preparation already proved. The cell input throughout this section remains the explicit lower-dimensional package.
Two-coordinate preparation. Let be an -cell on which , with base . Let be -functions on , and suppose
is bounded on . If is analytic near , then is reducible on a finite cell refinement.
The base function is bounded: writing , we have , and every base point has a nonempty fibre. Make all base functions analytic by the lower-dimensional package. Graph cells use lower-dimensional substitution. Separate , where the function is the ordinary analytic composition . On the remaining bands and are nonzero, with fixed signs.
The finite localization really has compatible cells
At a point of where , the function
is analytic near the corresponding point . Choose a closed box inside this domain, bounded away from . Its inverse image is described by finitely many bounds on the base functions and constant bounds on . Thus the lower-dimensional package and finite endpoint refinement make it a union of cells. Ordinary preparation applies on those cells.
At a point where , use instead
The map is an analytic monotone fibre map on the nonzero fixed-sign branches. It is the power-coordinate map with and scale . Its image is a cell. Choose a closed analytic-domain box for , bounded away from ; refine its inverse image in the -coordinate by base bounds and constant endpoints. Pull the resulting cells back with the proved power-coordinate construction. Ordinary preparation in , followed by that pullback, reduces the original function on these pieces.
Only actual points need the convergent splitting lemma. Around such a point choose a closed -box and sufficiently small closed -intervals, so the identity
holds, with both outer functions analytic on neighborhoods of the compact argument boxes. Bounds on again give compatible finite refinements: the first bounds are lower-dimensional, the second are constant endpoints, and the last pull back constant endpoints under . The independent -radius in the convergence proof contains on these chosen boxes.
These neighborhoods form an open cover of the actual compact image ; extract a finite subcover and take a common refinement of their inverse images. This proves the required localization without assuming preparation of arbitrary sets in the current dimension and without extending to a larger product of parameter closures.
Keep the two nondegenerate reductions before changing coordinates
On a splitting piece set
Ordinary preparation supplies a nondegenerate reduction of in and of in . The latter is then pulled back through . Hence both and are reducible.
Retain their original ordinary reductions as well as their pulled-back reductions. On finite refinements these give
The nonnegative exponents refer to the respective and reductions, before the inverse-coordinate pullback. That pullback is not asserted to preserve them. Restricting these formulas to further cells preserves their compact unit bounds.
Separate zero coefficients first. If either contribution vanishes, the other is the whole function. Otherwise apply the dominance refinement with to their pulled-back reductions. Each resulting piece is dominant in one direction or has .
Dominance gives an analytic unit, not just bounds
Suppose and . Give the two functions a common translation and write their ratio as
where is an analytic unit. The monomial is bounded because is bounded away from zero. Collect this monomial together with all bounded arguments representing into two coordinates. Their analytic recovery map represents by an analytic outer function near the new compact argument closure.
On that closure the recovered ratio lies in , by continuity and approximation from actual argument values. Consequently is represented by an analytic function taking values in there. It remains nonzero on a neighborhood of the compact closure and is an analytic -unit in . Thus
is reduced. This proves the needed analytic unit representation rather than inferring it from uniform nonvanishing alone. Interchanging the two contributions handles the other dominant case. A zero denominator in this calculation was already separated.
The balanced scale completes the analytic reduction
Now suppose both contributions are nonzero and comparable. Apply the zero-translation/comparison dichotomy to the retained ordinary reductions in and in . Pull the latter refinements back through and take a common refinement. Graph pieces are lower-dimensional cases. The nondegenerate exponents in the respective ordinary coordinates remain nonnegative, since that dichotomy replaces each distance by a base factor times either the zeroth or first power of the new distance times a unit.
If , choose . If , choose . In either case . In the remaining case both translations are zero. Comparability then says
so take
This is a positive analytic base -function on the refined piece; . No sign of a contribution, , or has been discarded.
As in the signed balanced calculation already proved, set
The complete map is bounded, and is bounded away from zero. In fact and . The analytic recovery map
maps into : it is continuous there and agrees with on the actual cell. Therefore
is analytic near the entire transformed compact image closure. Ordinary preparation applies with last coordinate and base parameters . Pull it back through , the power-coordinate map with nonzero scale on the fixed-sign branch. This reduces the original function in the balanced case.
All cases and covers are finite. This proves the full two-coordinate preparation statement.
Closure under bounded analytic composition
Let be reducible on an -cell , assume is bounded, and let be analytic near . Then is reducible.
Take a common finite refinement and translation, put , and use the bounded-argument collection proved earlier. It writes the composite as
with , a bounded complete argument map, and an analytic outer function near its actual compact image closure. On each fixed-sign branch, the affine distance coordinate carries the cell bijectively to an -cell with positive last coordinate.
If , put and . Both and are bounded, and is a bounded base function. The composite has precisely the form . Apply full two-coordinate preparation in , then the proved power-coordinate pullback with .
If , only remains. Apply ordinary analytic preparation in , then the negative-power pullback with . If , the composite depends only on the base and uses the lower-dimensional package, with a finite analytic box localization if needed. Thus a zero forward coefficient is never normalized to one.
Return from the distance coordinate to : on a branch with sign , a center in becomes , and
The unit argument map and disjoint-center condition are unchanged under this bijective substitution. Graph cells throughout use lower-dimensional evaluation. This proves the claimed closure.
Close the dimension induction for finite expressions
We make explicit the simultaneous induction package that was used above.
In dimension , the package consists of:
- A finite list of -expressions well defined on supplied -cells has a finite cell refinement on which every expression is reduced.
- Such a list can be made analytic, of constant sign, and pairwise ordered.
- Finitely many supplied cells and existing finite cell refinements admit a common finite cylindrical refinement; their finite expression domains and sign conditions are respected.
Here a finite expression uses coordinate functions and constants, restricted analytic functions on their stated compact cubes, sums, products, and rational powers on their stated real domains. General finite compositions can be expanded into such an expression. Restriction to a supplied cell does not assert a cell theorem for an arbitrary subset of its domain.
The package is immediate in dimension zero, where a cell is a point and well-defined functions have constant values. Assume it in all smaller dimensions. The preceding unit, endpoint, power-coordinate, ordinary-order and two-coordinate arguments then apply in dimension , and give bounded analytic composition closure there.
Coordinate functions are reduced. A base coordinate uses the base-function rule. The last coordinate, off its zero graph, is , with translation zero, exponent one and unit one; its zero graph uses the lower-dimensional rule. Constants are base functions.
Products are reduced by common translation and unit multiplication. A rational power of a nonzero reduced function is reduced on its stated real branch: fix the signs, take the corresponding rational power of the base absolute value and of the positive absolute unit, and multiply the exponent by that rational number. The unit power is analytic on a neighborhood of its positive compact image. Integer powers include their constant sign factor. Zero pieces are treated only where the power is defined; positive powers extended to zero give zero, while negative powers exclude zero. The exponent-zero function is the constant one on its stated domain. No convention about an undefined or a negative noninteger branch is introduced.
For a sum , the dominance/comparability refinement supplies pieces where, after possibly exchanging , for a fixed finite . Separate , which then also forces . Otherwise is reduced and bounded. Bounded analytic composition, applied to the analytic function , reduces , including all its cancellation zeros. Multiplication by reduces . In this argument is not claimed to be a unit: it may vanish.
A restricted analytic composition of already reduced inputs is reduced by the bounded analytic composition theorem, since its well-defined inputs lie in its stated compact cube. If a generator is defined to be zero outside that cube, first refine using the coordinate bounds on its already treated inputs. Use the sum case just proved to reduce their differences from the constant cube endpoints: both terms are already reduced. Those differences have constant sign after base refinement. On each resulting piece either the input is in the cube, including its boundary, or the generator is the constant zero. Thus the usual zero-extended convention causes no extra arbitrary-set assumption. Induction on the finite expression complexity proves assertion 1 without an assumption about arbitrary current-dimensional cell decomposition.
A reduced function is analytic on its cell: its positive distance, rational powers and bounded analytic unit arguments are analytic there. Refine its base so its coefficient has constant sign, using the lower-dimensional package. The distance is positive and the nonvanishing continuous unit has constant sign on the connected cell. Thus the function has constant sign. Apply the already proved expression result to the finitely many pairwise differences to order any finite list. This proves assertion 2.
For assertion 3, first use the smaller-dimensional package to refine all bases of the finitely many supplied cells, then order their finite endpoint functions there. Their distinct graphs and intervening bands form the required finite cylindrical refinement, with outer infinite bands included. Apply this also to the finitely many cells in all the expression refinements just obtained. A reduction restricts to a subcell: its old center remains disjoint, its bounded image closure is a subset of the old closure, and its analytic base coefficients restrict analytically. Sign conditions, hence the stated finite expression domains, remain respected. This proves assertion 3.
The simultaneous dimension induction closes. Every finite -expression on an -cell is reducible, and the analytic/sign/order/common-refinement package is now a theorem in every dimension. Its proof has used neither an arbitrary-set cell theorem nor a complement theorem as an induction input.
The global definition and its elementary set operations
We now give the arbitrary-set cell theorem and global preparation, completing the dimension argument above. We use the classical convention of Jean-Marie Lion and Jean-Philippe Rolin, Théorème de préparation pour les fonctions logarithmico-exponentielles, §0.1: embed in the product , where ; require a global semianalytic set to be locally semianalytic at every point of that compact product; define global subanalytic sets by coordinate projections of global semianalytic sets.
This specifies the compactification used in the proof. Valette’s printed radial map has open-ball image, while its stated target is a cube. We therefore make the product convention explicit and prove the required product and projection facts in its actual coordinate charts. No comparison across a ramified compactification boundary is an input.
Semianalytic means a finite Boolean combination of analytic equalities and strict inequalities in a neighborhood of every ambient point. Non-strict inequalities can be expressed as a strict inequality or an equality. The product has standard coordinate charts using or in each coordinate. Each is a product of analytic one-dimensional charts; is compact.
The following elementary constructions use only these definitions.
Polynomial sign sets are globally semianalytic. In a chart with inverted coordinates indexed by , a polynomial becomes a rational expression in the chart coordinates . On the part belonging to , all for are nonzero. Choose a sufficiently large even exponent in each such coordinate and multiply the expression by the positive monomial
The result is a polynomial in , and its sign and zero locus agree with the original expression on this part. Add the analytic conditions for the inverted coordinates; these exclude points at infinity. Every finite polynomial sign formula thus has a semianalytic description in every projective product chart. This proves the assertion without using a polynomial projection theorem.
Finite unions, intersections and products of global semianalytic sets are global semianalytic. Near each product-chart point, take the finitely many analytic formulas for the factors, pull them back under the coordinate projections, and combine them by the relevant Boolean operation. Cylinders are included: is semianalytic, with condition near its point at infinity. Coordinate permutations are analytic on the product, so preserve this property.
Let and be global subanalytic sets, with witness variables and . Then
The witness sets are globally semianalytic by the cylinder constructions. Products use the product witness followed by a coordinate permutation. Further coordinate projections simply concatenate the forgotten witness variables. Hence global subanalytic sets are closed under finite unions, intersections, products and coordinate projections, before any complement theorem has been proved.
For a globally subanalytic map, its graph and these operations give images and inverse images of global subanalytic subsets by graph intersection followed by projection. They also give joint graphs, composition and restrictions of such maps. For example, a sum or product of two functions is described by their two graphs and the polynomial relation or , with projected out. Rational-power graphs on their stated positive real branches are polynomial sign sets: for , , use and if , or if . Defined zero or integer branches are added by their corresponding polynomial conditions.
A restricted analytic function on a compact cube has a bounded graph. It is semianalytic near that cube by the analytic graph equation and the cube inequalities. Its compact graph closure avoids every point at infinity, so near those points the graph is empty. Its graph is therefore globally semianalytic. These primitive graphs and the graph constructions show that every finite -expression, restricted to a globally subanalytic domain on which it is defined, has a globally subanalytic graph.
The same conclusion holds for an analytic outer function defined only near a compact argument image: cover that image by finitely many closed boxes inside the analytic domain, use the restricted analytic graph on each box, and take the finite union of the resulting restricted graphs. Their values agree on overlaps. This does not require an analytic extension outside the given neighborhood.
Induction now shows that every -cell is globally subanalytic. Its base is such a set; the graph case uses the endpoint’s graph, and the band case uses the endpoints’ joint graphs and polynomial order inequalities followed by projection. Infinite endpoints omit the corresponding inequality. These facts provide the set-theoretic input independently of the expression preparation theorem.
Finite analytic cells for arbitrary globally subanalytic sets
Cell theorem. For any finite list of globally subanalytic subsets of , there is a finite cylindrical decomposition of into analytic -cells compatible with every set in the list.
We first treat a globally semianalytic set , considered as a subset of . Around every point of , choose a standard product chart and an open neighborhood on which a finite analytic sign formula defines . Inside it choose a closed coordinate box whose interior contains the point and whose closure remains inside the analytic domain and chart. Compactness supplies a finite such box cover.
On the finite part of one selected chart, write
The latter requires . These chart domains first have a finite -cell refinement by cuts at the coordinate zero hyperplanes. On each such cell all are well-defined -expressions.
For a chosen closed box , its finite-chart trace is described by finitely many sign conditions on and , together with the chart-domain conditions. Apply the now proved analytic/sign/common-refinement package for finite expressions. This gives a finite cell decomposition compatible with . Take a common refinement for all the selected boxes. They cover all of ; on every resulting cell choose a box containing its chart image.
Inside that box the local defining analytic functions for are restricted analytic functions. Their composites with are well-defined -expressions on the chosen cell. Prepare them and refine to make every defining sign constant. The local sign formula is then either true throughout a cell or false throughout it. Thus is a union of cells in a finite -cell decomposition of . Every analytic function has stayed inside its selected box’s actual domain.
For a global subanalytic set , take a globally semianalytic witness with . Apply the result just proved to . In a cylindrical decomposition, projection of a cell onto its first coordinates is its parent cell; each graph or band has a nonempty fibre over every point of that parent. Repeated projection therefore gives the induced decomposition of , after removing duplicate projected cells. Since is a union of cells, is a union of cells in this induced decomposition.
Finally, for finitely many , take a common finite refinement of the finitely many constructed -cell decompositions, using the already closed expression package. This proves the full cell theorem, including unbounded sets and simultaneous compatibility.
Full global preparation and the complement theorem
Let be a globally subanalytic function; no continuity is assumed. Its graph has a finite -cell decomposition in . The induced base decomposition is compatible with , since is the graph’s projection.
Over a base cell , a cell included in the graph cannot be a band: it would give several values at each base point. It must be a graph cell, and there is exactly one such graph over : at least one exists because the projection contains , and two would contradict the single-valuedness of . Its endpoint is an analytic -function equal to on . Apply expression preparation on these finitely many base cells and take a common refinement.
Thus every globally subanalytic function is reducible, with the complete analytic unit form defined earlier. This is the full preparation theorem, not just ordinary nondegenerate preparation. The exponent may be negative.
If is globally subanalytic, apply the cell theorem compatible with . Its complement is the union of the other finitely many cells, and each cell is globally subanalytic by the elementary graph constructions. This proves Gabrielov’s complement theorem for the stated global class.
Closure and interior also belong to this class. Indeed
The existential condition is a projection of a global subanalytic set using a polynomial inequality. Its failure for some positive is obtained by complement, intersection with , and projection. Taking the final complement gives . Then , and the same operations give its boundary and locally closed differences.
Cells are connected by the graph and band parametrizations already proved. Every connected component of a finite union of cells is a union of whole cells: a connected cell meeting that component is contained in it. Consequently a globally subanalytic set has finitely many connected components, each globally subanalytic.
Local subanalytic sets and bounded charts
For clarity we prove the comparison used by the course’s local analytic geometry. A locally subanalytic set is, near every finite ambient point, the projection of a relatively compact semianalytic witness whose compact closure lies in its analytic domain.
Compact witness observation. Such a witness, after a closed base-box restriction inside that neighborhood, has a globally semianalytic representative. Cover its compact closure by finitely many closed boxes lying inside local analytic formula neighborhoods. In each box intersect its finite sign formula with the closed-box inequalities. This gives a bounded semianalytic set in the whole Euclidean ambient space, empty near infinity. The finite union of these sets is exactly the restricted witness. It is therefore globally semianalytic in the projective product convention.
Suppose a bounded set is locally subanalytic at every point of its ambient closure. Its closure is compact. Cover it by finitely many smaller closed base boxes inside subanalytic witness neighborhoods. The compact witness observation makes each -trace on such a box a projection of a globally semianalytic witness. Their finite union is . Hence is globally subanalytic.
Conversely let be globally subanalytic, and fix a closed bounded base box . The product is compact. Cover it by finitely many semianalytic formula boxes for , using the ordinary coordinates on the finite base and standard projective charts on the witness coordinates. In each chart the witness variables have bounded chart coordinates ; for an inverted witness coordinate require , so it corresponds to an actual finite witness. Keep the base condition . Each resulting witness is bounded semianalytic with compact closure in its formula domain. Projection onto the unchanged base coordinates gives ; the finite union of these projections is locally subanalytic. Thus every global subanalytic set is locally subanalytic at every finite point.
In particular local subanalytic sets in a chart restricted to a compact box contained in their analytic neighborhood can use the global cell and preparation theorems just proved. This comparison concerns the relevant bounded chart traces; it makes no global definability assertion about an arbitrary unbounded analytic manifold or map.
Uniform finiteness in families
Let be globally subanalytic and write . Choose a cylindrical decomposition with the parameter coordinates first, compatible with .
After fixing , each cell has either an empty fibre or a graph or band cell in the remaining coordinates. This follows inductively from the cell definition: specialise its endpoints on each parent fibre, and keep its nonempty intervals or graphs. The specialised endpoints are analytic on their specialised analytic base cells. The resulting nonempty cells form a finite decomposition of compatible with , with at most the total number of original cells.
Each such fibre cell is connected. Therefore the number of connected components of is at most , independently of . Each component is a finite union of these globally subanalytic fibre cells.
For a globally subanalytic family of maps , regard its graph with coordinates ordered as . The sets are fibres of that one globally subanalytic graph over . The same argument bounds their number of connected components by one finite constant independent of both parameters. This retains the joint definability requirement on a family, rather than treating an arbitrary collection of individually definable fibres as a definable family.
Convergent Puiseux expansions
We prove the one-variable and parameterized statements in Valette’s Propositions 1.8.4, 1.8.6 and 1.8.7 from the full preparation theorem. Convergence, the domain of the analytic outer function, and the choice of a two-sided substitution are part of the proof.
One variable
Let be globally subanalytic. After reducing , preparation gives one band next to zero and a formula
where the base quantities are constants, the complete argument map is bounded, and is an analytic unit near its actual compact image closure. We may take . If , the zero series suffices.
If , boundedness of as forces . The point lies in the actual image closure. Thus
is a genuinely convergent power series for small. Multiplication by , with , gives a convergent Puiseux series. Choose a positive integer divisible by and by the denominator of ; its exponents are integers divided by , with only finitely many negative exponents.
If , shrink the interval so . The distance is a positive analytic function of across zero. Its rational powers and the forward and inverse unit arguments are analytic there. Their value at zero is in the actual compact image closure, so the analytic domain of includes it. Hence has an ordinary convergent Taylor series in this case.
Combining the cases proves
on a smaller positive interval. If is bounded, a lowest nonzero negative power would make it unbounded, so no such power occurs. If , its constant coefficient is also zero.
For finitely many bounded functions choose a common denominator for all series. The substitution gives analytic functions across : all cleared exponents are even nonnegative integers, so their series agree with the actual functions for both signs of . Merely saying that the substitution exponent is even is insufficient; for example, , whereas .
A compact analytic Taylor observation
We will also need convergence with parameters, not merely formal coefficients. Let be real analytic on a neighborhood of , with compact. There is a such that
for in a real neighborhood of and , after possibly shrinking that neighborhood. Every is analytic there. On compact subsets of a smaller parameter neighborhood the series converges uniformly for .
To see this, at each the convergent real analytic series has a holomorphic extension on a complex product polydisc. Shrink its parameter polydisc and take a smaller closed disc in ; the extension is bounded there. The one-variable Cauchy estimate gives a geometric majorant for the Taylor series on a still smaller -disc, uniformly for those real parameters. Finitely many parameter neighborhoods cover ; take the least of their positive radii. The Taylor coefficients on overlaps agree, because they are the displayed derivatives of the same real analytic function. The resulting real series therefore agree without requiring a single chosen complex extension on all the parameter neighborhoods.
The rational power , for and , is analytic for real sufficiently close to zero and has the branch with value one there. It can be used in this observation on any compact parameter set.
Continuous functions with parameters
Let be globally subanalytic. Suppose is continuous and globally subanalytic on a relatively open neighborhood of in . Then there is a finite partition of into globally subanalytic analytic manifolds , and one even positive integer , such that
is real analytic on a neighborhood of in . This is a neighborhood in the analytic manifold ; its width in may depend on .
Apply cylindrical preparation with the -coordinates first, compatible with and . Over each resulting base cell , the graph is a cell. The adjacent positive band belongs to : every point has a positive interval in , and compatibility makes membership constant on that band. Shrink an infinite upper endpoint to one if necessary. On this band, after further base refinement, write
All base functions are analytic on ; make either identically zero or nowhere zero, and either identically zero or of one fixed nonzero sign.
If , the formula and continuity give the zero function also at .
If and , boundedness of the argument map for every fixed forces . Nonvanishing of the unit at the limit point, together with continuity of , forces . Choose divisible by and by twice the denominator of . The integers and are even and nonnegative, so
At each , the limiting argument lies in the original compact closure. Its analytic neighborhood and the analytic base functions give a neighborhood on which this formula is jointly analytic in . It agrees with when , for both signs of ; continuity gives equality at zero.
If , put and . For ,
All powers and unit arguments are jointly analytic near each . The limiting argument at that point belongs to the actual compact closure, so composition with is legitimate. This gives an analytic extension in across zero, agreeing at zero by continuity. Its composition with any even power of gives the required extension.
There are finitely many pieces. Choose one divisible by twice every and every rational-exponent denominator appearing on them. The local analytic formulas agree where their neighborhoods overlap within a given piece, since they agree on the positive- side and hence by analytic uniqueness. Their union is the claimed neighborhood.
Parameterized Laurent–Puiseux series without continuity
Let be globally subanalytic, let be globally subanalytic, and let be globally subanalytic on
There is a finite partition of into globally subanalytic analytic manifolds , one positive integer , and on each a positive continuous globally subanalytic function , with , such that
Each coefficient is analytic on . The series converges there; on compact parameter subsets and a sufficiently smaller positive radius it converges locally uniformly in the root variable. Neither continuity at nor a common positive radius over an unbounded parameter cell is assumed.
Prepare , refining so is analytic on each base cell. As above, over every there is a bottom band contained in , where is analytic and . Retain the prepared formula just displayed and separate the same zero/nonzero coefficient and center cases.
Suppose first and . Again , but may now be negative. The map is bounded. Moreover
Indeed for any sequence of parameter points with convergent, choose sufficiently small that . Thus is analytic near the compact set . The compact Taylor observation supplies a single and analytic coefficients for
Consequently
All coefficients are analytic on . Choose
This is positive, continuous and globally subanalytic, and keeps the analytic argument within the smaller convergence disc. A common denominator for and gives the stated integer indexing, filling absent exponents with zero. The lower index is finite, even when .
Suppose next , and retain and its fixed sign . Set
These functions, together with , are bounded: for fixed they are limits as of the bounded complete argument map, with the same global bounds. The compact closure of lies in the original argument closure. To verify this also for varying , choose for each a sufficiently small so the actual argument is within of its limiting argument.
The analytic function
is defined near that compact parameter closure at . Its argument recovery map is continuous there and at zero takes values in the original compact closure. Choose a uniform small radius by the compact Taylor observation, reducing it below . Then
for
This is an ordinary Taylor series with analytic parameter coefficients and positive continuous globally subanalytic radius. The coefficient-zero case uses the zero series and .
Finally take one denominator for the finitely many pieces. The chosen radii are globally subanalytic by their explicit formulas and the already proved closure operations. On a compact subset of a base cell, the analytic base factors are bounded, and the Taylor majorants above give uniform convergence after reducing the root radius. A finite number of negative powers merely gives a finite Laurent part on the punctured interval. This proves the full parameterized Laurent–Puiseux assertion.
The curve-selection and Łojasiewicz treatment can now use the cell, complement and Puiseux results as proved providers. Its existing choice and curve arguments remain the single treatment of those steps.
Dimension, fibrewise closure and the frontier
This section adapts Guillaume Valette’s On subanalytic geometry, §2.3, from its native editable source under CC BY 4.0. The dimension and frontier arguments are expanded below. The empty-set convention is separated from strict decrease; the parameter-continuity proof uses an injective bounded transform and relative closed graphs. These changes imply no endorsement.
We first work with globally subanalytic subsets of Euclidean space in the projective product convention established above. “Definable” in this section means globally subanalytic. The finite analytic cell theorem, complement theorem, preparation and definable choice are already proved in this component and its linked curve-selection treatment. No uniformization, resolution or analytic regular-locus theorem is used here.
For a nonempty definable set , choose a finite analytic cell decomposition compatible with and define
Set . Cell dimension is its ordinary manifold dimension: a graph preserves the dimension of its parent, and a band adds one. We write
These are different sets. The frontier in the first formula is the one for which strict dimension decrease holds. All closures and interiors in the Euclidean statements use the ambient Euclidean topology.
Why cell dimension is intrinsic
We use the following elementary fact about differentiable manifolds: a nonempty open subset of a -dimensional manifold cannot be covered by finitely, or even countably, many differentiable submanifolds of smaller dimension that are contained in it. Here is the volume argument. Work in one manifold coordinate chart. A smaller-dimensional submanifold has a countable cover by parameter charts and then by compact parameter boxes on which the parameter map into has bounded derivative, hence is Lipschitz. Cover one -dimensional box by at most boxes of side . Their images are contained in -dimensional boxes of side at most . Their total outer volume is at most
Thus each compact chart image, and then their countable union, has zero -dimensional outer volume. A nonempty open set contains a box of positive volume. Countable subadditivity gives the asserted impossibility. This argument uses only coverings by Euclidean boxes; it requires no Sard theorem.
If differentiable manifolds are embedded in the same Euclidean space, then . Indeed every tangent vector of is the derivative of a curve in , hence in , giving an inclusion of tangent spaces. The inclusion into is differentiable in its local manifold coordinates, so the volume argument also applies to smaller-dimensional manifolds contained in .
Now refine any two compatible finite cell decompositions to a common finite analytic cell decomposition. Every refined cell inside an old cell has dimension at most . They cover ; if all had smaller dimension they would contradict the preceding volume argument in a coordinate neighborhood of . At least one has dimension . Consequently the maximum in (D1) does not change under refinement and is independent of the chosen decomposition. In particular
The same reasoning shows that a differentiable definable manifold has its manifold dimension as its definable dimension. Permuting Euclidean coordinates, or applying a definable differentiable diffeomorphism, preserves dimension: it carries the finitely many manifold cells to manifolds of the same dimensions, and a compatible cell refinement of their images has the same maximum by the argument just given.
Images, graphs and fibre dimensions
Image inequality. For any definable map , including a discontinuous map, and definable ,
Proof. Decompose the graph cylindrically, with the -coordinates first. Over a base cell contained in , each succeeding output coordinate must be a graph rather than a band, since there is exactly one complete value of over each . At each stage there is exactly one such graph over that parent: there is at least one by existence of , and two would violate uniqueness. Thus every graph cell has the same dimension as its -base and .
Reorder the coordinates with the output first, and take a compatible cylindrical decomposition there. A coordinate projection of a cell removes successive graph or band coordinates and cannot increase its dimension. The image is the finite union of the projected cells, so its dimension is at most . Coordinate reordering has preserved , proving (D5). The empty case is immediate.
Applying (D5) to a definable bijection and its inverse proves dimension invariance under arbitrary definable bijections; continuity is not needed. In particular every definable cell can be replaced by its definable analytic coordinates without changing dimensions. Those coordinates can be obtained by forgetting its graph coordinates: its remaining free coordinates range over an open definable subset of , and successive analytic graph functions reconstruct the cell.
For , put
A cylindrical decomposition with the -coordinates first has finitely many base cells . Over each , the fibre dimension is constant whenever its fibres are nonempty: each cell of has a nonempty fibre over every , and its fibre dimension is its total dimension minus . Taking the largest such cell gives
A base cell with empty fibres contributes nothing. Thus is the maximum of these sums. In particular, if , then its fibres over every full -dimensional base cell are finite or empty. A zero-dimensional definable set is finite because its cell decomposition consists of finitely many points.
Closure commutes with fibres after partitioning the base
Generic closure lemma. Given definable , there is a dense definable such that
Proof. The inclusion always holds. Define the exceptional set where the inclusion is strict. It is definable: closure has the distance-and-quantifier description proved above, and the complement/projection operations express the existence of a point in the set difference.
Suppose that exceptional set contained a full-dimensional cell. It is open. Definable choice selects on it a point and a radius with . Preparation makes these finitely many coordinate functions continuous on a finite analytic cell refinement. At least one cell of the refinement is still full-dimensional, by dimension invariance. Denote this open cell by . Then
is open in the whole product, is disjoint from , and contains . This contradicts the definition of closure. The exceptional set therefore has dimension less than , and in particular contains no nonempty open set. Its complement is the required dense definable . For , there is no exceptional fibre.
Partitioned closure lemma. There is a finite definable partition of such that
Here the closure on the left is the ambient closure of the restricted family. It is not generally the fibre of at exceptional parameters.
Proof. Induct on the dimension of the base. In the dense good set from (D8), any cell has the asserted property, by the inclusions
Every cell in the exceptional set has smaller dimension. Identify such a cell with its open definable analytic coordinate domain , , and pull the family back to . Apply the induction hypothesis in , taking empty fibres off . Transfer the resulting finite partition back to . At a point , closure in the product restricted to is the same as ambient closure tested at that point, and the coordinate homeomorphism preserves this local closure. This gives (D10) there.
Finally refine all the finitely many resulting pieces if necessary. The property survives refinement: for and , squeeze between and . The induction terminates in dimension zero.
Strict frontier decrease
Frontier theorem. For every nonempty definable set ,
For the empty set, both dimensions are ; only the equality is asserted. This small convention matters in dimension-zero induction arguments.
Proof. Put and suppose a cell had dimension . Near one point, is an analytic graph over an open set in . Shrink to a bounded analytic coordinate neighborhood with compact closure inside that graph chart. Subtracting its analytic graph function is a definable analytic change of coordinates there; its graph on the selected compact chart is semianalytic, so the bounded-chart comparison proved above supplies definability. In the new coordinates a nonempty open patch of is
Here is the transformed, restricted set. Its dimension is at most , by (D5) and the restriction inequality. Every point of the displayed patch is still a limit of , since the selected coordinate neighborhood is open around that point.
Decompose cylindrically over . Exclude its finitely many lower-dimensional base cells; their union has empty interior. Over any remaining full-dimensional base cell its fibre dimension is at most , by (D7). The fibres there are consequently finite or empty, hence closed. Also exclude the exceptional parameters of (D8). The union of these two exceptional sets has dimension less than , by (D4), so it cannot contain the nonempty open . Choose outside it. We obtain
contradicting (D13). If , there are no lower-dimensional nonempty base cells or exceptional parameters, and the same argument uses the unique base point. Thus every frontier cell has dimension less than . Since , (D4) gives the equality in (D12).
It follows that a definable is nowhere dense precisely when . In one direction, an -dimensional cell is open and precludes nowhere density. In the other, its closure has the same smaller dimension by (D12) and hence contains no open cell or open set.
The topological boundary always has dimension less than the ambient dimension:
Indeed has no -dimensional cell: any such cell is open and contained in , hence in its interior. The other part of the boundary is , whose dimension is also less than . Their finite union proves (D15). However is false in general; a closed line in has itself as topological boundary and empty frontier.
Fibrewise continuous functions become jointly continuous on base pieces
Parameter-continuity theorem. Let be definable, where . If every fibre function is continuous in its relative topology, there is a finite definable partition of the base such that is continuous for every .
Proof. Use the definable analytic homeomorphism
The positive square roots have semialgebraic graphs, so both maps are definable. Set . It is bounded and its fibre functions are continuous. Apply (D10) to , with as base and as fibre coordinates.
Fix and a sequence tending to it. Each subsequence of the bounded values has a convergent further subsequence in . Write its limit as . Then
Since and is continuous there, its graph is closed relative to . Thus . Every convergent further subsequence has that same limit, which implies convergence of the whole bounded sequence. This proves continuity of on . Composing with , continuous at the attained value in , proves continuity of .
Relative closedness in this argument cannot be replaced by ambient closedness: itself need not be closed. Nor can one use a noninjective bounded function as a substitute for (D16); continuity of that composite need not recover continuity of .
Transfer to local analytic geometry
In an analytic manifold chart, restrict a locally subanalytic set to a smaller closed box contained in its analytic witness neighborhood. The bounded-chart comparison above makes that trace globally subanalytic. Apply (D12) there and restrict back to the interior of the box. Near a given interior point, its frontier agrees with the frontier of the original trace. Analytic coordinate changes preserve local dimension by (D5) applied on bounded charts in both directions.
More explicitly, the dimension of a set germ is the eventual value of the dimensions of its intersections with shrinking chart balls. These integer values are nonincreasing and stabilize; the same is true for the frontier germ. Choose one small ball after both have stabilized and inside a bounded witness chart. The preceding frontier theorem gives
whenever the germ of is nonempty. If the frontier germ is empty, its dimension is . Empty germs are treated separately. This is the strict dimension drop needed when successively adjoining lower-dimensional boundary pieces in the relative triangulation construction.
Similarly (D5) applies locally to analytic or locally subanalytic maps whose restricted graphs lie in bounded witness charts. A proper map permits compact preimage localization when its images are considered near a compact target box. This supplies the precise dimension nonincrease after such localization; arbitrary unbounded graphs are not silently declared globally subanalytic.
These arguments supply the dimension, frontier and closure providers. They do not yet prove the analytic regular-locus, uniformization or constant-rank partition theorems. Those remain distinct prerequisites rather than consequences asserted from a dimension count.
Exercises with complete solutions
Exercise D1 (basic: two boundaries). In , calculate the frontier and topological boundary of the unit circle and of the open unit disc. Give their dimensions and identify which strict inequality applies.
Solution. The circle is closed with empty interior in . Therefore , of dimension , and , of dimension one. Its own dimension is one, so strict frontier decrease holds while strict decrease of topological boundary relative to the set fails. The open disc has dimension two; its closure is the closed disc and both its frontier and its topological boundary are the circle, of dimension one. In both examples the topological boundary has dimension less than the ambient dimension two.
Exercise D2 (intermediate: the exceptional parameter). Let . Determine exactly where fails. Give a base partition satisfying (D10), and explain why restricting before taking closure matters.
Solution. For , both sets are ; for , both are empty. At , but , so this is the unique exception. Use the partition . On its first two pieces the restricted family is empty, and its closure is empty. On the positive piece the fibre equality holds at each parameter in that piece. Although its closure accumulates at parameter zero, zero is not a parameter of that positive piece. Thus (D10) asserts equality on each piece only after restricting the family; it does not assert that the original ambient closure commutes with all fibres.
Exercise D3 (advanced: continuity and bounded transforms). Define
Show that every -fibre is continuous although is not jointly continuous. Find a base partition making it continuous on the corresponding product pieces. Finally show why cannot replace the injective transform (D16).
Solution. For the denominator is everywhere positive, so the fibre is continuous. For the function is identically zero, including at , so that fibre is continuous too. Along its value is , whereas at the origin its value is zero. Thus it is not jointly continuous. The partition works: on either open parameter half-line the same positive-denominator formula is continuous jointly; on the zero piece the function is zero. For the last claim let and when . This definable function is discontinuous at zero, but everywhere. Continuity of the bounded composite therefore does not imply continuity of . The inverse in (D16) is precisely what prevents this loss of information.