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.
Positive-Euler finite PL surfaces are disks, spheres or projective planes
Statement
Let be a connected compact surface supplied with a finite PL triangulation. The following conclusions require no choice axiom.
- If , then . Equality holds only for a disk. If instead , then is an annulus or a Mobius band; these have respectively two and one boundary circles.
- If , then . If , then is a two-sphere; if , then is a projective plane.
Consequently, every positive-Euler connected finite PL surface is a disk, sphere or projective plane. These identifications can be made by PL homeomorphisms between finite polygonal models. In a PL three-manifold without an embedded projective plane, a connected embedded positive-Euler surface is therefore a disk or a sphere.
Statement references
Finite triangulations of compact PL surfaces — the supplied finite triangulation.
The cylinder and the Mobius band as quotients of the square by and by , both by a closed quotient map — the annular and twisted rectangular-band models.
Projective plane crosscap polygon — the antipodal-boundary disk model of the projective plane.
Facts & Assumptions
Given: The finite triangulation of the connected compact surface .
The simplicial Euler characteristic: . An elementary collapse of a triangle and a free edge removes one face and one edge, preserving this number. Attaching a disk along a subdivided circle adds one, because the circle has equally many vertices and edges.
The dual spanning-tree collapse in A connected triangulated surface with Euler characteristic one and boundary is a disk, steps 1.1–2.1, applies to any connected finite triangulated surface with boundary, without using its Euler characteristic: it leaves a connected graph. Its step 4.1 proves the tree-neighborhood case. The graph-neighborhood construction for the general case is detailed below.
The cylinder and the Mobius band as quotients of the square by and by , both by a closed quotient map specifies the two rectangle quotients and . Projective plane crosscap polygon identifies a disk with antipodal boundary points paired as a projective plane, by an explicit finite quotient argument.
Proof
Suppose first that has boundary. Apply the finite dual-tree collapse [F2], choosing a lexicographically first spanning tree, to obtain a connected graph . Take small polygonal vertex disks and narrow rectangular edge bands inside to form a regular neighborhood . One can choose them after a finite subdivision by taking sufficiently small rational distances in the finitely many triangle charts. Reversing a free triangle-edge collapse enlarges this neighborhood by a boundary finger across that triangle. To see that its homeomorphism type is unchanged, use a triangle chart in which the removed edge is the base: the two retained sides make the tip of the finger, and moving its polygonal boundary from a small parallel arc to the base expands a disk along one boundary interval. Triangulate the region between these two arcs and map corresponding triangles linearly. This gives a PL homeomorphism between the two neighborhoods, fixed off that triangle and its small vertex sectors. Reverse the finitely many collapses in order and finally expand the boundary collar. Thus is PL homeomorphic to . This construction uses a finite list of local maps, rather than a general regular-neighborhood uniqueness theorem.
A spanning tree of the connected graph has edges. Write for the number of remaining edges. The collapses and [F1] give . If equality holds, , so is a tree and its neighborhood is a disk by [F2].
If , the graph has exactly one edge outside a spanning tree. Delete its leaf edges successively. A leaf vertex disk and its band merely form a finger on the neighboring disk; removing that finger changes no neighborhood homeomorphism type by the same finite polygonal expansion as in step 1.1. The graph remaining is one cycle: alternatively, the unique extra edge and the unique tree path joining its endpoints form that cycle, and every other tree edge belongs to a tree attached to it. Thus is the union of the vertex disks and bands around a single cycle.
Now suppose is closed. Remove the interior of a small polygonal disk inside one triangle and triangulate the remaining surface . It is connected: any path crossing the disk can have each crossing segment replaced by a path along its boundary, and a finite polygonal path has only finitely many such segments after a small general-position displacement. It has exactly one boundary circle. By [F1], , and step 2.1 gives . If , then is a disk by step 2.1. Capping a disk by a disk gives a sphere. Any PL boundary identification can be reduced to the identity by extending the boundary map over a disk: cone a finite subdivision of its circle to the center, and map the resulting triangles linearly. Thus this identification is PL.
Cut this cycle across one band. Its neighborhood becomes one rectangular strip: glue the remaining vertex disks and bands consecutively, each along one boundary interval, and use the polygonal disk expansions of step 1.1 to straighten the strip. At its two ends the transverse intervals are identified by a PL interval homeomorphism. If this map is increasing, change the transverse coordinate at one end and interpolate that change along the strip to make the gluing the identity. Explicitly, prescribe the required increasing map on one short side of the rectangle and the identity on its other three sides. This is a PL homeomorphism of its boundary. Subdivide at its finitely many breakpoints, cone both boundary subdivisions to interior points and map corresponding triangles linearly. This extends the boundary map to a PL homeomorphism of the rectangle. If the gluing is decreasing, first compose with and apply the same construction. The two resulting quotients are exactly the two models in [F3]. In the first, the two long sides of the strip give two boundary circles; in the second they join to one. Hence is respectively an annulus or a Mobius band.
If , then has Euler characteristic zero and exactly one boundary circle. Steps 3.1–4.1 make it a Mobius band, since the annulus has two boundary circles. Capping a Mobius band gives the antipodal-boundary disk of [F3]: in that disk model, a small collar of the identified outer circle is the twisted interval band, while the remaining inner disk is the cap. Conversely those two pieces recover the model. Changing the cap's boundary identification does not change the resulting PL surface, by the coning extension from step 3.2. Therefore is a projective plane. Every construction above used only finite trees, finite collapses and finite polygonal maps. The final embedded-surface consequence follows by composing these homeomorphisms with the given embedding.
Depends on
- Finite triangulations of compact PL surfaces
- The simplicial Euler characteristic
- A connected triangulated surface with Euler characteristic one and boundary is a disk
- The cylinder and the Mobius band as quotients of the square by $(0,y) \sim (1,y)$ and by $(0,y) \sim (1, 1-y)$, both by a closed quotient map
- Projective plane crosscap polygon
Used by
- A nonfundamental least-weight essential disk has a pure boundary obstruction Lemma
- A nonvertex fundamental disk has a connected two-copy normal sum Lemma
- A reduced original normal pair for a least-weight essential disk has no projective-plane summand Lemma
- A reduced original normal pair for a least-weight essential disk has no spherical summand Lemma
- Boundary exchange leaf caps of a least-weight disk have rigid edge counts Lemma
- Boundary exchange middle disks have positive original edge weight Lemma
Dependency tree · two levels
36 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
- Wolfgang Haken, Theorie der Normalflächen, Acta Mathematica105 (1961),245–375 (standard reference, not scraped)