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.
Homology of spheres
Statement
For , is for and otherwise. For , and all other reduced groups vanish. Thus for , whereas .
Facts & Assumptions
Given: The boundary of an -simplex as a simplicial model of .
Proof
Put and . The integral augmented complex of has a vertex-cone contraction, as used in A simplex has zero reduced simplicial homology. Tensoring the contraction identity with preserves it, so the augmented complex with coefficients in is exact. For , its groups and differentials computing reduced homology in degree agree with those of , hence .
In degree , exactness for gives . The map sends to the alternating sum of its facets with coefficient ; it is injective since any one facet has coefficient or . There are no -chains in , so . This uses the augmentation as when . Above degree all simplicial groups vanish.
The characteristic-simplex comparison of Simplicial and singular homology agree sends each vertex with coefficient to the corresponding singular point with coefficient , so it commutes with augmentation to . For either theory, , 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 , and negative reduced groups are zero by convention.
For , the augmentation is surjective (use any vertex) with zero kernel, hence is an isomorphism. For , the simplicial model consists of two vertices and no edges, giving ; its augmentation kernel is . This includes .
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
- Allen Hatcher, Algebraic Topology, Example 2.23 (standard reference, not scraped)