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.
Pointed flat piecewise linear caps admit saddle-free replacements
Statement
Let be a supplied finite parametrized embedded PL three-ball with a nonnegative affine height , and let be a convex three-dimensional polytope with an affine height . Assume and are boundary disks. Suppose a supplied PL boundary homeomorphism preserves height and maps onto . Let be a vertex of the polygonal face . Assume the faces of other than are partitioned into one triangular side face meeting exactly at , a top face at positive constant height, and the remaining side faces. Put .
For some arbitrarily short positive height range there is a parametrized PL disk containing , meeting exactly at , and a parametrized PL disk with , such that bounds a supplied parametrized PL three-ball. On the boundary obtained by replacing by , every new interior point away from has a regular local height-product chart; no positive-height saddle is introduced. The new cap meets height zero exactly at . Consequently, whenever the replaced disk lies in an embedded PL sphere whose remaining disk misses the constructed ball except along the common boundary, and the sphere after replacement bounds a supplied PL ball, the original sphere also bounds one. No choice hypothesis is introduced.
Facts & Assumptions
Given: The two balls, heights, boundary height-preserving map, bottom disks, side triangle and top face as stated.
Compatible finite triangulations of convex cells and finite PL maps or marked subpolyhedra (Finite convex cell complexes admit compatible triangulations, A PL embedded polyhedron becomes a subcomplex after subdivision).
Three-disk PL severing transfers supplied ball parameters (Three-disk piecewise linear severing reassembles parametrized balls).
Planar polygonal disks admit finite parameters and prescribed-boundary extensions (Finite polygonal disk parametrizations and boundary surgery).
Proof
Given: The stated data.
Extend to a PL homeomorphism . Use the supplied parameter of to transfer to the boundary of a convex ball, triangulate it there and on , and cone the boundary map from interior points. Convexity makes the matching cone-simplex maps bijective with PL inverses. Choose a common finite triangulation on which are linear. The last two functions have exactly the same zero vertices, namely those on , and are strictly positive at all other vertices. Cut at a number below all their positive vertex values and below the top height. On corresponding simplices the two cuts have identical face posets: they retain the zero vertices and cut precisely the zero-positive edges. Inductively match the truncated cells, fixing on their old boundary faces, matching the top sections by compatible face maps, and coning the remaining boundaries between interior points at height . Such points exist on every mixed face by convexity. The map preserves height on every cone simplex. This gives a PL homeomorphism preserving height and equal to on the old boundary. This is the explicit zero-vertex collar-leveling argument; it does not assert that the original extension preserved height.
Choose an affine function with , on , and on : the sum of two supporting inequalities of the polygon at its vertex does this. For sufficiently small , on and on the section . The first assertion follows by checking the two nonzero vertices of the triangle and using affinity; the second follows from compactness and . Then is a convex three-ball. Its new face is a convex polygonal disk lying below , and its remaining boundary lies in the old boundary of . It contains , meets exactly at , and misses the top section. Both boundary disks have finite PL parameters: is convex, and the complement of the relative interior of a face in a convex polyhedral sphere is a PL disk, as follows by the finite truncated-vertex planar chart and polygonal disk-extension construction. In particular and their intersection is their common boundary.
The retained body is convex and has its unique height-zero point at . Every new point of its boundary away from and from the unchanged attachment boundary is regular for height: at a new vertex strictly between the extrema, its convex link circle has a positive arc and a negative arc, each connected, because its lower and upper cone sections are convex; face and edge charts give the same conclusion. Choose and then outside the finitely many exceptional values making the new planar face horizontal or introducing a non-extremal horizontal face. This retains the strict inequalities in step 2.1. Coning the link arcs gives the local height-product charts, equivalently by the explicit two-half-space polygonal fan straightening. Pull back by . Height preservation gives the claimed new regular charts and the single zero point . The disk replacement is confined below any initially prescribed positive bound by taking smaller.
Let be the rest of the sphere after deleting . Its intersection with the pulled-back ball is by the stated transfer hypothesis. Thus satisfy [F2]. The supplied ball bounded by and any supplied ball bounded by give a supplied ball bounded by . All triangulations, cuts, cones and exceptional-value exclusions used finite collections; no choice assumption is introduced.
Depends on
Used by
Dependency tree · two levels
15 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.