Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-09-10 (Codex supervising session)
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.

Degree of identity constant reflection and antipodal sphere maps

Statement

On Sn⊂Rn+1 for n≥1, the identity, a constant map, any single coordinate reflection, and the antipodal map have degrees 1, 0, −1, and (−1)n+1 respectively.

Facts & Assumptions

Given: The objects and hypotheses in the statement above.

[F1]

Let n≥1. Choose a generator [Sn] of Hn(Sn;Z)≅Z, using cor-homology-of-spheres. For a continuous self-map f:Sn→Sn, its degree is the unique integer satisfying f∗[Sn]=deg⁡(f)[Sn]. The induced map is furnished by prop-relative-homology-is-functorial-for-maps-of-pairs with empty subspaces. Replacing the same generator in source and target by its negative does not change the integer. For a map between separately oriented copies of Sn, use their separately specified generators; reversing just one orientation changes the sign. The unreduced definition here is restricted to n≥1. (Degree of a self map of an oriented sphere)

[F2]

For n≥1 and continuous sphere self-maps f,g, homotopic maps have the same degree and deg⁡(g∘f)=deg⁡(g)deg⁡(f). Every homotopy equivalence Sn→Sn has degree 1 or −1. (Degree is homotopy invariant and multiplicative under composition)

[F3]

For n≥1 and f:Sn→Sn, let Σf be its two-cone (unreduced) suspension. Orient ΣSn≅Sn+1 by the natural suspension isomorphism. Then deg⁡(Σf)=deg⁡(f). (Suspension preserves sphere map degree)

[F4]

For any abelian group G, H0(∗;G)≅G and Hn(∗;G)=0 for every integer n≠0. For every set-indexed family of pairs the canonical map ⨁αHn(Xα,Aα;G)⟶Hn(⨆αXα,⨆αAα;G) is an isomorphism. Together with the structural axioms, singular homology is an ordinary theory with coefficient group G. (Singular homology satisfies dimension and arbitrary additivity)

[F5]

In an integral cellular chain complex, an oriented edge has boundary equal to its terminal vertex minus its initial vertex. (Cellular boundary is the incidence degree matrix)

[F6]

Cellular homology is naturally isomorphic to singular homology for cellular maps. (Cellular homology computes singular homology)

Proof

1.1F1F4

The identity fixes the chosen generator. A constant map factors through a point whose Hn is zero because n≥1. Their degrees are therefore 1 and 0.

1.2F1F5F6algebra

Give S1 the CW structure with left and right vertices and with the upper and lower semicircles as oriented 1-cells a,b, both directed from left to right. Its cellular chain complex has C1=Z[a]⊕Z[b], C0=Z[left]⊕Z[right], no 2-cells, and d1[a]=d1[b]=[right]−[left]. Thus H1cell(S1;Z)=ker⁡d1=Z([a]−[b]). Reflection across the horizontal axis is cellular, fixes both vertices, and interchanges the equally oriented cells a,b, so it sends [a]−[b] to its negative. The natural cellular-to-singular comparison carries this generator to a generator of H1(S1;Z) and intertwines the reflection maps. Hence the reflection has degree −1.

2.1F2F3step 1.2

Suspending this reflection n−1 times gives a coordinate reflection of Sn, still of degree −1 by F3. Every other coordinate reflection is conjugate to it by a coordinate permutation. The conjugating homeomorphism has degree ±1, and multiplicativity cancels its degree with that of its inverse.

3.1F2step 2.1∎

The antipodal map is the composite of the n+1 coordinate reflections. Its degree is their product (−1)n+1. This also covers the starting case n=1.

Depends on

Used by

Dependency tree · two levels

22 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