Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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 is not defined by top homology for self maps of s zero

Statement refuted

The unreduced top-homology scalar definition of degree does not extend unchanged to S0: H0(S0;Z)=Z2, and the transposition induces a nonscalar matrix. In contrast, the separate scalar invariant on H~0(S0;Z)Z is well defined and has possible values 1,0,+1.

Facts & Assumptions

Given: The objects and hypotheses in the statement above.

[F1]

Let n1. Choose a generator [Sn] of Hn(Sn;Z)Z, using cor-homology-of-spheres. For a continuous self-map f:SnSn, 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 n1. (Degree of a self map of an oriented sphere)

[F2]

For n1, H~k(Sn;G) is G for k=n and 0 otherwise. For S0, H~0(S0;G)G and all other reduced groups vanish. Thus H0(Sn;G)G for n1, whereas H0(S0;G)GG. (Homology of spheres)

[F3]

For an unreduced theory h and a nonempty based CW space (X,x0) with x0 a vertex, set h~n(X)=ker(hn(X)phn()). The basepoint inclusion s satisfies ps=id and splits this augmentation. The underlying ordinary theory is as in def-unreduced-homology-theory-on-cw-pairs. Independently, a reduced ordinary theory on based CW spaces consists of homotopy-invariant covariant functors h~n, natural suspension isomorphisms σ:h~n(X)h~n+1(ΣX), exact cofiber sequences, and arbitrary wedge additivity. More explicitly, for every based CW inclusion AX, h~n(A)h~n(X)h~n(X/A) is exact; the boundary in the extended sequence is the cofiber map to ΣA followed by σ1. The suspension here is reduced suspension. The dimension axiom is h~n(S0)=0 for n0, with h~0(S0)=G. Wedge additivity includes the empty wedge and gives h~n()=0. The empty space is not a based object. If its reduced groups are mentioned, this library uses H~n(;G)=0 in all degrees, as in def-zero-simplex-augmentation-and-reduced-singular-homology. The augmented-chain convention H~1(;G)=G is a different extension and is not used here. (Reduced homology theory and augmentation)

Counterexample

1.1

Write S0={a,b} and use the point classes ea,eb as the ordered basis of H0, consistently with [F2]. A map sends a point class to the class of its image. Hence, with columns recording images, the identity, transposition, constant-a, and constant-b maps induce respectively (1001), (0110), (1100), and (0011). These are all four maps of a two-point discrete space. In particular the transposition matrix is not an integer multiple of the identity; the rank-one hypothesis of [F1] is absent.

F1F2algebra
2.1

The augmentation of [F3] is (u,v)u+v. Its kernel has generator ebea. The four matrices in step 1.1 act on this generator as +1,1,0,0, respectively. Thus reduced degree exists in this case, but is a different convention from the unreduced definition restricted to positive-dimensional spheres.

F3step 1.1algebra

Depends on

Used by

Nothing in the library uses this result yet.

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