Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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 K1,K2 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

[F1]

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.

1.1

A simplex in its affine hull is defined by its barycentric coordinates λi0. Intersecting two simplices combines these finitely many inequalities in the intersection of their affine hulls. A nonempty intersection C is closed and bounded, hence is a cell. More generally consider any nonempty such finite-inequality cell C. Discard inequalities identically zero on C. For each remaining inequality choose a witness xiC where it is positive. Their average is in C 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 affC. If no inequalities remain, boundedness forces C to be a singleton, and its sole point is relatively interior.

F1
2.1

For xC, put I(x)={i:i(x)=0} and Fx={yC:i(y)=0 for iI(x)}. This is an exposed face, using the supporting function iI(x)i; an empty index set gives C. Its remaining inequalities are strict at x, so x is relatively interior in Fx. If G is any exposed face containing x, then for yFx a small extension z=x+ϵ(xy) still lies in Fx: active inequalities stay zero and all others stay nonnegative for small positive ϵ. Since x lies strictly between y and z, a supporting function nonnegative on C and zero at x must vanish at both endpoints. Hence yG and FxG.

step 1.1
3.1

Conversely, choose x relatively interior to any nonempty exposed face G, using the finite-inequality argument with its added supporting equality. For any yG, extend slightly past x away from y inside G. Every original inequality active at x must vanish at y, by the same nonnegative weighted-sum argument. Thus GFx, 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 C by adding more equalities. A point is in the relative boundary exactly when at least one inequality not identically zero on C is active: otherwise a relative ball lies in C; if one is active its nonconstant affine function has negative values arbitrarily nearby in affC. Thus proper faces cover exactly the relative boundary.

step 1.1step 2.1
4.1

Let C=στ and D=στ. 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 C shows CD is a face of C; reversing the roles proves it is a face of D. Now take arbitrary faces F of C and G of D. First restrict to the common face CD; intersections and transitivity of faces from the preceding step show FG is a face of F and G. 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.

F1step 3.1

Depends on

Used by

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