Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 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.

Cap product and the Mayer–Vietoris duality ladder

Statement

Let M=UV be an R-oriented boundaryless n-manifold covered by open subsets, with R commutative unital. Extension of compact supports gives an exact sequence Hcp(UV;R)(eU,eV)Hcp(U;R)Hcp(V;R)eU+eVHcp(M;R)δHcp+1(UV;R). Under cap-duality maps, its first two arrows commute with the ordinary homology Mayer–Vietoris arrows (i,i) and sum. For its connecting arrow, DM=(1)p+1DUVδ. Thus replacing the homology connecting arrow from Hnp(M;R) by (1)p+1 makes an exactly commuting ladder with exact rows. This asserts compatibility, without assuming any duality map is an isomorphism. The filtered-colimit exactness used here and the entire argument require no AC.

Facts & Assumptions

[F1]

The cap-duality map of an oriented manifold defines cap duality using the support classes of Compatible orientation classes over compact subsets, which are uniquely determined by their point restrictions.

[F2]

Excision for singular cohomology and Excision for singular homology identify relative groups supported in a compact subset of an open subspace with their ambient versions.

[F3]

Cap naturality and projection formula proves the actual chain identity i(iac)=aic.

[F4]

Relative cup product for an excisive triad proves the quotient-cochain comparison for two open subspaces, by explicit small-chain homotopies; only that comparison is used here.

[F5]

The long exact sequence in homology supplies the exact sequence of a short exact sequence of complexes, including the connecting map obtained by lifting and taking a differential.

[F7]

Mayer–Vietoris sequence in singular homology gives the homology sequence with sum as second map. Its chain convention has first map (c,c) and connecting map [zU+zV][zU].

[F8]

Relative cup product for an excisive triad explicitly constructs the least-subdivision retraction and homotopy from image-preserving barycentric subdivision and prism operators. Hence both operators preserve chains in every subspace and the homotopy is relative to chains already small for the cover.

[F9]

Cap product boundary identity gives (ac)=(1)p(acδac) for a degree-p cochain, including zero output degrees.

Proof

Given: M,U,V,n,R and the supplied orientation. All cochains below have coefficients in R, with positive coboundary, and cap is cohomology first. Orient open subspaces by restriction.

1.1

If KU is compact, remove the closed set MUMK in [F2]. This gives inverse isomorphisms for the inclusion (U,UK)(M,MK), since MK is open. Define extension on Hp(U,UK) as the inverse of cohomology restriction. Inclusions of supports commute with restriction at the cochain level, so their inverses commute too, giving a map e:Hcp(U)Hcp(M) by [F6]. A relative orientation class in U maps to the ambient class: its local restrictions agree with the given orientation, and [F1] gives uniqueness. For an ambient relative cocycle a, [F3] consequently gives DMe[aU]=iDU[aU]. This proves open naturality, including independence of the excision inverse.

F1F2F3F6given
1.2

For compact KU,LV, put A=MK, B=ML, and let Q be the cochains vanishing on C(A)+C(B). There is a short exact sequence of cochain complexes 0Qq(q,q)C(M,A)C(M,B)(a,b)a+bC(M,AB)0. The kernel is exactly the pairs (q,q) vanishing on both subcomplexes. For surjectivity, given a cochain φ in the last term, define φA to be zero on every simplex wholly in A and equal to φ on every other simplex; put φB=φφA. Then φA vanishes on A. On a simplex in B but not wholly in A, φB=0 by construction, and on a simplex in AB both original values are zero. Thus φB vanishes on B. These are termwise lifts, not asserted cochain maps. All displayed arrows commute with coboundaries.

F4given
2.1

Since A,B are open, [F4] identifies H(Q) with H(M,AB)=H(M,M(KL)). Apply [F5] to the short exact sequence of step 1.2, reindexing cochain degree p as chain degree p. This yields a long exact cohomology sequence with maps (e,e), sum, and connector represented, for a cocycle φ=φA+φB, by δφA=δφB in Q. All comparisons are induced by quotient maps, so they commute with enlargement of K,L; the connecting maps do too, since the same lifts remain lifts after enlargement and differential commutes with inclusion.

F4F5step 1.2
3.1

