Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-30
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite curvilinear triangulation of a compact Riemannian surface

Statement

Assume the axiom of choice. Let (M,g) be a compact smooth Riemannian surface, possibly disconnected, nonorientable, or with smooth boundary. Then M has a finite face-to-face curvilinear triangulation in the sense of Curvilinear face-to-face triangulation such that every closed face lies in a coordinate disk carrying a smooth orthonormal frame after a local orientation is chosen. Every prescribed boundary component is a union of boundary edges. If a finite open cover of M by strongly convex ambient coordinate disks is supplied, the faces can be chosen subordinate to that cover.

The same construction applies when M is a compact regular surface region with finitely many ordinary corners in a supplied boundaryless Riemannian surface. It yields finite triangular closed-disk faces with ordinary corners, regular C2 edges, full-edge or vertex intersections, the prescribed boundary as a subgraph, and circle links at interior vertices and interval links at boundary vertices, with the supplied corners retained as vertices. This is triangular face, edge, and link data on a cornered region; the smooth-boundary definition cited above is asserted only when M is a smooth manifold with boundary. In either case the finite closed cells form a regular CW structure on the underlying compact space, and its count V−E+F equals its singular-homology Euler characteristic.

Facts & Assumptions

Given: The compact Riemannian surface or regular cornered region of the Statement. Full AC is assumed because the planar Jordan-curve suppliers of [F2] use it (The Axiom of Choice).

[F1]

A smooth-boundary surface metric extends across its boundary to a neighbourhood in its smooth double; a cornered region already has its supplied ambient metric (Extending a compact surface metric across its boundary).

[F2]

A finite planar graph with regular embedded edges and pairwise distinct incident tangent rays in a closed coordinate disk admits a finite face-to-face disk refinement, with its original edges preserved up to subdivision. The proof further constructs triangular faces by a sequential polygonal fan in each Jordan face: steps 2.2 and 5.1–7.1 apply to any finite cyclic list of marked boundary vertices with positive sectors (Finite planar graph disk cuts and Euler count, proof 2.2 and 5.1–7.1).

[F3]

For a C2 function on a compact regular arc, almost every value is regular; finitely many critical-value sets and finitely many exceptional vertex distances can be avoided together (Morse-Sard for Euclidean maps).

[F4]

A curvilinear triangulation has regular C2 edges, triangular closed-disk faces, full-cell intersections, and the specified vertex links (Curvilinear face-to-face triangulation).

[F5]

For a finite CW complex, the alternating count of cells equals the alternating rank of integral singular homology (Euler–Poincare formula for finite CW complexes).

[F6]

Under AC, every point of a boundaryless Riemannian surface has a strongly geodesically convex neighbourhood inside any prescribed open neighbourhood. The proof constructs it as a coordinate ball in an orthonormal normal chart restricted to that open set (Existence of geodesically convex neighborhoods).

Proof

technique · use generic small metric circles to make a finite regular arrangement, assign each arrangement face one larger coordinate disk, triangulate that face by [F2], and reconcile subdivisions along shared old edges
1.1F1F6given

If M=∅, take empty face, edge, and vertex sets; the asserted CW count is 0=0, so the rest concerns nonempty M. For each p∈M, apply [F6] inside the ambient metric-extension neighbourhood supplied by [F1] and, when a finite strongly convex cover is supplied, inside a member containing p. The normal-coordinate construction in the proof of [F6] gives a strongly convex coordinate disk B(p,3ρp) centred at p. The smaller disks B(p,ρp) cover M; compactness selects a finite subcover with centres x1,…,xN and individual radii ρi>0. Thus each B(xi,3ρi) is a smooth strongly convex normal coordinate disk and, when a cover is supplied, lies in one of its members. A normal coordinate disk is a Euclidean round disk in the normal coordinates centred at its centre, and its coordinate tangent frame can be orthonormalized smoothly.

2.1F3step 1.1giveninduction

Choose radii si∈(ρi,2ρi) one at a time. At stage i the existing curves are finitely many compact regular C2 boundary arcs of M and already chosen smooth metric circles, cut at their finitely many intersections. The ambient distance d(xi,⋅) is smooth on every such arc in the annulus ρi<d(xi,⋅)<2ρi, which lies inside the normal coordinate disk B(xi,3ρi) of step 1.1. By [F3], choose si to be a regular value on every existing arc and to avoid its finitely many vertices and boundary corners. Intersections of the new circle with each previous arc are then transverse and form a compact discrete set, hence are finite. Avoid the finitely many radii of existing pairwise intersections to exclude triple points. Thus the circles and the prescribed boundary form a finite embedded regular C2 graph G on M after adding intersection vertices, supplied corners, and three auxiliary vertices on every closed curve component with no vertices, whether it is a selected metric circle or a smooth component of the prescribed boundary. At every vertex the incident tangent rays are distinct, including at circle–boundary crossings; at a prescribed corner the two boundary rays are distinct by ordinary-corner regularity.

3.1step 1.1step 2.1

The connected open faces of M∖G have constant membership in each open disk B(xi,si): crossing its circle is the only way to change that membership. Since the smaller disks B(xi,ρi) cover M, each face Q contains a point in some B(xi,ρi) and therefore lies wholly in B(xi,si). Its closure lies in the closed disk B(xi,si)‾. This assigns each face one such index i by the least possible index, a finite choice.

