Subanalytic triangulations on analytic manifolds
This reading constructs compatible locally finite triangulations of arbitrary Hausdorff second-countable real analytic manifolds. It supplies the relative Euclidean construction, elementary finite-colour chart covers, differentiable subanalytic cutoffs, a proper embedding and analytic recovery of the transported open simplices. Six exercises have complete solutions.
Original teaching text and solutions by GPT-6.1 Sol (OpenAI), Ultra, October 2026. CC0.
Setting and dependency boundary
Manifolds have finite dimension and no boundary. The prescribed family is locally finite, and each member is locally subanalytic. The compatible analytic partitions and simultaneous constant-rank refinements are proved below from the linked finite-cell calculus and compact chart covers. The relative construction retains lower subanalytic uniformization and analytic regularity prerequisites, together with analytic Noetherianity, the analytic constant-rank theorem and differential-equation facts, including uniform uniqueness. The dimension and frontier results have their complete linked provider below. Those lower results remain separate prerequisites. The finite-colour cover and cutoff proofs do not assume a triangulation or a covering-dimension theorem.
The bounded-chart comparison and global Boolean/projection calculus used for proper images have their complete written provider in analytic finiteness and preparation. That separately licensed component retains Guillaume Valette’s credit and its reuse terms; its expression is not imported here.
Compatible locally finite analytic partitions
The finite analytic cell theorem, its Boolean and projection calculus, and its bounded-chart comparison give the following manifold partition. The compact chart-ball refinement is proved below in Section 2 of the cutoff construction. These are the exact inputs; no analytic regular-locus theorem or uniformization theorem is needed for this partition.
Partition theorem. Let be a finite-dimensional Hausdorff second-countable real analytic manifold without boundary, and let be a locally finite family of locally subanalytic subsets. There is a countable locally finite partition of into connected locally subanalytic embedded analytic submanifolds compatible with every : each partition member is contained in or disjoint from each . Given finitely many analytic maps to real analytic manifolds, the partition can also make every restriction have constant rank.
Compact chart pieces and compatibility
The compact exhaustion and shell construction in the linked cutoff proof supplies a countable cover by open coordinate balls with compact closures contained in analytic charts; the family of these closures is locally finite. For instance, use the inner balls in that construction: their closures are contained in its locally finite outer compact balls. Each ball and its closure is locally semianalytic. In its chart it has a squared-norm inequality, and outside its compact closure it is empty on a neighborhood. The exhaustion sets need not be subanalytic; only the selected balls enter the partition.
For the map assertion apply this refinement to the open cover consisting of intersections of a source chart and inverse images of target charts for the finitely many . Thus each lies in one source chart, and every lies in one selected target chart. The source and target coordinate images of these compact sets are bounded. The maps in these coordinates are analytic on a neighborhood of .
Every compact set meets only finitely many members of a locally finite family. Indeed, cover the compact set by finitely many neighborhoods, each meeting finitely many family members; combine their finite lists. In particular meets only finitely many and finitely many nonempty .
Enumerate the balls and put
These sets are disjoint and cover , because each point has a first containing ball. For fixed the earlier union is finite; its trace near uses only the finitely many earlier closures that meet a sufficiently small neighborhood of . To justify that neighborhood, first take a finite cover of by neighborhoods meeting only finitely many closures, then discard the finitely many closures missing by shrinking around that compact set. Thus is a finite Boolean combination of locally semianalytic balls near . The local Boolean calculus also makes every relevant locally subanalytic there.
In the chosen source coordinates, these traces are bounded and locally subanalytic at every point of their ambient closures. Their closures lie inside the compact coordinate image of , strictly inside the source chart. Extension by the empty set therefore creates no chart-boundary obstruction. The proved bounded-chart comparison makes and all the finitely many relevant globally subanalytic in this Euclidean space.
Apply the finite analytic cell theorem compatibly with these sets, and keep just the cells in . Each kept cell is a connected embedded analytic submanifold. Its global subanalyticity gives local subanalyticity in the source chart, including at points of its closure; compact containment gives local emptiness outside that chart. It is therefore locally subanalytic in . It lies in or misses every , including those whose trace on is empty.
There are finitely many kept cells for each , and each is contained in . A neighborhood meeting only finitely many consequently meets only finitely many kept cells. They give a countable locally finite partition of . This proves the first assertion. It uses local finiteness of the compact closures; a merely countable atlas does not supply that conclusion.
Analytic coordinates on a cell
We spell out the cell coordinates needed for rank refinement. A cylindrical analytic cell of dimension has a coordinate projection which is a definable analytic diffeomorphism onto an open definable . Keep precisely its band coordinates and discard its graph coordinates.
This follows by induction through the cylindrical construction. For a graph over a cell with inverse parametrization , use ; the old free-coordinate domain remains open. For a band over that cell, the new free domain is
It is open because the endpoints are continuous, omitting the corresponding inequality for an infinite endpoint. Its inverse parametrization is . These maps and their inverses are analytic. Their graphs are definable by the graph, composition and projection calculus; hence the domains are definable too. In dimension zero use the single point . This proves the coordinate assertion, including the analytic embedding and its inverse, directly from the cell definition.
Definable derivatives and restriction ranks
Fix a kept cell , and write for this inverse parametrization. In the chosen target coordinates the maps are analytic and definable. To check the latter assertion, the coordinate graph of over is bounded and locally semianalytic at every point of its compact closure: its defining analytic equation is valid on a neighborhood of , and the closed coordinate ball supplies the domain condition. The bounded-chart comparison gives a globally subanalytic graph. Restriction to and composition with preserve definability.
For a scalar analytic definable , the derivative graph, with , is described by
Function values here can be written using extra real variables in the graph of ; division by is a polynomial graph condition. The formula uses finitely many real quantifiers. Existential quantification is projection, and universal quantification is complement of an existentially quantified complement. Thus the established Boolean and projection calculus makes this derivative graph definable. Openness of supplies a nontrivial interval of allowed at every , so the limit condition specifies the derivative uniquely. Applying this to every scalar coordinate gives definable differential matrices for all .
All rank sets are consequently definable: rank means that every -minor vanishes and, when , some -minor is nonzero. Rank zero means every matrix entry vanishes. Include all finitely many rank sets for the finitely many maps in a finite analytic cell decomposition of .
Every resulting -dimensional cell is open in . Indeed, a full-dimensional cylindrical cell has only band steps, and (P2) proves openness at every such step. Therefore is open in ; its tangent space is that of , and every has the constant rank selected on . Retain these members as finished.
On a smaller cell , the old differential rank is insufficient: restricting a rank-one map to one of its level curves can give rank zero. Take the cell’s own free-coordinate parametrization , and repeat the rank calculation for all . These are still definable analytic maps on an open definable domain. Their images under are connected embedded analytic submanifolds and definable in the original source chart. Repeat the same finite refinement and finish its full-dimensional members.
An unfinished branch now has strictly smaller dimension. Induction on terminates: dimension zero has rank zero for every map, and each positive-dimensional step finishes its full-dimensional cells and passes only finitely many smaller cells to already established lower-dimensional cases. The final refinement of each original is finite. Its members remain inside , so refining the finitely many cells for each preserves countability, local finiteness and compatibility with all . This proves simultaneous constant rank on every final member.
If is compact, this locally finite partition is finite by the compactness argument above. Similarly a compact subanalytic subset contained in one analytic chart has a finite compatible analytic partition, by bounded-chart comparison and finite cells. A connected cell lies in a single connected component; hence each component of a finite union of cells is a union of whole cells. There are finitely many components. For a compact subanalytic subset meeting several charts, intersect with finitely many compact coordinate boxes whose interiors cover it, apply the same finite-cell argument in each box, and take the resulting finite union of connected cells. This proves finiteness of its connected components as well.
The theorem supplies compatible analytic partitions and constant-rank refinements for the relative triangulation construction. Whitney and Verdier conditions, a frontier condition between partition members, and the intrinsic analytic regular-locus theorem require additional arguments.
Sources. Guillaume Valette, On subanalytic geometry, arXiv:2507.23622v1, §1.2, gives the graph/band cell definition and cell theorem; §2.1 gives first-order definable formulas and the definability of derivatives. The linked preparation component proves its finite-cell and Boolean/projection inputs in the stated projective product convention and retains its human credit and reuse terms. The manifold globalization, explicit derivative-limit formula, and simultaneous restriction-rank induction are written out here.
How a compatible triangulation is assembled
The triangulation input has a useful relative form: one may adapt a fixed locally finite polyhedron while preserving every old simplex setwise. The construction below follows the geometric method of Masahiro Shiota, Piecewise linearization of real analytic functions. We make its fibre ordering and straight-to-curved map explicit.
The lower subanalytic prerequisites used in this construction are uniformization, the set calculus, and the following forms of the regularity and dimension calculus. A nonempty subanalytic set has lower-dimensional frontier , as proved in Dimension, fibrewise closure and the frontier. This is distinct from the topological boundary, whose dimension can equal the dimension of the set. The compatible analytic partition theorem above proves that a locally finite family has a compatible locally finite partition into analytic submanifolds and that finitely many analytic maps have constant-rank restrictions after refinement. Compact subanalytic sets consequently have finite such partitions and finitely many connected components. These are inputs to the construction, rather than consequences of the triangulation being constructed. Analytic Noetherianity, the analytic constant-rank theorem and uniqueness for finite systems of analytic ordinary differential equations are also used.
Relative polyhedron theorem. Let be a finite-dimensional locally finite linear simplicial complex with closed support in . Let be locally finite in the ambient space, with each subanalytic and contained in . There are a locally finite subdivision and a subanalytic homeomorphism
such that for every old closed simplex , each restriction to an open simplex of is an analytic diffeomorphism onto a subanalytic analytic submanifold, and every such image is contained in or disjoint from each . No analyticity across simplex boundaries is asserted.
We first prove the ingredients that make the induction possible.
Choosing a point from which lines have finite intersections
Call a line singular for a set if it contains a nontrivial interval in that set. For a compact subanalytic set with no such intervals, every intersection with a line is finite: it is a compact zero-dimensional subanalytic set. For any countable collection of subanalytic sets of dimension less than , the union of their singular lines is meagre in . Their singular parallel directions form a meagre subset of . Here, a meagre set is a countable union of nowhere dense sets.
Proof. A compatible analytic partition reduces the claim to countably many analytic submanifolds. A line interval in the original set contains an interval in one partition member: on a compact subinterval only finitely many members occur, and their intersections with the line are subanalytic. Work on a small open set where one such member is the zero set of an analytic function ; a sum of squares of local defining functions supplies in higher codimension.
Choose analytic coordinates for a unit direction . Put and . The germ of the ascending chain of ideals stabilizes. Thus, on a neighborhood of any specified , for some ,
with analytic coefficients. Along , the vector satisfies a finite homogeneous linear differential system. If it is zero at , uniform zero-solution uniqueness makes it zero for all sufficiently small . Conversely, vanishing of on an interval makes all these initial jets zero. Hence the incidence of analytic line germs in the chosen submanifold is locally an analytic set defined by finitely many jet equations. This proves local finiteness of the equations; an infinite jet intersection has not been treated as automatically analytic.
Cover this incidence by countably many relatively compact closed subanalytic pieces and uniformize each piece. On its uniformizing manifold , write the analytic incidence parameters as . The map
has rank less than for in a neighborhood of zero: locally its image lies in the lower-dimensional analytic zero set. At a fixed , every -rowed minor of its differential is a polynomial in , since its columns are and . Vanishing on an interval makes that polynomial identically zero. Thus has rank less than for every real , including values for which the line has left the original coordinate neighborhood.
Sard’s theorem makes the image measure zero. Exhaust by countably many compact sets. Each compact image is closed, has empty interior and is nowhere dense. This proves the assertion about all points on singular lines.
For directions, suppose had surjective differential somewhere. A local analytic section over an open direction chart would give . For the resulting map , the determinant of its differential columns has leading coefficient
in its polynomial in . That coefficient is nonzero for a direction chart on the unit sphere. This contradicts the preceding rank calculation. The direction map therefore has only critical values. Sard and compact exhaustion again make its image meagre, now in projective space. In dimension one there are no line germs in a zero-dimensional set, so the assertion is immediate. Countable unions finish both claims.
In particular, inside any open simplex one can choose a centre outside a finite family of compact lower-dimensional sets and all their singular lines. One can also choose a parallel direction avoiding all singular directions of such a family. Baire’s theorem gives the choices in any prescribed open neighborhood.
Completing a finite-fibre set so its projection is open
For , call a set projection-open when restricted to that set is an open map. Suppose is compact subanalytic and every vertical fibre is finite. A finite analytic partition of , compatible with a prescribed finite family of subsets, can be chosen in analytic graph pieces.
Proof of the graph assertion. Refine an analytic partition by the rank of . A constant-rank restriction cannot have rank smaller than the dimension of its partition member: the analytic constant-rank theorem would give a positive-dimensional subset of a fibre. Remove the images of lower-dimensional pieces and frontiers, and partition the remaining image into connected analytic pieces. Over each such piece, compactness supplies a proper finite analytic covering. Its sheets have a canonical order in the last real coordinate. Following the first, second and subsequent values trivializes the covering, so each sheet is an analytic graph. Apply the same argument to the remaining lower-dimensional compact part. Dimension decreases strictly, and compactness gives finitely many pieces at every step. This yields the claimed finite graph partition. The properness used here is that of the projection on the compact closed set, including its frontier.
There is a compact finite-fibre subanalytic enlargement that is projection-open near a specified point of .
Proof by induction on . The case is immediate. Separate the -dimensional graph pieces, whose projection is open, from a closed compact remainder of dimension less than . Choose a parallel direction in the base that is nonsingular for , by the preceding lemma, and take it as the last base coordinate. For fixed , only finitely many base points occur in . Each has only finitely many heights. Thus the image of under
has finite vertical fibres. Enlarge that compact image, by induction, to a set whose projection is open near the specified point. Pull it back by and intersect with a sufficiently large closed ball. Near the specified point the ball has no effect. The resulting has finite vertical fibres and is projection-open; its projection has the free -coordinate. It contains . Therefore is projection-open there: points of the remainder lie in the projection-open enlargement, while the other pieces already have open projection. This completes the induction.
The same statements hold for radial projection from a centre , using polar coordinates away from . A local enlargement near can be turned into a compact one that is projection-open everywhere without losing local membership data. Here is the boundary step. Rotate and scale so , . Intersect the local enlargement with a narrow conical neighborhood and a radial band about radius one. Choose the band endpoints to avoid its finite fibre over ; narrow the cone so no points meet those radial endpoints. Its only boundary is then on the side of the cone. Reflect the spherical cap across its boundary sphere, leaving radial distance unchanged, and adjoin the reflected copy.
For completeness, such a reflection is analytic. Write a unit vector as , let the cap boundary be , and put . The formula
is an analytic involution of the sphere. Its denominator is positive; in stereographic coordinates it is inversion in the sphere of radius . It fixes the cap boundary pointwise and exchanges its two sides. Near the common boundary, relative openness on the cap and its reflected copy gives openness in the whole sphere. The doubled compact set still has finite radial fibres. Partition it into graph pieces, also respecting its intersection with the original set and the cap boundary. Near , the original set is a union of these pieces. In dimension one radial directions form two points, and no cap construction is needed.
Extending the skeleton without changing old simplices
We prove the relative theorem by induction on . The assertion for is immediate. Suppose it is proved in lower dimensions.
First reduce membership to closed sets. For a subanalytic in a compact old simplex, put , . The strict frontier inequality (D12) in the linked dimension provider makes this sequence terminate when the first empty set is reached. Membership in is a Boolean combination of the finitely many closed sets , obtained by substituting backwards. For a full-dimensional closed set, its boundary is lower-dimensional; a connected piece avoiding that boundary lies wholly in its interior or wholly outside it. Thus lower-dimensional closed obstacles, and the membership information on the old skeleton, suffice. Each compact old simplex meets only finitely many , so these local reductions preserve ambient local finiteness.
Fix an old -simplex , and choose a nonsingular centre outside its finite union of lower-dimensional closed obstacles. Such a choice is possible because that union and the excluded singular-line sets are meagre. Let send a point along its ray to the boundary. Each obstacle has finite radial fibres. At each of its points use the preceding compact radial completion, with an analytic graph partition that records its local membership. Finitely many such neighborhoods cover the compact obstacles.
Let be the finite union of all the completed compact sets. Every completion was constructed away from , so is compact and avoids . Choose only now, small enough that the closed inner simplex is disjoint from . Explicitly, if , take , where ; compactness makes the distance positive. If is empty, any suffices. Avoiding only the original obstacles would not ensure this property, because their completions can approach the centre more closely. Clip to , then add both and the inner boundary . Call the resulting compact set . All completed points in it have radial height strictly greater than , so the adjoined inner boundary is the least radial branch and the open inner simplex contains no other part of . It has finite radial fibres and open radial projection. Clipping does not spoil openness at an outer or inner boundary: the full boundary graph itself supplies the missing neighboring fibres.
Refine its finite graph partition to respect the partitions of every completion. Any connected piece compatible with this refinement is compatible with each original closed obstacle. Indeed, its intersection with that obstacle is closed. At an intersection point, a chosen completion neighborhood makes membership locally constant on the piece, so the intersection is also open. Connectedness makes it either the entire piece or empty.
Project all graph pieces and their relevant frontiers to the old skeleton, and include the original membership data on that skeleton. The images are subanalytic by properness on compact closures. The resulting family is locally finite: its members from remain on , and the old complex is locally finite. The induction hypothesis supplies a subdivision of the skeleton and a homeomorphism that fixes every old face setwise, is analytic on each new open simplex, and respects this projected data.
Ordered branches, including their values on faces
Over an open base simplex of , after the boundary map , the graph pieces of give finitely many strictly ordered positive radial functions
where the actual point on a branch is . The functions are analytic on the open simplex. The boundary partition ensures that each branch either occurs on the entire base simplex or is absent there.
Each branch extends continuously to the closed base simplex. To see this at a boundary point , intersect the open simplex with successively smaller balls centred at . These intersections are connected. The closures of their branch graphs are nested compact connected sets. Their intersection is the cluster set over , and is finite because has finite fibres. A nonempty finite connected set has one point. This gives a unique limiting value. The same argument at every boundary point, together with compactness, proves continuity of the extension.
On an open face, the limit is one of its finitely many graph branches. Its choice is locally constant, hence constant on the connected face. Consecutive branches upstairs restrict either to the same branch or to consecutive branches on a face. Otherwise a third branch strictly between their two limiting values would, by open projection, have nearby values over the interior base simplex. Those values would lie between the original consecutive branches, a contradiction. This is precisely where openness of the completed projection is needed.
Take a barycentric subdivision of . If two branches are distinct on an open base simplex, one vertex of each new simplex is the barycentre of its largest old carrier and lies in that carrier’s interior. Their values are strictly ordered at that vertex. They may agree at other vertices on lower faces; this causes a permitted collapse on that face, not a collapsed interior cell.
The straight model and its analytic lifting map
Let be the vertices of one of the subdivided base simplices, with barycentric coordinates . Model branch by the straight simplex with vertices
Its radial height over is
This is reciprocal, rather than arithmetic, interpolation. Indeed, if a point in the straight face has affine coefficients , radial projection gives . The condition then gives the displayed height . All vertex heights are positive. The strict order at an interior-carrier vertex makes throughout each open base simplex.
Between two consecutive straight faces, define
On a straight branch use its endpoint value, and inside the inner simplex use the conical extension , including . The annular map is strictly increasing on each radial interval. On every open annular cell it is analytic with an analytic inverse: and the branch functions are analytic there, radial projection is analytic on each old open face, and the radial derivative is
The maps agree on their common boundaries. If the two branches collapse on a lower face, every interpolated value lies between them, so continuity of their common limit supplies continuity there. There is no division by zero on an open annular cell. At the centre, the factor supplies continuity of the conical map. Thus is a homeomorphism of , agrees with on its boundary, and takes straight branch faces and cells between them to the prescribed analytic branches and bands.
The straight faces and the closed regions between consecutive faces form a finite polyhedral cell complex. Over a fixed base face, their defining inequalities are the linear half-space inequalities of the two branch hyperplanes inside the cone over that face. The face restriction and consecutive-or-collapsed property just proved makes intersections common faces. A barycentric subdivision turns this into a simplicial subdivision. On every open simplex the restriction of the preceding analytic cell map is an analytic embedding, hence an analytic diffeomorphism onto its image.
The graph is subanalytic. On compact branch faces this follows from the subanalytic graph functions and . For interpolation between two faces, take the closed subanalytic graph of the two endpoint maps over the same base ray, multiply by the compact parameter interval , and apply the analytic affine interpolation map to both its input and output coordinates. Its domain is compact, so this is a proper-image argument. The conical extension has the same compact graph construction, with the centre included. This avoids assuming that arbitrary nonproper compositions or images are subanalytic.
Do this on each old top simplex. The maps coincide on the skeleton, so they glue. Each map preserves its old simplex setwise. Local finiteness therefore gives a global homeomorphism, subanalytic graph and locally finite subdivision, with no accumulation of new cells in a compact neighborhood. Compatibility follows from the completed graph partition and the connected-piece argument. This proves the relative polyhedron theorem.
Relative support and a continuous isotopy
The construction can preserve a region that already needs no change. Let be a subcomplex of , and suppose every old open simplex outside is already compatible with the family. All interior membership obstacles then lie in . Their projected data stay in , since every face of a simplex of belongs to . Inductively retain the old simplices disjoint from and use the identity there. On a top simplex outside , the only remaining operation is conical extension of its already chosen boundary map. It is the identity when that closed simplex is disjoint from . Thus the final subdivision retains those disjoint simplices and fixes them pointwise. This is the relative support refinement, not a claim that the map must fix every simplex merely absent from .
There is also a subanalytic isotopy from the identity to , preserving every old simplex setwise and stationary on those unchanged regions. Prove it with the same skeleton induction. Suppose , , is the boundary isotopy. On an old top simplex let be its conical extension. Put . This is an increasing homeomorphism on each radial fibre, fixes the outer boundary, and has the form
Interpolate its radial coordinate by . Both summands are increasing, so is strictly increasing, has the same endpoints and gives a fibre homeomorphism . Define . Then , , and its boundary restriction is . The formulas are continuous, including collapsed face intervals and the centre by the endpoint arguments above. On the compact old simplex, a continuous family of these bijections has a continuous family of inverses: the map is a continuous bijection from a compact space to a Hausdorff space. Its graph is subanalytic by the same compact interpolation constructions. Local finiteness glues the family over all old simplices. This proves the asserted subanalytic isotopy; no global analyticity across cells is implied.
An exact two-dimensional instance. The centre is , the outer base is , , and the target radial heights are , . Subdivide the base at . The corresponding straight-face heights are , . The displayed lifting map is affine along each ray between the two straight faces. Curves are shown through their stated exact parametrizations; the picture is a sampled illustration, not a substitute for the proof.
For the original manifold input, this proves the global Euclidean relative construction and its restriction to a closed subanalytic subset. The complete globalization to an arbitrary real analytic manifold is proved below through finite-colour chart blocks, differentiable subanalytic cutoffs and analytic coordinate recovery on open simplices. The lower subanalytic prerequisites stated at the start of the relative construction remain explicit.
Compatible triangulations on arbitrary analytic manifolds
Manifold triangulation theorem. Let M be a Hausdorff second-countable real analytic manifold without boundary, of finite dimension, and let its subanalytic subsets form a locally finite family. There is a countable locally finite linear simplicial complex with closed support in a finite Euclidean space and a subanalytic homeomorphism from that support to M, compatible with the family. On every open simplex the map is an analytic diffeomorphism onto an analytic embedded submanifold.
We prove the globalization from the relative polyhedron theorem above. The proof includes the finite-colour covering lemma, finite-regularity subanalytic cutoffs, a proper embedding, bounded proper-image calculus, the extraction of a closed subcomplex and analytic chart-coordinate recovery. The relative theorem’s expressly stated lower prerequisites remain in force. They are separate from the elementary covering and cutoff arguments proved here.
Finite-regularity subanalytic cutoffs on arbitrary analytic manifolds
This is a bounded teaching proof for the cutoff and partition-of-unity dependency in the SH-03 manifold embedding construction. It treats Hausdorff, second-countable, finite-dimensional real analytic manifolds. Fix a finite integer . Every function constructed below is , and its graph is locally semianalytic, hence locally subanalytic, in the indicated analytic manifold. The word “subanalytic” here concerns every ambient point of that graph; it does not assert a single globally definable Euclidean presentation at infinity.
The same results are treated in Marja Kankaanrinta, A subanalytic triangulation theorem for real analytic orbifolds, arXiv:1105.0209v2, §5. Its closed-set separation lemma cites Proposition 5.4 of Kankaanrinta’s 1991 dissertation. The proof below supplies the manifold separation and support construction directly, without taking that unread proposition as a prerequisite. It also supplies the finite regularity needed for the embedding’s differential-rank argument. Kankaanrinta’s §5 is the comparison source for the construction, not the source of this stronger stated regularity.
Statements and support convention
For a function on , write
The following statements will be proved.
- Every open cover of , with no subanalyticity hypothesis on its members, admits a countable , locally subanalytic partition of unity . Each support is compact, lies in one analytic chart and in one member of , and the support family is locally finite in .
- For arbitrary disjoint closed subsets , there is a , locally subanalytic with and .
- If is closed and , where is open, there is a , locally subanalytic with and . If is compact, can have compact support in ; if lies in an analytic chart, that compact support lies in that chart.
Compactness in statement 3 requires a compact inner set. If is noncompact, a compactly supported function equal to one on is impossible. The general statement instead supplies a support contained in a locally finite union of compact coordinate-ball supports. All partition members in statement 1 individually have compact supports.
The empty manifold and an empty inner set have the empty partition and zero cutoff, respectively. All remaining arguments assume the relevant set is nonempty.
1. The compact radial bump, including derivative checks
Choose rational data and in . Set , , , and . For a real variable , define
The denominator is strictly positive for every real : if , then ; if , then ; and between and both are positive. Thus
The graph of this function is semialgebraic: on the three polynomial-inequality regions it is specified by , with , and , respectively. Overlapping endpoints give the same value. Non-strict inequalities are expressible using strict inequalities and equalities. Consequently, no projection theorem or o-minimal result is needed for this graph description.
The function is . Indeed, its derivatives through order on the positive half-line are constant multiples of , which tend to zero at the origin, matching the zero derivatives on the negative half-line. Its quotient in (C1) is therefore . Equivalently, near from above,
and near from below,
Since , these expressions have zero derivatives of all orders at their joining endpoints. In particular, for the required case , and more generally for ,
and outside this interval and at both endpoints. The displayed derivative tends to zero there.
Let be an analytic chart such that . Define
On , composition with the analytic squared norm makes a function, equal to one on the closed inner ball and strictly positive exactly on the open outer ball. In chart coordinates its gradient is
which tends to zero at both joining spheres. Its support in is exactly
This is compact and therefore closed in the Hausdorff manifold , and it lies in . Every point of , including every point outside , has an open neighborhood disjoint from ; on that neighborhood . Thus zero extension introduces neither a continuity nor a differentiability defect at the chart boundary.
The graph is locally semianalytic on , by the three analytic branch conditions from (C2) with ; at every point outside , the graph is locally the analytic zero graph. These cases cover all ambient graph points, so is locally semianalytic and locally subanalytic globally on . A different analytic chart does not change this conclusion: analytic coordinate transitions substitute analytic functions in the finitely many local equations and inequalities. The construction also works for a zero-dimensional chart, where the coordinate ball is the singleton .
2. A countable locally finite nested coordinate-ball refinement
We prove the topological refinement needed above instead of assuming an analytic partition of unity or requiring a cover member to be subanalytic.
First, there is a countable cover by open coordinate balls with compact closures in . For every point, take a coordinate ball whose closed coordinate ball lies in a chart image; its closure in is compact. Second countability gives a countable subcover: for each basis element contained in some member of this cover, select one such member. The selected members cover because a point and a covering neighborhood contain an appropriate basis element. This argument also proves the particular Lindelöf assertion being used.
Construct compact sets , , with
where . At stage , cover the compact set by finitely many precompact open coordinate balls, and let be the union of their compact closures. The original open balls are an open subset of this union containing the target compact set, which proves its inclusion in . The resulting need not be subanalytic. They are only used to organize the choices.
Given any open cover , put
The sets are compact and cover : for any , its first membership in some places it in . Also , since and .
At , choose containing and an analytic chart around . The intersection of this chart, , and is open. In its chart coordinates, choose a rational center and rational such that the inner ball contains the coordinate of and the closed outer ball lies in that intersection. To justify the rational choice, first take a small Euclidean neighborhood contained in the target open set, then take close enough to the coordinate of , and choose rational radii satisfying
with smaller than the remaining distance to the boundary of the chosen Euclidean neighborhood. Density of the rationals provides such data.
By compactness, finitely many resulting inner balls cover . Write them as and their corresponding compact outer balls as , . We have
and every lies compactly inside an analytic chart. The family of all is locally finite in . Indeed, if , this open neighborhood is disjoint from for every , because those balls avoid . Only finitely many earlier levels remain, with finitely many balls at each level. The inner balls cover , and the family is countable.
This proves precisely the needed refinement by nested balls with locally finite compact outer closures. It uses only second countability, the Hausdorff condition, elementary coordinate topology, and finite subcovers of compact sets.
3. Local graph calculus, with the boundedness hypotheses made explicit
For the particular radial bumps and their combinations, even the full general subanalytic image calculus can be avoided. Near any point, only finitely many compact supports from (C8) meet a neighborhood. A member whose support misses the point is identically zero after a further shrinking. For every other member the point lies in its analytic chart. Intersecting these finitely many neighborhoods gives a neighborhood on which each bump has finitely many semianalytic branches with an analytic expression. On a middle branch that expression is rational in analytic functions and its denominator is positive on the branch, as in (C2). Refine by the finitely many simultaneous branch choices. Each resulting piece is semianalytic, and sums, products, and quotients with a positive denominator have analytic expressions on a neighborhood of that piece. Their graphs are specified by analytic equations, or by the same equations after clearing positive denominators. Finite union gives a locally semianalytic graph. This observation will cover all the cutoffs, separation functions, and partitions constructed below.
Here are the corresponding general local subanalytic graph statements useful for other parts of the embedding argument. In these statements functions are continuous; this ensures bounded auxiliary graph coordinates near a fixed point.
G1 — finite tuples. If continuous have locally subanalytic graphs, then the graph of is locally subanalytic. In local coordinates, it is the intersection of the analytic inverse images of under . This uses finite intersection and analytic inverse-image closure.
G2 — sums and products. If are continuous with locally subanalytic graphs, then and have locally subanalytic graphs. Fix , take a relatively compact coordinate neighborhood , and shrink it so are bounded on a neighborhood of . Take bounded open auxiliary intervals containing their ranges there. Intersect the two graph conditions and the analytic equation , respectively , inside these bounded coordinates, also bounding . This subanalytic set has compact closure in a larger chart-and-interval neighborhood. Projection to is analytic and proper on that compact closure, so its image is subanalytic near . The projection describes exactly the desired graph. The properness on the closure, not just on the graph set, is the relevant image hypothesis.
G3 — reciprocal and division. If is continuous, locally subanalytic, and nonzero everywhere, the graph of is the analytic inverse image of under , on the open manifold . At an ambient point with , continuity of makes bounded near its base point, so reciprocals cannot approach zero there; the graph is locally empty. Alternatively, near , is bounded above and bounded away from zero, and the bounded graph projection argument applies. Together with G2 this proves the division statement. A positive continuous denominator admits these local bounds even if its global infimum is zero.
G4 — analytic compositions. A continuous locally subanalytic map composed with an analytic map defined on a neighborhood of its local image remains locally subanalytic. Use G1 and the graph equation , restricting to a compact neighborhood of the image and to bounded coordinates, and project as in G2. Analytic chart changes and products with analytic chart coordinates are special cases. For the constructed piecewise analytic functions these cases also follow directly from their finite branch equations.
G5 — locally finite sums. If is a family of locally subanalytic functions with locally finite supports in the ambient manifold, then is and locally subanalytic. Around every point, all but finitely many functions vanish on one neighborhood, so this is a finite sum there. The assertion concerns supports, not merely a pointwise finite count of nonzero values. Derivatives through order are those of the finite local sum.
G6 — controlled zero extension. Let be open and let be and locally subanalytic. If
then extending by zero to preserves both properties. On there is no change; each point outside lies in the open set , where the extension is identically zero. Compact containment is a sufficient instance of (C9), not a replacement for local subanalyticity of the original graph. In particular, if has compact support in an analytic chart , the zero extension of is and locally subanalytic by G2/G4/G6. Chart coordinates may be unbounded towards the chart boundary, but every point of that boundary has a neighborhood where this product is zero.
The general facts G1–G4 use the exact lower-calculus prerequisites
“finite intersection,” “analytic inverse images,” and “analytic images
proper on the closure,” used here with their precise conditions: finite
intersections and analytic inverse images preserve local subanalyticity;
an analytic image is locally subanalytic when its restriction to the
closure of the source set is proper. G5 and G6 are proved here from
locality. Their globally subanalytic Euclidean analogues are actually
read in Guillaume Valette, On subanalytic geometry,
arXiv:2507.23622v1, native analytic_geometry.tex, lines
61–127 (graph definition and Basic Properties). Those global analogues
are not applied to an arbitrary open cover or to the whole manifold. The
direct finite-branch argument at the start of this section makes the
present partition and cutoff conclusions independent of these deeper
general closure theorems; they need only the elementary inclusion of
semianalytic sets among subanalytic sets.
4. Partition of unity subordinate to an arbitrary open cover
Apply Section 2 to , and index the chosen pairs of nested balls by . Let be the bump from Section 1, equal to one on the corresponding inner ball and supported on its compact outer ball . Define
The sums are locally finite in a neighborhood, so is and locally semianalytic by Section 3. Some inner ball contains every , and its bump equals one there, hence . Division preserves regularity, and the finite branch descriptions prove each quotient locally semianalytic. Alternatively, G3 proves local subanalyticity directly. Thus
The support equality holds because is strictly positive: exactly where . These supports are compact, contained in analytic charts, and locally finite. They cover since at every point some is positive. This proves statement 1, including all support and smoothness conditions.
If a partition indexed by the original cover members is wanted, choose the recorded assignment and put
It is and locally subanalytic; only countably many members are nonzero. Its support is contained in and the grouped support family is locally finite. To check this last support assertion rather than assume it, a locally finite union of closed sets is closed: near a point outside the union, first discard all but finitely many sets using local finiteness and then avoid those finitely many closed sets. Therefore the union of with is a closed subset of containing . A neighborhood meeting only finitely many can meet only the finitely many grouped supports with their labels. Grouping can lose compact support in one chart, so the refined partition (C10) is the version used when those conditions matter.
5. Arbitrary closed-set separation without realizing an arbitrary zero set
For disjoint closed , the two open sets
cover . Apply the refined partition of Section 4, with each support assigned to one of these two sets. Write for indices assigned to , and put
This is a locally finite sum, is and locally subanalytic, and lies in . At a point of , every term in this sum vanishes, since its support is disjoint from ; hence . At a point of , every partition term assigned to vanishes, so the remaining terms sum to one; hence . This proves statement 2.
In particular, we never cover all of by a support family that is locally finite in and demand positivity at every point there. Such a construction would force , an unjustified condition for an arbitrary closed set. In (C12) the zero set merely contains and the one set contains . The arbitrary sets are inputs to open-neighborhood choices, not analytic graph constraints.
6. Cutoff plateaus and the nested-shrink use
Let with closed and open. Apply Section 4 to the open cover . If consists of indices assigned to , set
Exactly as in Section 5, , is and locally subanalytic, and . The closed, locally finite union lies in , so
This proves the general cutoff assertion. Notice that zero values on , by themselves, would not establish (C14); the locally finite closed union is the support control.
There is a shorter compact construction that also gives a plateau on an open neighborhood of . If is compact, choose finitely many nested coordinate balls with outer compact balls contained in and with inner open balls covering . Let their bumps be , and set
Each factor lies in , so . On every inner ball some , hence . Outside the finite union of outer compact balls all , hence . The finite union is a compact subset of . Finite products preserve regularity and the local finite branch graph description. Thus (C15) is a compactly supported , locally subanalytic cutoff equal to one on an open neighborhood of . When lies in one analytic chart, all the balls can be selected in that chart, so the support lies compactly inside it. One can also form the product locally for a locally finite ball family, but the partition proof (C13) already supplies the general noncompact statement.
For the intended nested-shrink application, assume
Formula (C15), applied to , gives
with regularity and a locally semianalytic graph. Here means that is compact and contained in ; need not be subanalytic. If a locally finite family and compact inner sets are supplied, construct independently this way. The supports remain locally finite because they are contained in . If the inner sets cover , then , and (C10) with in place of gives the desired partition. This applies to a finite-color family just as to an uncolored locally finite family; no coloring hypothesis enters the cutoff proof.
Finally, for each chart , the vector map
is and locally subanalytic by the finite branch equations or G2/G4/G6. On the plateau neighborhood it equals , with exactly the chart’s derivatives. This is the cutoff fact needed for the later embedding and coordinate-recovery argument; the embedding itself is outside this bounded proof.
7. Optional finite-group chart statement
Suppose a finite group acts analytically on , and are invariant disjoint closed sets. Apply Section 5, then average:
This function is invariant, , locally subanalytic, still in , and has the same prescribed zero and one values. Analytic diffeomorphisms preserve the local finite branch equations; the finite sum preserves all regularity. Likewise, if are invariant and a compact cutoff is available, the average is one on and has support contained in the finite compact union . This supplies a bounded finite-group lift of the separation/cutoff fact. No full orbifold atlas-gluing or global quotient theorem is claimed here.
Exact dependency boundary
For the constructed partitions and cutoffs, the dependencies are finite-dimensional analytic chart topology; second countability and Hausdorff compactness; density of rational coordinate data; finite subcovers of compact sets; elementary differentiation and division by a nonvanishing function; the definition of locally semianalytic sets and its invariance under analytic coordinate changes; and semianalytic inclusion in the local subanalytic class. The compact-exhaustion and locally finite refinement steps are fully proved in Section 2. No analytic partition of unity, analytic embedding theorem, arbitrary globally definable cover, or prescribed subanalyticity of an arbitrary open/closed input set is assumed. General local graph consequences G1–G4 additionally use only the lower calculus stated with its proper-on-closure condition in the owned lesson; those deeper statements are not needed for the explicit finite-branch construction.
Finite-colour refinement for a manifold
This is a complete proof of the manifold case needed by SH-03. It applies to a topological manifold; no differentiable structure is required. The auxiliary nerve need not have a global dimension bound. The construction never triangulates the manifold.
Statement
Let be a second-countable Hausdorff topological -manifold, , and let be any open cover. Then there is a countable locally finite open refinement
which covers , such that distinct members of each are disjoint. We can require more: for every there are an original cover member and a prescribed-atlas chart domain such that
Thus the statement requested for a second-countable Hausdorff paracompact manifold follows. Paracompactness need not be used separately: the elementary exhaustion below provides the needed locally finite covers. The empty manifold is immediate. The usual convention here is that manifold charts are open subsets of , so no boundary is involved.
Source comparison and provenance
Marja Kankaanrinta, A subanalytic triangulation theorem for real
analytic orbifolds, arXiv:1105.0209v2, Section 2, the theorem
labelled palais, states the finite-colour theorem for a
paracompact space of covering dimension
,
attributes the result originally to J. Milnor, and cites R. S. Palais,
The classification of G-spaces, Memoirs of the American
Mathematical Society 36 (1960), Theorem 1.8.2. Its next paragraph
explains the indexing by finite unordered tuples. The actual native
source was read at lines 212–235 and its bibliography at lines
1045–1047. Source
record.
John Milnor’s Differential Topology, Princeton lectures, Fall 1958, notes by James Munkres, Lemma 2.19, gives the colouring by strict inequalities between partition coordinates. That text assumes the covering-dimension bound for a manifold. The actual source was read at the opening page (attribution and chapter structure) and printed pages 18–19, especially Lemma 2.19 on printed page 19, PDF page index 18. Available lecture notes.
The strict-inequality colouring in the last section below is this Milnor construction, with its openness and local finiteness checked explicitly. The missing manifold dimension input is supplied here by a proved local approximation lemma and a locally finite elimination of nerve simplices. The resulting proof is a reconstructed elementary argument, not a claim to have read Palais’s proof. In particular, Palais Theorem 1.8.2 and an asserted equality of manifold and covering dimensions are not dependencies of this proof.
1. Locally finite compact chart supports
We first construct the elementary neighbourhood data used twice in the proof.
A point in an open set has nested chart cubes such that
Indeed, restrict a chart around the point to , and choose two nested Euclidean open cubes whose closures lie in its coordinate image. Their closed-cube inverse images are compact and hence closed in the Hausdorff space ; they are consequently the closures in . The chart may be chosen from a supplied atlas and restricted. The same argument works for , when a chart cube is a single isolated point.
There is a countable cover by such relatively compact chart neighbourhoods. To see the countability, a second-countable space is Lindelöf: from an open cover, select one cover member for each basis element which lies in a cover member. These selected members still cover. Apply this to the cover of all the neighbourhoods just constructed.
There are compact sets , , with
Inductively cover the compact set by finitely many relatively compact chart neighbourhoods and let be the union of their closures. The open neighbourhoods in that finite cover show that . The sets are compact, and every is eventually in an interior. Set for negative .
The compact band
lies in the open set
For every point of , use (F2) inside , with containing the point and a chosen atlas chart containing it. Select finitely many inner cubes covering , and retain their paired outer cubes . Enumerate the pairs as , where is finite or countable. They satisfy
The outer family is locally finite. If , the neighbourhood meets none of the cubes belonging to a band , because these cubes avoid . Only finitely many smaller bands exist, and each contributes finitely many cubes. In particular every compact set meets only finitely many : use finitely many of these local neighbourhoods to cover the compact set.
Within the coordinates of , take a continuous product of one-dimensional hat functions which equals one on and vanishes outside a smaller closed cube inside . Extend it by zero to . This gives
The zero extension is continuous, since its support is contained in the interior of its chart domain. The family of supports is locally finite. The sum is therefore continuous and positive, and
is a continuous partition with compact chart supports. All sums are finite on a neighbourhood of each point. This constructs the partition needed here, rather than invoking a partition-of-unity theorem.
Exactly the same construction applies to any open submanifold , using its own compact exhaustion. It supplies a locally finite family of closed inner cubes covering , continuous functions equal to one on those inner cubes, and larger compact chart cubes containing their supports.
2. A proved point-avoidance approximation lemma
Lemma. Suppose is a second-countable Hausdorff topological -manifold, , is continuous, , and is continuous. There is a continuous with
Local approximation. On a closed Euclidean -cube , every continuous map to can be approximated uniformly within any by a piecewise affine map missing . Subdivide into a sufficiently fine finite cubical grid. Each small grid cube is divided into the simplexes obtained by ordering its coordinate increments; these divisions agree on shared faces. Uniform continuity makes the oscillation of on each small simplex less than .
Choose the images of the finitely many vertices within of their original images, as follows. When a new vertex image is chosen, avoid the affine spans of together with each collection of at most previously chosen vertex images. There are finitely many spans, each of dimension at most . A proper affine subspace is closed with empty interior; a finite union of such subspaces cannot contain a nonempty open ball, by successively choosing a smaller open ball disjoint from each subspace. Thus a permissible new image always exists in the required small ball. The construction ensures that together with any at most chosen vertex images is affinely independent.
Extend the vertex images affinely over each simplex. The extensions agree on faces. No simplex image contains , because that would put in the affine span of at most of its vertex images. Barycentric interpolation and the oscillation bound give uniform error less than . This is only an explicit finite decomposition of a Euclidean cube, not a triangulation of .
Global construction. Use the end of Section 1 on to obtain closed inner chart cubes covering , larger closed chart cubes , and continuous functions such that
Choose these so that the family is locally finite. Put . Inductively choose satisfying
and, when ,
The second minimum is positive by the preceding stages and compactness. Empty unions impose no condition. Approximate , in its chart coordinates, by a piecewise affine map missing with error less than , and define
The formula is continuous across the boundary of , since vanishes on a neighbourhood of that boundary. On , the new map equals and avoids . Condition (F9) preserves avoidance on all earlier . Hence avoids on .
Every point has a neighbourhood meeting only finitely many . Thus is eventually constant on that neighbourhood, and the pointwise limit is continuous. Each point belongs to some , and its final value is a finite-stage value after stage ; it still avoids . At a point changed at stage , (F8) bounds the change by . Therefore
This proves the lemma. It uses neither Sard’s theorem, a smooth approximation theorem, the Baire theorem, nor covering dimension.
3. The nerve is locally finite, and the partition map is proper
Let be the nerve of the cover : a nonempty finite set of vertices is a simplex when . Its realization consists of the finitely supported vectors
in , with the subspace topology. This agrees with the usual simplex topology for this locally finite complex.
In fact each vertex belongs to only finitely many simplexes. The compact set meets only finitely many cover members; any simplex containing has all its vertices among these finitely many neighbours. There are only finitely many such finite vertex subsets. This proves local finiteness of the complex, but does not supply a uniform bound on its simplex dimensions.
Here are the topology details we will use. At , choose an index with . The open neighbourhood
meets only the finitely many simplexes containing . It lies in a finite subcomplex; its closure lies in a compact union of finitely many closed simplexes. Thus is locally compact and Hausdorff. The same finite-subcomplex description proves agreement of the two topologies. A compact subset of lies in a finite subcomplex: cover it by finitely many neighbourhoods (F11), then take the union of their finite subcomplexes.
The functions (F6) define a map
Its support is a simplex because implies . Continuity follows from the fact that locally only finitely many of the occur. If a compact set lies in a subcomplex with finite vertex set , then
The inverse image is closed and the right side is compact, so is proper. It is also a closed map: for a closed and , take a compact neighbourhood of . The set is compact and closed, so its complement in the interior of gives a neighbourhood of missing . In particular is closed in .
The same argument applies to any continuous for which
Such a map remains proper and closed. We will maintain this support condition during the compression. Properness is verified here because it is useful to the intended nerve route; point avoidance itself was proved in Section 2 and does not require closedness of the image.
4. Compress into the -skeleton without enlarging supports
We explain one simplex removal first. Let be a subcomplex, let be a maximal simplex of with dimension , and let be continuous. Choose , for example its barycentre, and put
The interior of this maximal simplex is open in . Indeed, near an interior point all its vertex coordinates are positive; any simplex with those coordinates positive must contain , and maximality forces it to equal . Therefore is an open -manifold. If is empty, the simplex may simply be removed.
Otherwise identify the affine span of with . Apply Section 2 on to , the point , and the continuous positive tolerance
We obtain . The image stays in the simplex interior because its displacement is less than the distance to the boundary. Define on and elsewhere. This extension is continuous: at , continuity and closedness of give ; as tends to , the bound (F15) tends to zero. The modification has not changed any coordinate outside the carrier , nor introduced or removed vertices within its interior. Thus
and it is unchanged elsewhere. The map now misses everywhere.
Radially retract to its boundary. In the vertex coordinates of , with , write
The maximum is positive for , because the coordinates of both and sum to one. Since , the ray reaches the simplex boundary at this parameter; every coordinate of is nonnegative, at least one is zero, and their sum is one. If , some , so and . The formula is continuous away from .
Extend by the identity outside . This is a continuous map on : the two closed pieces and agree on the boundary. Hence
is continuous, where removing the maximal simplex means removing its interior while retaining all its proper faces. It satisfies
At a point changed by (F17), its former carrier was exactly ; the radial retraction replaces this carrier by a proper face.
We now perform such removals for all simplexes of dimension greater than . Their dimensions may be unbounded. An ordinary instruction to start at a highest dimension would consequently be invalid. Instead enumerate these simplexes in an arbitrary fixed countable list, and repeatedly remove the first unremoved simplex in that list whose proper cofaces have all been removed.
This process is well defined and eventually removes every listed simplex. Each simplex has only finitely many cofaces, since any one of its vertices belongs to only finitely many simplexes of . Among the unremoved cofaces of any unremoved simplex, a maximal one is available for removal. To see eventual removal, induct on the maximum length of a proper-coface chain above a given simplex. Maximal simplexes are immediately available. Once the finitely many proper cofaces of a simplex have been removed, it is available permanently, and only finitely many entries earlier in the fixed list can precede it. Thus it is removed after finitely many more steps. This induction has finite height for each simplex, even though heights are not globally bounded.
Starting with , apply (F17) at these stages. Denote the successive maps by . Their supports decrease pointwise. At a given , choose a neighbourhood meeting only finitely many , with their indices in a finite set . Throughout the construction every image of a point of has its support in , by (F18). A simplex removal can change that map on only if all vertices of the removed simplex belong to . There are only finitely many such simplexes, and each is removed once. Consequently the maps are eventually constant on .
Their pointwise limit
is therefore continuous. Its image lies in the -skeleton: the interior of every simplex of larger dimension is removed at a finite stage and is never reintroduced. The support condition (F14) holds. In particular
The family of coordinate supports is still locally finite, each support lies in , and , viewed as a map to , is proper and closed by (F13)–(F14). These conclusions are valid despite the original nerve’s unbounded global dimension.
5. Colour by the number of strictly dominant coordinates
For every nonempty finite with , put
Use the colour , and discard empty sets. Formula (F21) is the strict coordinate version of the open stars of barycentres indexed by faces; the following direct checks avoid needing a barycentric-subdivision theorem.
Openness. On a neighbourhood where the original supports have indices in a finite set , the maximum on the right is the maximum of zero and finitely many continuous functions with indices in . The minimum on the left is also continuous. Its strict inequality defines an open set. No infinite-intersection openness assertion is being used.
Covering. At , let . By (F20), this is a nonempty set of at most indices. Its minimum is positive and all outside coordinates are zero, so .
Disjointness within one colour. If and , choose and . Membership in would give , while membership in would give . Thus .
Refinement and closure control. For every , (F21) implies . By (F20) and (F5),
Since is compact and closed, is compact. This proves (F1). In fact (F22) holds simultaneously for all .
Countability and local finiteness. The collection of finite subsets of a countable is countable. On the neighbourhood used above, a set can meet only if : every index in must have positive coordinate there. There are only finitely many such subsets. Thus the whole cover is locally finite. Its family of closures is locally finite as well, since a closure meeting the open set implies the corresponding open set meets .
This proves the theorem in its full manifold scope.
Dependency and scope verdict
The complete logical route is: compact chart cubes and exhaustion → explicit continuous compact-support partition → locally finite nerve → proved point avoidance on an open manifold → coface-first simplex elimination → Milnor’s strict-inequality colouring. Every step is proved above. The elementary background used is compactness, the Hausdorff property, second countability, uniform continuity on a compact cube, finite affine geometry and finite maxima/minima. No global manifold triangulation, finite-covering-dimension theorem, smoothing theorem, smooth partition theorem or Sard theorem is an unproved primitive. The only simplex decomposition is the explicitly described finite grid decomposition inside one Euclidean chart cube.
The output even gives a cover of multiplicity at most , so the upper covering-dimension bound follows from the construction when that convention is used. Equality of covering dimension with is unnecessary and is not claimed as proved here.
For an analytic manifold, may be chosen from its analytic atlas. The sets are arbitrary open subsets with compact closures inside those charts. The proof does not assert that is subanalytic, connected, a ball, or contractible. Subanalytic cutoff functions or any separate definability requirement must be supplied by their own argument. Distinct same-colour open sets are disjoint; pairwise disjointness of their closures is not asserted. The stronger closure inclusion (F22) is the chart-control input established here.
Proper embedding and transport to the manifold
The relative polyhedron theorem above concerns a closed linear polyhedron in Euclidean space. Here we supply the globalization step for an arbitrary Hausdorff second-countable real analytic manifold of dimension . The family to be triangulated is locally finite in ; each is locally subanalytic. Neither compactness of nor a globally definable atlas is assumed.
The construction follows the finite-colour and proper-normalization mechanism in Marja Kankaanrinta, A subanalytic triangulation theorem for real analytic orbifolds, §§5–6. In the manifold case ordinary analytic chart coordinates replace the invariant maps needed for an orbifold. The finite-colour covering and continuously differentiable cutoff lemmas proved above are the topological and function-theoretic ingredients. The relative polyhedron theorem retains its stated lower subanalytic prerequisites; this globalization argument does not supply uniformization or a resolution algorithm.
A finite-coordinate embedding with locally recoverable charts
Choose a countable locally finite refinement of a relatively compact analytic chart cover, where , is a positive integer, and distinct sets of the same colour are disjoint. The closure of each member stays in its assigned chart. Repeated shrinking of this locally finite cover gives three open covers with the same indices and
Here is the shrinking argument with its support condition. Take the proved compact-support partition subordinate to the cover , and group its terms by their assigned member. The grouped functions still form a partition. Their supports lie in : a locally finite union of the assigned compact supports is closed in , and contained in that member. Each is compact, because it is closed and lies in the compact closure of . These supports cover . In the assigned chart, the compact image of has positive distance from the complement of the open image of . Take three successively larger sufficiently small distance neighborhoods, with compact closures, to obtain . They all contain , so each family covers . They remain locally finite and preserve same-colour disjointness because they are subsets of the original members. This proves the displayed shrinkings without a separate shrinking theorem.
Empty members can be omitted. Local finiteness implies that the closure of the union for one colour equals the union of its member closures. Write for these unions. By the cutoff lemma there are , locally subanalytic functions such that
Let be the analytic coordinate map of the assigned chart, restricted to . On the disjoint union , define
Each is analytic on its open domain. At a point outside , local finiteness and give a neighborhood meeting none of the relevant supports. Thus zero extension makes a , locally subanalytic map on all of . Although the integer labels and chart coordinates need not be bounded globally, only finitely many labelled chart pieces occur near any point. This is precisely the local assertion required for these operations.
Set , and define
We prove that is a topological embedding. If , choose with . Then , so . Since throughout , equality of the last coordinate of forces . Equality of its first coordinates gives , hence .
For continuity of the inverse, suppose . Again choose . Eventually , so , where . The integer coordinate of tends to . It therefore equals eventually. Now , and convergence of the chart coordinates implies . Manifolds and Euclidean subspaces are first countable, so this sequential criterion proves continuity of .
The integer coordinate is essential in this proof. Positivity of alone locates a point in the union , not in one specified .
There is also a differential observation we will use later. At every some . On a neighborhood of that point in , the first coordinates of are the analytic chart coordinates themselves, since . Consequently is injective. Thus is a embedding with local analytic coordinates among its blocks, despite not being analytic across all cutoff boundaries.
Properness by one extra coordinate
Choose a countable locally finite , locally subanalytic partition of unity with compact supports, and put
The sum is finite near every point. It follows that is , locally subanalytic and strictly positive, with . Coordinate ratios recover from , so remains a topological embedding and an immersion.
For , choose with . Outside ,
Thus is a closed subset of a finite union of compact supports and is compact. If is compact, its last coordinate is bounded above by some . Since the last coordinate of is , its inverse image is a closed subset of . Hence is compact. This proves properness directly, without a second limit-point argument.
A proper map from a locally compact space to Euclidean space is closed here: if converges, the sequence lies in a compact Euclidean set, its inverse image is compact, and a convergent subsequence has the required image limit. Therefore is closed.
The proper-image calculus needed in this construction
We give the bounded local argument rather than infer global definability from the existence of an atlas. Let be continuous, proper and locally subanalytic, and let be locally subanalytic. Fix a target point and . The set
is compact. Cover by finitely many closed analytic coordinate boxes , each contained in a chart neighborhood where and the graph of are locally subanalytic. Choose the boxes small enough that their interiors cover . By continuity, is bounded. The bounded-chart comparison proved in the analytic preparation component makes
a bounded globally subanalytic set in chart and target coordinates. One can see this comparison at every point of its ambient closure: the source coordinate is in , the target coordinate is by continuity, and the box lies strictly inside the chart. Thus no witness is being extended past its analytic domain.
Project these finitely many graph traces to the target and intersect with . Their union is exactly . Indeed any source point mapping into that ball belongs to , which the boxes cover. Conversely every projected point comes from . The proved finite Boolean and projection calculus therefore makes locally subanalytic. This establishes the proper-image assertion in the generality used here, including the map .
Properness also carries local finiteness to the target. A compact inverse image of has a finite neighborhood cover, each member meeting only finitely many . Hence only finitely many meet . This proves ambient local finiteness even at points outside , rather than just local finiteness in .
The subanalytic structure does not depend on the chosen proper embedding. If is another continuous proper locally subanalytic topological embedding, then is proper: the inverse image of a compact product is closed in the compact inverse image under of its first projection. Its image is the graph of , and is locally subanalytic by the argument just given. Swapping the factors gives the graph of the inverse. Thus the comparison is a subanalytic homeomorphism.
A closed ambient polyhedron and the subcomplex it induces
Put . There is an explicit locally finite linear triangulation of all of . For each integer vector and each permutation of , take the simplex with vertices
These simplices fill the unit cube : order the fractional coordinates of a point, and express it by the successive coordinate differences as nonnegative barycentric weights. On a cube face, the coordinates fixed at zero or one drop out, leaving the same construction in the remaining coordinates. Thus adjacent cubes give the same subdivision of their common face. Include every simplex face. Any compact set meets finitely many unit cubes and finitely many of their simplices, proving local finiteness. Its support is the closed set .
Apply the relative polyhedron theorem to , with the locally finite subanalytic family consisting of and all . It gives a subdivision and a subanalytic homeomorphism , analytic with injective differential on each new open simplex, compatible with the whole family.
Let consist of the simplices for which . This is a subcomplex. In fact, closedness of implies
Every face of consequently has its open image in , and belongs to . Conversely compatibility says that every point of lies in the image of an included open simplex. Hence . As a subcomplex, is locally finite. It is countable, since each compact integer box meets finitely many simplices and these boxes exhaust the ambient space. Its support is closed.
The map
is a homeomorphism, compatible with every . It and its inverse are locally subanalytic. To verify this without a nonproper-composition assumption, restrict to compact coordinate and simplex boxes. The graph of the composition is obtained by intersecting the two bounded subanalytic graphs along their common -coordinate and projecting; the middle coordinate is bounded because the maps are continuous on the chosen compact sets. The bounded comparison and projection calculus apply. Such boxes cover neighborhoods of every graph point in both directions.
Why the open simplices are analytic embedded submanifolds
Subanalyticity of alone does not imply analyticity on an open simplex. We use the special coordinate blocks in .
Let , and write for . The last coordinate is positive. Every coordinate of is the analytic ratio . Given , choose with . Near we have , so and . The corresponding integer coordinate is continuous and integer-valued there, and hence locally equals . The first coordinates of the -th block are therefore exactly
They are the analytic coordinate ratios just identified. The analytic inverse of the chart shows that is analytic near . Since was arbitrary, it is analytic throughout the open simplex.
Its differential is injective. Indeed , and is . The chain rule gives
The left side equals by the relative polyhedron theorem. Thus both inequalities are equalities. The analytic constant-rank theorem gives local analytic immersion charts. Since is a homeomorphism on the entire support, its restriction is a homeomorphism onto its image with the subspace topology. Consequently the image is an analytic embedded submanifold and the restriction is an analytic diffeomorphism onto it. In particular no simplex has dimension greater than .
We have proved the arbitrary-manifold triangulation statement from the displayed lower prerequisites, with no analytic embedding theorem for and no global analyticity assertion for the cutoff construction. The regularity was used only in the chain-rule rank argument; finite-colour chart blocks supplied the analyticity of each transported simplex.
Exercises on the globalization mechanism
Integer labels identify the chart piece
Suppose is a disjoint union of open chart pieces and the coordinate map on each piece is . On consider . If with , prove that eventually belongs to , and explain why merely knowing is insufficient. Give a counterexample to discarding the integer coordinate.
Solution. The last coordinates are positive integers tending to . Eventually their distance from is less than , which forces equality. Hence eventually . The first coordinates then converge to ; the continuous inverse of the one fixed chart gives .
For the counterexample let , a second-countable real analytic one-manifold, with its usual coordinate on each component. Take and . The unlabelled coordinate map sends all these points to zero, although the sequence does not converge to : the open first component is a neighborhood containing none of its terms. It also fails injectivity. The example concerns the local chart-piece identification step; it is not a proposed compact-support atlas for the global construction. In that construction positivity of first places the sequence in , and the unscaled integer coordinate then provides the additional localization.
A weighted partition detects escape from every compact set
Let be a locally finite partition of unity on , with compact supports, and let . Prove that is compact for every . If a sequence eventually leaves every compact subset of , show that . Explain how this makes proper even when the image of is bounded.
Solution. Choose with . Outside the finite compact union , the partition identity gives
Consequently is a closed subset of , and is compact. An escaping sequence eventually avoids this set for every ; hence and its reciprocal tends to infinity.
For a compact target set, bound its last coordinate above by . Its inverse image under is closed and lies in the compact set . It is therefore compact. Boundedness of the other coordinates has no effect on this conclusion. The single positive last coordinate carries the entire properness argument.
An analytic homeomorphism can have a zero differential
On , let , , and . Check that is a proper locally subanalytic topological embedding, that is an analytic immersion, and that is an analytic homeomorphism whose differential is not injective at zero. Identify the missing hypothesis in an attempted chain-rule rank argument. Contrast this with the map in the globalization proof.
Solution. Regard all three maps as maps from to itself. The cube-root map is a homeomorphism, so the inverse image of a compact set is compact. Its graph is given by , and is semialgebraic, hence locally subanalytic. The composite is , with differential equal to one. The map is analytic and bijective with continuous inverse, but . Thus an analytic homeomorphism need not be an analytic immersion or an analytic diffeomorphism.
The cube root is not differentiable at zero: for nonzero , which diverges. One cannot apply the chain rule there. In the globalization proof the constructed embedding is ; once chart-coordinate ratios prove that the transported simplex map is analytic, the chain rule is valid. Since has rank , it forces the transported map to have the same rank. The cutoff’s finite differentiability is therefore a substantive hypothesis in that step.
Closedness and ambient local finiteness do different jobs
Triangulate by its two vertices and one edge. For , collect simplices whose open interiors are contained in . Explain why this collection is not a subcomplex. Next let be , and let , . Verify that is locally finite in , whereas is not locally finite in the ambient target . State where properness repairs each problem in the theorem.
Solution. The open edge is , so the edge is selected. Neither endpoint is in , so neither vertex is selected. A simplicial subcomplex must contain every face of a selected simplex, and this collection fails that condition. When is closed instead, implies , because a continuous homeomorphism takes the closure of the open simplex to the closed simplex image. Every face is then selected as well.
Every bounded interval in the source meets finitely many positive integers; this proves local finiteness of the family . But
Every ambient neighborhood of meets infinitely many of these singleton images. The map is not proper as a map to : the inverse image of the compact set is the noncompact set . Its image is also not closed in that ambient space.
For the theorem’s proper embedding, the image is closed, which makes the selected simplices face-closed. Separately, the compact inverse image of a closed target ball meets only finitely many members of a locally finite source family, which establishes local finiteness in the whole target. Local finiteness only inside the image would not justify the ambient relative polyhedron theorem.
Exercises on compatible analytic partitions
Restriction rank must be calculated again
Exercise P1 (intermediate). Let , on , and prescribe compatibility with the analytic line . Both ambient maps have constant rank one. Give a connected analytic partition compatible with , compute both restriction ranks, and explain why decomposing only by ambient rank misses a necessary calculation.
Solution. The three members , , and form a finite compatible partition into connected analytic embedded submanifolds. On each open half-plane, the tangent space is , so both coordinate projections have rank one. On , the tangent vectors are . The differential of is zero, while that of sends to ; their ranks are zero and one respectively. An ambient rank decomposition has only the rank-one set for each map, so it gives no information about the rank after a lower-dimensional compatibility refinement. The partition proof recalculates the differentials in each smaller member’s own coordinates.
Accumulation prevents local finiteness
Exercise P2 (introductory). On , each singleton , , is semianalytic. Prove that there is no locally finite partition into connected analytic submanifolds compatible with every . Compare with the family , and give an explicit compatible locally finite partition for that family.
Solution. If a partition member contains , compatibility makes it a subset of , so that member must be exactly . Every neighborhood of zero contains infinitely many of these distinct members, contradicting local finiteness. The prescribed family itself is not locally finite at zero; the theorem’s family hypothesis is therefore substantive even though each individual set has a very simple analytic definition. For the integers, take all singletons and all intervals , . They are connected analytic submanifolds, cover disjointly, and are compatible with every integer singleton. A bounded neighborhood of any point meets only finitely many of these members. The partition is locally finite and countable, as required.
Sources and reuse
Masahiro Shiota’s Piecewise linearization of real analytic functions supplies the credited geometric source for the relative construction. Marja Kankaanrinta’s A subanalytic triangulation theorem for real analytic orbifolds, §§2, 5–6, supplies the finite-colour, cutoff and proper-embedding comparisons; the present proof specializes to manifolds. John Milnor’s 1958 Differential Topology lectures, with notes by James Munkres, supply the strict-coordinate colouring. The manifold dimension input is proved directly here by point avoidance and nerve compression. Palais’s general covering-dimension theorem and an analytic embedding theorem are not assumed.
Self-checked by the writing AI. No independent review of the entire parent course, no full lower-foundation closure, and no full-source coverage of the broader orbifold paper are claimed. Original teaching, solutions, illustration and reader code are CC0; human source expression is not imported or relicensed.
Reading index · Reuse terms · Provenance