Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-12
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.

Excision for singular cohomology

Statement

If Z⊆A⊆X and Z‾⊆int⁡XA, inclusion induces an isomorphism Hn(X,A;G)→∼Hn(X∖Z,A∖Z;G) for every integer n and every abelian coefficient group G.

Facts & Assumptions

[F1]

The cover-small inclusion is a chain homotopy equivalence proves the chain homotopy equivalence using the explicit integral operators in its proof, with least subdivision depths, Dσ=Dm(σ)σ, R=1−∂D−D∂, and Dq=∑i<qTSi. In that construction every already-small simplex has m=0, and R lands in small chains.

[F2]

Cover-small singular chains defines small chains for families whose interiors cover the space.

[F3]

Relative singular cochain complex gives quotient integer chains and their dual relative cochains; Singular cochain complex with coefficients fixes the positive dual differential.

[F4]

Naturality of the singular cohomology pair sequence identifies the map of relative cohomology induced by a pair inclusion as precomposition on these cochains.

Proof

Given: The subsets and coefficients of the statement. Put Y=X∖Z, C=C∗(X;Z) and CA=C∗(A;Z).

1.1F2F3

The interiors of A and Y cover X: a point outside int⁡A lies outside Z‾, hence in the open set X∖Z‾⊆Y. Use this two-member family in [F2]. Its small subcomplex is M=CA+C∗(Y;Z), since its generators are precisely simplices whose image lies in one of the two members. The simplex subsets intersect exactly in those with image in A∩Y=A∖Z, so the finite formal-chain model gives CA∩C∗(Y)=C∗(A∖Z).

2.1F1step 1.1

Use [F1]'s constructed maps R:C→M and D:Cn→Cn+1. Here every simplex in A, and every simplex in Y, is already small. For such a simplex the least-depth recursion gives m=0, so Dσ=D0σ=0. Its faces are also small; hence Rσ=σ from the explicit formula. Consequently D∣M=0, R∣M=1, and in particular both maps preserve CA. With inclusion i:M→C the identities are Ri=1 and 1−iR=∂D+D∂. These are the actual operators of the supplier proof, not an inference that an arbitrary homotopy inverse preserves subspaces.

3.1F3step 1.1step 2.1

Quotienting the identities in step 2.1 by CA yields maps iˉ:M/CA→C/CA and Rˉ in reverse, with Rˉiˉ=1 and 1−iˉRˉ=∂ˉDˉ+Dˉ∂ˉ. Step 1.1 identifies M/CA with C∗(Y)/C∗(A∖Z): send a Y chain to its class modulo CA. This is onto since every element of M is a sum of an A chain and a Y chain, and its kernel is exactly the displayed intersection. The isomorphism commutes with boundaries, since all maps are induced by chain inclusions and quotients. Thus iˉ is the actual relative-chain inclusion for excision.

4.1F3step 3.1

Precompose with iˉ and Rˉ to obtain cochain maps iˉ♯ and Rˉ♯. The identity Rˉiˉ=1 gives iˉ♯Rˉ♯=1. On a degree-n cochain φ on C/CA, put Knφ=φDˉn−1, with K0=0. The other identity in step 3.1 gives φ−Rˉ♯iˉ♯φ=δKnφ+Kn+1δφ. For a cocycle the right side is a coboundary; therefore both induced composites are identities on cohomology. This proves bijectivity, with inverse induced by Rˉ♯, for arbitrary G; no exactness property of the Hom functor has been assumed.

5.1F1F3F4step 3.1step 4.1∎

By [F4] and step 3.1 the map just proved invertible is precisely the claimed restriction map, proving the theorem. If Z=∅ it is the identity; if A=X, both relative complexes are zero; if A=∅, the hypothesis forces Z=∅. Empty spaces, a point, zero coefficients and negative degrees are included. Degree zero in step 4.1 uses D−1=0, so the homotopy formula has its correct zero first summand. The least-depth construction in [F1] and all quotient/dual formulas are specified without any choice of bases or representatives; no AC, flatness or coefficient injectivity is used.

Depends on

Dependency tree · 2 levels

Sources