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 short-geodesic polygon cellulation from curvilinear triangles
Statement
Assume the axiom of choice. Let be a compact smooth surface with smooth boundary and a Riemannian metric extended to a neighbourhood in its smooth double, or a compact regular oriented surface region with finitely many ordinary corners in a supplied boundaryless ambient Riemannian surface. Supply the finite strongly convex ambient coordinate cover and scale of Uniform short-geodesic scale on a compact surface. Then has a finite face-to-face polygonal closed-disk cellulation whose nonboundary edges are embedded ambient minimizing geodesic segments of length less than , whose boundary edges are prescribed regular boundary arcs or their subarcs, and whose every closed face lies compactly in a strongly convex ambient coordinate disk contained in a member of the supplied cover and satisfying . Every face has only ordinary corners. The boundary arcs are retained rather than replaced by ambient geodesics. For a cornered region this means explicit face, edge, and link data, not an application of the smooth-boundary curvilinear-triangulation definition.
Facts & Assumptions
Given: The compact region and supplied finite strongly convex cover and uniform scale of the Statement.
Full AC is assumed because [F1] uses arbitrary-Jordan-curve graph suppliers (The Axiom of Choice); countable choice used by [F2] follows from it (The Axiom of Countable Choice ()).
There is a finite regular curvilinear triangulation for a smooth-boundary , or finite triangular face, edge, and link data for a cornered , preserving the boundary and subordinate to any supplied strongly convex ambient cover. Each face has ordinary corners and lies compactly inside its assigned cover member (Finite curvilinear triangulation of a compact Riemannian surface).
The supplied scale and strongly convex ambient cover give a unique short minimizing geodesic between sufficiently close points in each member (Uniform short-geodesic scale on a compact surface).
The smooth-boundary curvilinear-triangulation definition gives regular embedded edges, triangular Jordan-disk faces, full-edge or vertex intersections, and circle or interval vertex links; the cornered analogue is explicitly asserted in [F1] (Curvilinear face-to-face triangulation).
Proof
By compactness and bounded ambient curvature near , refine the supplied finite strongly convex cover to finitely many small strongly convex normal coordinate disks covering , each with closure in a supplied cover member and . Apply [F1] subordinate to this refined cover. For every closed face , choose its assigned small disk and its containing supplied cover member . Since there are finitely many faces and each is compact, each has a positive chart margin inside and . The original finite graph has regular edges, finitely many vertices, and pairwise distinct incident tangent rays; every sector occupied by a face has a positive opening. At a smooth boundary vertex the two boundary germs delimit the inward half-plane, and each incident interior edge germ has a strict inward angle. At an ordinary corner the corresponding sector is the supplied wedge. These assertions follow from the face sector and link clauses of [F1]–[F3], including the strict sectors in [F1]'s construction.
For each regular interior edge choose a finite subdivision by arclength with mesh at most . For small enough, every subarc and its two endpoints lie in a common strongly convex normal coordinate disk of the ambient metric, so [F2] gives its unique minimizing geodesic chord . Subdivide further to make every chord length less than ; uniform continuity of the finitely many edges makes this a finite operation. Leave boundary edges fixed, except that their existing marked endpoints may be retained as subdivision points.
The approximation has explicit uniform bounds. Parametrize an original subarc by arclength and its chord proportionally to arclength. In one of finitely many normal-coordinate disks covering the original graph, the coordinate acceleration of is bounded by a fixed , and satisfies with uniformly bounded Christoffel symbols and speed, hence . The two curves have the same endpoints. Applying the one-dimensional endpoint Green-function estimate to gives and , with a common over the finite edge family after reducing . These coordinate bounds are independent of the subdivisions and include the one-sided tangents at subarc endpoints.
Choose disjoint small ambient disks about the finitely many original vertices. By step 1.1, their incident edge germs occupy pairwise disjoint narrow cones and, at a boundary vertex, every interior germ cone lies strictly inside the inward half-plane or supplied corner wedge. Choose the disks small enough that each germ is a graph over its tangent ray there. Outside these vertex disks, disjoint original edges and the boundary have positive separation after deleting their common endpoint neighbourhoods; each original edge has a narrow embedded tubular strip in which its arclength projection is a coordinate. Reduce so the errors of step 3.1 are smaller than one quarter of every such separation, chart margin, and cone-angle margin. Then consecutive chords of one edge are graphs with strictly increasing arclength projection, chords on different edges cannot cross outside the vertex disks, and chords of distinct incident edges stay in their disjoint cones inside those disks. At a boundary vertex each interior chord initially points into the strict inward sector, and its -close continuation cannot meet the fixed boundary arc in the vertex disk; away from boundary vertices the separation margin prevents boundary crossings. This directly covers a smooth boundary that oscillates under an unrelated straight line: each chosen chord is controlled relative to its own old interior edge.
The new finite graph is embedded in with the same incidence and cyclic order as the old one. In each edge strip, the old and new arcs are graphs over the same longitudinal coordinate; interpolation of their transverse graph functions, multiplied by a cutoff that vanishes at the strip boundary, gives an ambient isotopy of that strip. In each vertex disk the disjoint ordered germs admit the analogous radial interpolation inside their strict cones, fixed near the disk boundary; on a boundary disk keep the boundary germs fixed. These finitely many local isotopies agree as the identity off their disjoint supports and extend to a homeomorphism of carrying the old graph to the new graph. Therefore the complements still have finitely many closed polygonal Jordan-disk faces, the same circle/interval links and full-cell intersections, and ordinary positive face sectors. A former face and its new image remain in by the chart margins chosen in step 1.1.
Split each original triangular face boundary at the inserted edge vertices. Its image under the homeomorphism of step 5.1 is a polygonal disk: each interior side is a finite chain of short ambient minimizing geodesic chords and each boundary side is a prescribed regular arc or subarc. The family remains face-to-face, with each shared old edge given the same subdivision and chords from both incident faces. Its finitely many vertices, edges and faces supply the claimed cellulation. In the empty case use the empty cellulation. Full AC is used only through [F1]; the subdivisions, uniform estimates and isotopies are finite.
Source locator
Lee, Riemannian Manifolds, Chapter 9, Problem 9-5, printed pp. 171–172 (PDF pp. 187–188), outlines short-geodesic polygon decompositions. Jost, Compact Riemann Surfaces, §2.3.A, Theorem 2.3.A.1, printed pp. 37–39 (PDF pp. 50–52), constructs a short-geodesic network for closed metric surfaces. Neither source proves this boundary-compatible cellulation. Here it follows from the boundary-compatible curvilinear triangulation Finite curvilinear triangulation of a compact Riemannian surface by the explicit chord estimates and graph isotopy in steps 3.1–5.1. The separate geodesic triangulation of the resulting polygonal cells is not asserted here.
Depends on
Used by
Dependency tree · two levels
29 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
- John M. Lee, Riemannian Manifolds: An Introduction to Curvature (1997) (standard reference, not scraped)
- Jürgen Jost, Compact Riemann Surfaces: An Introduction to Contemporary Mathematics (standard reference, not scraped)
- Ved Datar, Lectures on Riemannian Geometry (standard reference, not scraped)