Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-09-26 (gpt-6-sol)
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.

Local sphere orientations and finite puncture excision

Statement

For n≥1, Hn(Sn,Sn∖{x};Z)≅Z, with generator the restriction of the global sphere orientation. The local degree in Local degree at an isolated preimage is independent of shrinking its neighborhood. For every finite nonempty F⊂Sn, Hn(Sn,Sn∖F;Z)≅⨁x∈FHn(Sn,Sn∖{x};Z), and the global orientation maps to the tuple of local orientation generators.

Facts & Assumptions

Given: The objects and hypotheses in the statement above.

[F1]

The local-degree definition sets up the map of pairs from an allowed neighborhood of an isolated preimage and defines its integer multiplier using local orientation generators. It explicitly leaves the cyclic identifications and neighborhood independence to this lemma (Local degree at an isolated preimage).

[F2]

A map of pairs f:(X,A)→(Y,B) induces a commuting morphism from the long exact sequence of (X,A) to that of (Y,B), including the connecting maps. (Naturality of the pair long exact sequence)

[F3]

Let X=⨆α∈AXα be a disjoint union of topological spaces, and let G be an abelian group. Then for every n≥0, Hnsing(X;G)≅⨁α∈AHnsing(Xα;G). (The singular homology of a disjoint union is the direct sum)

[F4]

For n≥1, Hn(Sn;Z)≅Z and H0(Sn;Z)≅Z (Homology of spheres). The singular pair sequence is exact (Long exact sequence of a pair), and removing a subset whose closure lies in the interior of the relative subspace induces an isomorphism in relative homology (Excision for singular homology).

Proof

1.1F4algebra

A once-punctured sphere is contractible by stereographic projection and linear contraction. In the pair sequence its positive homology vanishes. For n>1 the terms on both sides of the global-to-relative map vanish, giving an isomorphism. For n=1, the last map is H0(S1∖{x})→H0(S1), an isomorphism between the groups of two connected nonempty spaces; exactness gives the same conclusion. Thus the global orientation generator restricts to a generator of the cyclic local group.

1.2F3F4

Choose mutually disjoint small open coordinate balls Ux around the finitely many points. Excision removes the closed set Sn∖⋃Ux, which is contained in the open complement of F. The relative chain complex of the disjoint balls splits into their direct sum, by the same simplex-by-component decomposition as F3. Excision in each ball then gives the displayed isomorphism. This argument includes a singleton F.

2.1F2step 1.1step 1.2

The homomorphism induced by (Sn,Sn∖F)→(Sn,Sn∖{x}) is projection onto the x summand: all other summands factor through a pair (Uz,Uz) and vanish. Its composite with the global map restricts the global class to its local generator. Hence the global tuple is diagonal.

3.1F1F2F4step 1.1∎

For nested allowed neighborhoods, the inclusion of punctured pairs is an excision isomorphism and carries one restricted generator to the other. Their maps to the target pair commute. Thus their integer multipliers agree. Two arbitrary allowed neighborhoods have an allowed open intersection, so shrinking proves full independence.

Depends on

Used by

Cited to discharge well-definedness by Local degree at an isolated preimage.

Dependency tree · two levels

17 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