Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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 PL embedded polyhedron becomes a subcomplex after subdivision

Statement

Let Q be a compact piecewise-linear polyhedron with a fixed finite linear triangulation T. If f:P→Q is a piecewise-linear embedding of a compact piecewise-linear polyhedron, then some finite subdivision T′ of T contains f(P) as the realization of a subcomplex.

Statement references

PL embeddings and subpolyhedra — the image of a piecewise-linear embedding is a subpolyhedron in some finite triangulation.

Subcomplexes, closures, stars, and links in a simplicial complex — a subcomplex is closed under taking faces.

Two finite linear subdivisions have a common simplicial refinement — common refinement for subdivisions of a fixed finite Euclidean complex; the intersection-cell construction below handles the two given linear triangulations directly.

Facts & Assumptions

Given: A compact piecewise-linear polyhedron Q, a finite linear triangulation T of Q, and a piecewise-linear embedding f:P→Q.

[F1]

PL embeddings and subpolyhedra: f(P) is a subcomplex in some finite linear triangulation T0 of Q.

[F2]

Intersections of finite linear complexes form a convex cell complex forms a finite convex intersection-cell complex from two finite linear simplicial complexes in one Euclidean space with the same underlying polyhedron. Finite convex cell complexes admit compatible triangulations gives it a compatible finite linear simplicial triangulation. These are the construction used in the narrower Two finite linear subdivisions have a common simplicial refinement.

[F3]

Subcomplexes, closures, stars, and links in a simplicial complex: a subcomplex is closed under taking faces.

Proof

1.1givenF1construct

By [F1], choose a finite linear triangulation T0 of Q in which f(P) is a subcomplex.

2.1givenF2F3step 1.1construct∎

Regard T and T0 as finite linear complexes on the same embedded polyhedron Q. Form all nonempty cells σ∩τ for σ∈T and τ∈T0, together with their faces. By [F2] these form a finite convex cell complex covering Q, and a compatible finite simplicial triangulation T′ of that cell complex exists. Each simplex of T′ lies in a cell contained in a simplex of T and a simplex of T0, so T′ is a common linear refinement. In particular it is a subdivision of T. Every simplex of the subcomplex representing f(P) is a union of these refined simplices; thus the simplices of T′ contained in f(P) have realization exactly f(P) and form a subcomplex by [F3].

Depends on

Used by

Dependency tree · two levels

8 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