Alphabeta Math
PropositionStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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.

Barycentric subdivision and prism preserve smooth singular chains

Statement

Barycentric subdivision S and its subdivision chain homotopy T preserve C(M;R), for manifolds M possibly with boundary. More generally, a homotopy prism preserves smooth chains if the composition of the homotopy with each supplied smooth-simplex extension extends smoothly into the target on a neighbourhood of Δk×[0,1] in Ak×R. A smooth homotopy on the closed time interval always gives such a prism after flattening time at both endpoints. Its chain-homotopy identity retains the same endpoint maps.

Facts & Assumptions

Given: A smooth simplex σ:ΔkM with extension σˉ:OM.

[F1]

Smooth chains retain the affine-neighbourhood extension convention (Smooth singular chain and cochain complexes).

[F2]

Subdivision and its homotopy are finite compositions with affine domain simplices (Barycentric subdivision operator, Subdivision prism homotopy).

[F3]

The homotopy prism is a signed finite sum with chain identity g#f#=P+P (The singular chain homotopy formula).

[F4]

The standard step s:R[0,1] is smooth, zero for t0 and one for t1 (The standard smooth step function).

Proof

1.1

If a:ΔjΔk is affine, it extends to an affine map aˉ:AjAk. The open inverse image aˉ1(O) contains Δj, and σˉaˉ extends σa smoothly into M. Each simplex in Sσ and Tσ has this form: coning affine simplices appends a fixed barycenter vertex and so remains affine, at every stage of the finite recursion [F2]. Therefore both operators preserve smooth chains. Their affine images stay in Δk, so they also preserve any specified image-containing subset of M.

givenF1F2
2.1

Let B be a smooth target-valued extension of (x,t)H(σ(x),t) to an open neighbourhood W of Δk×[0,1]. Each prism simplex λi:Δk+1Δk×[0,1] is affine. Its affine extension has open inverse image of W containing Δk+1, and Bλi is the required extension into the target. Thus every term of the signed prism is smooth. The equality [F3] is an equality in this subcomplex because every term is now in it.

F1F3step 1.1
3.1

For a smooth homotopy H:M×[0,1]N, with smoothness interpreted by local coordinate extensions also at the time endpoints, replace it by H^(p,t)=H(p,s(t)) for all real t. This is smooth: near an endpoint use a local coordinate extension of H and compose with (p,t)(p,s(t)); near an interior time ordinary smooth composition suffices. It is target-valued for every real t because s(t)[0,1]. Then (x,t)H^(σˉ(x),t) is smooth on O×R and satisfies step 2.1. Its endpoint maps are exactly those of H, so [F3] gives the same difference of induced chain maps.

F1F3F4step 2.1
4.1

The qualification in step 2.1 is necessary for an unmodified prism with a boundary target. Take M a point and H(t)=t into N=[0,). This is a smooth homotopy on the interval, but its prism is the path tt, which has no smooth target-valued extension across 0: any such nonnegative extension has a local minimum at 0 and derivative zero, whereas its right derivative would be one. Time flattening avoids this obstruction. In degree zero S=1 and T=0; the flattened homotopy prism is still a smooth path. Empty chains and empty domains give zero operators, repeated affine vertices are allowed, and all formulas are finite and choice-free.

F1F2F3F4step 1.1step 2.1step 3.1

Depends on

Used by

Dependency tree · two levels

17 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