Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-06
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.

Good pairs and quotient reduced homology

Statement

Suppose A is a nonempty closed subspace of X and is a deformation retract of an open neighborhood V in X; this is the good-pair hypothesis used here. Then the quotient map gives Hn(X,A;G)≅H~n(X/A;G) for every n.

Facts & Assumptions

Given: A nonempty closed subspace A⊆X and an open neighborhood V that deformation retracts onto A through a homotopy fixing A.

Proof

technique · direct
1.1givenalgebra

Since V deformation retracts onto A, H∗(V,A;G)=0. The quotient homotopy gives the same conclusion for (V/A,A/A). The long exact sequences of the short exact chain-complex sequences 0→C∗(V,A;G)→C∗(X,A;G)→C∗(X,V;G)→0 and its quotient analogue therefore give H∗(X,A;G)≅H∗(X,V;G),H∗(X/A,A/A;G)≅H∗(X/A,V/A;G).

2.1step 1.1algebra∎

Because A is closed and lies in the open set V, excision applies to (X,V) and to (X/A,V/A) after removing respectively A and the quotient point. The resulting removed pairs are homeomorphic, so the quotient map induces H∗(X,V;G)≅H∗(X/A,V/A;G). Combining with step 1.1 gives H∗(X,A;G)≅H∗(X/A,A/A;G). Since A≠∅, A/A is one point, and the augmented singular complex identifies the latter groups with H~∗(X/A;G), including degree zero.

Depends on

Used by

Dependency tree · two levels

8 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