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

Smooth singular chains compute singular homology

Statement

Assume countable choice ACω. For every smooth manifold M, possibly with boundary, the inclusion of smooth into continuous real singular chains induces an isomorphism Hk(M;R)Hksing(M;R) 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.

[F1]

Smooth chains form the stated subcomplex (Smooth singular chain and cochain complexes).

[F2]

Subdivision and target-valued smooth homotopy prisms preserve smooth chains (Barycentric subdivision and prism preserve smooth singular chains).

[F3]

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).

[F4]

The ordinary prism identity is the signed top-minus-bottom chain homotopy formula (The singular chain homotopy formula).

[F6]

The standard smooth step takes values in [0,1], is zero for nonpositive inputs and one for inputs at least one (The standard smooth step function).

[A1]

Countable choice is The Axiom of Countable Choice (ACω), the countable instance of The Axiom of Choice. It is inherited solely through [F3].

Proof

1.1

First let M 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.

F1F3A1
1.2

Now let M have boundary and let KM be compact. Its boundary part is compact by [F5]. For each eligible boundary chart centred at q=(z0,0), choose r>0 so its closed half-ball of radius 3r is inside the chart, and put χ(z,s)=1s0(((z,s)q2r2)/(3r2)) with step s0 from [F6]. Extend χ by zero outside the chart. It is smooth, equals one on the radius-r half-ball, and has compact support in the radius-2r half-ball. The family of all such smaller half-balls covers KM; take a finite subcover. No chart is selected simultaneously for every boundary point.

F5F6
2.1

Replacements respect faces exactly, hence give a chain map Q on the finite graded spans in question. The homotopy prisms give P+P=Q1: apply the oriented-prism calculation [F4] to each simplex homotopy; the side terms are the already assigned face prisms, so cancel with P. For a continuous cycle z, this gives Qzz=Pz with Qz smooth, proving surjectivity. If a smooth cycle z bounds a continuous b, use the supports of both b and z in step 1.1. Then Qz=z and Qb=Qb=z, proving injectivity. Equal nonsmooth faces that cancel in b have the same replacement, so the equality survives all cancellations. No assertion that a constant unnormalized prism vanishes is needed.

F1F4step 1.1algebra
2.2

For one chosen chart take 0<ε<r/2 and define Pt(z,s)=(z,s+εs0(t)χ(z,s)) there, and the identity elsewhere, for every real t. The displacement is nonnegative and less than r/2; where it is nonzero the original point is within radius 2r, so the image remains within radius 5r/2<3r. Thus the map is well-defined into M. It is jointly smooth across the chart edge because the support is compactly inside the chart. It preserves interior points, equals the identity for t0, and at t=1 moves inward every boundary point where χ>0. Compose the finitely many maps at the same time to obtain Jt and set j=J1. If an original boundary point of K has not yet moved, all earlier maps have fixed it exactly; eventually its covering bump moves it inward. Once interior, it remains interior. Therefore j(K)M.

F5F6step 1.2algebra
3.1

For a smooth simplex with extension τˉ:OM, (x,t)Jt(τˉ(x)) is smooth into M on O×R. Hence [F2] makes the prism PJ preserve smooth chains. The ordinary and smooth identities are both PJ+PJ=j#1 by [F4]. If jτ has image in M, restrict its extension to the open inverse image of M; it is then a strict smooth simplex into that boundaryless manifold.

F1F2F4F5step 2.2
4.1

For surjectivity let z be a continuous cycle, and let K be the finite union of its simplex images. Step 2.2 gives j#z in M, homologous to z in M by step 3.1. Boundaryless surjectivity from step 2.1 makes j#z homologous in M to a smooth cycle, which is also smooth in M. For injectivity let a smooth cycle z satisfy z=b with b continuous, and include both supports in K. Then j#z is smooth in M by step 3.1 and bounds j#b there. Boundaryless injectivity supplies smooth c in M with c=j#z. The smooth prism gives (cPJz)=j#z(j#zz)=z.

F1F2step 2.1step 2.2step 3.1algebra
5.1

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 J=1. 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].

F1F3F5A1step 1.1step 2.1step 2.2step 4.1

Depends on

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