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.
Piecewise linear height-product caps can be replaced by one extremum
Statement
Let be a finite parametrized PL two-disk and let be a finite PL embedding with for an affine height . Put , and . Let be a finite parametrized embedded PL two-disk with boundary and .
There exists a finite embedded parametrized PL disk with boundary , , such that its height has exactly one interior extremum, a minimum, and every other point of has a regular height-product chart. The set bounds a supplied parametrized PL three-ball. Consequently, if bounds a parametrized PL three-ball, then does as well. The reversed-height assertion replaces a maximum cap. No choice hypothesis is introduced.
Facts & Assumptions
Given: The disk, height-product embedding and exterior disk in the statement.
Polygonal disk parameters and extensions of prescribed boundary maps (Finite polygonal disk parametrizations and boundary surgery).
Compatible finite triangulations of convex polyhedral cells (Finite convex cell complexes admit compatible triangulations).
Parametrized PL balls admit standard-window removal (Parametrized piecewise linear balls absorb standard boundary windows).
Three embedded PL disks with common boundary and disjoint interiors satisfy the finite PL ball-reassembly implication (Three-disk piecewise linear severing reassembles parametrized balls).
Proof
Given: The stated product and disk.
Use the supplied disk parameter to replace by a convex polygon . Its product parameter and are finite PL after compatible prism subdivisions by [F2]. Choose and , and let be the convex pyramid with apex and base in . Its lateral boundary is a parametrized PL disk. It intersects the disk exactly in their common boundary . The latter is also a parametrized PL disk: it is the complement of the top face in the boundary of a convex prism, and mapping its bottom and side strips to concentric planar polygonal regions gives the finite disk parameter.
The pyramid meets the boundary of the prism exactly in its top base. The boundary-window charts along its base perimeter are ordinary linear dihedral-sector charts, including at polygon corners after a finite angular subdivision; these identify the outer prism with a half-space and the inner pyramid with a quadrant. Thus [F3] gives a finite PL ball parameter on . Its boundary is exactly . Transfer these disks, the pyramid and to by the product parameter and . This gives the required and ball with boundary .
Each horizontal section of above height and below height one is the boundary of a homothetic polygon . Thus its only interior height extremum is its apex minimum. At every other interior point its incident cone faces have nonzero height slope along their common generator, so a finite face-strip chart gives a local PL product with height as interval coordinate. Equivalently these strips are truncated convex cone faces, mapped to rectangular strips by matching their end edges and coning boundary maps with cone points at equal height. Composing with the height-preserving preserves these charts and the unique extremum. No conclusion about the height on the exterior disk is needed.
The disks have the same boundary and pairwise disjoint interiors, because and step 1.1 gives the other intersection. Their parameters are supplied above. If bounds a supplied PL ball, then this ball and satisfy [F4], which supplies the ball bounded by . Replacing by gives the reversed-height statement. Every selection, cone, prism subdivision and window construction is finite, so no choice assumption is required.
Depends on
Used by
Dependency tree · two levels
13 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.