3.2F2F3step 2.1construct

After G is fixed, choose ti∈(2ρi,3ρi) using [F3] so that the larger normal-coordinate circle ∂B(xi,ti) meets all regular graph edges transversely and avoids every graph vertex. Restrict the complete graph G to this larger closed coordinate disk Vi=B(xi,ti)‾, add its circle boundary, and subdivide at the finitely many intersections. Add three vertices to the circle if needed. In its normal coordinates this is exactly an input to [F2]: all clipped edges are regular through endpoints, and crossings produce distinct tangent rays. The graph may have parallel edges, which [F2] permits.

4.1F2step 3.1step 3.2

If the face Q of step 3.1 is assigned to i, then Q‾⊂B(xi,ti) by si<ti. It is one whole face of the restricted graph in Vi: paths within Vi cannot join it to another global face without crossing G, and the added outer circle is disjoint from Q‾. Apply [F2] to the restricted graph and retain only those finitely many new vertices and arcs whose relative interiors lie in Q. This partitions Q into finitely many closed Jordan triangles inside the frameable coordinate disk Vi. Every global face has one assignment, so cuts retained for distinct faces have disjoint relative interiors. Each restricted graph has finitely many refined faces; a global face assigned to i contains at least one of them, and two distinct global faces cannot contain the same one. Hence the total number of global faces, and of all retained triangles, is finite.

5.1F2F4step 2.1step 4.1construct

The finitely many local constructions may mark an old edge of G at different points on its two sides. Insert the union of all such marks on each old edge, a finite common subdivision. A triangle adjacent to a newly marked subedge is a Jordan disk with a positive sector at each boundary mark (angle π at an interior point of a regular edge). Apply the sequential polygonal fan construction of [F2] inside that triangle using the cyclic list of all its boundary marks. This subdivides it into finitely many triangular disks, each with exactly one boundary subedge. Consequently the two refinements on either side of an old edge share exactly its full subdivided subedges, and all final triangles meet in a full edge, one vertex, or the empty set. Their local links are circles in Int⁡M and intervals at ∂M: the original arrangement and the cuts occupy all sectors without overlap or gap. Supplied corners remain boundary vertices.

6.1F4step 5.1construct

The only edges not already regular C2 are the finitely many added polygonal arcs. Choose pairwise disjoint tiny disks about their nonvertex bends, avoiding all other edges and vertices. In such a disk the two directed segments of a simple polygonal arc are not opposite in the retracing sense; after rotating axes their union is a Lipschitz graph over its angle-bisector direction. Replace the graph near the bend by a smooth graph that agrees with its straight tails near the disk boundary and is uniformly close enough to stay in the chosen edge tube. One explicit replacement convolves the graph on a smaller interval with a smooth symmetric mollifier and uses a smooth cutoff in the straight-tail overlap. Its first coordinate remains strictly monotone, so it remains embedded and regular. The small disks and tube margins make all replacements disjoint; the resulting ambient isotopy preserves all incidence, sectors, and face-to-face intersections. Each new edge is now a regular C2 embedding. The untouched prescribed boundary arcs remain boundary edges.

7.1F2F4step 4.1step 5.1step 6.1

Each final face closure is a Jordan disk bounded by three regular C2 edges. Its Schoenflies homeomorphism supplies a map from the closed reference triangle taking its sides to those edges and its vertices to the three marked vertices. In a smooth-boundary surface, the face sectors, boundary half-disks, and links verified in steps 5.1–6.1 give all clauses of [F4]; thus the data are a curvilinear triangulation and each face lies in its assigned strongly convex coordinate disk, in a member of any supplied cover, with an orthonormal frame. For a cornered region the same finite face and link construction holds in the supplied ambient charts, using the original sector at each prescribed corner. The smooth-boundary definition is not invoked for that region.

8.1F2F5step 5.1step 7.1∎

In either case attach the finitely many vertex points, then the embedded closed edge intervals, then the closed triangular disks along their full boundary edges. By step 5.1 the resulting quotient maps continuously and bijectively onto M; compactness of the finite disjoint union and Hausdorffness of M make it a homeomorphism. Each characteristic map is an embedding, hence these cells form a finite regular CW structure, even in the cornered case. Apply [F5] to obtain V−E+F=∑j(−1)jrank⁡Hj(M;Z). Full AC is used through the Jordan and finite-plane-graph suppliers of [F2], and covers the countable-choice assumptions of [F1] and [F6]. Selecting local disks at every point in step 1.1 may also use AC; after a finite subcover is fixed, the remaining selections are finite.

Source locator

Lee, Chapter 9, Problem 9-5, printed pp. 171–172, sketches the convex-cover route to a surface triangulation. Jost, §2.3.A, Theorem 2.3.A.1, printed pp. 37–39, treats the closed geodesic case. Saucan, Theorem 1.1 and Definition 1.2, PDF pp. 1–2, provides context for compatible boundary refinements and positive angle control. The generic-circle, assigned-face, common-boundary-refinement, and C2 smoothing steps are proved here; none of these sources is claimed to prove a prescribed-boundary geodesic triangulation.

Depends on

Used by

Dependency tree · two levels

49 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources