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.
Homotopy-group local system along a cellular map
Definition
Let , let be a CW complex, and let be cellular. On define the homotopy-group local system along by
for a path class . The reversal is forced by the published basepoint-transport convention, in which . Endpoint-fixed homotopy invariance and give , so this is a covariant functor to abelian groups.
Extension from the skeleton
The pair has only cells of dimension at least . The published high-relative-cell lemma therefore shows that is an equivalence: it is bijective on components and induces isomorphisms on all vertex groups. Consequently extends to a local system on , uniquely up to a natural isomorphism whose restriction to is the identity. An obstruction calculation must either fix one such extension as coefficient data or use the equivalent universal-cover module model. For a point outside its stalk is not written , since is not defined there. This corrects the ill-typed wording in the Step-1 scaffold.
For , this page uses the construction only when the relevant is abelian and all conjugation transport is trivial. Then the system has trivial monodromy and is isomorphic to a constant abelian system on each component. No nonabelian group is inserted into a cellular cochain group. The definition itself chooses neither component basepoints nor a set-indexed family of paths; any concrete coordinate extension is treated as supplied data.
Depends on
Used by
Dependency tree · two levels
23 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
- James Davis and Paul Kirk, Lecture Notes in Algebraic Topology (standard reference, not scraped)