Take the directed system of pairs (K,L) ordered by inclusion. Directed colimits of these module sequences are exact for the following explicit reason. A class in a colimit kernel has a representative y at one stage. Its image becomes zero at a larger stage by the common-stage criterion [F6]. Exactness at that stage gives a preimage x, whose colimit class maps to the class of y. Conversely every such image is in the kernel because consecutive maps are zero at every stage. This proof applies at every term of the long sequence and needs only a preimage for the one class under consideration, not a family of preimage choices. The middle colimit is the direct sum of the two individual colimits: a pair of representatives can be moved to a common pair (K,L), and equality is tested at a common larger pair.

F6step 2.1
4.1

The intersections KL are cofinal among compact subsets of UV: for a compact T there take K=L=T. The unions KL are cofinal among compact subsets of M. Indeed, take all relatively compact open neighborhoods with closure inside U or inside V, as supplied by [F6]. This is an open cover of M defined without selecting one neighborhood per point. Finitely many cover a given compact T; split their closures into those contained in U and those contained in V, assigning a closure contained in both to either member. Their finite unions give compact KU,LV containing T in their union. For the two separate factors every compact support occurs in a pair by taking the other member empty. These cofinality statements, the enlargement maps, and step 1.1 identify the colimit of step 3.1 with the displayed compact-support sequence. In particular the sequence is exact.

F6step 1.1step 3.1
5.1

By step 1.1 the first two squares commute with vertical maps DUV, DUDV, DM, since their signs are (+,) and sum on both rows. To compute the connecting square, keep K,L fixed and take an n-chain c representing [M]KL, so c lies outside KL. The three open sets UL,UV,VK cover M. Apply [F8]'s small-chain retraction to this cover. It preserves the complement of KL, and its homotopy also preserves that complement, so the resulting chain represents the same relative class. Decompose it as c=c1+c2+c3, supported respectively in the three open sets. There are only finitely many simplices, and each is assigned to one containing open set. Discarding c1,c3 outside KL shows that c2 represents [M]KL under excision, while discarding c3 shows that c1+c2 represents [M]K. In particular (c1+c2) lies in UK: it is a chain in U and in MK, whose free simplex subgroups intersect in the chains of their intersection.

F1F2F7F8step 1.1step 4.1
6.1

Let φ be a degree-p cocycle vanishing outside KL, with p0, and choose the two lifts of step 1.2. The image DUVδ[φ] is represented by δφAc2. To justify use of this Q representative, observe that c2=cc1c3 is a sum of chains in A and B: the first summand is outside both supports, the second lies in B, and the third in A. By [F4], the class of δφA in Hp+1(Q) is represented by an actual relative cocycle ψ vanishing on AB, and δφAψ=δb for a degree-p cochain bQ. Since b vanishes on each of A,B, its cap with each summand of c2 is zero. Thus [F9] gives (δb)c2=(1)p(bc2), a boundary in UV. The cap class computed with ψ is therefore exactly the one computed with δφA. Applying [F9] within UV gives [δφAc2]=[φAc2], since their difference is (1)p(φAc2).

F1F4F8F9step 1.2step 2.1step 5.1
7.1

The other route begins with φc, an absolute cycle by [F1]. Split it into the U chain φc1 and the V chain φ(c2+c3). The connector of [F7] therefore gives [(φc1)]. Since δφ=0, [F9] and the support vanishings give (φc1)=(1)pφc1=(1)pφAc1=(1)p+1φAc2. The second equality uses that φB vanishes on B and c1 lies in ULB. The last equality uses (c1+c2)C(UK) from step 5.1, annihilated by φA. Comparing with step 6.1 gives the claimed sign. It persists on the support colimit because every class has such a representative.

F1F7F9step 5.1step 6.1
8.1

Multiplying each homology connector by (1)p+1 preserves its kernel and image, hence exactness, and step 7.1 makes the last square commute. For p<0 its source is zero; for pn the connector target has negative homology degree and the cap formulas are zero there. At p=0 the sign is minus and the positive coboundary convention has already been used; at p=n1 the target is ordinary zero-dimensional homology. If a covering open set or their intersection is empty, the corresponding groups are zero and the same exact sequence reduces to the identity/sum sequences. For a point, the cover consists of empty sets and points and degree-zero cap is vertex evaluation. The zero ring and zero representatives give zero throughout. Degenerate simplices remain free generators and all containments and formulas apply to them unchanged. Subdivision uses specified least depths; compactness and individual representatives involve only finite choices. No AC or categorical AB5 implication is used.

F1F6F8F9step 4.1step 5.1step 7.1

Depends on

Used by

Dependency tree · two levels

59 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