Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-12
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 and continuous real singular cohomology agree

Statement

Assume ACω. For every smooth manifold M, possibly with boundary, restriction induces a natural isomorphism Hsingk(M;R)≅H∞k(M;R) in every integer degree. Naturality is for smooth maps.

Facts & Assumptions

Given: The manifold and the restriction comparison.

[F1]

Ordinary and smooth Mayer–Vietoris use restriction, the V−U difference, and positive lift-differential connectors (Mayer vietoris sequence in real singular cohomology, Smooth singular mayer vietoris sequence).

[F2]

Restriction is a natural cochain map (Restriction from continuous to smooth singular cochains).

[F3]

Restriction is an isomorphism on convex coordinate domains, including relatively open half-space domains (Smooth continuous singular cohomology comparison is an isomorphism on convex coordinate domains).

[F4]

Countable disjoint-union product maps commute with restriction under countable choice (De rham and singular cohomology respect countable disjoint unions).

[F5]

The countable open-set principle applies also to boundary manifolds with the half-box local hypothesis (Countable mayer vietoris open set principle).

Proof

1.1givenF1F2

For an ordered open cover M=U∪V, restriction to smooth simplices gives a diagram from the ordinary short exact small-dual row to the smooth row. Every arrow commutes: restrictions and the V−U difference evaluate the same cochain on the same smooth simplex, and signed coboundaries use the same faces. If an ordinary overlap cocycle c is lifted to e with δe=a(d), its smooth restriction is a lift of the smooth restriction of c, and its differential is the smooth restriction of a(d). Thus the two small-dual lift-differential connectors commute. The squares with actual small-chain inclusions also commute on every smooth small simplex. Their cohomology maps are isomorphisms by [F1], so transporting connectors through their inverses preserves the square. All arrows in the two Mayer–Vietoris sequences therefore commute with restriction.

1.2F2F3F4A1

By [F4] the countable product interface and its comparison square hold under [A1]. The empty manifold has zero chain complexes and zero cohomology on both sides, so its comparison is an isomorphism. Every rational open box and rational half-box is convex; [F3] gives the local comparison isomorphisms, including the zero-dimensional point. Both functors are invariant under diffeomorphisms by functoriality, since the pullbacks of inverse maps are inverse.

2.1F2F5step 1.1step 1.2

All hypotheses of [F5] are now supplied by steps 1.1 and 1.2. Apply its boundaryless version to obtain the claimed isomorphism there and its half-box version to obtain it for manifolds with boundary. Naturality is the already defined square [F2], without any choices of smoothing or inverses on cochains.

3.1F1F2F4F5A1step 2.1∎

Negative degrees have zero groups; in degree zero the same initial Mayer–Vietoris segments apply. Empty opens and overlaps were included in [F1]. On a point the restriction complex map is identity. Degenerate simplices are retained in both complexes and their common face equations. Countable choice is used only through the product and exhaustion/globalization arguments; no arbitrary vector-space dual exactness, full AC, or prescribed-face smoothing into a boundary target is used.

Depends on

Dependency tree · 2 levels

Sources