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 and its subdivision chain homotopy preserve , for manifolds 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 in . 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 with extension .
Smooth chains retain the affine-neighbourhood extension convention (Smooth singular chain and cochain complexes).
Subdivision and its homotopy are finite compositions with affine domain simplices (Barycentric subdivision operator, Subdivision prism homotopy).
The homotopy prism is a signed finite sum with chain identity (The singular chain homotopy formula).
The standard step is smooth, zero for and one for (The standard smooth step function).
Proof
If is affine, it extends to an affine map . The open inverse image contains , and extends smoothly into . Each simplex in and 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 , so they also preserve any specified image-containing subset of .
Let be a smooth target-valued extension of to an open neighbourhood of . Each prism simplex is affine. Its affine extension has open inverse image of containing , and 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.
For a smooth homotopy , with smoothness interpreted by local coordinate extensions also at the time endpoints, replace it by for all real . This is smooth: near an endpoint use a local coordinate extension of and compose with ; near an interior time ordinary smooth composition suffices. It is target-valued for every real because . Then is smooth on and satisfies step 2.1. Its endpoint maps are exactly those of , so [F3] gives the same difference of induced chain maps.
The qualification in step 2.1 is necessary for an unmodified prism with a boundary target. Take a point and into . This is a smooth homotopy on the interval, but its prism is the path , which has no smooth target-valued extension across : any such nonnegative extension has a local minimum at and derivative zero, whereas its right derivative would be one. Time flattening avoids this obstruction. In degree zero and ; 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.
Depends on
Used by
- A finite chain needing different subdivision depths on its simplices Example
- One fixed number of barycentric subdivisions makes every singular simplex cover small False statement
- Smooth continuous singular cohomology comparison is an isomorphism on convex coordinate domains Proposition
- Smooth singular chains compute singular homology Theorem
- Smooth singular mayer vietoris sequence Theorem
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
- DG-16 design; Hatcher/Park control (standard reference, not scraped)