Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 2026-09-06 rests on unproved material (inherited)
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.

Rests on 3 statements not proved in this library, by way of the results it cites. This item cites no such statement directly; it depends on results that do. The unproved premises it inherits are Cohen's first model: an infinite Dedekind-finite set of reals, Sierpiński 1947: the generalised continuum hypothesis implies the Axiom of Choice and The continuum hypothesis and its generalisation are independent of ZFC. Each is recorded with a citation to the literature and is not established here, because the track that would prove it has not yet been developed in this library. Everything else in this proof is proved here.

Homology of spheres

Statement

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.

Facts & Assumptions

Given: The boundary of an (n+1)-simplex as a simplicial model of Sn.

Proof

technique · direct
1.1

Put D=Δn+1 and K=D. The integral augmented complex of D has a vertex-cone contraction, as used in A simplex has zero reduced simplicial homology. Tensoring the contraction identity with G preserves it, so the augmented complex with coefficients in G is exact. For k<n, its groups and differentials computing reduced homology in degree k agree with those of K, hence H~ksimp(K;G)=0.

givenconstruct
2.1

In degree n, exactness for D gives kern=imn+1. The map G=Cn+1(D;G)Cn(K;G) sends g to the alternating sum of its facets with coefficient g; it is injective since any one facet has coefficient g or g. There are no (n+1)-chains in K, so H~nsimp(K;G)G. This uses the augmentation as 0 when n=0. Above degree n all simplicial groups vanish.

step 1.1algebra
3.1

The characteristic-simplex comparison of Simplicial and singular homology agree sends each vertex with coefficient g to the corresponding singular point with coefficient g, so it commutes with augmentation to G. For either theory, H~0=ker(H0G), directly from the kernel-in-degree-zero definition in Augmentation at 0-simplices and reduced singular homology. Thus the ordinary comparison isomorphism restricts to an isomorphism on these kernels; in positive degrees reduced and ordinary homology agree. The calculation therefore transfers to KSn, and negative reduced groups are zero by convention.

step 2.1algebra
4.1

For n1, the augmentation H0(Sn;G)G is surjective (use any vertex) with zero kernel, hence is an isomorphism. For n=0, the simplicial model consists of two vertices and no edges, giving H0(S0;G)GG; its augmentation kernel is {(g,g):gG}. This includes G=0.

step 3.1algebra

Depends on

Used by

Dependency tree · two levels

9 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