Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Relative derived subdivision of a finite simplicial pair

Definition

For a finite Euclidean simplicial pair AK, define the relative derived subdivision DAK by keeping A unchanged and processing the other simplices by increasing dimension: triangulate their boundaries using the already processed faces, then cone that boundary from the simplex barycenter. A vertex outside A stays its own barycenter. Include all faces. Write T0=K, Tr=DATr1, also denoted DArK.

The coning triangulates a simplex because every ray from its interior barycenter meets its boundary in a unique point: in barycentric coordinates the ray stops when the first decreasing coordinate reaches zero. Cones over boundary simplices intersect in cones over their intersections; the apex is not in the affine hull of a proper face, so the new simplices are affinely independent. This is the radial version of Barycentric face chains triangulate a geometric simplex. Since adjacent original simplices have the same already triangulated common face, the construction is compatible and preserves the underlying polyhedron. It restricts to DAPP on each subcomplex P. If A has no vertices, the result is the ordinary barycentric subdivision of Barycentric subdivision of an abstract simplicial complex; if A=K, it is K itself.

The simplex description is a face αA (possibly empty), followed by barycenters of a strict chain of faces outside A that strictly contain α. Repeated coning proves both directions of this description: adjoining an outer barycenter extends the face chain, and every chain is built by successively coning its shorter initial chain.

Remarks

In Maunder 2.5.9 (pp.50–51), take the three triangles 012,023,234 with all faces and fix the full triangle 012. It remains one triangle. Triangle 023 has its edge 02 fixed and edges 03,23 bisected, so coning its subdivided boundary gives 1+2+2=5 triangles. Triangle 234 has all three edges bisected, giving 6 triangles. Thus the relative subdivision has exactly 1+5+6=12 triangles, as in the source example. The common edge 23 has the same midpoint on both sides.

Source locators

2.5.7–2.5.8 pp.49–50.

Depends on

Used by

Dependency tree · two levels

6 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