Alphabeta Math
TheoremStatement: 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.

Finite simplicial approximation for maps of pairs

Statement

Let K be finite, AK and BL subcomplexes, and f:(K,A)(L,B) continuous. For all sufficiently large integers r, there is a simplicial approximation g:(sdrK,sdrA)(L,B), homotopic as a map of pairs to fbKr. Here bKr is the composite barycentric homeomorphism. No pointwise fixing of a positive-dimensional restriction is asserted.

Source locators

2C.1 pp.177–179; Maunder 2.5.4 p.47.

Facts & Assumptions

[F1]

Barycentric realization is a homeomorphism compatible with subcomplexes. Barycentric subdivision realizes homeomorphically.

[F2]

Finite subdivisions have a compatible metric and their star diameters tend to zero. Mesh of iterated simplicial barycentric subdivision tends to zero.

[F4]

Star inclusions produce a simplicial map and a common-carrier homotopy. The open star criterion produces a simplicial map.

Proof

Given: A continuous map of the indicated pairs with finite source.

1.1

Use the barycentric homeomorphisms to view every subdivision as a triangulation of the same finite Euclidean polyhedron. The inverse images f1(stL(w)) cover it, since the support of every image point is nonempty. They are open, and the source is compact metric. The Lebesgue-number lemma gives δ>0 such that any nonempty set of diameter less than δ lies in one of these inverse images. For an empty source use the empty map for every r.

F1F2F3F4
2.1

Choose r0 with 2m(sdrK)<δ for every rr0, using the mesh estimate; in dimension zero m=0 already. Each vertex star in that triangulation is nonempty and has diameter at most 2m. Hence for each of the finitely many vertices v select g(v) with f(st(v))st(g(v)). This is only finite choice. The star criterion gives a simplicial map and a continuous common-carrier straight-line homotopy.

F2F3F4step 1.1
3.1

If σ is a face of sdrA, its barycenter lies in A, so the support of its image under f is a face of B. The star criterion puts all g(v) for vσ in this support; hence g(σ)B. At every point of A the same carrier argument keeps the homotopy inside B. Pulling back to the abstract subdivided realization gives the stated homotopy of pairs to fbKr, for every rr0.

F1F4step 2.1

Remarks

Approximations need not be unique. On one edge, the constant map with value its midpoint has both constant endpoint maps as star approximations, since the midpoint belongs to both target vertex stars. Some maps admit none before subdivision: the continuous edge self-map f(x)=min(2x,1) sends the open star [0,1) of 0 onto [0,1], which lies in neither target vertex star. This is the failure tested by Maunder 2.5.6, pp.47–48; it is stronger than failure of exact simpliciality.

Depends on

Used by

Dependency tree · two levels

27 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