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.
Intersections of finite linear complexes form a convex cell complex
Statement
Let be finite linear simplicial complexes in one Euclidean space, with the same underlying polyhedron. Their cells , together with all their faces and the empty cell, form a finite convex cell complex refining both. Each nonempty cell has finitely many faces and a relative interior point, and its proper faces cover its relative boundary.
The face and interior assertions also hold for every nonempty bounded finite-inequality cell in the definition.
Source locators
2.6–2.8(5), pp.13–15; Appendix to Chapter 2 pp.27–30.
Facts & Assumptions
Cells are bounded finite-inequality sets; supporting equality defines a face. Finite convex cell complex and linear subdivision.
Proof
Given: Two finite geometric simplicial complexes, and finite systems of affine inequalities for their simplices.
A simplex in its affine hull is defined by its barycentric coordinates . Intersecting two simplices combines these finitely many inequalities in the intersection of their affine hulls. A nonempty intersection is closed and bounded, hence is a cell. More generally consider any nonempty such finite-inequality cell . Discard inequalities identically zero on . For each remaining inequality choose a witness where it is positive. Their average is in and makes every remaining inequality positive, since all other terms are nonnegative. Finitely many strict inequalities give a relative open ball about this average in . If no inequalities remain, boundedness forces to be a singleton, and its sole point is relatively interior.
For , put and . This is an exposed face, using the supporting function ; an empty index set gives . Its remaining inequalities are strict at , so is relatively interior in . If is any exposed face containing , then for a small extension still lies in : active inequalities stay zero and all others stay nonnegative for small positive . Since lies strictly between and , a supporting function nonnegative on and zero at must vanish at both endpoints. Hence and .
Conversely, choose relatively interior to any nonempty exposed face , using the finite-inequality argument with its added supporting equality. For any , extend slightly past away from inside . Every original inequality active at must vanish at , by the same nonnegative weighted-sum argument. Thus , and the reverse inclusion was just proved. Consequently every face is obtained from an active subset of the finite inequalities, so there are finitely many faces. Intersections of faces are faces by adding their active equalities, and a face of a face is a face of by adding more equalities. A point is in the relative boundary exactly when at least one inequality not identically zero on is active: otherwise a relative ball lies in ; if one is active its nonconstant affine function has negative values arbitrarily nearby in . Thus proper faces cover exactly the relative boundary.
Let and . In each original simplicial complex the intersections and are common faces. They are cut out by supporting affine equalities nonnegative on and , respectively. Restricting these equalities to shows is a face of ; reversing the roles proves it is a face of . Now take arbitrary faces of and of . First restrict to the common face ; intersections and transitivity of faces from the preceding step show is a face of and . Including all faces therefore gives a finite complex. Every such cell is contained in its original and , and each point of the common polyhedron lies in at least one such intersection, proving refinement and equality of underlying sets.
Depends on
Used by
- Finite convex cell complexes admit compatible triangulations Lemma
- Two finite linear subdivisions have a common simplicial refinement Lemma
Cited to discharge well-definedness by Finite convex cell complex and linear subdivision.
Dependency tree · two levels
4 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
- C. P. Rourke and B. J. Sanderson, Introduction to Piecewise-Linear Topology (standard reference, not scraped)