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.

Two finite linear subdivisions have a common simplicial refinement

Statement

Two finite linear simplicial subdivisions K1,K2 of a fixed finite Euclidean simplicial complex have a common finite linear simplicial refinement. This asserts refinement of triangulations of the same embedded polyhedron, not of arbitrary abstractly homeomorphic triangulations.

Source locators

2.8(5), 2.9 and 2.12, pp.15–16.

Facts & Assumptions

[F1]

Intersection cells form a finite complex refining both triangulations. Intersections of finite linear complexes form a convex cell complex.

[F2]

A finite cell complex has a compatible simplicial triangulation. Finite convex cell complexes admit compatible triangulations.

Proof

Given: Two finite linear subdivisions K1,K2 with the same embedded underlying set.

1.1F1

Form the finite convex cell complex of all intersections σ∩τ, σ∈K1, τ∈K2, and their faces. It covers the common polyhedron and every cell is contained in a simplex of each triangulation.

2.1F2step 1.1∎

Choose a compatible simplicial triangulation T of that finite cell complex. Each simplex of T lies in an intersection cell, hence in one simplex of K1 and one of K2, and ∣T∣ is their common underlying set. These are exactly the conditions for a common linear refinement. If the set is empty take the empty complex; for points and lower-dimensional intersections the same cell triangulation applies. Only finitely many interior-point choices are required.

Depends on

Used by

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