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

Poincaré duality for oriented topological manifolds

Statement

Assume AC. Let M be an R-oriented boundaryless n-manifold, with R commutative unital; manifolds are Hausdorff and second countable here. Then cap with the compatible compact orientation classes gives isomorphisms DM:Hcp(M;R)Hnp(M;R) for every integer p, including disconnected, noncompact and empty M.

Naturality means that for an open inclusion i:UM with restricted orientation, DMe=iDU, where e is extension of compact supports. For compact M, Hcp(M;R)=Hp(M;R) canonically and DM(a)=a[M]. For arbitrary M the isomorphism is the direct sum of those on its components. AC is used in the countable coordinate-neighborhood selection for exhaustion and in the local universal-coefficient proof.

Facts & Assumptions

[F1]

The cap-duality map of an oriented manifold defines the actual cap map and proves representative and compact-support compatibility.

[F2]

A manifold exhaustion passes duality to the colimit supplies the compactly nested exhaustion, the two colimit identifications and compatibility with the actual DM.

[F3]

Duality extends to finite unions of coordinate balls proves duality on its finite coordinate-ball stages, with AC inherited from local UCT.

[F4]

Cap product and the Mayer–Vietoris duality ladder proves open-extension naturality of cap.

[F5]

Compatible orientation classes over compact subsets constructs [M]K, says that a compact support meets only finitely many components, and identifies the corresponding class decomposition.

[F6]

Compactly supported singular cohomology constructs the support colimit, including the terminal compact case. Fundamental class of a compact oriented manifold identifies the terminal support class with [M].

[F7]

The Axiom of Choice is assumed for the exact uses in [F2] and [F3].

[F8]

Every path-connected space is connected, and every path component lies inside a component proves connectedness of the interval and containment of each path component in a connected component.

[F9]

Topological manifolds with and without boundary gives Euclidean coordinate neighborhoods, and Connected components, quasicomponents, and totally disconnected spaces identifies the component through a point as the largest connected subset containing it.

Proof

Given: M,n,R, its orientation and AC. Every open submanifold carries the restricted orientation.

1.1

Apply [F2] to obtain increasing finite coordinate-ball unions Uj exhausting M. Each has cap-duality isomorphisms in every degree by [F3]. The two colimit identifications and cap compatibility in [F2] therefore identify DM with the colimit of these isomorphisms, which is an isomorphism by the representative lifting and vanishing argument proved there. The map is precisely the cap map of [F1], not an unspecified isomorphism between its domain and codomain. The construction does not assume M connected or compact.

F1F2F3F7given
1.2

For any open UM, [F4] gives DMe=iDU from the chain cap identity and support excision. This proves the stated naturality; an arbitrary continuous map is not being assigned an extension map on compact-support cohomology. If M is compact, K=M is terminal in [F6], so the cohomology colimit identifies with Hp(M;R) and its compatible orientation class is [M]. Formula [F1] is therefore exactly aa[M].

F1F4F6given
1.3

To make the component assertion explicit, first note that every component is open. For xM, restrict a coordinate neighborhood [F9] to a Euclidean ball about the coordinate of x. Straight segments make that ball path connected, hence connected by [F8], so maximality in [F9] puts it inside the component of x. The component is the union of these neighborhoods over its points and is therefore open. Its complement is the union of all other open components, so it is closed as well. Write the components as Cλ. Each simplex image lies in a single component: the simplex is convex and any two of its points are joined by a segment, whose continuous image is a path; the image is connected by [F8] and therefore lies in one maximal connected component [F9]. A finite chain uses only finitely many components, and its boundary remains in those components. Thus the chain complex is the direct sum of the component chain complexes. A cycle is exactly a tuple of component cycles with finite support, and it bounds exactly when each of its finitely many entries bounds; one finite sum of their bounding chains suffices. Hence Hq(M;R)=λHq(Cλ;R).

F8F9given
2.1

For a compact K, [F5] says that only finitely many components meet K. Its intersection Kλ with each is compact, because that component is also closed: the complement is the union of the other open components. Step 1.3 identifies the relative chain complex for (M,MK) with the finite direct sum of the relative complexes (Cλ,CλKλ) for those components; components missing K have zero quotient complex. Applying Hom into R identifies the relative cochain complex with the finite product, equal to the finite direct sum, of their cochain complexes. Kernels and images are computed componentwise, so the same statement holds in relative cohomology. Taking compact-support colimits by [F6] gives Hcp(M;R)=λHcp(Cλ;R): each representative has only those finitely many components, and conversely finitely many component representatives have compact union support; equality is witnessed on their finite union of larger supports. No infinite product of component cohomology groups is asserted.

F5F6step 1.3
3.1

The orientation class decomposition in [F5] and the cap formula [F1] show that the two direct sums in steps 1.3 and 2.1 carry DM to the componentwise maps DCλ. A simplex and all its front and back faces stay in its one component, so mixed component terms vanish. Every component is an open manifold and step 1.1 applies to it with its supplied restricted orientation. This establishes the component interpretation without selecting an orientation for each component.

F1F5step 1.1step 1.3step 2.1
4.1

For empty M all complexes and colimits are zero; for a point (n=0) cap is multiplication by the orientation unit and is an isomorphism. The zero ring likewise gives the unique isomorphism of zero modules. At p=n the target is ordinary H0; at p=0 cap evaluates the front vertex. Negative cochain and chain degrees are zero, and step 1.1 proves the assertion in these degrees as well. Degenerate simplices remain within their component and satisfy the same cap formula. The AC uses in [F7] are exactly the basis-indexed coordinate-neighborhood choice in [F2] and the free cycle/boundary modules, projections and comparison lifts in the local UCT used by [F3]. Component decomposition uses finite supports and introduces no further AC use.

F1F2F3F5F6F7step 1.1step 1.2step 3.1

Depends on

Used by

Dependency tree · two levels

49 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