Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

A manifold exhaustion passes duality to the colimit

Statement

Assume AC. Every Hausdorff second-countable n-manifold M has open sets U1U2 with M=j1Uj,UjUj+1,Uj compact, where each Uj is a finite union of relatively compact coordinate balls. For a manifold with boundary this phrase includes coordinate half-balls at boundary points, that is, inverse images of Br(x)R+n inside a chart; for a boundaryless manifold only ordinary coordinate balls are needed. The containment need not be strict.

For a commutative unital ring R, extension and inclusion give limjHcp(Uj;R)Hcp(M;R),limjHq(Uj;R)Hq(M;R). If M is boundaryless and R-oriented, these identifications carry the colimit of the stage cap-duality maps to DM. Thus compatible stage duality isomorphisms give an isomorphism on M; in particular the preceding finite-union theorem supplies these stages. AC is used to select coordinate neighborhoods for the eligible members of a countable basis and, for this last duality consequence, in the earlier local UCT proof.

Facts & Assumptions

[F1]

Topological manifolds with and without boundary supplies the countable basis and local Euclidean or half-space charts, including the zero-dimensional convention.

[F4]

The Axiom of Choice permits a simultaneous choice from the neighborhood sets indexed by eligible basis members.

[F5]

Cap duality passes to increasing open unions proves both colimit identifications for boundaryless oriented manifolds and the cap compatibility, with no extra choice.

[F6]

Duality extends to finite unions of coordinate balls gives cap isomorphisms on each finite union of ordinary coordinate balls, assuming AC only through local UCT.

[F7]

Compactly supported singular cohomology gives relative-support representatives and common-support equality. Excision for singular cohomology identifies a relative group supported in a compact subset of an open subspace with its ambient group.

Proof

Given: M,n,R and AC. Fix a countable basis. List its members as B1,B2,, permitting repetitions or empty padding if the basis is finite; if M is empty use only empty members. Such a list is part of being at most countable: an injection of the basis into the natural numbers assigns its unique member at an occupied index and the empty set otherwise.

1.1

Every point has arbitrarily small coordinate balls or half-balls with compact closure. In a chart take a radius whose closed Euclidean ball, intersected with the half-space when appropriate, lies inside the chart image and inside the desired open neighborhood. Such a radius exists by openness in the model. The closed model ball is compact by [F2], its inverse image is compact because an open cover pulls back under the chart map, and it is closed in M because M is Hausdorff. The latter implication follows by separating a point outside a compact set from each of its points and taking a finite subcover of those neighborhoods. Thus this inverse image contains the closure in M of the open coordinate ball and is itself that closure, since the open ball is dense in the closed model ball. This proves local compactness and makes [F3] applicable. For boundaryless M, [F1] lets the chart be taken Euclidean; for n=0 the coordinate ball is one point.

F1F2F3given
2.1

Call index i eligible when Bi is nonempty and is contained in a relatively compact coordinate ball of the type in step 1.1. For each eligible i, the set of such neighborhoods is a nonempty set of open subsets of M. Use [F4] to select one Vi containing Bi. For an ineligible index set Vi=. These neighborhoods cover M: for any x, step 1.1 gives a coordinate neighborhood V of the required type; the basis gives an index i with xBiV. That index is eligible, so xVi. No chart is selected for every point. The sole infinite selection in this construction is the family Vi over the eligible countable index set.

F1F4step 1.1
3.1

Put Wk=V1Vk. Its closure is the finite union of the compact closures of the Vi, hence compact: the finite union is closed and contains Wk, while each closure lies in the closure of Wk; finite subcovers show compactness. The Wk increase and cover M. Any compact subset of M is contained in some Wk, by a finite subcover and the maximum of its indices. Set N1=1. Given Nj, let Nj+1 be the least integer kmax(Nj+1,j+1) with WNjWk. Existence follows from the just-proved compact containment. Defining Uj=WNj gives the compact-closure nesting, and Njj ensures the Uj still cover M. Recursion uses uniquely specified least integers and needs no further choice.

step 2.1
4.1

For completeness the two colimit identifications do not need orientation or absence of boundary. Every compact support KM lies in some Uj by the same finite-subcover argument. By [F7], restriction identifies Hp(M,MK;R) with Hp(Uj,UjK;R): excise the closed set MUj, contained in the open set MK. The inverses define extension and commute with enlargement of supports. A compact-support class on M therefore comes from one stage. If a stage class becomes zero on M, [F7] witnesses this at a larger compact support L, contained in a later Uk; excision there proves the stage class already zero in that later stage. The common-stage representative construction of a sequential colimit, explicitly given in [F5], now proves the first canonical isomorphism.

F5F7step 3.1
4.2

A finite singular cycle on M has image in one Uj: its support is a finite union of continuous images of compact simplices, using [F2], and hence is compact. Thus its class comes from stage homology. If a stage cycle bounds in M, one finite bounding chain also has support in a later Uk, so the class vanishes in that stage. The same common-stage criterion proves the second canonical isomorphism. This argument includes ordinary H0 and the zero complexes in negative degrees, and invokes no exactness theorem about filtered colimits.

F2F5step 3.1
5.1

If M is boundaryless and oriented, [F5] identifies DM with the colimit map and proves that stagewise isomorphisms give an isomorphism. The particular Uj in step 3.1 are finite unions of ordinary coordinate balls, so [F6] proves those isomorphisms. Its only further AC use is the local UCT construction with free cycle/boundary modules, projections and comparison lifts. Nothing here asserts absolute cap duality on manifolds with boundary: their exhaustion and the two colimit identifications hold, while the stated cap consequence has the explicit boundaryless hypothesis.

F4F5F6step 3.1step 4.1step 4.2
6.1

If M is empty every Uj is empty, so all claims hold with zero groups. If M is compact, its cover by the Wk has a finite subcover, so some Wk=M and the exhaustion is eventually constant. This explains why nesting is not required to be proper. A point and finite zero-dimensional manifolds are included. For the zero ring all maps are the unique maps of zero modules. The colimit and cap statements hold for all degrees, including p=0,n and negative indices under the stated conventions. Degenerate simplices still have compact image. The countable neighborhood selection of step 2.1 is expressly covered by AC; all subsequent choices are finite or least-index constructions.

F1F2F4F5step 3.1step 4.1step 4.2step 5.1

Depends on

Used by

Dependency tree · two levels

62 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