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.
Innermost critical height loops admit strict piecewise linear cap reduction
Statement
Let be the image of a supplied finite PL embedding of the standard PL two-sphere. Choose an affine height distinct on the vertices of a linear triangulation of . At a vertex with both lower and upper incident directions, let be the number of positive arcs of its small link circle; it is also the number of negative arcs. Call a saddle when . Its horizontal section consists of simple loops meeting only at , together with finitely many disjoint regular circles. Let be the sum of the numbers of all these loops, including the regular circles, over the distinct saddle heights.
If , there are two supplied finite PL embedded two-spheres , with generic affine heights , for which Moreover supplied parametrized PL balls bounded by give, by explicit finite PL constructions, a parametrized PL ball bounded by . No general three-dimensional Schoenflies theorem or choice hypothesis is used.
Facts & Assumptions
Given: The embedded parametrized sphere and its generic affine height with positive complexity.
Finite polygonal Jordan disks and prescribed-boundary disk extensions (Finite polygonal disk parametrizations and boundary surgery).
Compatible finite triangulations and subdivisions for convex cells, PL maps and marked subpolyhedra (Finite convex cell complexes admit compatible triangulations, A PL embedded polyhedron becomes a subcomplex after subdivision).
Local one-sided PL level collars on a compact finite height band give a finite global height-preserving PL product (Finite piecewise linear level collars give global band products).
Height-product caps have one-extremum replacements with finite PL ball transfer (Piecewise linear height-product caps can be replaced by one extremum).
Pointed flat caps with the supplied convex boundary model have saddle-free replacements with finite PL ball transfer (Pointed flat piecewise linear caps admit saddle-free replacements).
The three-disk severing implication reassembles parametrized balls, including the nested cases (Three-disk piecewise linear severing reassembles parametrized balls).
Proof
Given: The stated surface and height. The constructions below are all made on compact finite polyhedra.
Choose a saddle plane with critical vertex . The section is a finite graph with every point of degree two except , whose degree is . Following each edge from until it first returns to decomposes its nonregular component into simple loops; distinct loops meet only at . Other components are simple circles. A finite collection of such planar loops has an innermost simple loop bounding a polygonal disk with : choose an innermost bounded complementary face inside a loop, and if its boundary passes , follow its simple loop boundary; the only possible common vertex is . The circle cuts into two parametrized PL disks . To check the finite PL parameter assertion, transfer to the supplied standard sphere, choose a tetrahedral vertex off the transferred circle by polygonal chart point pushes, and truncate a small cone disjoint from it. The remaining sphere has a planar triangular disk parameter by mapping its opposite face and three strips to concentric triangles. Apply [F1] to the circle there; the other disk is the surrounding annulus capped by the removed cone, parametrized by cutting a joining strip and using [F1]. Thus are finite PL spheres, with their flat caps explicitly parametrized.
First suppose . In each a sufficiently narrow collar of lies entirely on one side of , since has no critical point and the collar's open connected side has constant height sign. Write with that sign. For small , the collar meets its level plane in one polygonal circle approaching . Its bounded planar disk varies in a finite polyhedral layer with bottom and side that collar: subdivide by the finitely many incident triangle planes and use planar crossing parity to select the bounded disk cells. Taking small keeps every other surface part outside . Away from this follows from the positive separation of compact nonincident pieces and ; along it follows from the ordinary two-face regular height charts. The layer is a PL manifold with boundary: interior cells have ball charts, side points have half-ball charts, and its bottom rim has quadrant charts from the same planar fans. Its level fibers have local collars at both sides, including its bottom and top. Thus [F3] supplies a height-product disk parameter on all of . Apply [F4] to replace and the collar by a cap with one extremum and otherwise regular height. The rest of meets only in its top circle. The ball-transfer conclusion of [F4] is therefore applicable. This supplies the required cap replacement for in the nonpointed case.
Now suppose . For each , the open boundary arc has a one-sided collar in of constant height sign. Orient with this sign. Choose one positive ray in each of its two incident face sectors at , very close to the corresponding zero ray of , and call them . For small , the part of the collar between these rays is one embedded polygonal arc joining to ; choose ray generators of height one. This follows by tracing the level segments in the finitely many incident triangles along ; none of their other vertices has height between zero and . The two terminal sectors are linear cones. The planar disk has an empty angular sector at : its link arc lies in the horizontal circle and meets no other surface direction except its endpoints, since its interior is disjoint from the section graph. Just inside the chosen positive side of this arc choose a finite polygonal joining arc at level from to , disjoint from except at its ends. Such an arc is obtained by following that empty link sector and projecting radially to the positive level; its compact interior stays in the adjacent open complementary sector. Call this arc and put . Then is a simple polygon. Its bounded disk contains no other surface piece: away from use finite positive separations as in step 2.1; in the small conical neighborhood of , the chosen joining arc cuts off exactly the sector adjacent to the empty disk, excluding the remaining link branches. Shrink once for these finitely many requirements.
Let be the layer of these disks for , with bottom . It is a compact finite polyhedron: its boundary consists of the bottom disk, the finite surface strip , the cone , and the top disk ; a common plane arrangement with planar parity selects its finitely many solid cells. It is a PL manifold with boundary, also at . The link there has boundary made of the bottom disk arc, two positive surface-sector arcs and the closing arc of , forming one simple polygonal circle on the standard link sphere. The disk on its positive side gives its half-ball chart. The disk assertion follows by the finite tetrahedral planar chart and [F1] as in step 1.1; coning gives the chart. The bottom arc is an ordinary boundary interval of that link disk, so is locally collared even at . Everywhere at positive height, the side arcs and their endpoints give the ordinary half-space or quadrant height charts; there are no other vertices of the surface in the layer. Therefore [F3] gives a height-product parameter . In particular is a supplied parametrized PL ball. The old cap part is a disk with boundary . Splitting its strip corner into its two boundary occurrences makes a finite PL disk with bottom the interval obtained by cutting at , top and two monotone sides . Its bottom and positive fibers have local one-sided collars, so [F3] also supplies a height-product interval parameter for this normalized strip. Restoring the two occurrences gives the actual strip in .
Supply the convex pointed boundary model required by [F5], rather than assuming it. Let with , and take the convex hull with the top triangle having vertices . Its face in is the triangle from to the first two top vertices, meeting only at . The remaining side strip, normalized by splitting , has a height-product interval parameter by the same [F3] argument, or directly from its convex faces. Map to , taking to , by [F1]. Match the two normalized strip parameters by their induced bottom interval map; this is height-preserving and matches the two side rays at every height. Map the cone to by coning its top arc map linearly from to ; choose its endpoints to match the strip maps. On the top disk extend the already prescribed boundary map by [F1]. These four maps paste to a finite PL boundary homeomorphism preserving height on . Use the cut in [F5] below a height . Its replaced boundary disk contains and meets only at ; it also misses , whose height is . Since , these two exclusions give . In particular is not all of : its boundary turns through the interior of before reaching either positive -ray. In the convex model this is explicit: take the supporting function and cut by , with so small that the cut lies below . On , , whereas on , ; hence the cut meets that triangular side only at . The height-preserving leveling map in [F5] retains the prescribed boundary map, so these exclusions pull back to . Step 3.1 says the remainder of misses outside ; on the cut ball's old boundary its intersection with is exactly . Thus the remaining disk of meets this ball only along , as required for [F5]'s ball transfer. Replacing by its new pointed cap meets only at and introduces no positive-height saddle. The replacement is confined to an arbitrarily short positive height range. On the critical plane it deletes precisely the chosen loop ; all other branches at are outside the layer and remain unchanged.
Perform the respective replacements on both , in a height range containing no other original saddle height, obtaining . In step 2.1 only a new extremum was inserted. In step 5.1 all new positive-height points are regular, and at height exactly the selected loop has disappeared. Every other original critical-plane loop belongs to one of the two cut disks and is unchanged. If the remaining vertex at height becomes regular or an extremum in either sphere, that plane no longer contributes to its complexity, which can only decrease the count further. Thus the total contribution at this height is at most the former contribution minus one; at other saddle heights the contributions partition the original ones. Restore generic affine heights by arbitrarily small direction perturbations and compatible subdivisions. This does not add saddles: each new nonextremal vertex has a link circle with exactly two transverse zero crossings, a condition stable under a small perturbation on its finite link edges; the cap extremum has all incident directions of one sign. The other critical link signs and the order of their heights are preserved by choosing the perturbation below the finitely many nonzero sign and height gaps. There are no horizontal surface faces left in the replaced caps. The section graph incidence at each unchanged critical vertex is determined by these signs, so its loop count is preserved. This proves the stated complexity inequality. Finally, supplied balls for transfer by steps 2.1 or 5.1 to supplied balls for . Apply [F6] to the three disks to obtain the ball bounded by . All constructions and exclusions were finite, so no choice principle was introduced.
Depends on
- Finite polygonal disk parametrizations and boundary surgery
- Finite convex cell complexes admit compatible triangulations
- A PL embedded polyhedron becomes a subcomplex after subdivision
- Finite piecewise linear level collars give global band products
- Piecewise linear height-product caps can be replaced by one extremum
- Pointed flat piecewise linear caps admit saddle-free replacements
- Three-disk piecewise linear severing reassembles parametrized balls
Used by
Dependency tree · two levels
19 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
- J. W. Alexander, On the subdivision of 3-space by a polyhedron (standard reference, not scraped)