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.
Compact-support local Mayer–Vietoris and its cap ladder without choice
Statement
Let be a Hausdorff manifold, an open cover, and a local system of abelian groups. There is a natural exact sequence The maps into the union are extension maps obtained by excision. If is oriented of dimension , cap with its compatible integral compact-support orientation classes compares this sequence with homology Mayer–Vietoris in degrees . The ladder commutes when the homology connecting map leaving degree is multiplied by . No choice principle is assumed. All maps respect a coefficient-ring action commuting with the local transports.
Facts & Assumptions
Given: The cover and ambient local system; in the cap assertion, the supplied orientation.
Compact-support classes have compact representatives and equality is witnessed at a common larger compact support. Compactly supported cohomology with local coefficients
Local chains admit the explicit least-subdivision small-chain deformation, excision and Mayer–Vietoris. Excision and Mayer–Vietoris with local coefficients
Compatible canonical support orientation classes exist without choice; the supplied orientation trivializes the orientation local system. Canonical twisted fundamental classes over compact subsets
The cohomology-first cap satisfies and is natural for coefficient transports. Cup and cap products with local coefficients
Proof
For compact , write and , with analogous notation for . Local cochains vanishing on are the relative local complex denoted . Simplex by simplex, addition gives an onto map : a simplex not entirely outside is not entirely outside at least one of , so place its assigned coefficient in the first allowed summand. This is a degreewise lift, not asserted to commute with coboundaries. Its kernel consists of pairs with vanishing on . Thus there is a short exact cochain sequence with that kernel. The latter cochain complex computes the relative local cohomology supported in . Indeed and are open and cover ; [F2] replaces their small-chain sum by the full complement. To see the relative comparison on cochains explicitly, extend its small-chain homotopy to all ambient simplex generators by zero on simplices not contained in this complement. Then maps complement chains to their small-chain sum and fixes the sum, while vanishes on the sum. The resulting quotient maps are inverse up to the displayed chain homotopy; transporting coefficients along the same affine paths gives the identical local-cochain comparison. Taking cohomology gives the supported exact sequence.
Restrict to pairs , compact. These unions are cofinal among compact supports in . For any compact , choose finitely many relatively compact coordinate neighborhoods whose closures lie in one of and whose interiors cover . The union of the closures assigned to , intersected with , is a compact ; the analogous construction gives , with . Only one finite cover is selected. The intersections are cofinal for compact subsets of , since one may take equal to any such compact set. Excision in [F2] identifies the groups supported in , and with their groups in , and . Take the filtered colimit of the exact sequences of step 1.1. It is exact directly: a representative in a colimit kernel vanishes at one common larger pair of supports, where exactness supplies its lift; a zero representative of a lift also becomes zero at a common larger pair. With [F1] this gives exactly the displayed compact-support sequence and its extension maps.
For the cap assertion, use the support class of [F3] on , whose restrictions are the two smaller support classes. Subdivide a finite representative orientation chain so that every simplex lies either in or outside , and either in or outside ; the two open covers and the finite chain allow one common finite subdivision by [F2]. If is a degree- supported cocycle lifted by the short exact sequence of step 1.1, then is a chain in and is a chain in : the other simplices lie outside the corresponding support and their front evaluations vanish. Their sum is . The supported cohomology connector is represented by in the intersection complex. The homology connector is represented by . Since lies outside , [F4] gives . To check the kernel-to-support comparison as well, put and use from step 1.1. The actual cochain supported in is . Since is a cocycle, with . The homotopy vanishes on every simplex contained either outside or outside , so vanishes there too. After the same cover subdivision, is a chain in and . The identity [F4] shows that is the boundary in that intersection. Thus the computed connector represents the cap of the actual supported cohomology class, not just of its small-complex model. This is the claimed connecting-square sign. The other squares commute by addition, the same support restrictions, and the cap formula.
Coefficient morphisms and restrictions commute with all simplex transports and the displayed maps, proving naturality; a commuting scalar action is respected for the same reason. Empty supports and intersections give zero groups, and the same formulas apply in degree zero and negative degrees. All subdivision choices are least integers, each compact support uses one finite cover, and colimit exactness chooses one representative and one lift at a time. No family of primitives, chart choices or inverse maps indexed by an infinite set is chosen. This proves the assertions without a choice principle.
Depends on
Used by
Dependency tree · two levels
30 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
- Hatcher, Algebraic Topology, proof of Poincare duality and local coefficients, Chapters 3.3 and 3.H (standard reference, not scraped)