Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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.

A compact locally collared polyhedron has a piecewise linear collar

Statement

Let P be a compact subpolyhedron of a polyhedron Q. Suppose P is locally piecewise linearly collared in Q: each point has a product neighborhood in which P is the bottom of a piecewise linear product with [0,1). Then there is a piecewise linear embedding c:P×[0,1]→Q with c(x,0)=x such that c(P×[0,1)) is an open neighborhood of P in Q. In particular the boundary of every compact piecewise linear manifold has such a collar.

Facts & Assumptions

Given: P⊂Q and the compactness and local collar hypotheses above.

[F1]

Finite compatible polyhedral subdivisions admit compatible triangulations; piecewise linear maps and subpolyhedra admit finite compatible subdivisions on compact parts (Finite convex cell complexes admit compatible triangulations, A PL embedded polyhedron becomes a subcomplex after subdivision).

Proof

Given: The stated pair. The empty case has the empty collar, so assume P is nonempty.

1.1givenF1construct

Attach an external collar and denote the resulting polyhedron by Q+=(Q×{1})∪(P×[0,1]), identifying P⊂Q with P×{1}. This is a polyhedron: triangulate the compact marked part of Q with P a subcomplex, triangulate its product prisms compatibly, and glue the equal marked faces. Outside this compact part keep the original locally finite triangulation. A local collar chart about a∈P, shrunk to the closed star Sa=a∗La of a vertex in a finite triangulation of P, identifies Sa×[1,2] with a neighborhood in Q of that star. Combining it with the external collar gives Sa×[0,2]⊂Q+. The product is the cone from (a,1) over (La×[0,2])∪(Sa×{0,2}). Triangulate that boundary and cone it to (a,1). Moving the cone vertex to (a,1/2) and extending linearly on the cone simplices defines a piecewise linear homeomorphism of this product fixed on the displayed cone base, which is the relative frontier of the local neighborhood in Q+. The remaining sides, if the star meets the boundary of P, may move along the boundary of Q+. Both cone decompositions cover the product: on every radial line in the star factor the product has a single interval in each height direction, so each ray from either vertex has a unique final boundary point. Extend this map by the identity to Q+ and call it ha.

2.1step 1.1construct

On the external collar, ha preserves the P coordinate and decreases the height weakly. In a cone simplex this follows directly from affine coordinates: only the cone vertex changes, by the vertical displacement −1/2, so a point with cone-vertex coefficient λ has the same first coordinate and height reduced by λ/2. The decrease is strict for points over the relative interior Sa∖La with height strictly between 0 and 2. Compactness provides finitely many such star interiors covering P. Compose their pushes in any fixed order to obtain a piecewise linear homeomorphism h′ of Q+. Every point (x,1) is then sent to (x,t(x)) with 0<t(x)<1: at least one selected star contains x in its interior, that push strictly decreases the height, subsequent pushes cannot increase it, and all pushes fix height zero and are injective. Since each push preserves the ordered vertical intervals in the external collar, h′(Q)∩(P×[0,1]) is exactly the region T={(x,s):t(x)≤s≤1}. Also h′(Q) contains all of Q×{1}, since the inverse of every push increases height on any point at height at least one in its local chart.

3.1F1step 2.1construct

The function t is piecewise linear on a finite subdivision of P: the graph h′(P) is a finite polyhedron projecting bijectively to P, and subdividing the projection gives an affine bijection on every simplex with affine inverse on its image. Refine its projected cells compatibly using [F1]. For each simplex A in this subdivision, T∩(A×[0,1]) is a convex prism cut out by the affine bottom s=t(x) and the constant top s=1. Its faces correspond exactly to the faces of A×[0,1]. Construct compatible piecewise linear homeomorphisms between these prisms by induction over their faces: prescribe the identity on the top, the projection (x,t(x))↦(x,0) on the bottom, use the already constructed face maps on the vertical sides, and cone from interior points to extend over each remaining cell. The finite convex cell triangulation argument in [F1] verifies bijectivity and a piecewise linear inverse. These maps paste to g:T→P×[0,1], fixed on the top and sending the graph to the bottom by its first coordinate. Extend g by the identity on Q×{1} to obtain a piecewise linear homeomorphism h′(Q)→Q+.

4.1givenstep 3.1construct∎

The composite h=g∘h′∣Q:Q→Q+ is a piecewise linear homeomorphism and sends each x∈P to (x,0). Pull back the external collar by h: put c(x,s)=h−1(x,s). This is a piecewise linear embedding with the required bottom restriction, and its half-open image is an open neighborhood because P×[0,1) is an open neighborhood of P×{0} in Q+. A piecewise linear boundary chart is a local product chart of the required kind, so the manifold assertion follows. Only the finite local cover and finite subdivisions were selected; no countable or arbitrary-index choice assumption is used.

Depends on

Used by

Dependency tree · two levels

7 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