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.
Smooth singular chains compute singular homology
Statement
Assume countable choice . For every smooth manifold , possibly with boundary, the inclusion of smooth into continuous real singular chains induces an isomorphism in every integer degree. This isomorphism is natural for smooth maps. The proof smooths only finitely many simplices at a time. For boundary targets it moves a finite compact set into the interior; it does not prescribe arbitrary boundary faces during smoothing.
Facts & Assumptions
Given: The strict smooth chain complex and its inclusion into continuous chains.
Smooth chains form the stated subcomplex (Smooth singular chain and cochain complexes).
Subdivision and target-valued smooth homotopy prisms preserve smooth chains (Barycentric subdivision and prism preserve smooth singular chains).
Boundaryless relative simplex smoothing preserves exactly the prescribed compatible face homotopies and fixes an originally smooth simplex when all of its face homotopies are constant (Relative smoothing of a continuous simplex along its faces).
The ordinary prism identity is the signed top-minus-bottom chain homotopy formula (The singular chain homotopy formula).
Boundary charts describe a closed boundary and an open boundaryless interior (The boundary of a positive-dimensional manifold is a closed embedded smooth (n-1)-manifold, Interior and boundary of a manifold with boundary).
The standard smooth step takes values in , is zero for nonpositive inputs and one for inputs at least one (The standard smooth step function).
Countable choice is The Axiom of Countable Choice (), the countable instance of The Axiom of Choice. It is inherited solely through [F3].
Proof
First let be boundaryless. From any finite list of chains take their finite supports and all iterated faces, identifying equal parametrized maps in each degree. This is a finite face-closed set. Assign each zero-simplex itself and its constant homotopy. Inductively the already assigned face homotopies of a simplex agree on intersections, because the affine face identities produce the same lower-dimensional map. Apply [F3] to give the simplex a smooth replacement and a homotopy with these exact faces. If the simplex was originally smooth, all its faces were smooth and already fixed, so use the fixed clause of [F3]. Only finitely many choices are made at each of finitely many dimensions.
Now let have boundary and let be compact. Its boundary part is compact by [F5]. For each eligible boundary chart centred at , choose so its closed half-ball of radius is inside the chart, and put with step from [F6]. Extend by zero outside the chart. It is smooth, equals one on the radius- half-ball, and has compact support in the radius- half-ball. The family of all such smaller half-balls covers ; take a finite subcover. No chart is selected simultaneously for every boundary point.
Replacements respect faces exactly, hence give a chain map on the finite graded spans in question. The homotopy prisms give : apply the oriented-prism calculation [F4] to each simplex homotopy; the side terms are the already assigned face prisms, so cancel with . For a continuous cycle , this gives with smooth, proving surjectivity. If a smooth cycle bounds a continuous , use the supports of both and in step 1.1. Then and , proving injectivity. Equal nonsmooth faces that cancel in have the same replacement, so the equality survives all cancellations. No assertion that a constant unnormalized prism vanishes is needed.
For one chosen chart take and define there, and the identity elsewhere, for every real . The displacement is nonnegative and less than ; where it is nonzero the original point is within radius , so the image remains within radius . Thus the map is well-defined into . It is jointly smooth across the chart edge because the support is compactly inside the chart. It preserves interior points, equals the identity for , and at moves inward every boundary point where . Compose the finitely many maps at the same time to obtain and set . If an original boundary point of has not yet moved, all earlier maps have fixed it exactly; eventually its covering bump moves it inward. Once interior, it remains interior. Therefore .
For a smooth simplex with extension , is smooth into on . Hence [F2] makes the prism preserve smooth chains. The ordinary and smooth identities are both by [F4]. If has image in , restrict its extension to the open inverse image of ; it is then a strict smooth simplex into that boundaryless manifold.
For surjectivity let be a continuous cycle, and let be the finite union of its simplex images. Step 2.2 gives in , homologous to in by step 3.1. Boundaryless surjectivity from step 2.1 makes homologous in to a smooth cycle, which is also smooth in . For injectivity let a smooth cycle satisfy with continuous, and include both supports in . Then is smooth in by step 3.1 and bounds there. Boundaryless injectivity supplies smooth in with . The smooth prism gives .
The actual inclusion of complexes commutes with postcomposition by every smooth map, so its induced isomorphism is natural; no naturality of the chosen finite smoothings or pushes is claimed. For an empty compact boundary part take no chart maps and . Empty chains have empty support, and all negative chain groups are zero. Degree-zero cycles and one-point manifolds are covered by steps 1.1–2.1; zero-dimensional manifolds have empty boundary. Constant and repeated simplices are retained. All boundary pushes are finite; the sole countable-choice cost is that of [F3].
Depends on
- Smooth singular chain and cochain complexes
- Barycentric subdivision and prism preserve smooth singular chains
- Relative smoothing of a continuous simplex along its faces
- The singular chain homotopy formula
- The boundary of a positive-dimensional manifold is a closed embedded smooth (n-1)-manifold
- Interior and boundary of a manifold with boundary
- The standard smooth step function
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
33 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)