Alphabeta Math
TheoremStatement: Literature-sourcedProof: Literature-sourcedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Poincare–Lefschetz duality with local coefficients

Statement

Assume AC. Let M be a compact n-manifold and let A=M; let R be a commutative unital ring and L an R-module local system on M. Cap with the canonical relative twisted fundamental class gives isomorphisms, for every integer k, Hk(M;L)Hnk(M,A;OMRRL),Hk(M,A;L)Hnk(M;OMRRL). Here OMR is the collar extension of the interior orientation system. The statement is for the actual boundary A, not an arbitrary subspace of M.

Facts & Assumptions

Given: M,A,n,R,L and AC as in the statement. Put N=MA and P=OMRRL.

[F1]

Canonical twisted fundamental classes over compact subsets gives z=[M,A]tw and z=[A]tw under the boundary-system identification of Orientation local system on a manifold with boundary.

[F2]

Cup and cap products with local coefficients defines both relative cap maps and gives their boundary identity.

[F3]

Poincare duality with the orientation local system gives twisted duality on N and on the compact boundaryless manifold A.

[F4]

Compact topological manifold boundaries admit collars supplies collar cores and makes NM a homotopy equivalence. Functoriality with coefficient morphisms applies this equivalence with the transport identifications of the coefficient systems.

[F6]

Compactly supported cohomology with local coefficients gives the support colimit. The Axiom of Choice is used only through [F3].

Proof

technique · direct
1.1

If A=, M=N is compact, [F1] identifies z with the compact twisted fundamental class, and both displayed maps are [F3]. This includes compact zero-manifolds. Hence suppose A, so n1. Choose a collar and put Cd=c(A×[0,d)), Kd=MCd for 0<d<1. Every compact subset L of N lies in some Kd. Indeed, on a fixed closed collar segment the height coordinate has compact image on L, and that image omits zero because LA=; hence its positive part has a positive minimum. Points outside the segment already lie in every sufficiently small core. Choosing d below that minimum gives LKd.

F4
2.1

The collar retraction CdA, the natural cohomology pair sequences, and the five lemma give Hk(M,Cd;L)Hk(M,A;L). Removing the closed boundary inside Cd, local-coefficient excision gives Hk(M,Cd;L)Hk(N,NKd;LN). Both isomorphisms commute with decreasing d, because they are induced by inclusions, restrictions, and the collar homotopies with their coefficient-transport comparisons. Cofinality from step 1.1 and the common-support criterion [F6] therefore give an isomorphism J:Hk(M,A;L)Hck(N;LN).

F4F5F6step 1.1
3.1

Under J, cap with z is cap with the interior support class followed by inclusion NM. Indeed [F1] constructed z so that its image in Hn(M,Cd;OMR) is the excision image of [N]Kdtw. Represent a class by a cocycle vanishing on Cd and represent the equality of these two relative classes by a boundary plus a chain in Cd. The cap boundary identity in [F2] turns the boundary term into a target boundary, and the Cd term caps to zero. Thus the two cap classes agree. Twisted duality on N is an isomorphism by [F3], and inclusion NM is a homotopy equivalence with the coefficient comparison in [F4]. Together with step 2.1 this proves the second displayed isomorphism.

F1F2F3F4step 2.1
4.1

For the first displayed map, compare the five-term cohomology window Hk1(A;L)Hk(M,A;L)Hk(M;L)Hk(A;L)Hk+1(M,A;L) with the homology window Hnk(A;P)Hnk(M;P)Hnk(M,A;P)Hnk1(A;P)Hnk1(M;P). Use vertically, in order, twisted duality on A, the second isomorphism just proved, the desired first cap map, twisted duality on A, and the next-degree second isomorphism. The boundary identification in [F1] identifies PA with OARRLA. Both rows are exact by [F5].

F1F3F5step 3.1
5.1

The middle inclusion and quotient squares commute because they use the same cap chains before and after passage to the relevant quotient. For a degree-(k1) boundary cocycle a, choose an extension a~ to M. The positive cohomology connector is represented by δa~, and the cap boundary formula gives δa~z=a~z+(1)k(a~z). Since z=[A]tw, this proves the first connector square; the same calculation one degree later proves the last. For the homology connector square, a degree-k cocycle b gives (bz)=(1)kbAz, so multiplying that homology connector by (1)k makes the square commute. Multiplication by this unit preserves exactness. Thus [F5]'s five lemma applies to the ladder in step 4.1 and proves the first displayed map is an isomorphism.

F1F2F5step 4.1
6.1

Empty M and the zero ring or zero system give the unique isomorphisms of zero groups. The endpoint degrees k=0,n occur in the same exact windows; negative chain and cochain degrees vanish. Disconnected manifolds split componentwise, and compactness makes only finitely many components occur. The boundary may be empty or disconnected. The collar choice changes OMR only by the natural isomorphism specified in its definition, under which the class and cap maps correspond by their local characterization. The sole AC use is inherited from boundaryless twisted duality [F3], namely its countable coordinate-neighborhood selection; collar cores, individual representatives, and finite exact windows add no choice. The published oriented Poincare--Lefschetz theorem is recovered after an orientation trivializes OMR.

F1F3F4F6step 1.1step 3.1step 5.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

52 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